{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:2HVJAUEO23NSTS55L6VE7R6V5M","short_pith_number":"pith:2HVJAUEO","canonical_record":{"source":{"id":"1304.4499","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-04-16T15:50:18Z","cross_cats_sorted":[],"title_canon_sha256":"db580dfdc274edc7bee88001e596208fe74d798db89b603134b6daab382c57a5","abstract_canon_sha256":"795e833d7f1b6a75f3d04dffd5f9c9211283fc03e00c41acfe86f7270cd65815"},"schema_version":"1.0"},"canonical_sha256":"d1ea90508ed6db29cbbd5faa4fc7d5eb338e73281c94c492ec278030abf3e188","source":{"kind":"arxiv","id":"1304.4499","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.4499","created_at":"2026-05-18T03:11:33Z"},{"alias_kind":"arxiv_version","alias_value":"1304.4499v2","created_at":"2026-05-18T03:11:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.4499","created_at":"2026-05-18T03:11:33Z"},{"alias_kind":"pith_short_12","alias_value":"2HVJAUEO23NS","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_16","alias_value":"2HVJAUEO23NSTS55","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_8","alias_value":"2HVJAUEO","created_at":"2026-05-18T12:27:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:2HVJAUEO23NSTS55L6VE7R6V5M","target":"record","payload":{"canonical_record":{"source":{"id":"1304.4499","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-04-16T15:50:18Z","cross_cats_sorted":[],"title_canon_sha256":"db580dfdc274edc7bee88001e596208fe74d798db89b603134b6daab382c57a5","abstract_canon_sha256":"795e833d7f1b6a75f3d04dffd5f9c9211283fc03e00c41acfe86f7270cd65815"},"schema_version":"1.0"},"canonical_sha256":"d1ea90508ed6db29cbbd5faa4fc7d5eb338e73281c94c492ec278030abf3e188","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:11:33.333159Z","signature_b64":"nFkYIN6u24PfWA8yaYpqcAlgT2IRijFPabDaYjkz2yyFkAl9F9YcBQuflhdwx4tOYJdeXzJ3NKXM9H1cbCiGCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d1ea90508ed6db29cbbd5faa4fc7d5eb338e73281c94c492ec278030abf3e188","last_reissued_at":"2026-05-18T03:11:33.332441Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:11:33.332441Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1304.4499","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-18T03:11:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YEiVajla379J69PXGtfVHROLfGni2XDViQcHhEjRVe/gQ69Rq5Vl17GB3tKdKQPLn+QUMrlcTv0vQFAOr1w4DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T20:30:12.548179Z"},"content_sha256":"1125fc807f4b3139fa6ced2426173fc94bc483f580a63801c5e7b3cd1c1dd0dc","schema_version":"1.0","event_id":"sha256:1125fc807f4b3139fa6ced2426173fc94bc483f580a63801c5e7b3cd1c1dd0dc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:2HVJAUEO23NSTS55L6VE7R6V5M","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Abstraction and Acceleration in SMT-based Model-Checking for Array Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Francesco Alberti, Natasha Sharygina, Silvio Ghilardi","submitted_at":"2013-04-16T15:50:18Z","abstract_excerpt":"Abstraction (in its various forms) is a powerful established technique in model-checking; still, when unbounded data-structures are concerned, it cannot always cope with divergence phenomena in a satisfactory way. Acceleration is an approach which is widely used to avoid divergence, but it has been applied mostly to integer programs. This paper addresses the problem of accelerating transition relations for unbounded arrays with the ultimate goal of avoiding divergence during reachability analysis of abstract programs. For this, we first design a format to compute accelerations in this domain; "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.4499","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-18T03:11:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DRySHov592Kon3zVvONbWgXFuhPLm7T9+Kroc+lcxPfC0KlxxXf85FBvkfRSc8fB4b5+0IF/4BOmAuhPruisBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T20:30:12.548861Z"},"content_sha256":"e216a4126e457a2b4e916f2c5b7950e88f31536bcb323dfb6252e30221a05712","schema_version":"1.0","event_id":"sha256:e216a4126e457a2b4e916f2c5b7950e88f31536bcb323dfb6252e30221a05712"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2HVJAUEO23NSTS55L6VE7R6V5M/bundle.json","state_url":"https://pith.science/pith/2HVJAUEO23NSTS55L6VE7R6V5M/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2HVJAUEO23NSTS55L6VE7R6V5M/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-08T20:30:12Z","links":{"resolver":"https://pith.science/pith/2HVJAUEO23NSTS55L6VE7R6V5M","bundle":"https://pith.science/pith/2HVJAUEO23NSTS55L6VE7R6V5M/bundle.json","state":"https://pith.science/pith/2HVJAUEO23NSTS55L6VE7R6V5M/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2HVJAUEO23NSTS55L6VE7R6V5M/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:2HVJAUEO23NSTS55L6VE7R6V5M","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":"795e833d7f1b6a75f3d04dffd5f9c9211283fc03e00c41acfe86f7270cd65815","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-04-16T15:50:18Z","title_canon_sha256":"db580dfdc274edc7bee88001e596208fe74d798db89b603134b6daab382c57a5"},"schema_version":"1.0","source":{"id":"1304.4499","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.4499","created_at":"2026-05-18T03:11:33Z"},{"alias_kind":"arxiv_version","alias_value":"1304.4499v2","created_at":"2026-05-18T03:11:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.4499","created_at":"2026-05-18T03:11:33Z"},{"alias_kind":"pith_short_12","alias_value":"2HVJAUEO23NS","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_16","alias_value":"2HVJAUEO23NSTS55","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_8","alias_value":"2HVJAUEO","created_at":"2026-05-18T12:27:30Z"}],"graph_snapshots":[{"event_id":"sha256:e216a4126e457a2b4e916f2c5b7950e88f31536bcb323dfb6252e30221a05712","target":"graph","created_at":"2026-05-18T03:11:33Z","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":"Abstraction (in its various forms) is a powerful established technique in model-checking; still, when unbounded data-structures are concerned, it cannot always cope with divergence phenomena in a satisfactory way. Acceleration is an approach which is widely used to avoid divergence, but it has been applied mostly to integer programs. This paper addresses the problem of accelerating transition relations for unbounded arrays with the ultimate goal of avoiding divergence during reachability analysis of abstract programs. For this, we first design a format to compute accelerations in this domain; ","authors_text":"Francesco Alberti, Natasha Sharygina, Silvio Ghilardi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-04-16T15:50:18Z","title":"Abstraction and Acceleration in SMT-based Model-Checking for Array Programs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.4499","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:1125fc807f4b3139fa6ced2426173fc94bc483f580a63801c5e7b3cd1c1dd0dc","target":"record","created_at":"2026-05-18T03:11:33Z","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":"795e833d7f1b6a75f3d04dffd5f9c9211283fc03e00c41acfe86f7270cd65815","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-04-16T15:50:18Z","title_canon_sha256":"db580dfdc274edc7bee88001e596208fe74d798db89b603134b6daab382c57a5"},"schema_version":"1.0","source":{"id":"1304.4499","kind":"arxiv","version":2}},"canonical_sha256":"d1ea90508ed6db29cbbd5faa4fc7d5eb338e73281c94c492ec278030abf3e188","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d1ea90508ed6db29cbbd5faa4fc7d5eb338e73281c94c492ec278030abf3e188","first_computed_at":"2026-05-18T03:11:33.332441Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:11:33.332441Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nFkYIN6u24PfWA8yaYpqcAlgT2IRijFPabDaYjkz2yyFkAl9F9YcBQuflhdwx4tOYJdeXzJ3NKXM9H1cbCiGCw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:11:33.333159Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.4499","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1125fc807f4b3139fa6ced2426173fc94bc483f580a63801c5e7b3cd1c1dd0dc","sha256:e216a4126e457a2b4e916f2c5b7950e88f31536bcb323dfb6252e30221a05712"],"state_sha256":"1c47c468140b0437d2d24c89788ca0108f92482cbd6ea1f3127e77ccdffc6ce5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d8rxCTHDIziL0bKIJECNK0/vgFAbXeF4A1deUESq1xVrnVdtzM9GVOJXASgy/CZV0SIWuO7/i0FjHIWGnehIDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T20:30:12.552630Z","bundle_sha256":"04d924079ef5b2c583330a5efed1ae2597ae3dd5c4486692653066f4be9094b5"}}