{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:ODIZD7NHWEJGJMJ6YXODKCGKM4","short_pith_number":"pith:ODIZD7NH","canonical_record":{"source":{"id":"1410.5089","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-10-19T16:39:26Z","cross_cats_sorted":[],"title_canon_sha256":"caa22d84c9e20f7d186ac07b65ff5adbce31b472418e9114305e86bb06ac368d","abstract_canon_sha256":"2e9015f6f3b6821d8a6cd4a7d6666686c7282df55774f5dc94f971207ee53738"},"schema_version":"1.0"},"canonical_sha256":"70d191fda7b11264b13ec5dc3508ca6709b73a079141d9b41e0018425e725c87","source":{"kind":"arxiv","id":"1410.5089","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.5089","created_at":"2026-05-18T02:39:46Z"},{"alias_kind":"arxiv_version","alias_value":"1410.5089v1","created_at":"2026-05-18T02:39:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.5089","created_at":"2026-05-18T02:39:46Z"},{"alias_kind":"pith_short_12","alias_value":"ODIZD7NHWEJG","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"ODIZD7NHWEJGJMJ6","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"ODIZD7NH","created_at":"2026-05-18T12:28:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:ODIZD7NHWEJGJMJ6YXODKCGKM4","target":"record","payload":{"canonical_record":{"source":{"id":"1410.5089","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-10-19T16:39:26Z","cross_cats_sorted":[],"title_canon_sha256":"caa22d84c9e20f7d186ac07b65ff5adbce31b472418e9114305e86bb06ac368d","abstract_canon_sha256":"2e9015f6f3b6821d8a6cd4a7d6666686c7282df55774f5dc94f971207ee53738"},"schema_version":"1.0"},"canonical_sha256":"70d191fda7b11264b13ec5dc3508ca6709b73a079141d9b41e0018425e725c87","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:39:46.949939Z","signature_b64":"7Zm7CMwrTz9GcE9wmyotD7Vykp4fVU9ROpD3PsmrzgHLmAHKYkRy+7XI6E0xiwoyVkQq6iODy7H2p8pGv0kRCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"70d191fda7b11264b13ec5dc3508ca6709b73a079141d9b41e0018425e725c87","last_reissued_at":"2026-05-18T02:39:46.949484Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:39:46.949484Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1410.5089","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":"NS7rRGjWkoFzoA9HSRPhjTh3p1EeaRi0ZF65v1LPwFlZr0NJtaU2zn1C7lYfdnzYWJexSHhsXoT79zyviwynBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T16:56:09.307372Z"},"content_sha256":"adf1530de571192d2c8fdac1d5855d750f68b8ebecebdd0854593a86d505c96a","schema_version":"1.0","event_id":"sha256:adf1530de571192d2c8fdac1d5855d750f68b8ebecebdd0854593a86d505c96a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:ODIZD7NHWEJGJMJ6YXODKCGKM4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Unrestricted Termination and Non-Termination Arguments for Bit-Vector 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:39:26Z","abstract_excerpt":"Proving program termination is typically done by finding a well-founded ranking function for the program states. Existing termination provers typically find ranking functions using either linear algebra or templates. As such they are often restricted to finding linear ranking functions over mathematical integers. This class of functions is insufficient for proving termination of many terminating programs, and furthermore a termination argument for a program operating on mathematical integers does not always lead to a termination argument for the same program operating on fixed-width machine in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.5089","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":"eEDZw9MkmwQOnH+yavTx4LExVMMUZItiYieZWZw38f5YW8JL1khqyfHgo+09IMlCzyRG55MOeqiWUc76lz+lDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T16:56:09.307730Z"},"content_sha256":"ba08f907e768b7d1349ed2f4e3f2801bc3d12dccebb32adb46c06a53d484c59e","schema_version":"1.0","event_id":"sha256:ba08f907e768b7d1349ed2f4e3f2801bc3d12dccebb32adb46c06a53d484c59e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ODIZD7NHWEJGJMJ6YXODKCGKM4/bundle.json","state_url":"https://pith.science/pith/ODIZD7NHWEJGJMJ6YXODKCGKM4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ODIZD7NHWEJGJMJ6YXODKCGKM4/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-28T16:56:09Z","links":{"resolver":"https://pith.science/pith/ODIZD7NHWEJGJMJ6YXODKCGKM4","bundle":"https://pith.science/pith/ODIZD7NHWEJGJMJ6YXODKCGKM4/bundle.json","state":"https://pith.science/pith/ODIZD7NHWEJGJMJ6YXODKCGKM4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ODIZD7NHWEJGJMJ6YXODKCGKM4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:ODIZD7NHWEJGJMJ6YXODKCGKM4","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":"2e9015f6f3b6821d8a6cd4a7d6666686c7282df55774f5dc94f971207ee53738","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-10-19T16:39:26Z","title_canon_sha256":"caa22d84c9e20f7d186ac07b65ff5adbce31b472418e9114305e86bb06ac368d"},"schema_version":"1.0","source":{"id":"1410.5089","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.5089","created_at":"2026-05-18T02:39:46Z"},{"alias_kind":"arxiv_version","alias_value":"1410.5089v1","created_at":"2026-05-18T02:39:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.5089","created_at":"2026-05-18T02:39:46Z"},{"alias_kind":"pith_short_12","alias_value":"ODIZD7NHWEJG","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"ODIZD7NHWEJGJMJ6","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"ODIZD7NH","created_at":"2026-05-18T12:28:41Z"}],"graph_snapshots":[{"event_id":"sha256:ba08f907e768b7d1349ed2f4e3f2801bc3d12dccebb32adb46c06a53d484c59e","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":"Proving program termination is typically done by finding a well-founded ranking function for the program states. Existing termination provers typically find ranking functions using either linear algebra or templates. As such they are often restricted to finding linear ranking functions over mathematical integers. This class of functions is insufficient for proving termination of many terminating programs, and furthermore a termination argument for a program operating on mathematical integers does not always lead to a termination argument for the same program operating on fixed-width machine in","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:39:26Z","title":"Unrestricted Termination and Non-Termination Arguments for Bit-Vector Programs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.5089","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:adf1530de571192d2c8fdac1d5855d750f68b8ebecebdd0854593a86d505c96a","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":"2e9015f6f3b6821d8a6cd4a7d6666686c7282df55774f5dc94f971207ee53738","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-10-19T16:39:26Z","title_canon_sha256":"caa22d84c9e20f7d186ac07b65ff5adbce31b472418e9114305e86bb06ac368d"},"schema_version":"1.0","source":{"id":"1410.5089","kind":"arxiv","version":1}},"canonical_sha256":"70d191fda7b11264b13ec5dc3508ca6709b73a079141d9b41e0018425e725c87","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"70d191fda7b11264b13ec5dc3508ca6709b73a079141d9b41e0018425e725c87","first_computed_at":"2026-05-18T02:39:46.949484Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:39:46.949484Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7Zm7CMwrTz9GcE9wmyotD7Vykp4fVU9ROpD3PsmrzgHLmAHKYkRy+7XI6E0xiwoyVkQq6iODy7H2p8pGv0kRCw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:39:46.949939Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.5089","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:adf1530de571192d2c8fdac1d5855d750f68b8ebecebdd0854593a86d505c96a","sha256:ba08f907e768b7d1349ed2f4e3f2801bc3d12dccebb32adb46c06a53d484c59e"],"state_sha256":"fc65b0bf52309bce68da5d076ae6a138d8eacedab9a03043746f1fc3315da956"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YXFqa6nHY800XYTKtyYeJ6YAu30Yg1t/Jb7mNeK7ZvLZ5NBC+FRloMvES4WwVjs2MG5FIXBdAHLk+9dQAK+mBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T16:56:09.311230Z","bundle_sha256":"7ce500cc0097e0089ec7c92d273b0a1e0a924f9ccd5759c8e3fcd00456d0bbbc"}}