{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:EUY5555TU5MC4FM4ZIGB2FGTK5","short_pith_number":"pith:EUY5555T","canonical_record":{"source":{"id":"1505.04581","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2015-05-18T10:18:45Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"0a0418b8915606784d44cfb7fa6e04cc781319455a01a19c123fca588ebf70a1","abstract_canon_sha256":"7410ef650f2adbfa6715d1a61266b99315b45b4e7d87e6e67fa433862bfe7e5c"},"schema_version":"1.0"},"canonical_sha256":"2531def7b3a7582e159cca0c1d14d3574f88e9e653c4ae980b3d157165ba0ad5","source":{"kind":"arxiv","id":"1505.04581","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.04581","created_at":"2026-05-18T02:07:25Z"},{"alias_kind":"arxiv_version","alias_value":"1505.04581v1","created_at":"2026-05-18T02:07:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.04581","created_at":"2026-05-18T02:07:25Z"},{"alias_kind":"pith_short_12","alias_value":"EUY5555TU5MC","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"EUY5555TU5MC4FM4","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"EUY5555T","created_at":"2026-05-18T12:29:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:EUY5555TU5MC4FM4ZIGB2FGTK5","target":"record","payload":{"canonical_record":{"source":{"id":"1505.04581","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2015-05-18T10:18:45Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"0a0418b8915606784d44cfb7fa6e04cc781319455a01a19c123fca588ebf70a1","abstract_canon_sha256":"7410ef650f2adbfa6715d1a61266b99315b45b4e7d87e6e67fa433862bfe7e5c"},"schema_version":"1.0"},"canonical_sha256":"2531def7b3a7582e159cca0c1d14d3574f88e9e653c4ae980b3d157165ba0ad5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:07:25.106362Z","signature_b64":"BX7bFWs3mDpbL9g6zCE4hXTY33EhuQE3ask74JO8FGIoD/AIjCrhGyYMgnR7fM/t7fDNthKaJJbX3GNslXOdBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2531def7b3a7582e159cca0c1d14d3574f88e9e653c4ae980b3d157165ba0ad5","last_reissued_at":"2026-05-18T02:07:25.105859Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:07:25.105859Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1505.04581","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:07:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qrHmTuwLjcuJond0P4ZFOzJ+3C9q1anK//XpsOolxpzPzs5NjP5xiLzCdmGo5F1VijhU3aS0iNWBLage1aMBDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T15:07:38.345997Z"},"content_sha256":"1c32a8485488c74ae9d8636912bf941a06e3a23e5c6715f99b2e005e24ee7a41","schema_version":"1.0","event_id":"sha256:1c32a8485488c74ae9d8636912bf941a06e3a23e5c6715f99b2e005e24ee7a41"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:EUY5555TU5MC4FM4ZIGB2FGTK5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Synthesising Interprocedural Bit-Precise Termination Proofs (extended version)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.SE","authors_text":"Bj\\\"orn Wachter, Cristina David, Daniel Kroening, Hong-Yi Chen, Peter Schrammel","submitted_at":"2015-05-18T10:18:45Z","abstract_excerpt":"Proving program termination is key to guaranteeing absence of undesirable behaviour, such as hanging programs and even security vulnerabilities such as denial-of-service attacks. To make termination checks scale to large systems, interprocedural termination analysis seems essential, which is a largely unexplored area of research in termination analysis, where most effort has focussed on difficult single-procedure problems. We present a modular termination analysis for C programs using template-based interprocedural summarisation. Our analysis combines a context-sensitive, over-approximating fo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.04581","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:07:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2rUI3xRbTT8Akt1/EBln1W+vyMrGwXCP+waQ3JzbDY/g4bGqyrg7kHV9LcPFCN4i6RpOejk03LjJywqEZ2H/BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T15:07:38.346679Z"},"content_sha256":"a5b8afbf7575bdc3044754ca9047e1d5e907b3a35bd13bbd571b8ff69aadd12f","schema_version":"1.0","event_id":"sha256:a5b8afbf7575bdc3044754ca9047e1d5e907b3a35bd13bbd571b8ff69aadd12f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EUY5555TU5MC4FM4ZIGB2FGTK5/bundle.json","state_url":"https://pith.science/pith/EUY5555TU5MC4FM4ZIGB2FGTK5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EUY5555TU5MC4FM4ZIGB2FGTK5/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-29T15:07:38Z","links":{"resolver":"https://pith.science/pith/EUY5555TU5MC4FM4ZIGB2FGTK5","bundle":"https://pith.science/pith/EUY5555TU5MC4FM4ZIGB2FGTK5/bundle.json","state":"https://pith.science/pith/EUY5555TU5MC4FM4ZIGB2FGTK5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EUY5555TU5MC4FM4ZIGB2FGTK5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:EUY5555TU5MC4FM4ZIGB2FGTK5","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":"7410ef650f2adbfa6715d1a61266b99315b45b4e7d87e6e67fa433862bfe7e5c","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2015-05-18T10:18:45Z","title_canon_sha256":"0a0418b8915606784d44cfb7fa6e04cc781319455a01a19c123fca588ebf70a1"},"schema_version":"1.0","source":{"id":"1505.04581","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.04581","created_at":"2026-05-18T02:07:25Z"},{"alias_kind":"arxiv_version","alias_value":"1505.04581v1","created_at":"2026-05-18T02:07:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.04581","created_at":"2026-05-18T02:07:25Z"},{"alias_kind":"pith_short_12","alias_value":"EUY5555TU5MC","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"EUY5555TU5MC4FM4","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"EUY5555T","created_at":"2026-05-18T12:29:19Z"}],"graph_snapshots":[{"event_id":"sha256:a5b8afbf7575bdc3044754ca9047e1d5e907b3a35bd13bbd571b8ff69aadd12f","target":"graph","created_at":"2026-05-18T02:07:25Z","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 key to guaranteeing absence of undesirable behaviour, such as hanging programs and even security vulnerabilities such as denial-of-service attacks. To make termination checks scale to large systems, interprocedural termination analysis seems essential, which is a largely unexplored area of research in termination analysis, where most effort has focussed on difficult single-procedure problems. We present a modular termination analysis for C programs using template-based interprocedural summarisation. Our analysis combines a context-sensitive, over-approximating fo","authors_text":"Bj\\\"orn Wachter, Cristina David, Daniel Kroening, Hong-Yi Chen, Peter Schrammel","cross_cats":["cs.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2015-05-18T10:18:45Z","title":"Synthesising Interprocedural Bit-Precise Termination Proofs (extended version)"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.04581","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:1c32a8485488c74ae9d8636912bf941a06e3a23e5c6715f99b2e005e24ee7a41","target":"record","created_at":"2026-05-18T02:07:25Z","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":"7410ef650f2adbfa6715d1a61266b99315b45b4e7d87e6e67fa433862bfe7e5c","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2015-05-18T10:18:45Z","title_canon_sha256":"0a0418b8915606784d44cfb7fa6e04cc781319455a01a19c123fca588ebf70a1"},"schema_version":"1.0","source":{"id":"1505.04581","kind":"arxiv","version":1}},"canonical_sha256":"2531def7b3a7582e159cca0c1d14d3574f88e9e653c4ae980b3d157165ba0ad5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2531def7b3a7582e159cca0c1d14d3574f88e9e653c4ae980b3d157165ba0ad5","first_computed_at":"2026-05-18T02:07:25.105859Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:07:25.105859Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BX7bFWs3mDpbL9g6zCE4hXTY33EhuQE3ask74JO8FGIoD/AIjCrhGyYMgnR7fM/t7fDNthKaJJbX3GNslXOdBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:07:25.106362Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.04581","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1c32a8485488c74ae9d8636912bf941a06e3a23e5c6715f99b2e005e24ee7a41","sha256:a5b8afbf7575bdc3044754ca9047e1d5e907b3a35bd13bbd571b8ff69aadd12f"],"state_sha256":"a2c62341026a372339d250894c7b8d45d2cad07cff95a0aae3226a32f1536007"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5fNngHk9PbvCBMP6q8ZUWi/5Me25Mo5Tf0LK853yL2HgT0LxgnPHcK9w1Yk5Ts/EUIvQ9VEOwubSBFMl3/h2CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T15:07:38.349518Z","bundle_sha256":"176750e0b2d8d4e59c71dc1c50ebc3bcfb77979f1c9808bd96c986ec377d1d91"}}