{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:RPCPPORMDAUSGVMWYXLGBTXYJQ","short_pith_number":"pith:RPCPPORM","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"},"canonical_sha256":"8bc4f7ba2c1829235596c5d660cef84c26698703ba54a4917b78ff8c3ed9dcf9","source":{"kind":"arxiv","id":"1909.11542","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1909.11542","created_at":"2026-07-05T00:12:53Z"},{"alias_kind":"arxiv_version","alias_value":"1909.11542v3","created_at":"2026-07-05T00:12:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.11542","created_at":"2026-07-05T00:12:53Z"},{"alias_kind":"pith_short_12","alias_value":"RPCPPORMDAUS","created_at":"2026-07-05T00:12:53Z"},{"alias_kind":"pith_short_16","alias_value":"RPCPPORMDAUSGVMW","created_at":"2026-07-05T00:12:53Z"},{"alias_kind":"pith_short_8","alias_value":"RPCPPORM","created_at":"2026-07-05T00:12:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:RPCPPORMDAUSGVMWYXLGBTXYJQ","target":"record","payload":{"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"},"canonical_sha256":"8bc4f7ba2c1829235596c5d660cef84c26698703ba54a4917b78ff8c3ed9dcf9","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"},"source_kind":"arxiv","source_id":"1909.11542","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T00:12:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7CYuLLjGXFz9bEkU1cOyvy3heBkkvIyr0xtejxJaG9wNLv7WprMnpPeXv34FQwe40KtOtfNZbCAIYqiPKPApDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-08T22:12:43.209117Z"},"content_sha256":"ce7ce440ba95c7fb72afcc7a0edfc64c73aba2e35a44c3b6c40a9b27440436a8","schema_version":"1.0","event_id":"sha256:ce7ce440ba95c7fb72afcc7a0edfc64c73aba2e35a44c3b6c40a9b27440436a8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:RPCPPORMDAUSGVMWYXLGBTXYJQ","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T00:12:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z2DpSNI6VyraUidYQHuNLvBZGESro0etiUW8LFr/T17uXx9ufBGSLGfFMFtjvFCkVHbeVawzvUwfRSQooJS0CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-08T22:12:43.209499Z"},"content_sha256":"3da9de2c817a98bee951dc027c94e5cb9ea167b1f1b9f151f1ab54050259bfff","schema_version":"1.0","event_id":"sha256:3da9de2c817a98bee951dc027c94e5cb9ea167b1f1b9f151f1ab54050259bfff"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RPCPPORMDAUSGVMWYXLGBTXYJQ/bundle.json","state_url":"https://pith.science/pith/RPCPPORMDAUSGVMWYXLGBTXYJQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RPCPPORMDAUSGVMWYXLGBTXYJQ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-08T22:12:43Z","links":{"resolver":"https://pith.science/pith/RPCPPORMDAUSGVMWYXLGBTXYJQ","bundle":"https://pith.science/pith/RPCPPORMDAUSGVMWYXLGBTXYJQ/bundle.json","state":"https://pith.science/pith/RPCPPORMDAUSGVMWYXLGBTXYJQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RPCPPORMDAUSGVMWYXLGBTXYJQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:RPCPPORMDAUSGVMWYXLGBTXYJQ","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"603a5e983d3dba8f8ed61d9c6964fa52541761c753fa7ee67da4bce870591ae1","cross_cats_sorted":["cs.SE","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-09-25T15:05:02Z","title_canon_sha256":"37145f2a1a378a74efced4804fe43947c4b44876cc2fe59c1eb3205b0605a2bc"},"schema_version":"1.0","source":{"id":"1909.11542","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1909.11542","created_at":"2026-07-05T00:12:53Z"},{"alias_kind":"arxiv_version","alias_value":"1909.11542v3","created_at":"2026-07-05T00:12:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.11542","created_at":"2026-07-05T00:12:53Z"},{"alias_kind":"pith_short_12","alias_value":"RPCPPORMDAUS","created_at":"2026-07-05T00:12:53Z"},{"alias_kind":"pith_short_16","alias_value":"RPCPPORMDAUSGVMW","created_at":"2026-07-05T00:12:53Z"},{"alias_kind":"pith_short_8","alias_value":"RPCPPORM","created_at":"2026-07-05T00:12:53Z"}],"graph_snapshots":[{"event_id":"sha256:3da9de2c817a98bee951dc027c94e5cb9ea167b1f1b9f151f1ab54050259bfff","target":"graph","created_at":"2026-07-05T00:12:53Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1909.11542/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Gabriel Ryan, Jianan Yao, Justin Wong, Ronghui Gu, Suman Jana","cross_cats":["cs.SE","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-09-25T15:05:02Z","title":"CLN2INV: Learning Loop Invariants with Continuous Logic Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1909.11542","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:ce7ce440ba95c7fb72afcc7a0edfc64c73aba2e35a44c3b6c40a9b27440436a8","target":"record","created_at":"2026-07-05T00:12:53Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"603a5e983d3dba8f8ed61d9c6964fa52541761c753fa7ee67da4bce870591ae1","cross_cats_sorted":["cs.SE","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-09-25T15:05:02Z","title_canon_sha256":"37145f2a1a378a74efced4804fe43947c4b44876cc2fe59c1eb3205b0605a2bc"},"schema_version":"1.0","source":{"id":"1909.11542","kind":"arxiv","version":3}},"canonical_sha256":"8bc4f7ba2c1829235596c5d660cef84c26698703ba54a4917b78ff8c3ed9dcf9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8bc4f7ba2c1829235596c5d660cef84c26698703ba54a4917b78ff8c3ed9dcf9","first_computed_at":"2026-07-05T00:12:53.757575Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:12:53.757575Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6fHneIduTEF7Fr+KULriLoPBFOeZ03m9R/xuaKbJRSI48jUOVjesfwDmNbtOPD52yO7O10Vwjo8qKZ/l9LrNAA==","signature_status":"signed_v1","signed_at":"2026-07-05T00:12:53.758027Z","signed_message":"canonical_sha256_bytes"},"source_id":"1909.11542","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ce7ce440ba95c7fb72afcc7a0edfc64c73aba2e35a44c3b6c40a9b27440436a8","sha256:3da9de2c817a98bee951dc027c94e5cb9ea167b1f1b9f151f1ab54050259bfff"],"state_sha256":"1e512abc66642028ed02a577593bd6ec293d7bf08521bc4f499fbe458886da63"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XUS5L8v7cuSIehIEY5S9dFKv5HhmJp5+qtQqfJEZexVE8rJYSw3vk0T4BwaO3i4rVjhpZCD4aAHLuTLZDW8kBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-08T22:12:43.211617Z","bundle_sha256":"c31d7c22c3d34f7cc443c49e4738eb65562dafda4708482024fe99037baf06a8"}}