{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:RPCPPORMDAUSGVMWYXLGBTXYJQ","short_pith_number":"pith:RPCPPORM","schema_version":"1.0","canonical_sha256":"8bc4f7ba2c1829235596c5d660cef84c26698703ba54a4917b78ff8c3ed9dcf9","source":{"kind":"arxiv","id":"1909.11542","version":3},"attestation_state":"computed","paper":{"title":"CLN2INV: Learning Loop Invariants with Continuous Logic Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SE","stat.ML"],"primary_cat":"cs.LG","authors_text":"Gabriel Ryan, Jianan Yao, Justin Wong, Ronghui Gu, Suman Jana","submitted_at":"2019-09-25T15:05:02Z","abstract_excerpt":"Program verification offers a framework for ensuring program correctness and therefore systematically eliminating different classes of bugs. Inferring loop invariants is one of the main challenges behind automated verification of real-world programs which often contain many loops. In this paper, we present Continuous Logic Network (CLN), a novel neural architecture for automatically learning loop invariants directly from program execution traces. Unlike existing neural networks, CLNs can learn precise and explicit representations of formulas in Satisfiability Modulo Theories (SMT) for loop inv"},"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":"1909.11542","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-09-25T15:05:02Z","cross_cats_sorted":["cs.SE","stat.ML"],"title_canon_sha256":"37145f2a1a378a74efced4804fe43947c4b44876cc2fe59c1eb3205b0605a2bc","abstract_canon_sha256":"603a5e983d3dba8f8ed61d9c6964fa52541761c753fa7ee67da4bce870591ae1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:12:53.758027Z","signature_b64":"6fHneIduTEF7Fr+KULriLoPBFOeZ03m9R/xuaKbJRSI48jUOVjesfwDmNbtOPD52yO7O10Vwjo8qKZ/l9LrNAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8bc4f7ba2c1829235596c5d660cef84c26698703ba54a4917b78ff8c3ed9dcf9","last_reissued_at":"2026-07-05T00:12:53.757575Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:12:53.757575Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"CLN2INV: Learning Loop Invariants with Continuous Logic Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SE","stat.ML"],"primary_cat":"cs.LG","authors_text":"Gabriel Ryan, Jianan Yao, Justin Wong, Ronghui Gu, Suman Jana","submitted_at":"2019-09-25T15:05:02Z","abstract_excerpt":"Program verification offers a framework for ensuring program correctness and therefore systematically eliminating different classes of bugs. Inferring loop invariants is one of the main challenges behind automated verification of real-world programs which often contain many loops. In this paper, we present Continuous Logic Network (CLN), a novel neural architecture for automatically learning loop invariants directly from program execution traces. Unlike existing neural networks, CLNs can learn precise and explicit representations of formulas in Satisfiability Modulo Theories (SMT) for loop inv"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1909.11542","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/1909.11542/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":"1909.11542","created_at":"2026-07-05T00:12:53.757636+00:00"},{"alias_kind":"arxiv_version","alias_value":"1909.11542v3","created_at":"2026-07-05T00:12:53.757636+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.11542","created_at":"2026-07-05T00:12:53.757636+00:00"},{"alias_kind":"pith_short_12","alias_value":"RPCPPORMDAUS","created_at":"2026-07-05T00:12:53.757636+00:00"},{"alias_kind":"pith_short_16","alias_value":"RPCPPORMDAUSGVMW","created_at":"2026-07-05T00:12:53.757636+00:00"},{"alias_kind":"pith_short_8","alias_value":"RPCPPORM","created_at":"2026-07-05T00:12:53.757636+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.17914","citing_title":"Guiding LLM-based Loop Invariant Synthesis via Feedback on Local Reasoning Errors","ref_index":31,"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":67,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RPCPPORMDAUSGVMWYXLGBTXYJQ","json":"https://pith.science/pith/RPCPPORMDAUSGVMWYXLGBTXYJQ.json","graph_json":"https://pith.science/api/pith-number/RPCPPORMDAUSGVMWYXLGBTXYJQ/graph.json","events_json":"https://pith.science/api/pith-number/RPCPPORMDAUSGVMWYXLGBTXYJQ/events.json","paper":"https://pith.science/paper/RPCPPORM"},"agent_actions":{"view_html":"https://pith.science/pith/RPCPPORMDAUSGVMWYXLGBTXYJQ","download_json":"https://pith.science/pith/RPCPPORMDAUSGVMWYXLGBTXYJQ.json","view_paper":"https://pith.science/paper/RPCPPORM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1909.11542&json=true","fetch_graph":"https://pith.science/api/pith-number/RPCPPORMDAUSGVMWYXLGBTXYJQ/graph.json","fetch_events":"https://pith.science/api/pith-number/RPCPPORMDAUSGVMWYXLGBTXYJQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RPCPPORMDAUSGVMWYXLGBTXYJQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RPCPPORMDAUSGVMWYXLGBTXYJQ/action/storage_attestation","attest_author":"https://pith.science/pith/RPCPPORMDAUSGVMWYXLGBTXYJQ/action/author_attestation","sign_citation":"https://pith.science/pith/RPCPPORMDAUSGVMWYXLGBTXYJQ/action/citation_signature","submit_replication":"https://pith.science/pith/RPCPPORMDAUSGVMWYXLGBTXYJQ/action/replication_record"}},"created_at":"2026-07-05T00:12:53.757636+00:00","updated_at":"2026-07-05T00:12:53.757636+00:00"}