{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:OQGQLQFEPDPUNMZR7XHSP75IAG","short_pith_number":"pith:OQGQLQFE","schema_version":"1.0","canonical_sha256":"740d05c0a478df46b331fdcf27ffa801a2d84f378327f9d69ad1c57a178fe373","source":{"kind":"arxiv","id":"1108.3675","version":1},"attestation_state":"computed","paper":{"title":"AIG Rewriting Using 5-Input Cuts","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Elena Dubrova, Nan Li","submitted_at":"2011-08-18T08:10:37Z","abstract_excerpt":"Rewriting is a common approach to logic optimization based on local transformations. Most commercially available logic synthesis tools include a rewriting engine that may be used multiple times on the same netlist during optimization. This paper presents an And-Inverter graph based rewriting algorithm using 5-input cuts. The best circuits are pre-computed for a subset of NPN classes of 5-variable functions. Cut enumeration and Boolean matching are used to identify replacement candidates. The presented approach is expected to complement existing rewriting approaches which are usually based on 4"},"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":"1108.3675","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2011-08-18T08:10:37Z","cross_cats_sorted":[],"title_canon_sha256":"458df9d82b50437c5d464f052ac970f2a953fbbb7298e6300b66560eac1cc431","abstract_canon_sha256":"cf03bd570cca1c031959a96c1e507ceb41592287472e2e79a0858e204c2c99e3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:15:07.699937Z","signature_b64":"YVBrO/qOYLRp6VbVJitpGkiZAk8rguAvGx+u7bLnzT5xEd/pAVDcEJCmMx0oHS8/XtIohNzL1sXjq8wKahfUAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"740d05c0a478df46b331fdcf27ffa801a2d84f378327f9d69ad1c57a178fe373","last_reissued_at":"2026-05-18T04:15:07.699391Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:15:07.699391Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"AIG Rewriting Using 5-Input Cuts","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Elena Dubrova, Nan Li","submitted_at":"2011-08-18T08:10:37Z","abstract_excerpt":"Rewriting is a common approach to logic optimization based on local transformations. Most commercially available logic synthesis tools include a rewriting engine that may be used multiple times on the same netlist during optimization. This paper presents an And-Inverter graph based rewriting algorithm using 5-input cuts. The best circuits are pre-computed for a subset of NPN classes of 5-variable functions. Cut enumeration and Boolean matching are used to identify replacement candidates. The presented approach is expected to complement existing rewriting approaches which are usually based on 4"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.3675","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":"1108.3675","created_at":"2026-05-18T04:15:07.699470+00:00"},{"alias_kind":"arxiv_version","alias_value":"1108.3675v1","created_at":"2026-05-18T04:15:07.699470+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.3675","created_at":"2026-05-18T04:15:07.699470+00:00"},{"alias_kind":"pith_short_12","alias_value":"OQGQLQFEPDPU","created_at":"2026-05-18T12:26:37.096874+00:00"},{"alias_kind":"pith_short_16","alias_value":"OQGQLQFEPDPUNMZR","created_at":"2026-05-18T12:26:37.096874+00:00"},{"alias_kind":"pith_short_8","alias_value":"OQGQLQFE","created_at":"2026-05-18T12:26:37.096874+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/OQGQLQFEPDPUNMZR7XHSP75IAG","json":"https://pith.science/pith/OQGQLQFEPDPUNMZR7XHSP75IAG.json","graph_json":"https://pith.science/api/pith-number/OQGQLQFEPDPUNMZR7XHSP75IAG/graph.json","events_json":"https://pith.science/api/pith-number/OQGQLQFEPDPUNMZR7XHSP75IAG/events.json","paper":"https://pith.science/paper/OQGQLQFE"},"agent_actions":{"view_html":"https://pith.science/pith/OQGQLQFEPDPUNMZR7XHSP75IAG","download_json":"https://pith.science/pith/OQGQLQFEPDPUNMZR7XHSP75IAG.json","view_paper":"https://pith.science/paper/OQGQLQFE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1108.3675&json=true","fetch_graph":"https://pith.science/api/pith-number/OQGQLQFEPDPUNMZR7XHSP75IAG/graph.json","fetch_events":"https://pith.science/api/pith-number/OQGQLQFEPDPUNMZR7XHSP75IAG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OQGQLQFEPDPUNMZR7XHSP75IAG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OQGQLQFEPDPUNMZR7XHSP75IAG/action/storage_attestation","attest_author":"https://pith.science/pith/OQGQLQFEPDPUNMZR7XHSP75IAG/action/author_attestation","sign_citation":"https://pith.science/pith/OQGQLQFEPDPUNMZR7XHSP75IAG/action/citation_signature","submit_replication":"https://pith.science/pith/OQGQLQFEPDPUNMZR7XHSP75IAG/action/replication_record"}},"created_at":"2026-05-18T04:15:07.699470+00:00","updated_at":"2026-05-18T04:15:07.699470+00:00"}