{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:O6P35HH2BQIRIIMWHEG43RO5HU","short_pith_number":"pith:O6P35HH2","schema_version":"1.0","canonical_sha256":"779fbe9cfa0c11142196390dcdc5dd3d18a99e8039b419c2ed1e074cf03106d1","source":{"kind":"arxiv","id":"1511.01368","version":3},"attestation_state":"computed","paper":{"title":"Equivalence Checking By Logic Relaxation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Eugene Goldberg","submitted_at":"2015-11-04T15:22:13Z","abstract_excerpt":"We introduce a new framework for Equivalence Checking (EC) of Boolean circuits based on a general technique called Logic Relaxation (LoR). The essence of LoR is to relax the formula to be solved and compute a superset S of the set of new behaviors. Namely, S contains all new satisfying assignments that appeared due to relaxation and does not contain assignments satisfying the original formula. Set S is generated by a procedure called partial quantifier elimination. If all possible bad behaviors are in S, the original formula cannot have them and so the property described by this formula holds."},"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":"1511.01368","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-11-04T15:22:13Z","cross_cats_sorted":[],"title_canon_sha256":"1b12e373158c09081dc5fbf6d6c196e60df976f3fc989accff57f265722aba6f","abstract_canon_sha256":"126d22f0061a44bf4e837b638a94e50ab94bb030caa0e8e62467750c03719ecb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:18.018273Z","signature_b64":"5nGgIl6ilMnvD+kOqYpmXue9MtEIwgRkqJtbkfZC328GOQgyyHqA7F91+bw5P87hr44y4+l9SB18eZS6FayPBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"779fbe9cfa0c11142196390dcdc5dd3d18a99e8039b419c2ed1e074cf03106d1","last_reissued_at":"2026-05-18T01:11:18.017765Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:18.017765Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Equivalence Checking By Logic Relaxation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Eugene Goldberg","submitted_at":"2015-11-04T15:22:13Z","abstract_excerpt":"We introduce a new framework for Equivalence Checking (EC) of Boolean circuits based on a general technique called Logic Relaxation (LoR). The essence of LoR is to relax the formula to be solved and compute a superset S of the set of new behaviors. Namely, S contains all new satisfying assignments that appeared due to relaxation and does not contain assignments satisfying the original formula. Set S is generated by a procedure called partial quantifier elimination. If all possible bad behaviors are in S, the original formula cannot have them and so the property described by this formula holds."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.01368","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":"1511.01368","created_at":"2026-05-18T01:11:18.017847+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.01368v3","created_at":"2026-05-18T01:11:18.017847+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.01368","created_at":"2026-05-18T01:11:18.017847+00:00"},{"alias_kind":"pith_short_12","alias_value":"O6P35HH2BQIR","created_at":"2026-05-18T12:29:34.919912+00:00"},{"alias_kind":"pith_short_16","alias_value":"O6P35HH2BQIRIIMW","created_at":"2026-05-18T12:29:34.919912+00:00"},{"alias_kind":"pith_short_8","alias_value":"O6P35HH2","created_at":"2026-05-18T12:29:34.919912+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1906.10357","citing_title":"Partial Quantifier Elimination With Learning","ref_index":18,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/O6P35HH2BQIRIIMWHEG43RO5HU","json":"https://pith.science/pith/O6P35HH2BQIRIIMWHEG43RO5HU.json","graph_json":"https://pith.science/api/pith-number/O6P35HH2BQIRIIMWHEG43RO5HU/graph.json","events_json":"https://pith.science/api/pith-number/O6P35HH2BQIRIIMWHEG43RO5HU/events.json","paper":"https://pith.science/paper/O6P35HH2"},"agent_actions":{"view_html":"https://pith.science/pith/O6P35HH2BQIRIIMWHEG43RO5HU","download_json":"https://pith.science/pith/O6P35HH2BQIRIIMWHEG43RO5HU.json","view_paper":"https://pith.science/paper/O6P35HH2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.01368&json=true","fetch_graph":"https://pith.science/api/pith-number/O6P35HH2BQIRIIMWHEG43RO5HU/graph.json","fetch_events":"https://pith.science/api/pith-number/O6P35HH2BQIRIIMWHEG43RO5HU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/O6P35HH2BQIRIIMWHEG43RO5HU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/O6P35HH2BQIRIIMWHEG43RO5HU/action/storage_attestation","attest_author":"https://pith.science/pith/O6P35HH2BQIRIIMWHEG43RO5HU/action/author_attestation","sign_citation":"https://pith.science/pith/O6P35HH2BQIRIIMWHEG43RO5HU/action/citation_signature","submit_replication":"https://pith.science/pith/O6P35HH2BQIRIIMWHEG43RO5HU/action/replication_record"}},"created_at":"2026-05-18T01:11:18.017847+00:00","updated_at":"2026-05-18T01:11:18.017847+00:00"}