{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:YYQRJ6NBA4FSVTCMCU2OXNKF6V","short_pith_number":"pith:YYQRJ6NB","schema_version":"1.0","canonical_sha256":"c62114f9a1070b2acc4c1534ebb545f5795e0a9f5e354113414889ef78f89ad3","source":{"kind":"arxiv","id":"2404.13617","version":1},"attestation_state":"computed","paper":{"title":"Parallel AIG Refactoring via Conflict Breaking","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Biwei Xie, Junfeng Liu, Liwei Ni, Xingquan Li, Ye Cai, Zonglin Yang","submitted_at":"2024-04-21T10:54:12Z","abstract_excerpt":"Algorithm parallelization to leverage multi-core platforms for improving the efficiency of Electronic Design Automation~(EDA) tools plays a significant role in enhancing the scalability of Integrated Circuit (IC) designs. Logic optimization is a key process in the EDA design flow to reduce the area and depth of the circuit graph by finding logically equivalent graphs for substitution, which is typically time-consuming. To address these challenges, in this paper, we first analyze two types of conflicts that need to be handled in the parallelization framework of refactoring And-Inverter Graph~(A"},"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":"2404.13617","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2024-04-21T10:54:12Z","cross_cats_sorted":[],"title_canon_sha256":"b01cf1ec265d89a2ed3fed7954c68e0c09328c9651a30434757c4416e9aef14f","abstract_canon_sha256":"ee7439291fbf7199af95fb86781b14ccd6c038c2ea2d4fce10414717040c4108"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:10:35.064386Z","signature_b64":"erORKdvlQS5uHJhvIxl36jHCljcE2ooL0eovaBd/JvmirqFN/pySQU8Y2LouEZ4I/W9Jf/z6+CYuRSF3ZjxqBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c62114f9a1070b2acc4c1534ebb545f5795e0a9f5e354113414889ef78f89ad3","last_reissued_at":"2026-07-05T08:10:35.063963Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:10:35.063963Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parallel AIG Refactoring via Conflict Breaking","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Biwei Xie, Junfeng Liu, Liwei Ni, Xingquan Li, Ye Cai, Zonglin Yang","submitted_at":"2024-04-21T10:54:12Z","abstract_excerpt":"Algorithm parallelization to leverage multi-core platforms for improving the efficiency of Electronic Design Automation~(EDA) tools plays a significant role in enhancing the scalability of Integrated Circuit (IC) designs. Logic optimization is a key process in the EDA design flow to reduce the area and depth of the circuit graph by finding logically equivalent graphs for substitution, which is typically time-consuming. To address these challenges, in this paper, we first analyze two types of conflicts that need to be handled in the parallelization framework of refactoring And-Inverter Graph~(A"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.13617","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/2404.13617/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":"2404.13617","created_at":"2026-07-05T08:10:35.064029+00:00"},{"alias_kind":"arxiv_version","alias_value":"2404.13617v1","created_at":"2026-07-05T08:10:35.064029+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.13617","created_at":"2026-07-05T08:10:35.064029+00:00"},{"alias_kind":"pith_short_12","alias_value":"YYQRJ6NBA4FS","created_at":"2026-07-05T08:10:35.064029+00:00"},{"alias_kind":"pith_short_16","alias_value":"YYQRJ6NBA4FSVTCM","created_at":"2026-07-05T08:10:35.064029+00:00"},{"alias_kind":"pith_short_8","alias_value":"YYQRJ6NB","created_at":"2026-07-05T08:10:35.064029+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/YYQRJ6NBA4FSVTCMCU2OXNKF6V","json":"https://pith.science/pith/YYQRJ6NBA4FSVTCMCU2OXNKF6V.json","graph_json":"https://pith.science/api/pith-number/YYQRJ6NBA4FSVTCMCU2OXNKF6V/graph.json","events_json":"https://pith.science/api/pith-number/YYQRJ6NBA4FSVTCMCU2OXNKF6V/events.json","paper":"https://pith.science/paper/YYQRJ6NB"},"agent_actions":{"view_html":"https://pith.science/pith/YYQRJ6NBA4FSVTCMCU2OXNKF6V","download_json":"https://pith.science/pith/YYQRJ6NBA4FSVTCMCU2OXNKF6V.json","view_paper":"https://pith.science/paper/YYQRJ6NB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2404.13617&json=true","fetch_graph":"https://pith.science/api/pith-number/YYQRJ6NBA4FSVTCMCU2OXNKF6V/graph.json","fetch_events":"https://pith.science/api/pith-number/YYQRJ6NBA4FSVTCMCU2OXNKF6V/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YYQRJ6NBA4FSVTCMCU2OXNKF6V/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YYQRJ6NBA4FSVTCMCU2OXNKF6V/action/storage_attestation","attest_author":"https://pith.science/pith/YYQRJ6NBA4FSVTCMCU2OXNKF6V/action/author_attestation","sign_citation":"https://pith.science/pith/YYQRJ6NBA4FSVTCMCU2OXNKF6V/action/citation_signature","submit_replication":"https://pith.science/pith/YYQRJ6NBA4FSVTCMCU2OXNKF6V/action/replication_record"}},"created_at":"2026-07-05T08:10:35.064029+00:00","updated_at":"2026-07-05T08:10:35.064029+00:00"}