{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:TKUW7SO5C4DVB2ICBIRUZC6T53","short_pith_number":"pith:TKUW7SO5","canonical_record":{"source":{"id":"1204.2386","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-04-11T09:38:47Z","cross_cats_sorted":[],"title_canon_sha256":"d22dd9a2fbcc8dadee3f420fd5a5256f6932693ac002eb2e4b2cf28d2cf6ffe6","abstract_canon_sha256":"93783ea746684217d3515228d036ea7c7d775d4712b360dbaf3e4fa2637cf7cf"},"schema_version":"1.0"},"canonical_sha256":"9aa96fc9dd170750e9020a234c8bd3eec35f339ce8f446c5dbbde18510079f60","source":{"kind":"arxiv","id":"1204.2386","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.2386","created_at":"2026-05-18T01:37:38Z"},{"alias_kind":"arxiv_version","alias_value":"1204.2386v5","created_at":"2026-05-18T01:37:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.2386","created_at":"2026-05-18T01:37:38Z"},{"alias_kind":"pith_short_12","alias_value":"TKUW7SO5C4DV","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_16","alias_value":"TKUW7SO5C4DVB2IC","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_8","alias_value":"TKUW7SO5","created_at":"2026-05-18T12:27:23Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:TKUW7SO5C4DVB2ICBIRUZC6T53","target":"record","payload":{"canonical_record":{"source":{"id":"1204.2386","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-04-11T09:38:47Z","cross_cats_sorted":[],"title_canon_sha256":"d22dd9a2fbcc8dadee3f420fd5a5256f6932693ac002eb2e4b2cf28d2cf6ffe6","abstract_canon_sha256":"93783ea746684217d3515228d036ea7c7d775d4712b360dbaf3e4fa2637cf7cf"},"schema_version":"1.0"},"canonical_sha256":"9aa96fc9dd170750e9020a234c8bd3eec35f339ce8f446c5dbbde18510079f60","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:38.888523Z","signature_b64":"XQx4IU3lbsxOZ9H67vhOp0TY+PU/eysA6XnuBSorFX8Vd7bil0S6wqLk49WqgCb4VjFT/rlp8syn9LFDW1PuDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9aa96fc9dd170750e9020a234c8bd3eec35f339ce8f446c5dbbde18510079f60","last_reissued_at":"2026-05-18T01:37:38.887923Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:38.887923Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1204.2386","source_version":5,"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-18T01:37:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FD7pwAF7fwRGLb2Ir5yOVbtFEMQNqHt9+DYQMkoG/OQ0jD9m7v/7LNuRJ9xQRDpdaSVJ8tR73a+3MVlocoVKCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T01:37:39.500791Z"},"content_sha256":"be5476244ede7634ba493746e002b5cdd701923deda48e056351fa7e76653ae8","schema_version":"1.0","event_id":"sha256:be5476244ede7634ba493746e002b5cdd701923deda48e056351fa7e76653ae8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:TKUW7SO5C4DVB2ICBIRUZC6T53","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Quantifier-Free Interpolation of a Theory of Arrays","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Department of Computer Science), Roberto Bruttomesso (Universit\\`a degli Studi di Milano, Silvio Ghilardi (Universit\\`a degli Studi di Milano, Silvio Ranise (Fondazione Bruno Kessler, Trento)","submitted_at":"2012-04-11T09:38:47Z","abstract_excerpt":"The use of interpolants in model checking is becoming an enabling technology to allow fast and robust verification of hardware and software. The application of encodings based on the theory of arrays, however, is limited by the impossibility of deriving quantifier- free interpolants in general. In this paper, we show that it is possible to obtain quantifier-free interpolants for a Skolemized version of the extensional theory of arrays. We prove this in two ways: (1) non-constructively, by using the model theoretic notion of amalgamation, which is known to be equivalent to admit quantifier-free"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.2386","kind":"arxiv","version":5},"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-18T01:37:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EiMDuSgZMj9dd0by0rYrWyCBNOkEuvmRhp3KanSwGw6CAHIPhOgq0dBx1ZyLM7WF72OYl4pzJ1L2Wd88rejLDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T01:37:39.501510Z"},"content_sha256":"441723173c906c7dcfba6069e2980088f3e7f58761fa99e3cf70245efb98eaf8","schema_version":"1.0","event_id":"sha256:441723173c906c7dcfba6069e2980088f3e7f58761fa99e3cf70245efb98eaf8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TKUW7SO5C4DVB2ICBIRUZC6T53/bundle.json","state_url":"https://pith.science/pith/TKUW7SO5C4DVB2ICBIRUZC6T53/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TKUW7SO5C4DVB2ICBIRUZC6T53/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-10T01:37:39Z","links":{"resolver":"https://pith.science/pith/TKUW7SO5C4DVB2ICBIRUZC6T53","bundle":"https://pith.science/pith/TKUW7SO5C4DVB2ICBIRUZC6T53/bundle.json","state":"https://pith.science/pith/TKUW7SO5C4DVB2ICBIRUZC6T53/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TKUW7SO5C4DVB2ICBIRUZC6T53/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:TKUW7SO5C4DVB2ICBIRUZC6T53","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":"93783ea746684217d3515228d036ea7c7d775d4712b360dbaf3e4fa2637cf7cf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-04-11T09:38:47Z","title_canon_sha256":"d22dd9a2fbcc8dadee3f420fd5a5256f6932693ac002eb2e4b2cf28d2cf6ffe6"},"schema_version":"1.0","source":{"id":"1204.2386","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.2386","created_at":"2026-05-18T01:37:38Z"},{"alias_kind":"arxiv_version","alias_value":"1204.2386v5","created_at":"2026-05-18T01:37:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.2386","created_at":"2026-05-18T01:37:38Z"},{"alias_kind":"pith_short_12","alias_value":"TKUW7SO5C4DV","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_16","alias_value":"TKUW7SO5C4DVB2IC","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_8","alias_value":"TKUW7SO5","created_at":"2026-05-18T12:27:23Z"}],"graph_snapshots":[{"event_id":"sha256:441723173c906c7dcfba6069e2980088f3e7f58761fa99e3cf70245efb98eaf8","target":"graph","created_at":"2026-05-18T01:37:38Z","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":"The use of interpolants in model checking is becoming an enabling technology to allow fast and robust verification of hardware and software. The application of encodings based on the theory of arrays, however, is limited by the impossibility of deriving quantifier- free interpolants in general. In this paper, we show that it is possible to obtain quantifier-free interpolants for a Skolemized version of the extensional theory of arrays. We prove this in two ways: (1) non-constructively, by using the model theoretic notion of amalgamation, which is known to be equivalent to admit quantifier-free","authors_text":"Department of Computer Science), Roberto Bruttomesso (Universit\\`a degli Studi di Milano, Silvio Ghilardi (Universit\\`a degli Studi di Milano, Silvio Ranise (Fondazione Bruno Kessler, Trento)","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-04-11T09:38:47Z","title":"Quantifier-Free Interpolation of a Theory of Arrays"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.2386","kind":"arxiv","version":5},"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:be5476244ede7634ba493746e002b5cdd701923deda48e056351fa7e76653ae8","target":"record","created_at":"2026-05-18T01:37:38Z","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":"93783ea746684217d3515228d036ea7c7d775d4712b360dbaf3e4fa2637cf7cf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-04-11T09:38:47Z","title_canon_sha256":"d22dd9a2fbcc8dadee3f420fd5a5256f6932693ac002eb2e4b2cf28d2cf6ffe6"},"schema_version":"1.0","source":{"id":"1204.2386","kind":"arxiv","version":5}},"canonical_sha256":"9aa96fc9dd170750e9020a234c8bd3eec35f339ce8f446c5dbbde18510079f60","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9aa96fc9dd170750e9020a234c8bd3eec35f339ce8f446c5dbbde18510079f60","first_computed_at":"2026-05-18T01:37:38.887923Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:37:38.887923Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XQx4IU3lbsxOZ9H67vhOp0TY+PU/eysA6XnuBSorFX8Vd7bil0S6wqLk49WqgCb4VjFT/rlp8syn9LFDW1PuDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:37:38.888523Z","signed_message":"canonical_sha256_bytes"},"source_id":"1204.2386","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:be5476244ede7634ba493746e002b5cdd701923deda48e056351fa7e76653ae8","sha256:441723173c906c7dcfba6069e2980088f3e7f58761fa99e3cf70245efb98eaf8"],"state_sha256":"59a1f3679f5b2a5cc48ff854b86203c0cd2b1d6efce6062424262812b328071d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"91bPiC7XP/+OtARavGmSnbSWOf1eiqJ88xtS5fDNBWY+jn5x7ZWsFVMs787sEFytTBjmlqJAX0TELo0baVwaBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T01:37:39.505529Z","bundle_sha256":"d1f8cba5132d8b221010ec97d4de4d2dee7847da18583b3c3e048e27f7ac3afa"}}