aiqbench analysis
This research introduces a formal "survival certificate" to validate logical implications extracted from statutes despite inherent noise in machine parsers. By rigorously testing against inter-extractor disagreement across thousands of legal sections, the study demonstrates that while such certified logic is usable, it remains fragile and requires per-chapter calibration or specific error tolerance. The findings highlight critical challenges in deploying AI for legal analysis where reliability must be statistically proven rather than assumed.
When Can a Machine Trust a Statute? A Survival Certificate for Machine-Extracted Legal Logic
arXiv:2609.01741v1 Announce Type: cross Abstract: Statutes are increasingly parsed by machines before people read them, and the parsers disagree: on Missouri's statutes, two independently written extractors diverge on numeric-threshold presence at a false-negative rate of 0.43. We ask what formal logic survives such noise. We build a passive survival certificate for the Duquenne-Guigues implication basis of machine-extracted statutory contexts: per-attribute inter-extractor disagreement is measured, replayed against the basis in 1,000 Monte Carlo trials, and an implication is certified only when a one-sided Wilson 95% lower bound on survival reaches 0.95; every certified implication carries premise spans and a minimal counterexample. On 29,365 Missouri sections and 502 Indian central-Act sections, the preregistered held-out gate passes (10 statute families across 7 Titles exact; 16 across 11 with 5% tolerance), yet under one globally deployed error model 93.2% of held-out chapters fall below the informativeness floor, and a 2x2 factorial assigns that to calibration-rate transfer, not selection. The certificate is usable but fragile: deploy it per-chapter-calibrated or error-tolerant. Code, data products, and the audit trail, including one retracted claim, are released.
Title:When Can a Machine Trust a Statute? A Survival Certificate for Machine-Extracted Legal Logic
Abstract:Statutes are increasingly parsed by machines before people read them, and the parsers disagree: on Missouri's statutes, two independently written extractors diverge on numeric-threshold presence at a false-negative rate of 0.43. We ask what formal logic survives such noise. We build a passive survival certificate for the Duquenne-Guigues implication basis of machine-extracted statutory contexts: per-attribute inter-extractor disagreement is measured, replayed against the basis in 1,000 Monte Carlo trials, and an implication is certified only when a one-sided Wilson 95% lower bound on survival reaches 0.95; every certified implication carries premise spans and a minimal counterexample. On 29,365 Missouri sections and 502 Indian central-Act sections, the preregistered held-out gate passes (10 statute families across 7 Titles exact; 16 across 11 with 5% tolerance), yet under one globally deployed error model 93.2% of held-out chapters fall below the informativeness floor, and a 2x2 factorial assigns that to calibration-rate transfer, not selection. The certificate is usable but fragile: deploy it per-chapter-calibrated or error-tolerant. Code, data products, and the audit trail, including one retracted claim, are released.
18 pages, 9 figures, 13 tables (6 main text, 7 appendix). Code, data products, and preregistration to be released on GitHub
Artificial Intelligence (cs.AI); Computation and Language (cs.CL)
arXiv:2609.01741 [cs.AI]
(or arXiv:2609.01741v1 [cs.AI] for this version)
https://doi.org/10.48550/arXiv.2609.01741 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 306 words
Related coverage

News
Quantum Computing Report · Jul 25, 2026

Weekly Cyber Security Newsletter Bulletin – Certighost Exploit, Checkpoint 0-day, HTTP/2 Flaw, Notepad++ Plugin Abuse +20 Stories
Cybersecurity News · Jul 26, 2026

How To Prepare For Quantum Computing, The Complete Readiness Guide
Quantum Zeitgeist · Jul 31, 2026

Top 10 Best Cyber Threat Intelligence Companies in 2026
Cybersecurity News · Aug 31, 2026