{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:QGCGJZ3FX5B3XBBFBQTYOWTZFR","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"a1c4b7fe399eb389cce542ca3b1fbfa06caece94be51760c5b7bb82f8eb2e6c8","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SE","submitted_at":"2026-05-13T17:43:13Z","title_canon_sha256":"f0d61d0272c1d967335b581877d07dc6caa75a70e94f9aaed34390edd5d12856"},"schema_version":"1.0","source":{"id":"2605.13817","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.13817","created_at":"2026-05-18T02:44:15Z"},{"alias_kind":"arxiv_version","alias_value":"2605.13817v1","created_at":"2026-05-18T02:44:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.13817","created_at":"2026-05-18T02:44:15Z"},{"alias_kind":"pith_short_12","alias_value":"QGCGJZ3FX5B3","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"QGCGJZ3FX5B3XBBF","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"QGCGJZ3F","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:09b12e5b1abedb1d569dba2a4806bb6ee0715d878c0b476b093f3636b71f9784","target":"graph","created_at":"2026-05-18T02:44:15Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"large language models, equipped with an SMT solver, can audit such requirements: translating them into formal logic, detecting ambiguity through stochastic variation in the generated formalization, and exposing inconsistency, vacuousness, and safety violations through solver queries on the resulting specification."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"that stochastic variation in LLM-generated formalizations reliably signals genuine ambiguity in the original natural-language requirement rather than LLM inconsistency or hallucination."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"VERIMED translates natural-language requirements to formal logic via LLMs, detects ambiguity from stochastic formalization differences, and audits for inconsistency and safety violations using SMT queries."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Large language models with an SMT solver can translate and audit natural-language software requirements for ambiguity and defects."}],"snapshot_sha256":"29cc8daff6d70b1ecbdcfd5565d71bb7b5cdada0ac7e6e36118e7b70ca3b2526"},"formal_canon":{"evidence_count":1,"snapshot_sha256":"aaad35982e1b20ee4a257f848725c614a150efd1fe211abaeac2c414f0305799"},"paper":{"abstract_excerpt":"Natural-language software requirements are often ambiguous, inconsistent, and underspecified; in safety-critical domains, these defects propagate into formal models that verify the wrong specification and into implementations that ship unsafe behavior. We show that large language models, equipped with an SMT solver, can audit such requirements: translating them into formal logic, detecting ambiguity through stochastic variation in the generated formalization, and exposing inconsistency, vacuousness, and safety violations through solver queries on the resulting specification. We present VERIMED","authors_text":"Bethel Hall, William Eiers","cross_cats":["cs.AI"],"headline":"Large language models with an SMT solver can translate and audit natural-language software requirements for ambiguity and defects.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SE","submitted_at":"2026-05-13T17:43:13Z","title":"Neurosymbolic Auditing of Natural-Language Software Requirements"},"references":{"count":29,"internal_anchors":1,"resolved_work":29,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"A. Akinfaderin and S. Subramanian. Verafi: Verified agentic financial intelligence through neurosymbolic policy generation.arXiv preprint arXiv:2512.14744, 2025. 9","work_id":"c9d4e896-4f48-464e-8a2a-b82be4055b7a","year":2025},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"M. Allamanis, S. Panthaplackel, and P. Yin. Unsupervised evaluation of code llms with round-trip correctness.arXiv preprint arXiv:2402.08699, 2024","work_id":"7e0ec464-b6ec-48c2-9d2f-97bf9e2d1ff0","year":2024},{"cited_arxiv_id":"2604.25031","doi":"","is_internal_anchor":true,"ref_index":3,"title":"Faithful Autoformalization via Roundtrip Verification and Repair","work_id":"f522d33d-3557-4b9e-ad69-f374edb17c3a","year":2026},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"P. Arcaini, S. Bonfanti, A. Gargantini, and E. Riccobene. How to assure correctness and safety of medical software: the hemodialysis machine case study. InInternational Conference on Abstract State Ma","work_id":"807546e8-71ac-4b76-9c34-e7060dc516a2","year":2016},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"C. Barrett, P. Fontaine, and C. Tinelli. The satisfiability modulo theories library (smt-lib). www. SMT-LIB. org, 2:68, 2016","work_id":"ba53710d-dbb0-4420-8e94-1e667da030df","year":2016}],"snapshot_sha256":"53db5cc6166def21d39bd5ab4e11c019d0148ff8c416c4bfa3dae5b1866e880a"},"source":{"id":"2605.13817","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-14T17:57:24.470155Z","id":"174b28b7-5524-49e6-98ea-c50276fb6284","model_set":{"reader":"grok-4.3"},"one_line_summary":"VERIMED translates natural-language requirements to formal logic via LLMs, detects ambiguity from stochastic formalization differences, and audits for inconsistency and safety violations using SMT queries.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Large language models with an SMT solver can translate and audit natural-language software requirements for ambiguity and defects.","strongest_claim":"large language models, equipped with an SMT solver, can audit such requirements: translating them into formal logic, detecting ambiguity through stochastic variation in the generated formalization, and exposing inconsistency, vacuousness, and safety violations through solver queries on the resulting specification.","weakest_assumption":"that stochastic variation in LLM-generated formalizations reliably signals genuine ambiguity in the original natural-language requirement rather than LLM inconsistency or hallucination."}},"verdict_id":"174b28b7-5524-49e6-98ea-c50276fb6284"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:e63681d7a774e22dc90fd1c51c4d8c1810d5d50c1b1b398213710c9a30a16dad","target":"record","created_at":"2026-05-18T02:44:15Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"a1c4b7fe399eb389cce542ca3b1fbfa06caece94be51760c5b7bb82f8eb2e6c8","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SE","submitted_at":"2026-05-13T17:43:13Z","title_canon_sha256":"f0d61d0272c1d967335b581877d07dc6caa75a70e94f9aaed34390edd5d12856"},"schema_version":"1.0","source":{"id":"2605.13817","kind":"arxiv","version":1}},"canonical_sha256":"818464e765bf43bb84250c27875a792c754c0bd1fd6e2fe3350400fb14148aec","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"818464e765bf43bb84250c27875a792c754c0bd1fd6e2fe3350400fb14148aec","first_computed_at":"2026-05-18T02:44:15.312948Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:44:15.312948Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"T7oG/qUTGu8MRnKc2AjsXQUJAFSiuXTWoR8f2umxTp0iRRkR0n2IcPQVucGeqvIsIgIjppvZ8A4xJpPD80WzBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:44:15.313556Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.13817","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e63681d7a774e22dc90fd1c51c4d8c1810d5d50c1b1b398213710c9a30a16dad","sha256:09b12e5b1abedb1d569dba2a4806bb6ee0715d878c0b476b093f3636b71f9784"],"state_sha256":"8fbe67cd1ffe4834f7b440912659cb75d1878a9a571f2a7ebb48ff4fe24659b8"}