{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:XDIYH5KYZPX27E2TCN24FLPSWU","short_pith_number":"pith:XDIYH5KY","schema_version":"1.0","canonical_sha256":"b8d183f558cbefaf93531375c2adf2b518cd186ed734a44cf2ac0acf8d47d36b","source":{"kind":"arxiv","id":"2507.14330","version":3},"attestation_state":"computed","paper":{"title":"Leveraging LLMs for Formal Software Requirements -- Challenges and Prospects","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.SE","authors_text":"Arshad Beg, Diarmuid O'Donoghue, Rosemary Monahan","submitted_at":"2025-07-18T19:15:50Z","abstract_excerpt":"Software correctness is ensured mathematically through formal verification, which involves the resources of generating formal requirement specifications and having an implementation that must be verified. Tools such as model-checkers and theorem provers ensure software correctness by verifying the implementation against the specification. Formal methods deployment is regularly enforced in the development of safety-critical systems e.g. aerospace, medical devices and autonomous systems. Generating these specifications from informal and ambiguous natural language requirements remains the key cha"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2507.14330","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SE","submitted_at":"2025-07-18T19:15:50Z","cross_cats_sorted":[],"title_canon_sha256":"4951d2f79ff4cfcc6cac0eeb999a11c68fe2cc0e508f697a139c4f18f86b6892","abstract_canon_sha256":"733254a244413712a0f22df926721df972e38b323ed390bd2be012d8f43d9923"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:00:51.035629Z","signature_b64":"J/F29Zre4QPPeOTpeqKvg6jOi25yBJI8nqIOWBqgjWjarTWR45YAbHkGNBipy+xdYI6e96ZYbqWUeg7in3MvBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b8d183f558cbefaf93531375c2adf2b518cd186ed734a44cf2ac0acf8d47d36b","last_reissued_at":"2026-07-05T12:00:51.035113Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:00:51.035113Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Leveraging LLMs for Formal Software Requirements -- Challenges and Prospects","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.SE","authors_text":"Arshad Beg, Diarmuid O'Donoghue, Rosemary Monahan","submitted_at":"2025-07-18T19:15:50Z","abstract_excerpt":"Software correctness is ensured mathematically through formal verification, which involves the resources of generating formal requirement specifications and having an implementation that must be verified. Tools such as model-checkers and theorem provers ensure software correctness by verifying the implementation against the specification. Formal methods deployment is regularly enforced in the development of safety-critical systems e.g. aerospace, medical devices and autonomous systems. Generating these specifications from informal and ambiguous natural language requirements remains the key cha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.14330","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2507.14330/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2507.14330","created_at":"2026-07-05T12:00:51.035171+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.14330v3","created_at":"2026-07-05T12:00:51.035171+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.14330","created_at":"2026-07-05T12:00:51.035171+00:00"},{"alias_kind":"pith_short_12","alias_value":"XDIYH5KYZPX2","created_at":"2026-07-05T12:00:51.035171+00:00"},{"alias_kind":"pith_short_16","alias_value":"XDIYH5KYZPX27E2T","created_at":"2026-07-05T12:00:51.035171+00:00"},{"alias_kind":"pith_short_8","alias_value":"XDIYH5KY","created_at":"2026-07-05T12:00:51.035171+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.05792","citing_title":"Can LLMs Write Correct TLA+ Specifications? Evaluating Natural-Language-to-TLA+ Generation","ref_index":6,"is_internal_anchor":false},{"citing_arxiv_id":"2604.10341","citing_title":"VeriTrans: Fine-Tuned LLM-Assisted NL-to-PL Translation via a Deterministic Neuro-Symbolic Pipeline","ref_index":1,"is_internal_anchor":false},{"citing_arxiv_id":"2604.10884","citing_title":"Ambiguity Detection and Elimination in Automated Executable Process Modeling","ref_index":7,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XDIYH5KYZPX27E2TCN24FLPSWU","json":"https://pith.science/pith/XDIYH5KYZPX27E2TCN24FLPSWU.json","graph_json":"https://pith.science/api/pith-number/XDIYH5KYZPX27E2TCN24FLPSWU/graph.json","events_json":"https://pith.science/api/pith-number/XDIYH5KYZPX27E2TCN24FLPSWU/events.json","paper":"https://pith.science/paper/XDIYH5KY"},"agent_actions":{"view_html":"https://pith.science/pith/XDIYH5KYZPX27E2TCN24FLPSWU","download_json":"https://pith.science/pith/XDIYH5KYZPX27E2TCN24FLPSWU.json","view_paper":"https://pith.science/paper/XDIYH5KY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.14330&json=true","fetch_graph":"https://pith.science/api/pith-number/XDIYH5KYZPX27E2TCN24FLPSWU/graph.json","fetch_events":"https://pith.science/api/pith-number/XDIYH5KYZPX27E2TCN24FLPSWU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XDIYH5KYZPX27E2TCN24FLPSWU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XDIYH5KYZPX27E2TCN24FLPSWU/action/storage_attestation","attest_author":"https://pith.science/pith/XDIYH5KYZPX27E2TCN24FLPSWU/action/author_attestation","sign_citation":"https://pith.science/pith/XDIYH5KYZPX27E2TCN24FLPSWU/action/citation_signature","submit_replication":"https://pith.science/pith/XDIYH5KYZPX27E2TCN24FLPSWU/action/replication_record"}},"created_at":"2026-07-05T12:00:51.035171+00:00","updated_at":"2026-07-05T12:00:51.035171+00:00"}