{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:ZUXBM5CXNI7DKTCJ3F5TMPYPED","short_pith_number":"pith:ZUXBM5CX","canonical_record":{"source":{"id":"1306.1945","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-06-08T18:41:28Z","cross_cats_sorted":["cs.PL"],"title_canon_sha256":"e01c5980158d14ad75ce6ab6582bd6cce3bdc0f047dc9b05e9c6572823cf2446","abstract_canon_sha256":"33d84fbc1c1144231e275724052181384d6988dba1c5859e924ee2f5b4d1f27c"},"schema_version":"1.0"},"canonical_sha256":"cd2e1674576a3e354c49d97b363f0f20e7755093621c2635784b2378c3ade3dc","source":{"kind":"arxiv","id":"1306.1945","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.1945","created_at":"2026-05-18T03:21:22Z"},{"alias_kind":"arxiv_version","alias_value":"1306.1945v1","created_at":"2026-05-18T03:21:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.1945","created_at":"2026-05-18T03:21:22Z"},{"alias_kind":"pith_short_12","alias_value":"ZUXBM5CXNI7D","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"ZUXBM5CXNI7DKTCJ","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"ZUXBM5CX","created_at":"2026-05-18T12:28:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:ZUXBM5CXNI7DKTCJ3F5TMPYPED","target":"record","payload":{"canonical_record":{"source":{"id":"1306.1945","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-06-08T18:41:28Z","cross_cats_sorted":["cs.PL"],"title_canon_sha256":"e01c5980158d14ad75ce6ab6582bd6cce3bdc0f047dc9b05e9c6572823cf2446","abstract_canon_sha256":"33d84fbc1c1144231e275724052181384d6988dba1c5859e924ee2f5b4d1f27c"},"schema_version":"1.0"},"canonical_sha256":"cd2e1674576a3e354c49d97b363f0f20e7755093621c2635784b2378c3ade3dc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:21:22.803345Z","signature_b64":"dFHCmohDdqIv+9eZSYV+whCXevv0yr4On8wsfvpCYzJ3mKdbkDC1pqoYNcTAhDbki6HRGMXnWcLXN38QWYYiBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cd2e1674576a3e354c49d97b363f0f20e7755093621c2635784b2378c3ade3dc","last_reissued_at":"2026-05-18T03:21:22.802627Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:21:22.802627Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1306.1945","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-18T03:21:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/FenoGT6SY5jQvyzRIkYECaSI5xtOWbEAL01sREJZ5THcysESdq7S/U/QPR9gq+rz9xo58lDz3aZ8hFsYIUVDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T01:18:02.784495Z"},"content_sha256":"6862dce53898814014d0a00494fe628ab5d910a1cb6f9e6846b0838a15efa241","schema_version":"1.0","event_id":"sha256:6862dce53898814014d0a00494fe628ab5d910a1cb6f9e6846b0838a15efa241"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:ZUXBM5CXNI7DKTCJ3F5TMPYPED","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Automatic Abstraction in SMT-Based Unbounded Software Model Checking","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PL"],"primary_cat":"cs.LO","authors_text":"Anvesh Komuravelli, Arie Gurfinkel, Edmund M. Clarke, Sagar Chaki","submitted_at":"2013-06-08T18:41:28Z","abstract_excerpt":"Software model checkers based on under-approximations and SMT solvers are very successful at verifying safety (i.e. reachability) properties. They combine two key ideas -- (a) \"concreteness\": a counterexample in an under-approximation is a counterexample in the original program as well, and (b) \"generalization\": a proof of safety of an under-approximation, produced by an SMT solver, are generalizable to proofs of safety of the original program. In this paper, we present a combination of \"automatic abstraction\" with the under-approximation-driven framework. We explore two iterative approaches f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.1945","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-18T03:21:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2TYXFF9N+l97qqtb/XvT8qEOVMZKzxkJt2Vu+9KON8ZZB7G715e6RObfjzS9QNr8Mxs3/55jHf3SjmU1DhlBAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T01:18:02.784887Z"},"content_sha256":"950e90f554e0bbcc50b775a3a7d95977b40f86410000ca45000502738064aae3","schema_version":"1.0","event_id":"sha256:950e90f554e0bbcc50b775a3a7d95977b40f86410000ca45000502738064aae3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZUXBM5CXNI7DKTCJ3F5TMPYPED/bundle.json","state_url":"https://pith.science/pith/ZUXBM5CXNI7DKTCJ3F5TMPYPED/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZUXBM5CXNI7DKTCJ3F5TMPYPED/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-06T01:18:02Z","links":{"resolver":"https://pith.science/pith/ZUXBM5CXNI7DKTCJ3F5TMPYPED","bundle":"https://pith.science/pith/ZUXBM5CXNI7DKTCJ3F5TMPYPED/bundle.json","state":"https://pith.science/pith/ZUXBM5CXNI7DKTCJ3F5TMPYPED/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZUXBM5CXNI7DKTCJ3F5TMPYPED/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:ZUXBM5CXNI7DKTCJ3F5TMPYPED","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":"33d84fbc1c1144231e275724052181384d6988dba1c5859e924ee2f5b4d1f27c","cross_cats_sorted":["cs.PL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-06-08T18:41:28Z","title_canon_sha256":"e01c5980158d14ad75ce6ab6582bd6cce3bdc0f047dc9b05e9c6572823cf2446"},"schema_version":"1.0","source":{"id":"1306.1945","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.1945","created_at":"2026-05-18T03:21:22Z"},{"alias_kind":"arxiv_version","alias_value":"1306.1945v1","created_at":"2026-05-18T03:21:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.1945","created_at":"2026-05-18T03:21:22Z"},{"alias_kind":"pith_short_12","alias_value":"ZUXBM5CXNI7D","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"ZUXBM5CXNI7DKTCJ","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"ZUXBM5CX","created_at":"2026-05-18T12:28:09Z"}],"graph_snapshots":[{"event_id":"sha256:950e90f554e0bbcc50b775a3a7d95977b40f86410000ca45000502738064aae3","target":"graph","created_at":"2026-05-18T03:21:22Z","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":"Software model checkers based on under-approximations and SMT solvers are very successful at verifying safety (i.e. reachability) properties. They combine two key ideas -- (a) \"concreteness\": a counterexample in an under-approximation is a counterexample in the original program as well, and (b) \"generalization\": a proof of safety of an under-approximation, produced by an SMT solver, are generalizable to proofs of safety of the original program. In this paper, we present a combination of \"automatic abstraction\" with the under-approximation-driven framework. We explore two iterative approaches f","authors_text":"Anvesh Komuravelli, Arie Gurfinkel, Edmund M. Clarke, Sagar Chaki","cross_cats":["cs.PL"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-06-08T18:41:28Z","title":"Automatic Abstraction in SMT-Based Unbounded Software Model Checking"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.1945","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:6862dce53898814014d0a00494fe628ab5d910a1cb6f9e6846b0838a15efa241","target":"record","created_at":"2026-05-18T03:21:22Z","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":"33d84fbc1c1144231e275724052181384d6988dba1c5859e924ee2f5b4d1f27c","cross_cats_sorted":["cs.PL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-06-08T18:41:28Z","title_canon_sha256":"e01c5980158d14ad75ce6ab6582bd6cce3bdc0f047dc9b05e9c6572823cf2446"},"schema_version":"1.0","source":{"id":"1306.1945","kind":"arxiv","version":1}},"canonical_sha256":"cd2e1674576a3e354c49d97b363f0f20e7755093621c2635784b2378c3ade3dc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cd2e1674576a3e354c49d97b363f0f20e7755093621c2635784b2378c3ade3dc","first_computed_at":"2026-05-18T03:21:22.802627Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:21:22.802627Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dFHCmohDdqIv+9eZSYV+whCXevv0yr4On8wsfvpCYzJ3mKdbkDC1pqoYNcTAhDbki6HRGMXnWcLXN38QWYYiBA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:21:22.803345Z","signed_message":"canonical_sha256_bytes"},"source_id":"1306.1945","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6862dce53898814014d0a00494fe628ab5d910a1cb6f9e6846b0838a15efa241","sha256:950e90f554e0bbcc50b775a3a7d95977b40f86410000ca45000502738064aae3"],"state_sha256":"1860c24652f346b5211f1ed5be7bab16a90009c38ac83d4dec207c54f5ca71a3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ixoyOsTmBdsvyPj0Y5ez1XRf+KU7eVotlt0vV3ZZtN4iYmAUa+yMPwu9VoZs99dopdz1GfhQHDmniKFlLQr3Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T01:18:02.787394Z","bundle_sha256":"afed1bb7ec16b20a8a5a8bcf7221437f55b15ed6eff49231e5945b10c4dd5cfa"}}