{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:VHBMDQBAO75KMY5OJCJW43YXOI","short_pith_number":"pith:VHBMDQBA","schema_version":"1.0","canonical_sha256":"a9c2c1c02077faa663ae48936e6f1772180be1f34cd2ba39bd3e2cde7818e7c0","source":{"kind":"arxiv","id":"1507.02297","version":3},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1507.02297","created_at":"2026-05-18T01:35:29.594802+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.02297v3","created_at":"2026-05-18T01:35:29.594802+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.02297","created_at":"2026-05-18T01:35:29.594802+00:00"},{"alias_kind":"pith_short_12","alias_value":"VHBMDQBAO75K","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_16","alias_value":"VHBMDQBAO75KMY5O","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_8","alias_value":"VHBMDQBA","created_at":"2026-05-18T12:29:44.643036+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VHBMDQBAO75KMY5OJCJW43YXOI","json":"https://pith.science/pith/VHBMDQBAO75KMY5OJCJW43YXOI.json","graph_json":"https://pith.science/api/pith-number/VHBMDQBAO75KMY5OJCJW43YXOI/graph.json","events_json":"https://pith.science/api/pith-number/VHBMDQBAO75KMY5OJCJW43YXOI/events.json","paper":"https://pith.science/paper/VHBMDQBA"},"agent_actions":{"view_html":"https://pith.science/pith/VHBMDQBAO75KMY5OJCJW43YXOI","download_json":"https://pith.science/pith/VHBMDQBAO75KMY5OJCJW43YXOI.json","view_paper":"https://pith.science/paper/VHBMDQBA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.02297&json=true","fetch_graph":"https://pith.science/api/pith-number/VHBMDQBAO75KMY5OJCJW43YXOI/graph.json","fetch_events":"https://pith.science/api/pith-number/VHBMDQBAO75KMY5OJCJW43YXOI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VHBMDQBAO75KMY5OJCJW43YXOI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VHBMDQBAO75KMY5OJCJW43YXOI/action/storage_attestation","attest_author":"https://pith.science/pith/VHBMDQBAO75KMY5OJCJW43YXOI/action/author_attestation","sign_citation":"https://pith.science/pith/VHBMDQBAO75KMY5OJCJW43YXOI/action/citation_signature","submit_replication":"https://pith.science/pith/VHBMDQBAO75KMY5OJCJW43YXOI/action/replication_record"}},"created_at":"2026-05-18T01:35:29.594802+00:00","updated_at":"2026-05-18T01:35:29.594802+00:00"}