Tootfinder

A $1000\times$ Faster LLM-enhanced Algorithm For Path Planning in Large-scale Grid Maps
Junlin Zeng, Xin Zhang, Xiang Zhao, Yan Pan
https://arxiv.org/abs/2510.02716 https://

A $1000\times$ Faster LLM-enhanced Algorithm For Path Planning in Large-scale Grid Maps
Path planning in grid maps, arising from various applications, has garnered significant attention. Existing methods, such as A*, Dijkstra, and their variants, work well for small-scale maps but fail to address large-scale ones due to high search time and memory consumption. Recently, Large Language Models (LLMs) have shown remarkable performance in path planning but still suffer from spatial illusion and poor planning performance. Among all the works, LLM-A* \cite{meng2024llm} leverages LLM to …

Optimizing digital quantum simulation of open quantum lattice models
Xie-Hang Yu, Hongchao Li, J. Ignacio Cirac, Rahul Trivedi
https://arxiv.org/abs/2509.02268 https://

Optimizing digital quantum simulation of open quantum lattice models
Many-body systems arising in condensed matter physics and quantum optics inevitably couple to the environment and need to be modelled as open quantum systems. While near-optimal algorithms have been developed for simulating many-body quantum dynamics, algorithms for their open system counterparts remain less well investigated. We address the problem of simulating geometrically local many-body open quantum systems interacting with a stationary Gaussian environment. Under a smoothness assumption …

Derivation and Verification of Array Sorting by Merging, and its Certification in Dafny
Juan Pablo Carbonell, Jos\'e E. Solsona, Nora Szasz, \'Alvaro Tasistro
https://arxiv.org/abs/2509.01758

Derivation and Verification of Array Sorting by Merging, and its Certification in Dafny
We provide full certifications of two versions of merge sort of arrays in the verification-aware programming language Dafny. We start by considering schemas for applying the divide-and-conquer or partition method of solution to specifications given by pre- and post-conditions involving linear arrays. We then derive the merge sort and merging algorithms as instances of these schemas, thereby arriving at a fully recursive formulation. Further, the analysis of the tree of subproblems arising from …

The Space Coronagraph Optical Bench (SCoOB): 7. design, fabrication, and first light for a self-coherent camera
Kevin Derby, Kian Milani, Grace C. Hathaway, Joshua Liberman, Kyle Van Gorkom, Ramya Anche, Adam Schilperoort, Corey Fucetola, Brandon Chalifoux, Kuravi Hewawasam, Christopher Mendillo, Sebastiaan Y. Haffert, Ewan S. Douglas
https://

The Space Coronagraph Optical Bench (SCoOB): 7. design, fabrication, and first light for a self-coherent camera
The 2020 Decadal Survey on Astronomy and Astrophysics tasked future space observatories with the goal of detecting and characterizing a large sample of Earth-like exoplanets. To achieve this, these observatories will require coronagraphs and wavefront control algorithms in order to achieve $10^{-10}$ or better starlight suppression. The Space Coronagraph Optical Bench (SCoOB) is a vacuum compatible testbed at the University of Arizona which aims to advance and mature starlight suppression techn…

Testable algorithms for approximately counting edges and triangles in sublinear time and space
Talya Eden, Ronitt Rubinfeld, Arsen Vasilyan
https://arxiv.org/abs/2509.20351 http…

Testable algorithms for approximately counting edges and triangles in sublinear time and space
We consider the fundamental problems of approximately counting the numbers of edges and triangles in a graph in sublinear time. Previous algorithms for these tasks are significantly more efficient under a promise that the arboricity of the graph is bounded by some parameter $\overlineα$. However, when this promise is violated, the estimates given by these algorithms are no longer guaranteed to be correct. For the triangle counting task, we give an algorithm that requires no promise on the in…

A blunt question: Which hashing algorithm do you prefer to use or even another unpopular algorithm? 🤔
I would be grateful for sharing the toot.
(we just discuss it without argument)
#hash #code #sha

Computing Linear Combinations of $\varphi$-Function Actions for Exponential Integrators
Awad H. Al-Mohy
https://arxiv.org/abs/2509.26475 https://arxiv.org/…

Computing Linear Combinations of $φ$-Function Actions for Exponential Integrators
We propose a matrix-free algorithm for evaluating linear combinations of $φ$-function actions, $w_i := \sum_{j=0}^{p} α_i^{\,j}\,φ_j(t_i A)v_j$ for $i=1\colon r$, arising in exponential integrators. The method combines the scaling and recovering method with a truncated Taylor series, choosing a spectral shift and a scaling parameter by minimizing a power-based objective of the shifted operator. Accuracy is user-controlled and ultimately limited by the working precision. The algorithm decoupl…

Threats to the sustainability of Community Notes on X
Zahra Arjmandi-Lari, Alexios Mantzarlis, Tom Stafford
https://arxiv.org/abs/2510.00650 https://arxiv.…

Threats to the sustainability of Community Notes on X
Community Notes are emerging as an important option for content moderation. The Community Notes system pioneered by Twitter, now known as X, uses a bridging algorithm to identify user-generated context with upvotes across political divides, supposedly spinning consensual gold from partisan straw. It is important to understand the nature of the community behind Community Notes, especially as the feature has now been imitated by several billion-user platforms. We look for signs of stability and d…

Fast Feature Field ($\text{F}^3$): A Predictive Representation of Events
Richeek Das, Kostas Daniilidis, Pratik Chaudhari
https://arxiv.org/abs/2509.25146 https://

Fast Feature Field ($\text{F}^3$): A Predictive Representation of Events
This paper develops a mathematical argument and algorithms for building representations of data from event-based cameras, that we call Fast Feature Field ($\text{F}^3$). We learn this representation by predicting future events from past events and show that it preserves scene structure and motion information. $\text{F}^3$ exploits the sparsity of event data and is robust to noise and variations in event rates. It can be computed efficiently using ideas from multi-resolution hash encoding and de…

Classical Simulations of Low Magic Quantum Dynamics
Kemal Aziz, Haining Pan, Michael J. Gullans, J. H. Pixley
https://arxiv.org/abs/2508.20252 https://arxi…

Classical Simulations of Low Magic Quantum Dynamics
We develop classical simulation algorithms for adaptive quantum circuits that produce states with low levels of ``magic'' (i.e., non-stabilizerness). These algorithms are particularly well-suited to circuits with high rates of Pauli measurements, such as those encountered in quantum error correction and monitored quantum circuits. The measurements serve to limit the buildup of magic induced by non-Clifford operations arising from generic noise processes or unitary gates, respectively. Our algor…