{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:NRH6PVJJ36XQB2A4S3W5I3AIPG","short_pith_number":"pith:NRH6PVJJ","schema_version":"1.0","canonical_sha256":"6c4fe7d529dfaf00e81c96edd46c08799065b0df5e09d692aa5798ca566abbfd","source":{"kind":"arxiv","id":"2401.08807","version":5},"attestation_state":"computed","paper":{"title":"SpecGen: Automated Generation of Formal Program Specifications via Large Language Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SE","authors_text":"Lei Bu, Lezhi Ma, Shangqing Liu, Xiaofei Xie, Yi Li","submitted_at":"2024-01-16T20:13:50Z","abstract_excerpt":"Formal program specifications play a crucial role in various stages of software development. However, manually crafting formal program specifications is rather difficult, making the job time-consuming and labor-intensive. It is even more challenging to write specifications that correctly and comprehensively describe the semantics of complex programs. To reduce the burden on software developers, automated specification generation methods have emerged. However, existing methods usually rely on predefined templates or grammar, making them struggle to accurately describe the behavior and functiona"},"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":"2401.08807","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2024-01-16T20:13:50Z","cross_cats_sorted":[],"title_canon_sha256":"c792317b9c8af786796e93ebd63e455c76bf7c77a8d2ceeef3fbf074310f4b64","abstract_canon_sha256":"1a5f11659670e4ad5eaeb3abef370bee7d53453c62df921152f716ac422dd42c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:19:21.896206Z","signature_b64":"0JtJRBG8yipVIW8X9xN0C30sVwhOuaXY5AyFljd1H+jKMBCgBgAw51u7pUq9zxQb+4XLKxsBLyb3cSgM+h09AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6c4fe7d529dfaf00e81c96edd46c08799065b0df5e09d692aa5798ca566abbfd","last_reissued_at":"2026-07-05T10:19:21.895614Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:19:21.895614Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"SpecGen: Automated Generation of Formal Program Specifications via Large Language Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SE","authors_text":"Lei Bu, Lezhi Ma, Shangqing Liu, Xiaofei Xie, Yi Li","submitted_at":"2024-01-16T20:13:50Z","abstract_excerpt":"Formal program specifications play a crucial role in various stages of software development. However, manually crafting formal program specifications is rather difficult, making the job time-consuming and labor-intensive. It is even more challenging to write specifications that correctly and comprehensively describe the semantics of complex programs. To reduce the burden on software developers, automated specification generation methods have emerged. However, existing methods usually rely on predefined templates or grammar, making them struggle to accurately describe the behavior and functiona"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.08807","kind":"arxiv","version":5},"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/2401.08807/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":"2401.08807","created_at":"2026-07-05T10:19:21.895674+00:00"},{"alias_kind":"arxiv_version","alias_value":"2401.08807v5","created_at":"2026-07-05T10:19:21.895674+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.08807","created_at":"2026-07-05T10:19:21.895674+00:00"},{"alias_kind":"pith_short_12","alias_value":"NRH6PVJJ36XQ","created_at":"2026-07-05T10:19:21.895674+00:00"},{"alias_kind":"pith_short_16","alias_value":"NRH6PVJJ36XQB2A4","created_at":"2026-07-05T10:19:21.895674+00:00"},{"alias_kind":"pith_short_8","alias_value":"NRH6PVJJ","created_at":"2026-07-05T10:19:21.895674+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":7,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.23931","citing_title":"BODHI: Precise OS Kernel Specification Inference","ref_index":14,"is_internal_anchor":false},{"citing_arxiv_id":"2606.17637","citing_title":"Brick-DICL: Dynamic In-Context Learning for Automated Brick Schema Classification","ref_index":20,"is_internal_anchor":false},{"citing_arxiv_id":"2606.05792","citing_title":"Can LLMs Write Correct TLA+ Specifications? Evaluating Natural-Language-to-TLA+ Generation","ref_index":26,"is_internal_anchor":false},{"citing_arxiv_id":"2502.18917","citing_title":"ClassInvGen: Class Invariant Synthesis using Large Language Models","ref_index":30,"is_internal_anchor":false},{"citing_arxiv_id":"2602.13851","citing_title":"Evaluating LLM-Generated ACSL Annotations for Formal Verification","ref_index":14,"is_internal_anchor":false},{"citing_arxiv_id":"2605.03356","citing_title":"POSTCONDBENCH: Benchmarking Correctness and Completeness in Formal Postcondition Inference","ref_index":14,"is_internal_anchor":false},{"citing_arxiv_id":"2604.21570","citing_title":"SpecSyn: LLM-based Synthesis and Refinement of Formal Specifications for Real-world Program Verification","ref_index":53,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NRH6PVJJ36XQB2A4S3W5I3AIPG","json":"https://pith.science/pith/NRH6PVJJ36XQB2A4S3W5I3AIPG.json","graph_json":"https://pith.science/api/pith-number/NRH6PVJJ36XQB2A4S3W5I3AIPG/graph.json","events_json":"https://pith.science/api/pith-number/NRH6PVJJ36XQB2A4S3W5I3AIPG/events.json","paper":"https://pith.science/paper/NRH6PVJJ"},"agent_actions":{"view_html":"https://pith.science/pith/NRH6PVJJ36XQB2A4S3W5I3AIPG","download_json":"https://pith.science/pith/NRH6PVJJ36XQB2A4S3W5I3AIPG.json","view_paper":"https://pith.science/paper/NRH6PVJJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2401.08807&json=true","fetch_graph":"https://pith.science/api/pith-number/NRH6PVJJ36XQB2A4S3W5I3AIPG/graph.json","fetch_events":"https://pith.science/api/pith-number/NRH6PVJJ36XQB2A4S3W5I3AIPG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NRH6PVJJ36XQB2A4S3W5I3AIPG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NRH6PVJJ36XQB2A4S3W5I3AIPG/action/storage_attestation","attest_author":"https://pith.science/pith/NRH6PVJJ36XQB2A4S3W5I3AIPG/action/author_attestation","sign_citation":"https://pith.science/pith/NRH6PVJJ36XQB2A4S3W5I3AIPG/action/citation_signature","submit_replication":"https://pith.science/pith/NRH6PVJJ36XQB2A4S3W5I3AIPG/action/replication_record"}},"created_at":"2026-07-05T10:19:21.895674+00:00","updated_at":"2026-07-05T10:19:21.895674+00:00"}