{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:PQYRK6ZVAPRFFA5TYF5F42U67C","short_pith_number":"pith:PQYRK6ZV","schema_version":"1.0","canonical_sha256":"7c31157b3503e25283b3c17a5e6a9ef88c969498f441019487776e79d21feff8","source":{"kind":"arxiv","id":"2311.07948","version":1},"attestation_state":"computed","paper":{"title":"Finding Inductive Loop Invariants using Large Language Models","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.PL","authors_text":"Adharsh Kamath, Aditya Senthilnathan, Akash Lal, Aseem Rastogi, Pantazis Deligiannis, Rahul Sharma, Saikat Chakraborty, Shuvendu K. Lahiri, Subhajit Roy","submitted_at":"2023-11-14T06:58:09Z","abstract_excerpt":"Loop invariants are fundamental to reasoning about programs with loops. They establish properties about a given loop's behavior. When they additionally are inductive, they become useful for the task of formal verification that seeks to establish strong mathematical guarantees about program's runtime behavior. The inductiveness ensures that the invariants can be checked locally without consulting the entire program, thus are indispensable artifacts in a formal proof of correctness. Finding inductive loop invariants is an undecidable problem, and despite a long history of research towards practi"},"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":"2311.07948","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PL","submitted_at":"2023-11-14T06:58:09Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"d0e1a8f311242e33c68dff613afd63acf04929e0a14340734799adc29f714c97","abstract_canon_sha256":"57a899bf79fc2a44ec5043f5a9a605383151c18973d3d2b8403e210ca7a50c90"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:12:26.212965Z","signature_b64":"h465+Hq8cWVbizZ4Fv2Y7WMnHEbnyNekGRSUl3M/vTFosuoL9KHEzFA4Bn0i3JUQq28zKkAlriZjJqkMqre6AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7c31157b3503e25283b3c17a5e6a9ef88c969498f441019487776e79d21feff8","last_reissued_at":"2026-07-05T07:12:26.212517Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:12:26.212517Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Finding Inductive Loop Invariants using Large Language Models","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.PL","authors_text":"Adharsh Kamath, Aditya Senthilnathan, Akash Lal, Aseem Rastogi, Pantazis Deligiannis, Rahul Sharma, Saikat Chakraborty, Shuvendu K. Lahiri, Subhajit Roy","submitted_at":"2023-11-14T06:58:09Z","abstract_excerpt":"Loop invariants are fundamental to reasoning about programs with loops. They establish properties about a given loop's behavior. When they additionally are inductive, they become useful for the task of formal verification that seeks to establish strong mathematical guarantees about program's runtime behavior. The inductiveness ensures that the invariants can be checked locally without consulting the entire program, thus are indispensable artifacts in a formal proof of correctness. Finding inductive loop invariants is an undecidable problem, and despite a long history of research towards practi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.07948","kind":"arxiv","version":1},"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/2311.07948/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":"2311.07948","created_at":"2026-07-05T07:12:26.212582+00:00"},{"alias_kind":"arxiv_version","alias_value":"2311.07948v1","created_at":"2026-07-05T07:12:26.212582+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.07948","created_at":"2026-07-05T07:12:26.212582+00:00"},{"alias_kind":"pith_short_12","alias_value":"PQYRK6ZVAPRF","created_at":"2026-07-05T07:12:26.212582+00:00"},{"alias_kind":"pith_short_16","alias_value":"PQYRK6ZVAPRFFA5T","created_at":"2026-07-05T07:12:26.212582+00:00"},{"alias_kind":"pith_short_8","alias_value":"PQYRK6ZV","created_at":"2026-07-05T07:12:26.212582+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":9,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.30914","citing_title":"Automating Formal Verification with Reinforcement Learning and Recursive Inference","ref_index":88,"is_internal_anchor":false},{"citing_arxiv_id":"2502.18917","citing_title":"ClassInvGen: Class Invariant Synthesis using Large Language Models","ref_index":19,"is_internal_anchor":false},{"citing_arxiv_id":"2605.17914","citing_title":"Guiding LLM-based Loop Invariant Synthesis via Feedback on Local Reasoning Errors","ref_index":20,"is_internal_anchor":false},{"citing_arxiv_id":"2511.02521","citing_title":"Large Lemma Miners: Can LLMs do Induction Proofs for Hardware?","ref_index":20,"is_internal_anchor":false},{"citing_arxiv_id":"2602.13851","citing_title":"Evaluating LLM-Generated ACSL Annotations for Formal Verification","ref_index":11,"is_internal_anchor":false},{"citing_arxiv_id":"2605.10005","citing_title":"Combining Mechanical and Agentic Specification Inference for Move","ref_index":9,"is_internal_anchor":false},{"citing_arxiv_id":"2605.10005","citing_title":"Combining Mechanical and Agentic Specification Inference for Move","ref_index":9,"is_internal_anchor":false},{"citing_arxiv_id":"2604.15533","citing_title":"Verification Modulo Tested Library Contracts","ref_index":26,"is_internal_anchor":false},{"citing_arxiv_id":"2604.15533","citing_title":"Verification Modulo Tested Library Contracts","ref_index":26,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PQYRK6ZVAPRFFA5TYF5F42U67C","json":"https://pith.science/pith/PQYRK6ZVAPRFFA5TYF5F42U67C.json","graph_json":"https://pith.science/api/pith-number/PQYRK6ZVAPRFFA5TYF5F42U67C/graph.json","events_json":"https://pith.science/api/pith-number/PQYRK6ZVAPRFFA5TYF5F42U67C/events.json","paper":"https://pith.science/paper/PQYRK6ZV"},"agent_actions":{"view_html":"https://pith.science/pith/PQYRK6ZVAPRFFA5TYF5F42U67C","download_json":"https://pith.science/pith/PQYRK6ZVAPRFFA5TYF5F42U67C.json","view_paper":"https://pith.science/paper/PQYRK6ZV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2311.07948&json=true","fetch_graph":"https://pith.science/api/pith-number/PQYRK6ZVAPRFFA5TYF5F42U67C/graph.json","fetch_events":"https://pith.science/api/pith-number/PQYRK6ZVAPRFFA5TYF5F42U67C/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PQYRK6ZVAPRFFA5TYF5F42U67C/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PQYRK6ZVAPRFFA5TYF5F42U67C/action/storage_attestation","attest_author":"https://pith.science/pith/PQYRK6ZVAPRFFA5TYF5F42U67C/action/author_attestation","sign_citation":"https://pith.science/pith/PQYRK6ZVAPRFFA5TYF5F42U67C/action/citation_signature","submit_replication":"https://pith.science/pith/PQYRK6ZVAPRFFA5TYF5F42U67C/action/replication_record"}},"created_at":"2026-07-05T07:12:26.212582+00:00","updated_at":"2026-07-05T07:12:26.212582+00:00"}