Tootfinder

This https://arxiv.org/abs/2505.23397 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csAI_…

A Unified Framework for Human AI Collaboration in Security Operations Centers with Trusted Autonomy
This article presents a structured framework for Human-AI collaboration in Security Operations Centers (SOCs), integrating AI autonomy, trust calibration, and Human-in-the-loop decision making. Existing frameworks in SOCs often focus narrowly on automation, lacking systematic structures to manage human oversight, trust calibration, and scalable autonomy with AI. Many assume static or binary autonomy settings, failing to account for the varied complexity, criticality, and risk across SOC tasks c…

This https://arxiv.org/abs/2505.16529 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_mat…

Modular forms of CM type mod $\ell$
We say that a normalized modular form without complex multiplication is of CM type modulo $\ell$ by an imaginary quadratic field $K$ if its Fourier coefficients $a_p$ are $0$ modulo a prime ideal dividing $\ell$ for every prime $p$ inert in $K$. In this paper, we address the following problem: Given a weight 2 cuspidal Hecke eigenform $f$ without CM which is of CM type modulo $\ell$ by an imaginary quadratic field $K$, does there exist a congruence modulo $\ell$ between $f$ and a genuine CM m…

For those who think that going out is the wrong thing to do today: Here's a quick puzzle for you.
#MathPuzzle #ScientificAmerican #DicePuzzle

This https://arxiv.org/abs/2505.20368 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csIR_…

Hierarchical Retrieval with Evidence Curation for Open-Domain Financial Question Answering on Standardized Documents
Retrieval-augmented generation (RAG) based large language models (LLMs) are widely used in finance for their excellent performance on knowledge-intensive tasks. However, standardized documents (e.g., SEC filing) share similar formats such as repetitive boilerplate texts, and similar table structures. This similarity forces traditional RAG methods to misidentify near-duplicate text, leading to duplicate retrieval that undermines accuracy and completeness. To address these issues, we propose the …

This https://arxiv.org/abs/2408.11643 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_mat…

K3 surfaces with maximal complex multiplication
Following Valloni, we study complex projective K3 surfaces having complex multiplication by rings of integers.

Campana's orbifold conjecture for numerically equivalent divisors
Min Ru, Julie Tzu-Yueh Wang
https://arxiv.org/abs/2506.00873 https://

Campana's orbifold conjecture for numerically equivalent divisors
We prove the following version of the Campana's orbifold conjecture: Let $X$ be a complex non-singular projective variety of dimension $n$. Let $D_1,\ldots,D_{n+1}$ be $\mathbb Z$-linearly independent effective divisors in ${\rm Div}(X)$ and $D:=D_1+\cdots+D_{n+1}$ be a normal crossing divisor of $X$. Assume furthermore that they are numerically parallel. Let $Δ=\sum_{i=1}^{n+1} (1-m_i^{-1}) D_i$ and let $f:\mathbb C\to (X,Δ) $ be an orbifold entire curve. Then, there exists a positive intege…

Unwinding the rare $\Omega$ sector: Fragmentation of fully charmed baryons from HL-LHC to FCC
Francesco Giovanni Celiberto
https://arxiv.org/abs/2506.00776

Unwinding the rare $Ω$ sector: Fragmentation of fully charmed baryons from HL-LHC to FCC
By adopting a hadron-structure-oriented approach, we present and discuss the release of the novel OMG3Q1.0 set of collinear fragmentation functions for fully charmed, rare $Ω$ baryons. Our methodology combines diquark-like proxy model inputs for both charm-quark and gluon channels, calculated at the initial energy scales, with a DGLAP evolution that ensures a consistent treatment of heavy-quark thresholds, following directly from the HF-NRevo scheme. We complement our work with a phenomenologi…

State Similarity in Modular Superconducting Quantum Processors with Classical Communications
Bujiao Wu, Changrong Xie, Peng Mi, Zhiyi Wu, Zechen Guo, Peisheng Huang, Wenhui Huang, Xuandong Sun, Jiawei Zhang, Libo Zhang, Jiawei Qiu, Xiayu Linpeng, Ziyu Tao, Ji Chu, Ji Jiang, Song Liu, Jingjing Niu, Yuxuan Zhou, Yuxuan Du, Wenhui Ren, Youpeng Zhong, Tongliang Liu, Dapeng Yu

State Similarity in Modular Superconducting Quantum Processors with Classical Communications
As quantum devices continue to scale, distributed quantum computing emerges as a promising strategy for executing large-scale tasks across modular quantum processors. A central challenge in this paradigm is verifying the correctness of computational outcomes when subcircuits are executed independently following circuit cutting. Here we propose a cross-platform fidelity estimation algorithm tailored for modular architectures. Our method achieves substantial reductions in sample complexity compar…

A High-Performance Evolutionary Multiobjective Community Detection Algorithm
Guilherme O. Santos, Lucas S. Vieira, Giulio Rossetti, Carlos H. G. Ferreira, Gladston Moreira
https://arxiv.org/abs/2506.01752

A High-Performance Evolutionary Multiobjective Community Detection Algorithm
Community structure is a key feature of complex networks, underpinning a diverse range of phenomena across social, biological, and technological systems. While traditional methods, such as Louvain and Leiden, offer efficient solutions, they rely on single-objective optimization, often failing to capture the multifaceted nature of real-world networks. Multi-objective approaches address this limitation by considering multiple structural criteria simultaneously, but their high computational cost r…

The stability of independence polynomials of complete bipartite graphs
Guo Chen, Bo Ning, Jianhua Tu
https://arxiv.org/abs/2505.24381 https://

The stability of independence polynomials of complete bipartite graphs
The independence polynomial of a graph is termed {\it stable} if all its roots are located in the left half-plane $\{z \in \mathbb{C} : \mathrm{Re}(z) \leq 0\}$, and the graph itself is also referred to as stable. Brown and Cameron (Electron. J. Combin. 25(1) (2018) \#P1.46) proved that the complete bipartite graph $K_{1,n}$ is stable and posed the question: \textbf{Are all complete bipartite graphs stable?} We answer this question by establishing the following results: \begin{itemize} \i…