{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:VHBMDQBAO75KMY5OJCJW43YXOI","short_pith_number":"pith:VHBMDQBA","canonical_record":{"source":{"id":"1507.02297","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-07-08T20:17:50Z","cross_cats_sorted":[],"title_canon_sha256":"37ed3a42b684c204165895a404993e5b68ad6091ef3c341c5432a55cffa9c54b","abstract_canon_sha256":"362797853552157c24f24feea27e6c9d4128d180e3d59d4afab7683979d2f263"},"schema_version":"1.0"},"canonical_sha256":"a9c2c1c02077faa663ae48936e6f1772180be1f34cd2ba39bd3e2cde7818e7c0","source":{"kind":"arxiv","id":"1507.02297","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.02297","created_at":"2026-05-18T01:35:29Z"},{"alias_kind":"arxiv_version","alias_value":"1507.02297v3","created_at":"2026-05-18T01:35:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.02297","created_at":"2026-05-18T01:35:29Z"},{"alias_kind":"pith_short_12","alias_value":"VHBMDQBAO75K","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"VHBMDQBAO75KMY5O","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"VHBMDQBA","created_at":"2026-05-18T12:29:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:VHBMDQBAO75KMY5OJCJW43YXOI","target":"record","payload":{"canonical_record":{"source":{"id":"1507.02297","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-07-08T20:17:50Z","cross_cats_sorted":[],"title_canon_sha256":"37ed3a42b684c204165895a404993e5b68ad6091ef3c341c5432a55cffa9c54b","abstract_canon_sha256":"362797853552157c24f24feea27e6c9d4128d180e3d59d4afab7683979d2f263"},"schema_version":"1.0"},"canonical_sha256":"a9c2c1c02077faa663ae48936e6f1772180be1f34cd2ba39bd3e2cde7818e7c0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:35:29.595460Z","signature_b64":"imzDacEViRaiAZ2E+uwJPjEqICJe2/VoTlfTBycSCKXGGzF1E1BFqnzEEcD981bjHVtmIuGM8vBqb/CInvNdAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a9c2c1c02077faa663ae48936e6f1772180be1f34cd2ba39bd3e2cde7818e7c0","last_reissued_at":"2026-05-18T01:35:29.594673Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:35:29.594673Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1507.02297","source_version":3,"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:35:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uk8qkoJuBPCD6jggzAosK/jrLgtyMFbVAemq2eyM/O0jz2XiFgdFcZyEFein+xiF7s+IYUSSIBJiipy2RpfJCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T22:55:16.456752Z"},"content_sha256":"1c3afc2447b9ee18d41019df875d8c0371f663aa9262a1e483e248cbd1e3ece7","schema_version":"1.0","event_id":"sha256:1c3afc2447b9ee18d41019df875d8c0371f663aa9262a1e483e248cbd1e3ece7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:VHBMDQBAO75KMY5OJCJW43YXOI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Equivalence Checking and Simulation By Computing Range Reduction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Eugene Goldberg","submitted_at":"2015-07-08T20:17:50Z","abstract_excerpt":"We introduce new methods of equivalence checking and simulation based on Computing Range Reduction (CRR). Given a combinational circuit $N$, the CRR problem is to compute the set of outputs that disappear from the range of $N$ if a set of inputs of $N$ is excluded from consideration. Importantly, in many cases, range reduction can be efficiently found even if computing the entire range of $N$ is infeasible.\n  Solving equivalence checking by CRR facilitates generation of proofs of equivalence that mimic a \"cut propagation\" approach. A limited version of such an approach has been successfully us"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.02297","kind":"arxiv","version":3},"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:35:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FIcsRDQdkgp2ivCZh07dQ9rBUFnoEK/gcesbS2zAlGvNnY4z8cnE9YWDb1cHeuXA4e0bi4rszhel/H7SubZmDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T22:55:16.457095Z"},"content_sha256":"9a68b2aea551951f2dcc4dde4a0f519955d6ad7e89b0639acb5e642f13bc7ebe","schema_version":"1.0","event_id":"sha256:9a68b2aea551951f2dcc4dde4a0f519955d6ad7e89b0639acb5e642f13bc7ebe"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VHBMDQBAO75KMY5OJCJW43YXOI/bundle.json","state_url":"https://pith.science/pith/VHBMDQBAO75KMY5OJCJW43YXOI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VHBMDQBAO75KMY5OJCJW43YXOI/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-28T22:55:16Z","links":{"resolver":"https://pith.science/pith/VHBMDQBAO75KMY5OJCJW43YXOI","bundle":"https://pith.science/pith/VHBMDQBAO75KMY5OJCJW43YXOI/bundle.json","state":"https://pith.science/pith/VHBMDQBAO75KMY5OJCJW43YXOI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VHBMDQBAO75KMY5OJCJW43YXOI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:VHBMDQBAO75KMY5OJCJW43YXOI","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":"362797853552157c24f24feea27e6c9d4128d180e3d59d4afab7683979d2f263","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-07-08T20:17:50Z","title_canon_sha256":"37ed3a42b684c204165895a404993e5b68ad6091ef3c341c5432a55cffa9c54b"},"schema_version":"1.0","source":{"id":"1507.02297","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.02297","created_at":"2026-05-18T01:35:29Z"},{"alias_kind":"arxiv_version","alias_value":"1507.02297v3","created_at":"2026-05-18T01:35:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.02297","created_at":"2026-05-18T01:35:29Z"},{"alias_kind":"pith_short_12","alias_value":"VHBMDQBAO75K","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"VHBMDQBAO75KMY5O","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"VHBMDQBA","created_at":"2026-05-18T12:29:44Z"}],"graph_snapshots":[{"event_id":"sha256:9a68b2aea551951f2dcc4dde4a0f519955d6ad7e89b0639acb5e642f13bc7ebe","target":"graph","created_at":"2026-05-18T01:35:29Z","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 introduce new methods of equivalence checking and simulation based on Computing Range Reduction (CRR). Given a combinational circuit $N$, the CRR problem is to compute the set of outputs that disappear from the range of $N$ if a set of inputs of $N$ is excluded from consideration. Importantly, in many cases, range reduction can be efficiently found even if computing the entire range of $N$ is infeasible.\n  Solving equivalence checking by CRR facilitates generation of proofs of equivalence that mimic a \"cut propagation\" approach. A limited version of such an approach has been successfully us","authors_text":"Eugene Goldberg","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-07-08T20:17:50Z","title":"Equivalence Checking and Simulation By Computing Range Reduction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.02297","kind":"arxiv","version":3},"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:1c3afc2447b9ee18d41019df875d8c0371f663aa9262a1e483e248cbd1e3ece7","target":"record","created_at":"2026-05-18T01:35:29Z","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":"362797853552157c24f24feea27e6c9d4128d180e3d59d4afab7683979d2f263","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-07-08T20:17:50Z","title_canon_sha256":"37ed3a42b684c204165895a404993e5b68ad6091ef3c341c5432a55cffa9c54b"},"schema_version":"1.0","source":{"id":"1507.02297","kind":"arxiv","version":3}},"canonical_sha256":"a9c2c1c02077faa663ae48936e6f1772180be1f34cd2ba39bd3e2cde7818e7c0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a9c2c1c02077faa663ae48936e6f1772180be1f34cd2ba39bd3e2cde7818e7c0","first_computed_at":"2026-05-18T01:35:29.594673Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:35:29.594673Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"imzDacEViRaiAZ2E+uwJPjEqICJe2/VoTlfTBycSCKXGGzF1E1BFqnzEEcD981bjHVtmIuGM8vBqb/CInvNdAw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:35:29.595460Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.02297","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1c3afc2447b9ee18d41019df875d8c0371f663aa9262a1e483e248cbd1e3ece7","sha256:9a68b2aea551951f2dcc4dde4a0f519955d6ad7e89b0639acb5e642f13bc7ebe"],"state_sha256":"23ffa168640aeb8eb024680b27dbedb162b0df30eadd36c2049ee0720eef6dc1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UzT2sY5CWj6sK3ClRlI02Ur575rVWdwH+AENYwFWjDBXhEpDiKDK6Xz0NcpAQhyn8DJLWLFIqWCG9Eay7tHxBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T22:55:16.458951Z","bundle_sha256":"4869384fdda7fb717be2cfd83c770c4c73cad0201feda8b0e482134c1788516e"}}