{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:E4SLF3F3P2SSJIALYRF7NL4YLZ","short_pith_number":"pith:E4SLF3F3","schema_version":"1.0","canonical_sha256":"2724b2ecbb7ea524a00bc44bf6af985e6b45d178148526d680a1cb9f69ca3e8d","source":{"kind":"arxiv","id":"2310.09342","version":3},"attestation_state":"computed","paper":{"title":"Ranking LLM-Generated Loop Invariants for Program Verification","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.CL","cs.SE"],"primary_cat":"cs.PL","authors_text":"Aditya Senthilnathan, Akash Lal, Aseem Rastogi, Madanlal Musuvathi, Nikhil Swamy, Rahul Sharma, Saikat Chakraborty, Sarah Fakhoury, Shuvendu K. Lahiri","submitted_at":"2023-10-13T18:13:52Z","abstract_excerpt":"Synthesizing inductive loop invariants is fundamental to automating program verification. In this work, we observe that Large Language Models (such as gpt-3.5 or gpt-4) are capable of synthesizing loop invariants for a class of programs in a 0-shot setting, yet require several samples to generate the correct invariants. This can lead to a large number of calls to a program verifier to establish an invariant. To address this issue, we propose a {\\it re-ranking} approach for the generated results of LLMs. We have designed a ranker that can distinguish between correct inductive invariants and inc"},"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":"2310.09342","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PL","submitted_at":"2023-10-13T18:13:52Z","cross_cats_sorted":["cs.AI","cs.CL","cs.SE"],"title_canon_sha256":"e2c2b58428ca34f26d4eee24865fc8a43e4290249974e60cd656621004bf6a3d","abstract_canon_sha256":"4c7be2b016a9b4460a4d0a4a3907f6d22096205fb33a85b560a627a518ff4281"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:44:20.820262Z","signature_b64":"BHuUF9II/d7FhexO2fGvBawo9gxqHJxQk5QjtVC4kh7tLx/cIGz6ukMCpr+uJZTOIwu3mxqtaWGfwgo9ceu8Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2724b2ecbb7ea524a00bc44bf6af985e6b45d178148526d680a1cb9f69ca3e8d","last_reissued_at":"2026-07-05T07:44:20.819788Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:44:20.819788Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Ranking LLM-Generated Loop Invariants for Program Verification","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.CL","cs.SE"],"primary_cat":"cs.PL","authors_text":"Aditya Senthilnathan, Akash Lal, Aseem Rastogi, Madanlal Musuvathi, Nikhil Swamy, Rahul Sharma, Saikat Chakraborty, Sarah Fakhoury, Shuvendu K. Lahiri","submitted_at":"2023-10-13T18:13:52Z","abstract_excerpt":"Synthesizing inductive loop invariants is fundamental to automating program verification. In this work, we observe that Large Language Models (such as gpt-3.5 or gpt-4) are capable of synthesizing loop invariants for a class of programs in a 0-shot setting, yet require several samples to generate the correct invariants. This can lead to a large number of calls to a program verifier to establish an invariant. To address this issue, we propose a {\\it re-ranking} approach for the generated results of LLMs. We have designed a ranker that can distinguish between correct inductive invariants and inc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.09342","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/2310.09342/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":"2310.09342","created_at":"2026-07-05T07:44:20.819844+00:00"},{"alias_kind":"arxiv_version","alias_value":"2310.09342v3","created_at":"2026-07-05T07:44:20.819844+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.09342","created_at":"2026-07-05T07:44:20.819844+00:00"},{"alias_kind":"pith_short_12","alias_value":"E4SLF3F3P2SS","created_at":"2026-07-05T07:44:20.819844+00:00"},{"alias_kind":"pith_short_16","alias_value":"E4SLF3F3P2SSJIAL","created_at":"2026-07-05T07:44:20.819844+00:00"},{"alias_kind":"pith_short_8","alias_value":"E4SLF3F3","created_at":"2026-07-05T07:44:20.819844+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2508.21302","citing_title":"Locus: Agentic Predicate Synthesis for Directed Fuzzing","ref_index":9,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/E4SLF3F3P2SSJIALYRF7NL4YLZ","json":"https://pith.science/pith/E4SLF3F3P2SSJIALYRF7NL4YLZ.json","graph_json":"https://pith.science/api/pith-number/E4SLF3F3P2SSJIALYRF7NL4YLZ/graph.json","events_json":"https://pith.science/api/pith-number/E4SLF3F3P2SSJIALYRF7NL4YLZ/events.json","paper":"https://pith.science/paper/E4SLF3F3"},"agent_actions":{"view_html":"https://pith.science/pith/E4SLF3F3P2SSJIALYRF7NL4YLZ","download_json":"https://pith.science/pith/E4SLF3F3P2SSJIALYRF7NL4YLZ.json","view_paper":"https://pith.science/paper/E4SLF3F3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2310.09342&json=true","fetch_graph":"https://pith.science/api/pith-number/E4SLF3F3P2SSJIALYRF7NL4YLZ/graph.json","fetch_events":"https://pith.science/api/pith-number/E4SLF3F3P2SSJIALYRF7NL4YLZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/E4SLF3F3P2SSJIALYRF7NL4YLZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/E4SLF3F3P2SSJIALYRF7NL4YLZ/action/storage_attestation","attest_author":"https://pith.science/pith/E4SLF3F3P2SSJIALYRF7NL4YLZ/action/author_attestation","sign_citation":"https://pith.science/pith/E4SLF3F3P2SSJIALYRF7NL4YLZ/action/citation_signature","submit_replication":"https://pith.science/pith/E4SLF3F3P2SSJIALYRF7NL4YLZ/action/replication_record"}},"created_at":"2026-07-05T07:44:20.819844+00:00","updated_at":"2026-07-05T07:44:20.819844+00:00"}