{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:YDSQM65DPKZBW27RWH5S4KGZKS","short_pith_number":"pith:YDSQM65D","canonical_record":{"source":{"id":"1405.4028","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-05-15T22:31:03Z","cross_cats_sorted":[],"title_canon_sha256":"1160de1a15331b51e90248c798b1f5d9f069e88386aa2ff65025e949c7479d56","abstract_canon_sha256":"0322d991238bccdc01494927fa1ee1bba4e4ee385a687b0f2646bfd845dfc331"},"schema_version":"1.0"},"canonical_sha256":"c0e5067ba37ab21b6bf1b1fb2e28d9549438afaf85474652617cd2dcedfeab98","source":{"kind":"arxiv","id":"1405.4028","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.4028","created_at":"2026-05-18T02:51:07Z"},{"alias_kind":"arxiv_version","alias_value":"1405.4028v2","created_at":"2026-05-18T02:51:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.4028","created_at":"2026-05-18T02:51:07Z"},{"alias_kind":"pith_short_12","alias_value":"YDSQM65DPKZB","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"YDSQM65DPKZBW27R","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"YDSQM65D","created_at":"2026-05-18T12:28:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:YDSQM65DPKZBW27RWH5S4KGZKS","target":"record","payload":{"canonical_record":{"source":{"id":"1405.4028","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-05-15T22:31:03Z","cross_cats_sorted":[],"title_canon_sha256":"1160de1a15331b51e90248c798b1f5d9f069e88386aa2ff65025e949c7479d56","abstract_canon_sha256":"0322d991238bccdc01494927fa1ee1bba4e4ee385a687b0f2646bfd845dfc331"},"schema_version":"1.0"},"canonical_sha256":"c0e5067ba37ab21b6bf1b1fb2e28d9549438afaf85474652617cd2dcedfeab98","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:51:07.875764Z","signature_b64":"JR9EEfuZJF+hBlv7wIoDF1VhjJdZXEWGgBqa6fMQosI/gxPhWsuTMhKNljmNClLjbOa6Frju3MS2t6NrOpJ9AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c0e5067ba37ab21b6bf1b1fb2e28d9549438afaf85474652617cd2dcedfeab98","last_reissued_at":"2026-05-18T02:51:07.875297Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:51:07.875297Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1405.4028","source_version":2,"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:51:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Nxq/5eehANtdbCrbzJ0iUXv/b2jn+ju3+9OkeErKs5YurRQNcmUmNWp84rdWEJe4sPJpIka6tQUdh/7yN5dcAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T08:09:56.671505Z"},"content_sha256":"aee109c1294d101f9bde7ccf2fcb78b28f03f39f40d553c611a4135e800b6fa5","schema_version":"1.0","event_id":"sha256:aee109c1294d101f9bde7ccf2fcb78b28f03f39f40d553c611a4135e800b6fa5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:YDSQM65DPKZBW27RWH5S4KGZKS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"SMT-based Model Checking for Recursive Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Anvesh Komuravelli, Arie Gurfinkel, Sagar Chaki","submitted_at":"2014-05-15T22:31:03Z","abstract_excerpt":"We present an SMT-based symbolic model checking algorithm for safety verification of recursive programs. The algorithm is modular and analyzes procedures individually. Unlike other SMT-based approaches, it maintains both \"over-\" and \"under-approximations\" of procedure summaries. Under-approximations are used to analyze procedure calls without inlining. Over-approximations are used to block infeasible counterexamples and detect convergence to a proof. We show that for programs and properties over a decidable theory, the algorithm is guaranteed to find a counterexample, if one exists. However, e"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.4028","kind":"arxiv","version":2},"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:51:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"25BSu6ug2Hcis/lnOJt8ItiYauN9WJOKfI3hPVoCx8JKNrsuYvzTU+EJs8tEaSC4lOenSob6sthL0UPVgAkMBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T08:09:56.671847Z"},"content_sha256":"5ec30697032798fa81a2222403510706769fe4c61ea346235d4cc57c741b81a7","schema_version":"1.0","event_id":"sha256:5ec30697032798fa81a2222403510706769fe4c61ea346235d4cc57c741b81a7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YDSQM65DPKZBW27RWH5S4KGZKS/bundle.json","state_url":"https://pith.science/pith/YDSQM65DPKZBW27RWH5S4KGZKS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YDSQM65DPKZBW27RWH5S4KGZKS/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-06-27T08:09:56Z","links":{"resolver":"https://pith.science/pith/YDSQM65DPKZBW27RWH5S4KGZKS","bundle":"https://pith.science/pith/YDSQM65DPKZBW27RWH5S4KGZKS/bundle.json","state":"https://pith.science/pith/YDSQM65DPKZBW27RWH5S4KGZKS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YDSQM65DPKZBW27RWH5S4KGZKS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:YDSQM65DPKZBW27RWH5S4KGZKS","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":"0322d991238bccdc01494927fa1ee1bba4e4ee385a687b0f2646bfd845dfc331","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-05-15T22:31:03Z","title_canon_sha256":"1160de1a15331b51e90248c798b1f5d9f069e88386aa2ff65025e949c7479d56"},"schema_version":"1.0","source":{"id":"1405.4028","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.4028","created_at":"2026-05-18T02:51:07Z"},{"alias_kind":"arxiv_version","alias_value":"1405.4028v2","created_at":"2026-05-18T02:51:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.4028","created_at":"2026-05-18T02:51:07Z"},{"alias_kind":"pith_short_12","alias_value":"YDSQM65DPKZB","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"YDSQM65DPKZBW27R","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"YDSQM65D","created_at":"2026-05-18T12:28:57Z"}],"graph_snapshots":[{"event_id":"sha256:5ec30697032798fa81a2222403510706769fe4c61ea346235d4cc57c741b81a7","target":"graph","created_at":"2026-05-18T02:51:07Z","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":"We present an SMT-based symbolic model checking algorithm for safety verification of recursive programs. The algorithm is modular and analyzes procedures individually. Unlike other SMT-based approaches, it maintains both \"over-\" and \"under-approximations\" of procedure summaries. Under-approximations are used to analyze procedure calls without inlining. Over-approximations are used to block infeasible counterexamples and detect convergence to a proof. We show that for programs and properties over a decidable theory, the algorithm is guaranteed to find a counterexample, if one exists. However, e","authors_text":"Anvesh Komuravelli, Arie Gurfinkel, Sagar Chaki","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-05-15T22:31:03Z","title":"SMT-based Model Checking for Recursive Programs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.4028","kind":"arxiv","version":2},"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:aee109c1294d101f9bde7ccf2fcb78b28f03f39f40d553c611a4135e800b6fa5","target":"record","created_at":"2026-05-18T02:51:07Z","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":"0322d991238bccdc01494927fa1ee1bba4e4ee385a687b0f2646bfd845dfc331","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-05-15T22:31:03Z","title_canon_sha256":"1160de1a15331b51e90248c798b1f5d9f069e88386aa2ff65025e949c7479d56"},"schema_version":"1.0","source":{"id":"1405.4028","kind":"arxiv","version":2}},"canonical_sha256":"c0e5067ba37ab21b6bf1b1fb2e28d9549438afaf85474652617cd2dcedfeab98","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c0e5067ba37ab21b6bf1b1fb2e28d9549438afaf85474652617cd2dcedfeab98","first_computed_at":"2026-05-18T02:51:07.875297Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:51:07.875297Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JR9EEfuZJF+hBlv7wIoDF1VhjJdZXEWGgBqa6fMQosI/gxPhWsuTMhKNljmNClLjbOa6Frju3MS2t6NrOpJ9AA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:51:07.875764Z","signed_message":"canonical_sha256_bytes"},"source_id":"1405.4028","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:aee109c1294d101f9bde7ccf2fcb78b28f03f39f40d553c611a4135e800b6fa5","sha256:5ec30697032798fa81a2222403510706769fe4c61ea346235d4cc57c741b81a7"],"state_sha256":"bc21baefd49fb747fcfb6513fe3f11599e91d8e476927e37aa3055939c77a5f2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pXXPDB7H/fCrTndvwdsgA2TyHn79FeOKR8XBqQIY0A8ehrHbqh2VphkyebsNMabfdVmVlF6b4pJnH7B84aRaDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T08:09:56.673984Z","bundle_sha256":"e21ff7ac987d9c8e49114536eea0fbfb44e0366310f7ceb4d1ed925456f50e49"}}