{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:F2YYE3UBSKLA67RKZLJ4OTFCWZ","short_pith_number":"pith:F2YYE3UB","schema_version":"1.0","canonical_sha256":"2eb1826e8192960f7e2acad3c74ca2b6422575109aa119a1c55628c4f9bc9fbc","source":{"kind":"arxiv","id":"2504.11574","version":2},"attestation_state":"computed","paper":{"title":"E-morphic: Scalable Equality Saturation for Structural Exploration in Logic Synthesis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AR","authors_text":"Chen Chen, Cunxi Yu, Guangyu Hu, Hongce Zhang, Yuzhe Ma","submitted_at":"2025-04-15T19:38:14Z","abstract_excerpt":"In technology mapping, the quality of the final implementation heavily relies on the circuit structure after technology-independent optimization. Recent studies have introduced equality saturation as a novel optimization approach. However, its efficiency remains a hurdle against its wide adoption in logic synthesis. This paper proposes a highly scalable and efficient framework named E-morphic. It is the first work that employs equality saturation for resynthesis after conventional technology-independent logic optimizations, enabling structure exploration before technology mapping. Powered by s"},"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":"2504.11574","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2025-04-15T19:38:14Z","cross_cats_sorted":[],"title_canon_sha256":"c0f04a7c545910f8bb112c0f77cb58e3ba57c7094f79b274e456af333110c8b0","abstract_canon_sha256":"70098d5c79b6a4a5495e3cfe4831268ee97c7c6c711adb96d15421ced6a0ed5e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:51:37.488206Z","signature_b64":"5uI534dEgFYiVnXL14z7EI7XeyW6kNU2JnFlahRoIh03qS2dAFRyt+PuLHnT349fdDvBHwRJMmwqzLoVHQxzCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2eb1826e8192960f7e2acad3c74ca2b6422575109aa119a1c55628c4f9bc9fbc","last_reissued_at":"2026-07-05T10:51:37.487734Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:51:37.487734Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"E-morphic: Scalable Equality Saturation for Structural Exploration in Logic Synthesis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AR","authors_text":"Chen Chen, Cunxi Yu, Guangyu Hu, Hongce Zhang, Yuzhe Ma","submitted_at":"2025-04-15T19:38:14Z","abstract_excerpt":"In technology mapping, the quality of the final implementation heavily relies on the circuit structure after technology-independent optimization. Recent studies have introduced equality saturation as a novel optimization approach. However, its efficiency remains a hurdle against its wide adoption in logic synthesis. This paper proposes a highly scalable and efficient framework named E-morphic. It is the first work that employs equality saturation for resynthesis after conventional technology-independent logic optimizations, enabling structure exploration before technology mapping. Powered by s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.11574","kind":"arxiv","version":2},"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/2504.11574/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":"2504.11574","created_at":"2026-07-05T10:51:37.487792+00:00"},{"alias_kind":"arxiv_version","alias_value":"2504.11574v2","created_at":"2026-07-05T10:51:37.487792+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.11574","created_at":"2026-07-05T10:51:37.487792+00:00"},{"alias_kind":"pith_short_12","alias_value":"F2YYE3UBSKLA","created_at":"2026-07-05T10:51:37.487792+00:00"},{"alias_kind":"pith_short_16","alias_value":"F2YYE3UBSKLA67RK","created_at":"2026-07-05T10:51:37.487792+00:00"},{"alias_kind":"pith_short_8","alias_value":"F2YYE3UB","created_at":"2026-07-05T10:51:37.487792+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2508.14068","citing_title":"Revisit Choice Network for Synthesis and Technology Mapping","ref_index":35,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/F2YYE3UBSKLA67RKZLJ4OTFCWZ","json":"https://pith.science/pith/F2YYE3UBSKLA67RKZLJ4OTFCWZ.json","graph_json":"https://pith.science/api/pith-number/F2YYE3UBSKLA67RKZLJ4OTFCWZ/graph.json","events_json":"https://pith.science/api/pith-number/F2YYE3UBSKLA67RKZLJ4OTFCWZ/events.json","paper":"https://pith.science/paper/F2YYE3UB"},"agent_actions":{"view_html":"https://pith.science/pith/F2YYE3UBSKLA67RKZLJ4OTFCWZ","download_json":"https://pith.science/pith/F2YYE3UBSKLA67RKZLJ4OTFCWZ.json","view_paper":"https://pith.science/paper/F2YYE3UB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2504.11574&json=true","fetch_graph":"https://pith.science/api/pith-number/F2YYE3UBSKLA67RKZLJ4OTFCWZ/graph.json","fetch_events":"https://pith.science/api/pith-number/F2YYE3UBSKLA67RKZLJ4OTFCWZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F2YYE3UBSKLA67RKZLJ4OTFCWZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F2YYE3UBSKLA67RKZLJ4OTFCWZ/action/storage_attestation","attest_author":"https://pith.science/pith/F2YYE3UBSKLA67RKZLJ4OTFCWZ/action/author_attestation","sign_citation":"https://pith.science/pith/F2YYE3UBSKLA67RKZLJ4OTFCWZ/action/citation_signature","submit_replication":"https://pith.science/pith/F2YYE3UBSKLA67RKZLJ4OTFCWZ/action/replication_record"}},"created_at":"2026-07-05T10:51:37.487792+00:00","updated_at":"2026-07-05T10:51:37.487792+00:00"}