{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:ILNUPRSZKPUP5KRIFX2ZQXWCEV","short_pith_number":"pith:ILNUPRSZ","schema_version":"1.0","canonical_sha256":"42db47c65953e8feaa282df5985ec225496c64e13ef5c3457b61999d7fdd374c","source":{"kind":"arxiv","id":"2404.00762","version":2},"attestation_state":"computed","paper":{"title":"Enchanting Program Specification Synthesis by Large Language Models using Static Analysis and Program Verification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SE","authors_text":"Cheng Wen, Cong Tian, Haokun Li, Jialun Cao, Jie Su, Mengda He, Shengchao Qin, Shing-Chi Cheung, Zhiwu Xu","submitted_at":"2024-03-31T18:15:49Z","abstract_excerpt":"Formal verification provides a rigorous and systematic approach to ensure the correctness and reliability of software systems. Yet, constructing specifications for the full proof relies on domain expertise and non-trivial manpower. In view of such needs, an automated approach for specification synthesis is desired. While existing automated approaches are limited in their versatility, i.e., they either focus only on synthesizing loop invariants for numerical programs, or are tailored for specific types of programs or invariants. Programs involving multiple complicated data types (e.g., arrays, "},"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":"2404.00762","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2024-03-31T18:15:49Z","cross_cats_sorted":[],"title_canon_sha256":"a1afe63c6e630c3eabce42da9f866a5fc209104c83b1a5c7a8a63a98a3ebb42f","abstract_canon_sha256":"26868232c0b40b153db5e8eccdb94d0b25e37a6e751e98f7a0ba602995cfd5ef"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:03:12.164598Z","signature_b64":"AYp3r1E68Ag4zfX5oN+AAZ6m9apVNshSqfJ4s/To3xX+qHHEIcc3Qj9GwiabtVxJCRnmN5O0JlyRqsyZV122AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"42db47c65953e8feaa282df5985ec225496c64e13ef5c3457b61999d7fdd374c","last_reissued_at":"2026-07-05T08:03:12.164116Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:03:12.164116Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Enchanting Program Specification Synthesis by Large Language Models using Static Analysis and Program Verification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SE","authors_text":"Cheng Wen, Cong Tian, Haokun Li, Jialun Cao, Jie Su, Mengda He, Shengchao Qin, Shing-Chi Cheung, Zhiwu Xu","submitted_at":"2024-03-31T18:15:49Z","abstract_excerpt":"Formal verification provides a rigorous and systematic approach to ensure the correctness and reliability of software systems. Yet, constructing specifications for the full proof relies on domain expertise and non-trivial manpower. In view of such needs, an automated approach for specification synthesis is desired. While existing automated approaches are limited in their versatility, i.e., they either focus only on synthesizing loop invariants for numerical programs, or are tailored for specific types of programs or invariants. Programs involving multiple complicated data types (e.g., arrays, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.00762","kind":"arxiv","version":2},"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/2404.00762/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":"2404.00762","created_at":"2026-07-05T08:03:12.164172+00:00"},{"alias_kind":"arxiv_version","alias_value":"2404.00762v2","created_at":"2026-07-05T08:03:12.164172+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.00762","created_at":"2026-07-05T08:03:12.164172+00:00"},{"alias_kind":"pith_short_12","alias_value":"ILNUPRSZKPUP","created_at":"2026-07-05T08:03:12.164172+00:00"},{"alias_kind":"pith_short_16","alias_value":"ILNUPRSZKPUP5KRI","created_at":"2026-07-05T08:03:12.164172+00:00"},{"alias_kind":"pith_short_8","alias_value":"ILNUPRSZ","created_at":"2026-07-05T08:03:12.164172+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":5,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.30914","citing_title":"Automating Formal Verification with Reinforcement Learning and Recursive Inference","ref_index":90,"is_internal_anchor":false},{"citing_arxiv_id":"2605.23109","citing_title":"Inductive Deductive Synthesis: Enabling AI to Generate Formally Verified Systems","ref_index":54,"is_internal_anchor":false},{"citing_arxiv_id":"2511.01423","citing_title":"LLM-Assisted Tool for Joint Generation of Formulas and Functions in Rule-Based Verification of Map Transformations","ref_index":23,"is_internal_anchor":false},{"citing_arxiv_id":"2511.21104","citing_title":"BRIDGE: Building Representations In Domain Guided Program Synthesis","ref_index":33,"is_internal_anchor":false},{"citing_arxiv_id":"2604.16560","citing_title":"SpecPylot: Python Specification Generation using Large Language Models","ref_index":18,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ILNUPRSZKPUP5KRIFX2ZQXWCEV","json":"https://pith.science/pith/ILNUPRSZKPUP5KRIFX2ZQXWCEV.json","graph_json":"https://pith.science/api/pith-number/ILNUPRSZKPUP5KRIFX2ZQXWCEV/graph.json","events_json":"https://pith.science/api/pith-number/ILNUPRSZKPUP5KRIFX2ZQXWCEV/events.json","paper":"https://pith.science/paper/ILNUPRSZ"},"agent_actions":{"view_html":"https://pith.science/pith/ILNUPRSZKPUP5KRIFX2ZQXWCEV","download_json":"https://pith.science/pith/ILNUPRSZKPUP5KRIFX2ZQXWCEV.json","view_paper":"https://pith.science/paper/ILNUPRSZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2404.00762&json=true","fetch_graph":"https://pith.science/api/pith-number/ILNUPRSZKPUP5KRIFX2ZQXWCEV/graph.json","fetch_events":"https://pith.science/api/pith-number/ILNUPRSZKPUP5KRIFX2ZQXWCEV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ILNUPRSZKPUP5KRIFX2ZQXWCEV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ILNUPRSZKPUP5KRIFX2ZQXWCEV/action/storage_attestation","attest_author":"https://pith.science/pith/ILNUPRSZKPUP5KRIFX2ZQXWCEV/action/author_attestation","sign_citation":"https://pith.science/pith/ILNUPRSZKPUP5KRIFX2ZQXWCEV/action/citation_signature","submit_replication":"https://pith.science/pith/ILNUPRSZKPUP5KRIFX2ZQXWCEV/action/replication_record"}},"created_at":"2026-07-05T08:03:12.164172+00:00","updated_at":"2026-07-05T08:03:12.164172+00:00"}