This paper presents two quantum algorithms for solving linear systems with normalized solution $|x angle$ to accuracy $ε$, independent of the condition number $κ$.

The paper develops a formal theory to analyze how throughput changes in AI-enhanced cybersecurity pipelines when stage capacities are perturbed by multipliers.

This paper compares the effect of different initialization methods on the accuracy and complexity of solutions in genetic programming for symbolic regression, finding no significant differences.

This paper documents and analyzes the failure process of strategies used to address conceptual drift in long-horizon LLM collaboration and introduces the concept of 'Index Sickness' and the 'Pang Prin…

This paper proves the conjecture that Local SGD outperforms Mini-batch SGD under bounded second-order heterogeneity for general convex objectives, improving the convergence guarantee and lower bounds.

This paper measures the lower bound for the shortest program generating a sequence, proving a conservation law and providing a deterministic engine to recover generating programs for certain sequences…

This paper provides bounds on the difference between the annihilation number and independence number of a finite simple graph, and proves these bounds for various types of graphs.

The paper proposes a novel, practical upper bound to estimate the worst-case performance of medical prediction models on the target population, even when the selection bias mechanism and target data a…

The paper introduces SafetyDrift, a predictive model that forecasts when AI agents will violate safety protocols by analyzing the cumulative risk across sequences of individually safe actions.

The paper introduces Acceptance Cards, a rigorous four-diagnostic standard, to provide a comprehensive and reliable evaluation protocol for claims of safe fine-tuning defenses.

This paper introduces the Value Causal Markov Condition (v-CMC) for linking causality and utility, and develops its foundations.

This paper unconditionally proves the Orthogonal Vectors and Monotone Orthogonal Vectors conjectures in concrete computational models, and provides stronger lower bounds for Boolean formulas and branc…

This paper presents two algorithms using the Newton-Raphson method to calculate the floor of y**(1/m) for natural integer numbers y > 2 and m > 1, which can be used to determine if y is an integer pow…