Tootfinder

Verifiable blind observable estimation: A composably secure protocol for near-term quantum advantage tasks
Bo Yang, Elham Kashefi, Harold Ollivier
https://arxiv.org/abs/2510.08548

Verifiable blind observable estimation: A composably secure protocol for near-term quantum advantage tasks
The rapid advance of quantum hardware is spotlighting pre-fault-tolerant tasks that may no longer be efficiently validated by classical means and are likely to run on potentially untrusted remote quantum servers. This motivates problem-independent verification protocols with rigorous guarantees. The Verifiable Blind Quantum Computation (VBQC) protocol provides delegated computation where the composable security spans the confidentiality and integrity of the computation. However, the success o…

Verification power of rational-valued automata with deterministic and affine states
Zeyu Chen, Abuzer Yakary{\i}lmaz, Junde Wu
https://arxiv.org/abs/2509.07857 https://

Verification power of rational-valued automata with deterministic and affine states
We investigate the verification power of rational-valued affine automata within Arthur--Merlin proof systems. For one-way verifiers, we give real-time protocols with perfect completeness and tunable bounded error for two benchmark nonregular languages, the balanced-middle language and the centered-palindrome language, illustrating a concrete advantage over probabilistic and quantum finite-state verifiers. For two-way verifiers, we first design a weak protocol that verifies every Turing-recogniz…

Iedereen verbaasd. Geen enkele politieke partij heeft een toegankelijk partijprogramma in PDF.
Nuttig onderzoek van Iacobien Riezebosch.
https://ibestuur.nl/artikel/geen-enkele-politieke-partij-heeft-een-toegankelijk-partijprogramma…

Geen enkele politieke partij heeft een toegankelijk partijprogramma (pdf) - iBestuur

#AntiAKW Auf die olivgrüne #VollkornCDU im Bundestag @… ist Verlass: Sie stimmt im Umweltausschuss gegen den Antrag von @…

Biometric Bound Credentials for Age Verification
Norman Poh, Daryl Burns
https://arxiv.org/abs/2509.07465 https://arxiv.org/pdf/2509.07465

Biometric Bound Credentials for Age Verification
Age verification is increasingly critical for regulatory compliance, user trust, and the protection of minors online. Historically, solutions have struggled with poor accuracy, intrusiveness, and significant security risks. More recently, concerns have shifted toward privacy, surveillance, fairness, and the need for transparent, trustworthy systems. In this paper, we propose Biometric Bound Credentials (BBCreds) as a privacy-preserving approach that cryptographically binds age credentials to an…

Formal verification for robo-advisors: Irrelevant for subjective end-user trust, yet decisive for investment behavior?
Alina Tausch, Magdalena Wischnewski, Mustafa Yalciner, Daniel Neider
https://arxiv.org/abs/2509.08540

Formal verification for robo-advisors: Irrelevant for subjective end-user trust, yet decisive for investment behavior?
This online-vignette study investigates the impact of certification and verification as measures for quality assurance of AI on trust and use of a robo-advisor. Confronting 520 participants with an imaginary situation where they were using an online banking service to invest their inherited money, we formed 4 experimental groups. EG1 achieved no further information of their robo-advisor, while EG2 was informed that their robo-advisor was certified by a reliable agency for unbiased processes, an…

Russland: Ukrainische Drohnen auf Ausbildungszentrum im Kernkraftwerk Saporischschja
Ukrainische Drohnen haben nach russischer Darstellung ein Ausbildungszentrum im Kernkraftwerk Saporischschja angegriffen. Das teilte die Verwaltung des von Russland kontrollierten Kraftwerks in der Ukraine mit. Es gab demnach keine Opfer, und Informationen über mögliche Schäden würden derzeit geprüft.
Unabhängig zu verifizieren war der Beric…
📑

Ukraine-Liveblog: ++ Rheinmetall plant Rüstungsfabrik in der Ukraine ++
Der deutsche Rüstungskonzern Rheinmetall will künftig Artilleriegeschosse direkt in der Ukraine produzieren. Morgen tagt der UN-Sicherheitsrat zur Verletzung des polnischen Luftraums durch mutmaßlich russische Drohnen.

VRPAgent: LLM-Driven Discovery of Heuristic Operators for Vehicle Routing Problems
Andr\'e Hottung, Federico Berto, Chuanbo Hua, Nayeli Gast Zepeda, Daniel Wetzel, Michael R\"omer, Haoran Ye, Davide Zago, Michael Poli, Stefano Massaroli, Jinkyoo Park, Kevin Tierney
https://arxiv.org/abs/2510.07073

VRPAgent: LLM-Driven Discovery of Heuristic Operators for Vehicle Routing Problems
Designing high-performing heuristics for vehicle routing problems (VRPs) is a complex task that requires both intuition and deep domain knowledge. Large language model (LLM)-based code generation has recently shown promise across many domains, but it still falls short of producing heuristics that rival those crafted by human experts. In this paper, we propose VRPAgent, a framework that integrates LLM-generated components into a metaheuristic and refines them through a novel genetic search. By u…

Proof-Carrying Numbers (PCN): A Protocol for Trustworthy Numeric Answers from LLMs via Claim Verification
Aivin V. Solatorio
https://arxiv.org/abs/2509.06902 https://

Proof-Carrying Numbers (PCN): A Protocol for Trustworthy Numeric Answers from LLMs via Claim Verification
Large Language Models (LLMs) as stochastic systems may generate numbers that deviate from available data, a failure known as \emph{numeric hallucination}. Existing safeguards -- retrieval-augmented generation, citations, and uncertainty estimation -- improve transparency but cannot guarantee fidelity: fabricated or misquoted values may still be displayed as if correct. We propose \textbf{Proof-Carrying Numbers (PCN)}, a presentation-layer protocol that enforces numeric fidelity through mechanic…

Does block size matter in randomized block Krylov low-rank approximation?
Tyler Chen, Ethan N. Epperly, Raphael A. Meyer, Christopher Musco, Akash Rao
https://arxiv.org/abs/2508.06486

Does block size matter in randomized block Krylov low-rank approximation?
We study the problem of computing a rank-$k$ approximation of a matrix using randomized block Krylov iteration. Prior work has shown that, for block size $b = 1$ or $b = k$, a $(1 + \varepsilon)$-factor approximation to the best rank-$k$ approximation can be obtained after $\tilde O(k/\sqrt{\varepsilon})$ matrix-vector products with the target matrix. On the other hand, when $b$ is between $1$ and $k$, the best known bound on the number of matrix-vector products scales with $b(k-b)$, which coul…