{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:1999:TTESFKNRKYPGMLEYC3JDSWOO2Z","short_pith_number":"pith:TTESFKNR","canonical_record":{"source":{"id":"cs/9910014","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"cs.LO","submitted_at":"1999-10-14T22:41:39Z","cross_cats_sorted":["cs.AR"],"title_canon_sha256":"1e2ad6e8a2012f8ecd75341e701eff4761e9dc7b50ebbe28a74dab34109b9063","abstract_canon_sha256":"5bad9db345e9243be13fbf66b0086ad4d64c679df438a8113a9440268737b486"},"schema_version":"1.0"},"canonical_sha256":"9cc922a9b1561e662c9816d23959ced65356f1f2d4adf4c5d5c62d155fa06bae","source":{"kind":"arxiv","id":"cs/9910014","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/9910014","created_at":"2026-07-04T14:25:13Z"},{"alias_kind":"arxiv_version","alias_value":"cs/9910014v2","created_at":"2026-07-04T14:25:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/9910014","created_at":"2026-07-04T14:25:13Z"},{"alias_kind":"pith_short_12","alias_value":"TTESFKNRKYPG","created_at":"2026-07-04T14:25:13Z"},{"alias_kind":"pith_short_16","alias_value":"TTESFKNRKYPGMLEY","created_at":"2026-07-04T14:25:13Z"},{"alias_kind":"pith_short_8","alias_value":"TTESFKNR","created_at":"2026-07-04T14:25:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:1999:TTESFKNRKYPGMLEYC3JDSWOO2Z","target":"record","payload":{"canonical_record":{"source":{"id":"cs/9910014","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"cs.LO","submitted_at":"1999-10-14T22:41:39Z","cross_cats_sorted":["cs.AR"],"title_canon_sha256":"1e2ad6e8a2012f8ecd75341e701eff4761e9dc7b50ebbe28a74dab34109b9063","abstract_canon_sha256":"5bad9db345e9243be13fbf66b0086ad4d64c679df438a8113a9440268737b486"},"schema_version":"1.0"},"canonical_sha256":"9cc922a9b1561e662c9816d23959ced65356f1f2d4adf4c5d5c62d155fa06bae","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:25:13.088911Z","signature_b64":"JTUqQuYsvK70czTccihA3Zzy4f/W7HnQugolPgCFB5CiwhrScOyl0dCED+khlqdJ58c8Pi21V3EVmxFrRUFIDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9cc922a9b1561e662c9816d23959ced65356f1f2d4adf4c5d5c62d155fa06bae","last_reissued_at":"2026-07-04T14:25:13.088534Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:25:13.088534Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"cs/9910014","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-07-04T14:25:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"630SCatv9cYW8bx3R7osvuEIbgBYKR/h0WXml9zgxE2nr7oLAsxge1MiYu8vj5FqbdT3a2KD/PQqxrsp0kxjDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-12T23:06:24.624950Z"},"content_sha256":"1ffc11304889e9ea0ab6a0e32599a5df05ae9cfeb3584cc6c12d5c8bb871bd6b","schema_version":"1.0","event_id":"sha256:1ffc11304889e9ea0ab6a0e32599a5df05ae9cfeb3584cc6c12d5c8bb871bd6b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:1999:TTESFKNRKYPGMLEYC3JDSWOO2Z","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Processor Verification Using Efficient Reductions of the Logic of Uninterpreted Functions to Propositional Logic","license":"","headline":"","cross_cats":["cs.AR"],"primary_cat":"cs.LO","authors_text":"Miroslav N. Velev, Randal E. Bryant, Steven German","submitted_at":"1999-10-14T22:41:39Z","abstract_excerpt":"The logic of equality with uninterpreted functions (EUF) provides a means of abstracting the manipulation of data by a processor when verifying the correctness of its control logic. By reducing formulas in this logic to propositional formulas, we can apply Boolean methods such as Ordered Binary Decision Diagrams (BDDs) and Boolean satisfiability checkers to perform the verification.\n  We can exploit characteristics of the formulas describing the verification conditions to greatly simplify the propositional formulas generated. In particular, we exploit the property that many equations appear on"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/9910014","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/cs/9910014/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-04T14:25:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j0R6+JhxrHQTh47qUlmjTxKyA8DnAd9kdAsLDfdCL7miwQZOfr6hEHyW2DOsqR8vDLFRmVT03z3YV9UjbaZkDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-12T23:06:24.625971Z"},"content_sha256":"b65e50cf85975ffe4cb2c1a60eccf0321a6da98ad0b79825d5e9f44e67902a78","schema_version":"1.0","event_id":"sha256:b65e50cf85975ffe4cb2c1a60eccf0321a6da98ad0b79825d5e9f44e67902a78"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TTESFKNRKYPGMLEYC3JDSWOO2Z/bundle.json","state_url":"https://pith.science/pith/TTESFKNRKYPGMLEYC3JDSWOO2Z/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TTESFKNRKYPGMLEYC3JDSWOO2Z/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-07-12T23:06:24Z","links":{"resolver":"https://pith.science/pith/TTESFKNRKYPGMLEYC3JDSWOO2Z","bundle":"https://pith.science/pith/TTESFKNRKYPGMLEYC3JDSWOO2Z/bundle.json","state":"https://pith.science/pith/TTESFKNRKYPGMLEYC3JDSWOO2Z/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TTESFKNRKYPGMLEYC3JDSWOO2Z/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:1999:TTESFKNRKYPGMLEYC3JDSWOO2Z","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":"5bad9db345e9243be13fbf66b0086ad4d64c679df438a8113a9440268737b486","cross_cats_sorted":["cs.AR"],"license":"","primary_cat":"cs.LO","submitted_at":"1999-10-14T22:41:39Z","title_canon_sha256":"1e2ad6e8a2012f8ecd75341e701eff4761e9dc7b50ebbe28a74dab34109b9063"},"schema_version":"1.0","source":{"id":"cs/9910014","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/9910014","created_at":"2026-07-04T14:25:13Z"},{"alias_kind":"arxiv_version","alias_value":"cs/9910014v2","created_at":"2026-07-04T14:25:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/9910014","created_at":"2026-07-04T14:25:13Z"},{"alias_kind":"pith_short_12","alias_value":"TTESFKNRKYPG","created_at":"2026-07-04T14:25:13Z"},{"alias_kind":"pith_short_16","alias_value":"TTESFKNRKYPGMLEY","created_at":"2026-07-04T14:25:13Z"},{"alias_kind":"pith_short_8","alias_value":"TTESFKNR","created_at":"2026-07-04T14:25:13Z"}],"graph_snapshots":[{"event_id":"sha256:b65e50cf85975ffe4cb2c1a60eccf0321a6da98ad0b79825d5e9f44e67902a78","target":"graph","created_at":"2026-07-04T14:25:13Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/cs/9910014/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The logic of equality with uninterpreted functions (EUF) provides a means of abstracting the manipulation of data by a processor when verifying the correctness of its control logic. By reducing formulas in this logic to propositional formulas, we can apply Boolean methods such as Ordered Binary Decision Diagrams (BDDs) and Boolean satisfiability checkers to perform the verification.\n  We can exploit characteristics of the formulas describing the verification conditions to greatly simplify the propositional formulas generated. In particular, we exploit the property that many equations appear on","authors_text":"Miroslav N. Velev, Randal E. Bryant, Steven German","cross_cats":["cs.AR"],"headline":"","license":"","primary_cat":"cs.LO","submitted_at":"1999-10-14T22:41:39Z","title":"Processor Verification Using Efficient Reductions of the Logic of Uninterpreted Functions to Propositional Logic"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/9910014","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:1ffc11304889e9ea0ab6a0e32599a5df05ae9cfeb3584cc6c12d5c8bb871bd6b","target":"record","created_at":"2026-07-04T14:25:13Z","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":"5bad9db345e9243be13fbf66b0086ad4d64c679df438a8113a9440268737b486","cross_cats_sorted":["cs.AR"],"license":"","primary_cat":"cs.LO","submitted_at":"1999-10-14T22:41:39Z","title_canon_sha256":"1e2ad6e8a2012f8ecd75341e701eff4761e9dc7b50ebbe28a74dab34109b9063"},"schema_version":"1.0","source":{"id":"cs/9910014","kind":"arxiv","version":2}},"canonical_sha256":"9cc922a9b1561e662c9816d23959ced65356f1f2d4adf4c5d5c62d155fa06bae","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9cc922a9b1561e662c9816d23959ced65356f1f2d4adf4c5d5c62d155fa06bae","first_computed_at":"2026-07-04T14:25:13.088534Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T14:25:13.088534Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JTUqQuYsvK70czTccihA3Zzy4f/W7HnQugolPgCFB5CiwhrScOyl0dCED+khlqdJ58c8Pi21V3EVmxFrRUFIDw==","signature_status":"signed_v1","signed_at":"2026-07-04T14:25:13.088911Z","signed_message":"canonical_sha256_bytes"},"source_id":"cs/9910014","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1ffc11304889e9ea0ab6a0e32599a5df05ae9cfeb3584cc6c12d5c8bb871bd6b","sha256:b65e50cf85975ffe4cb2c1a60eccf0321a6da98ad0b79825d5e9f44e67902a78"],"state_sha256":"0329724fa18ef42a308dec48e9af9829116ed9951f8374341e50407d49bbed3a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rB7qDs3xZV8xX2ONa4p4cH6Qg4QL5QoTs7/GUe2ube3Oj3+878uC1nXc+gBggMKC0cydyGsOdQGaLmpnNjjSCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-12T23:06:24.632650Z","bundle_sha256":"04b4c4a9ee2e00c3ce165de7f99b8cb0b61ca581a4a6dd31be0d5f3aebe4e448"}}