{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:NOOVEOQV5WAUFTXDOZJCWKZESC","short_pith_number":"pith:NOOVEOQV","canonical_record":{"source":{"id":"1410.5088","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-10-19T16:29:27Z","cross_cats_sorted":[],"title_canon_sha256":"73421a8a9abd5445076d3726eef94251bb956bc57eea19ea92e6b03385e35927","abstract_canon_sha256":"b5ce1e9238592492793f211d612d62a648649c9d3e924e77ccd2f602da06e179"},"schema_version":"1.0"},"canonical_sha256":"6b9d523a15ed8142cee376522b2b249083e7e4fef1cb24c1353faddf7c6857ed","source":{"kind":"arxiv","id":"1410.5088","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.5088","created_at":"2026-05-18T02:39:46Z"},{"alias_kind":"arxiv_version","alias_value":"1410.5088v1","created_at":"2026-05-18T02:39:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.5088","created_at":"2026-05-18T02:39:46Z"},{"alias_kind":"pith_short_12","alias_value":"NOOVEOQV5WAU","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"NOOVEOQV5WAUFTXD","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"NOOVEOQV","created_at":"2026-05-18T12:28:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:NOOVEOQV5WAUFTXDOZJCWKZESC","target":"record","payload":{"canonical_record":{"source":{"id":"1410.5088","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-10-19T16:29:27Z","cross_cats_sorted":[],"title_canon_sha256":"73421a8a9abd5445076d3726eef94251bb956bc57eea19ea92e6b03385e35927","abstract_canon_sha256":"b5ce1e9238592492793f211d612d62a648649c9d3e924e77ccd2f602da06e179"},"schema_version":"1.0"},"canonical_sha256":"6b9d523a15ed8142cee376522b2b249083e7e4fef1cb24c1353faddf7c6857ed","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:39:46.957518Z","signature_b64":"Ou9wHHSkV7GeDPGtB+vqC3gfzGD96z0syRmgKxfZphued2VqeaqpJTVZWiMZ4zhFNvdddUx35gVWPEKzkRRtCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6b9d523a15ed8142cee376522b2b249083e7e4fef1cb24c1353faddf7c6857ed","last_reissued_at":"2026-05-18T02:39:46.956911Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:39:46.956911Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1410.5088","source_version":1,"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-05-18T02:39:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P9LC7FBCy7zMNDAdDtmnGlHXKKqVW5Z1ljF1wiS//lnpezFeCfkaZfrftqCl0pPO/+Xno3PTURmjAvpen/GvAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T19:10:01.924198Z"},"content_sha256":"00c546152c51556b1093b9be1eef0fb5011169a4385fc8f86478d27a48473314","schema_version":"1.0","event_id":"sha256:00c546152c51556b1093b9be1eef0fb5011169a4385fc8f86478d27a48473314"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:NOOVEOQV5WAUFTXDOZJCWKZESC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Propositional Reasoning about Safety and Termination of Heap-Manipulating Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Cristina David, Daniel Kroening, Matt Lewis","submitted_at":"2014-10-19T16:29:27Z","abstract_excerpt":"This paper shows that it is possible to reason about the safety and termination of programs handling potentially cyclic, singly-linked lists using propositional reasoning even when the safety invariants and termination arguments depend on constraints over the lengths of lists. For this purpose, we propose the theory SLH of singly-linked lists with length, which is able to capture non-trivial interactions between shape and arithmetic. When using the theory of bit-vector arithmetic as a background, SLH is efficiently decidable via a reduction to SAT. We show the utility of SLH for software verif"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.5088","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":""},"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-05-18T02:39:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5Ze+KvJKDHwThjN0IKRu1VpuG99nKtSPHeDRsXqOEc1prvFwGE368lOmMcpTBAxG3cWlbZ2pqPehHgJ1acL7BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T19:10:01.924616Z"},"content_sha256":"21df2ce01ae2893d182a88b3c6fc9b60aefd71a57c838e85a0bd8619c31bb71e","schema_version":"1.0","event_id":"sha256:21df2ce01ae2893d182a88b3c6fc9b60aefd71a57c838e85a0bd8619c31bb71e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NOOVEOQV5WAUFTXDOZJCWKZESC/bundle.json","state_url":"https://pith.science/pith/NOOVEOQV5WAUFTXDOZJCWKZESC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NOOVEOQV5WAUFTXDOZJCWKZESC/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-05-28T19:10:01Z","links":{"resolver":"https://pith.science/pith/NOOVEOQV5WAUFTXDOZJCWKZESC","bundle":"https://pith.science/pith/NOOVEOQV5WAUFTXDOZJCWKZESC/bundle.json","state":"https://pith.science/pith/NOOVEOQV5WAUFTXDOZJCWKZESC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NOOVEOQV5WAUFTXDOZJCWKZESC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:NOOVEOQV5WAUFTXDOZJCWKZESC","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":"b5ce1e9238592492793f211d612d62a648649c9d3e924e77ccd2f602da06e179","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-10-19T16:29:27Z","title_canon_sha256":"73421a8a9abd5445076d3726eef94251bb956bc57eea19ea92e6b03385e35927"},"schema_version":"1.0","source":{"id":"1410.5088","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.5088","created_at":"2026-05-18T02:39:46Z"},{"alias_kind":"arxiv_version","alias_value":"1410.5088v1","created_at":"2026-05-18T02:39:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.5088","created_at":"2026-05-18T02:39:46Z"},{"alias_kind":"pith_short_12","alias_value":"NOOVEOQV5WAU","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"NOOVEOQV5WAUFTXD","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"NOOVEOQV","created_at":"2026-05-18T12:28:41Z"}],"graph_snapshots":[{"event_id":"sha256:21df2ce01ae2893d182a88b3c6fc9b60aefd71a57c838e85a0bd8619c31bb71e","target":"graph","created_at":"2026-05-18T02:39:46Z","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"},"paper":{"abstract_excerpt":"This paper shows that it is possible to reason about the safety and termination of programs handling potentially cyclic, singly-linked lists using propositional reasoning even when the safety invariants and termination arguments depend on constraints over the lengths of lists. For this purpose, we propose the theory SLH of singly-linked lists with length, which is able to capture non-trivial interactions between shape and arithmetic. When using the theory of bit-vector arithmetic as a background, SLH is efficiently decidable via a reduction to SAT. We show the utility of SLH for software verif","authors_text":"Cristina David, Daniel Kroening, Matt Lewis","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-10-19T16:29:27Z","title":"Propositional Reasoning about Safety and Termination of Heap-Manipulating Programs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.5088","kind":"arxiv","version":1},"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:00c546152c51556b1093b9be1eef0fb5011169a4385fc8f86478d27a48473314","target":"record","created_at":"2026-05-18T02:39:46Z","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":"b5ce1e9238592492793f211d612d62a648649c9d3e924e77ccd2f602da06e179","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-10-19T16:29:27Z","title_canon_sha256":"73421a8a9abd5445076d3726eef94251bb956bc57eea19ea92e6b03385e35927"},"schema_version":"1.0","source":{"id":"1410.5088","kind":"arxiv","version":1}},"canonical_sha256":"6b9d523a15ed8142cee376522b2b249083e7e4fef1cb24c1353faddf7c6857ed","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6b9d523a15ed8142cee376522b2b249083e7e4fef1cb24c1353faddf7c6857ed","first_computed_at":"2026-05-18T02:39:46.956911Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:39:46.956911Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ou9wHHSkV7GeDPGtB+vqC3gfzGD96z0syRmgKxfZphued2VqeaqpJTVZWiMZ4zhFNvdddUx35gVWPEKzkRRtCg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:39:46.957518Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.5088","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:00c546152c51556b1093b9be1eef0fb5011169a4385fc8f86478d27a48473314","sha256:21df2ce01ae2893d182a88b3c6fc9b60aefd71a57c838e85a0bd8619c31bb71e"],"state_sha256":"a387ecb1ca2c183debe80a3952396390bc78272322d7ee1de2f3da00ac71a233"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x87nXHl+DvT9Z1EJBqiNdvzOtuKoatF5N0+49ejJiNPKCIFYyUjZ56kqBsMMybPwaCrcwknucMUc+iSdwz7ICg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T19:10:01.927743Z","bundle_sha256":"a795e8d16ea3dabb4051523666f99a5ea11ad4ba266a76872b50e8cd1e7ed19a"}}