Tootfinder

Faster Computation of Entropic Optimal Transport via Stable Low Frequency Modes
Reda Chhaibi, Serge Gratton, Samuel Vaiter
https://arxiv.org/abs/2506.14780

Faster Computation of Entropic Optimal Transport via Stable Low Frequency Modes
In this paper, we propose an accelerated version for the Sinkhorn algorithm, which is the reference method for computing the solution to Entropic Optimal Transport. Its main draw-back is the exponential slow-down of convergence as the regularization weakens $\varepsilon \rightarrow 0$. Thanks to spectral insights on the behavior of the Hessian, we propose to mitigate the problem via an original spectral warm-start strategy. This leads to faster convergence compared to the reference method, …

GitChameleon: Evaluating AI Code Generation Against Python Library Version Incompatibilities
Diganta Misra, Nizar Islah, Victor May, Brice Rauby, Zihan Wang, Justine Gehring, Antonio Orvieto, Muawiz Chaudhary, Eilif B. Muller, Irina Rish, Samira Ebrahimi Kahou, Massimo Caccia
https://arxiv.org/abs/2507.12367

GitChameleon: Evaluating AI Code Generation Against Python Library Version Incompatibilities
The rapid evolution of software libraries poses a considerable hurdle for code generation, necessitating continuous adaptation to frequent version updates while preserving backward compatibility. While existing code evolution benchmarks provide valuable insights, they typically lack execution-based evaluation for generating code compliant with specific library versions. To address this, we introduce GitChameleon, a novel, meticulously curated dataset comprising 328 Python code completion proble…

The Complexity of Counting Small Sub-Hypergraphs
Marco Bressan, Julian Brinkmann, Holger Dell, Marc Roth, Philip Wellnitz
https://arxiv.org/abs/2506.14081 …

The Complexity of Counting Small Sub-Hypergraphs
Subgraph counting is a fundamental and well-studied problem whose computational complexity is well understood. Quite surprisingly, the hypergraph version of subgraph counting has been almost ignored. In this work, we address this gap by investigating the most basic sub-hypergraph counting problem: given a (small) hypergraph $H$ and a (large) hypergraph $G$, compute the number of sub-hypergraphs of $G$ isomorphic to $H$. Formally, for a family $\mathcal{H}$ of hypergraphs, let #Sub($\mathcal{H}$…

New Time Integrators and Capabilities in SUNDIALS Versions 6.2.0-7.4.0
Steven B. Roberts, Mustafa A\u{g}g\"ul, Daniel R. Reynolds, Cody J. Balos, David J. Gardner, Carol S. Woodward
https://arxiv.org/abs/2506.14976

New Time Integrators and Capabilities in SUNDIALS Versions 6.2.0-7.4.0
SUNDIALS is a well-established numerical library that provides robust and efficient time integrators and nonlinear solvers. This paper overviews several significant improvements and new features added over the last three years to support scientific simulations run on high-performance computing systems. Notably, three new classes of one-step methods have been implemented: low storage Runge-Kutta, symplectic partitioned Runge-Kutta, and operator splitting. In addition, we describe new time step a…

https://www.crikey.com.au/2025/07/17/clive-palmer-united-australia-party-trumpet-of-patriots-data-breach-documents/
I don’t know enough about Australian politics but it sounds like the country’s version of the MAG…

Clive Palmer’s political parties suffer data breach affecting ‘all emails … documents and records’
Identical statements from both parties say a ransomware attack has obtained ‘email address, phone number, identity records, banking records, employment history, documents (including those provided subject to confidentiality arrangements)'.

Auch für manche Spezialanwendungen etablieren sich KI-Dienste, wie ein Blick auf die bestbewerteten der Suchmaschine „There’s an AI for That“ zeigt. Die Sammlung ist über die vergangenen zwei Jahre gereift. Sie rühmt sich, für mehr als 13.000 unterschiedliche Aufgaben 36.000 Werkzeuge kategorisiert und oft von Nutzern bewertet zu haben. Marcus Schwarze #FAZ (€)

KI: Die neuen Werkzeuge der Macht
Mehr als 36.000 KI-Werkzeuge listet eine umfassende Suchmaschine für Werkzeuge der Künstlichen Intelligenz auf. Ein paar wenige davon sind gekommen, um zu bleiben – als neue Werkzeuge der Effizienz, Macht und Zeitersparnis.

POPQC: Parallel Optimization for Quantum Circuits (Extended Version)
Pengyu Liu, Jatin Arora, Mingkuan Xu, Umut A. Acar
https://arxiv.org/abs/2506.13720 ht…

POPQC: Parallel Optimization for Quantum Circuits (Extended Version)
Optimization of quantum programs or circuits is a fundamental problem in quantum computing and remains a major challenge. State-of-the-art quantum circuit optimizers rely on heuristics and typically require superlinear, and even exponential, time. Recent work proposed a new approach that pursues a weaker form of optimality called local optimality. Parameterized by a natural number $Ω$, local optimality insists that each and every $Ω$-segment of the circuit is optimal with respect to an extern…

Belief propagation for networks with loops: The neighborhoods-intersections-based method
Pedro Hack
https://arxiv.org/abs/2506.13791 https://

Belief propagation for networks with loops: The neighborhoods-intersections-based method
In order to diminish the damaging effect of loops on belief propagation (BP), the first explicit version of generalized BP for networks, the KCN-method, was recently introduced. Despite its success, the KCN-method spends computational resources inefficiently. Such inefficiencies can quickly turn the exact application of the method unfeasible, since its time complexity increases exponentially with them. This affects for instance tree networks, for which, despite not offering any accuracy advanta…

Abelianization of $\text{SL}_2$ over Dedekind domains of arithmetic type
Behrooz Mirzaii, Bruno R. Ramos, Thiago Verissimo
https://arxiv.org/abs/2506.12638

Abelianization of $\text{SL}_2$ over Dedekind domains of arithmetic type
We determine the exact group structure of the abelianization of $\text{SL}_2(A)$, where $A$ is a Dedekind domain of arithmetic type with infinitely many units. In particular, our results show that $\text{SL}_2(A)^\text{ab}$ is finite, with exponent dividing $12$ when $\text{char}(A)=0$, and dividing $6$ when $\text{char}(A)>0$. As illustrative cases, we compute $\text{SL}_2(A)^\text{ab}$ explicitly for instances where $A$ is the ring of integers of a real quadratic field or a cyclotomic extensi…

Spectral extremal problems for non-bipartite graphs without odd cycles
Lantao Zou, Lihua Feng, Yongtao Li
https://arxiv.org/abs/2507.11817 https://

Spectral extremal problems for non-bipartite graphs without odd cycles
A well-known result of Mantel asserts that every $n$-vertex triangle-free graph $G$ has at most $\lfloor n^2/4 \rfloor$ edges. Moreover, Erdős proved that if $G$ is further non-bipartite, then $e(G)\le \lfloor {(n-1)^2}/{4}\rfloor +1$. Recently, Lin, Ning and Wu [Combin. Probab. Comput. 30 (2021)] established a spectral version by showing that if $G$ is a triangle-free non-bipartite graph on $n$ vertices, then $λ(G)\le λ(S_1(T_{n-1,2}))$, with equality if and only if $G=S_1(T_{n-1,2})$, wher…