{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:RHQYP3KO5GPDMLGLL6Q5TJHEBH","short_pith_number":"pith:RHQYP3KO","schema_version":"1.0","canonical_sha256":"89e187ed4ee99e362ccb5fa1d9a4e409e682a10656f0079b4ea5d911327eee3f","source":{"kind":"arxiv","id":"2406.06241","version":1},"attestation_state":"computed","paper":{"title":"Practical Boolean Decomposition for Delay-driven LUT Mapping","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Alan Mishchenko, Alessandro Tempia Calvino, Giovanni De Micheli, Robert Brayton","submitted_at":"2024-06-10T13:14:31Z","abstract_excerpt":"Ashenhurst-Curtis decomposition (ACD) is a decomposition technique used, in particular, to map combinational logic into lookup tables (LUTs) structures when synthesizing hardware designs. However, available implementations of ACD suffer from excessive complexity, search-space restrictions, and slow run time, which limit their applicability and scalability. This paper presents a novel fast and versatile technique of ACD suitable for delay optimization. We use this new formulation to compute two-level decompositions into a variable number of LUTs and enhance delay-driven LUT mapping by performin"},"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":"2406.06241","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2024-06-10T13:14:31Z","cross_cats_sorted":[],"title_canon_sha256":"1fc679f324c9a6aa7029392437f8b0556ce77cce2684100e7931ebaa87feda63","abstract_canon_sha256":"01a69f53ab8d5ded40791c69046146b3d578304e3bb194fd246095ebc2d3df93"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:29:39.708030Z","signature_b64":"wLSQNJRxL8x5vbvStOb+3y9u8I2cEsdwiGyIfEQEy0XhHUM/Qv7noXWFb/lu0nJ1PHaEvRaPa96U/Gt/+djaAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"89e187ed4ee99e362ccb5fa1d9a4e409e682a10656f0079b4ea5d911327eee3f","last_reissued_at":"2026-07-05T08:29:39.707483Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:29:39.707483Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Practical Boolean Decomposition for Delay-driven LUT Mapping","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Alan Mishchenko, Alessandro Tempia Calvino, Giovanni De Micheli, Robert Brayton","submitted_at":"2024-06-10T13:14:31Z","abstract_excerpt":"Ashenhurst-Curtis decomposition (ACD) is a decomposition technique used, in particular, to map combinational logic into lookup tables (LUTs) structures when synthesizing hardware designs. However, available implementations of ACD suffer from excessive complexity, search-space restrictions, and slow run time, which limit their applicability and scalability. This paper presents a novel fast and versatile technique of ACD suitable for delay optimization. We use this new formulation to compute two-level decompositions into a variable number of LUTs and enhance delay-driven LUT mapping by performin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.06241","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2406.06241/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2406.06241","created_at":"2026-07-05T08:29:39.707542+00:00"},{"alias_kind":"arxiv_version","alias_value":"2406.06241v1","created_at":"2026-07-05T08:29:39.707542+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.06241","created_at":"2026-07-05T08:29:39.707542+00:00"},{"alias_kind":"pith_short_12","alias_value":"RHQYP3KO5GPD","created_at":"2026-07-05T08:29:39.707542+00:00"},{"alias_kind":"pith_short_16","alias_value":"RHQYP3KO5GPDMLGL","created_at":"2026-07-05T08:29:39.707542+00:00"},{"alias_kind":"pith_short_8","alias_value":"RHQYP3KO","created_at":"2026-07-05T08:29:39.707542+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.06816","citing_title":"DeepCell: Self-Supervised Multiview Fusion for Circuit Representation Learning","ref_index":48,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RHQYP3KO5GPDMLGLL6Q5TJHEBH","json":"https://pith.science/pith/RHQYP3KO5GPDMLGLL6Q5TJHEBH.json","graph_json":"https://pith.science/api/pith-number/RHQYP3KO5GPDMLGLL6Q5TJHEBH/graph.json","events_json":"https://pith.science/api/pith-number/RHQYP3KO5GPDMLGLL6Q5TJHEBH/events.json","paper":"https://pith.science/paper/RHQYP3KO"},"agent_actions":{"view_html":"https://pith.science/pith/RHQYP3KO5GPDMLGLL6Q5TJHEBH","download_json":"https://pith.science/pith/RHQYP3KO5GPDMLGLL6Q5TJHEBH.json","view_paper":"https://pith.science/paper/RHQYP3KO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2406.06241&json=true","fetch_graph":"https://pith.science/api/pith-number/RHQYP3KO5GPDMLGLL6Q5TJHEBH/graph.json","fetch_events":"https://pith.science/api/pith-number/RHQYP3KO5GPDMLGLL6Q5TJHEBH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RHQYP3KO5GPDMLGLL6Q5TJHEBH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RHQYP3KO5GPDMLGLL6Q5TJHEBH/action/storage_attestation","attest_author":"https://pith.science/pith/RHQYP3KO5GPDMLGLL6Q5TJHEBH/action/author_attestation","sign_citation":"https://pith.science/pith/RHQYP3KO5GPDMLGLL6Q5TJHEBH/action/citation_signature","submit_replication":"https://pith.science/pith/RHQYP3KO5GPDMLGLL6Q5TJHEBH/action/replication_record"}},"created_at":"2026-07-05T08:29:39.707542+00:00","updated_at":"2026-07-05T08:29:39.707542+00:00"}