{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:ICNG2DBHXOS3BA75ZNX642RGQ5","short_pith_number":"pith:ICNG2DBH","schema_version":"1.0","canonical_sha256":"409a6d0c27bba5b083fdcb6fee6a268761c0e449d493d5792dc0e8e99ce4a6a2","source":{"kind":"arxiv","id":"1503.06632","version":1},"attestation_state":"computed","paper":{"title":"A Fast Heuristic Algorithm for Redundancy Removal","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Elena Dubrova, Maxim Teslenko","submitted_at":"2015-03-23T13:25:18Z","abstract_excerpt":"Redundancy identification is an important step of the design flow that typically follows logic synthesis and optimization. In addition to reducing circuit area, power consumption, and delay, redundancy removal also improves testability. All commercially available synthesis tools include a redundancy removal engine which is often run multiple times on the same netlist during optimization. This paper presents a fast heuristic algorithm for redundancy removal in combinational circuits. Our idea is to provide a quick partial solution which can be used for the intermediate redundancy removal runs i"},"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":"1503.06632","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-03-23T13:25:18Z","cross_cats_sorted":[],"title_canon_sha256":"9af63d6095b47799e5fb6270994c5a16f8687d448b037950cc07e2ecd90ab337","abstract_canon_sha256":"a5195bd4691cab3b3afc101852582f92c8cfb425d0a41e00b30fb46e577451de"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:20:37.754972Z","signature_b64":"+RYucZVpeHzhAjk0VMQeRBFa4Br+mXaHD+dIBM+dL5RHLyTt6qFcIFwgP+Vv/6wj/PE1EYmW2dssyZaUfEi/AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"409a6d0c27bba5b083fdcb6fee6a268761c0e449d493d5792dc0e8e99ce4a6a2","last_reissued_at":"2026-05-18T02:20:37.754253Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:20:37.754253Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Fast Heuristic Algorithm for Redundancy Removal","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Elena Dubrova, Maxim Teslenko","submitted_at":"2015-03-23T13:25:18Z","abstract_excerpt":"Redundancy identification is an important step of the design flow that typically follows logic synthesis and optimization. In addition to reducing circuit area, power consumption, and delay, redundancy removal also improves testability. All commercially available synthesis tools include a redundancy removal engine which is often run multiple times on the same netlist during optimization. This paper presents a fast heuristic algorithm for redundancy removal in combinational circuits. Our idea is to provide a quick partial solution which can be used for the intermediate redundancy removal runs i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.06632","kind":"arxiv","version":1},"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":"1503.06632","created_at":"2026-05-18T02:20:37.754387+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.06632v1","created_at":"2026-05-18T02:20:37.754387+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.06632","created_at":"2026-05-18T02:20:37.754387+00:00"},{"alias_kind":"pith_short_12","alias_value":"ICNG2DBHXOS3","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_16","alias_value":"ICNG2DBHXOS3BA75","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_8","alias_value":"ICNG2DBH","created_at":"2026-05-18T12:29:25.134429+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/ICNG2DBHXOS3BA75ZNX642RGQ5","json":"https://pith.science/pith/ICNG2DBHXOS3BA75ZNX642RGQ5.json","graph_json":"https://pith.science/api/pith-number/ICNG2DBHXOS3BA75ZNX642RGQ5/graph.json","events_json":"https://pith.science/api/pith-number/ICNG2DBHXOS3BA75ZNX642RGQ5/events.json","paper":"https://pith.science/paper/ICNG2DBH"},"agent_actions":{"view_html":"https://pith.science/pith/ICNG2DBHXOS3BA75ZNX642RGQ5","download_json":"https://pith.science/pith/ICNG2DBHXOS3BA75ZNX642RGQ5.json","view_paper":"https://pith.science/paper/ICNG2DBH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.06632&json=true","fetch_graph":"https://pith.science/api/pith-number/ICNG2DBHXOS3BA75ZNX642RGQ5/graph.json","fetch_events":"https://pith.science/api/pith-number/ICNG2DBHXOS3BA75ZNX642RGQ5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ICNG2DBHXOS3BA75ZNX642RGQ5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ICNG2DBHXOS3BA75ZNX642RGQ5/action/storage_attestation","attest_author":"https://pith.science/pith/ICNG2DBHXOS3BA75ZNX642RGQ5/action/author_attestation","sign_citation":"https://pith.science/pith/ICNG2DBHXOS3BA75ZNX642RGQ5/action/citation_signature","submit_replication":"https://pith.science/pith/ICNG2DBHXOS3BA75ZNX642RGQ5/action/replication_record"}},"created_at":"2026-05-18T02:20:37.754387+00:00","updated_at":"2026-05-18T02:20:37.754387+00:00"}