{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:BGPQ4YGDI2H3VXMZVPFHLPPNLF","short_pith_number":"pith:BGPQ4YGD","schema_version":"1.0","canonical_sha256":"099f0e60c3468fbadd99abca75bded595ba66a49a8461fb6f8553835aef1fa38","source":{"kind":"arxiv","id":"2110.11292","version":1},"attestation_state":"computed","paper":{"title":"OpenABC-D: A Large-Scale Dataset For Machine Learning Guided Integrated Circuit Synthesis","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.SY","eess.SY"],"primary_cat":"cs.LG","authors_text":"Animesh Basak Chowdhury, Benjamin Tan, Ramesh Karri, Siddharth Garg","submitted_at":"2021-10-21T17:19:19Z","abstract_excerpt":"Logic synthesis is a challenging and widely-researched combinatorial optimization problem during integrated circuit (IC) design. It transforms a high-level description of hardware in a programming language like Verilog into an optimized digital circuit netlist, a network of interconnected Boolean logic gates, that implements the function. Spurred by the success of ML in solving combinatorial and graph problems in other domains, there is growing interest in the design of ML-guided logic synthesis tools. Yet, there are no standard datasets or prototypical learning tasks defined for this problem "},"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":"2110.11292","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-10-21T17:19:19Z","cross_cats_sorted":["cs.AI","cs.SY","eess.SY"],"title_canon_sha256":"7e763158569d7694b47ee0d5c3cacdbbff0e7647664f566a020ae9f0dca89297","abstract_canon_sha256":"76f6a0149ea0072ef1d3cabe38f2a67dd1ae134016ba93c785fb062bdd186636"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:24:46.030278Z","signature_b64":"fV/gLQAtm0N2T9isgZxJpCcM2S3TaCx23SOYP4w4V/VR1hBdRCf9xO+tad6d3u5zN1jfQLtRo+q08+8J/5MlCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"099f0e60c3468fbadd99abca75bded595ba66a49a8461fb6f8553835aef1fa38","last_reissued_at":"2026-07-05T03:24:46.029863Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:24:46.029863Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"OpenABC-D: A Large-Scale Dataset For Machine Learning Guided Integrated Circuit Synthesis","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.SY","eess.SY"],"primary_cat":"cs.LG","authors_text":"Animesh Basak Chowdhury, Benjamin Tan, Ramesh Karri, Siddharth Garg","submitted_at":"2021-10-21T17:19:19Z","abstract_excerpt":"Logic synthesis is a challenging and widely-researched combinatorial optimization problem during integrated circuit (IC) design. It transforms a high-level description of hardware in a programming language like Verilog into an optimized digital circuit netlist, a network of interconnected Boolean logic gates, that implements the function. Spurred by the success of ML in solving combinatorial and graph problems in other domains, there is growing interest in the design of ML-guided logic synthesis tools. Yet, there are no standard datasets or prototypical learning tasks defined for this problem "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2110.11292","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/2110.11292/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":"2110.11292","created_at":"2026-07-05T03:24:46.029920+00:00"},{"alias_kind":"arxiv_version","alias_value":"2110.11292v1","created_at":"2026-07-05T03:24:46.029920+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2110.11292","created_at":"2026-07-05T03:24:46.029920+00:00"},{"alias_kind":"pith_short_12","alias_value":"BGPQ4YGDI2H3","created_at":"2026-07-05T03:24:46.029920+00:00"},{"alias_kind":"pith_short_16","alias_value":"BGPQ4YGDI2H3VXMZ","created_at":"2026-07-05T03:24:46.029920+00:00"},{"alias_kind":"pith_short_8","alias_value":"BGPQ4YGD","created_at":"2026-07-05T03:24:46.029920+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.11202","citing_title":"CapBench: A Multi-PDK Dataset for Machine-Learning-Based Post-Layout Capacitance Extraction","ref_index":9,"is_internal_anchor":false},{"citing_arxiv_id":"2604.08810","citing_title":"R2G: A Multi-View Circuit Graph Benchmark Suite from RTL to GDSII","ref_index":6,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BGPQ4YGDI2H3VXMZVPFHLPPNLF","json":"https://pith.science/pith/BGPQ4YGDI2H3VXMZVPFHLPPNLF.json","graph_json":"https://pith.science/api/pith-number/BGPQ4YGDI2H3VXMZVPFHLPPNLF/graph.json","events_json":"https://pith.science/api/pith-number/BGPQ4YGDI2H3VXMZVPFHLPPNLF/events.json","paper":"https://pith.science/paper/BGPQ4YGD"},"agent_actions":{"view_html":"https://pith.science/pith/BGPQ4YGDI2H3VXMZVPFHLPPNLF","download_json":"https://pith.science/pith/BGPQ4YGDI2H3VXMZVPFHLPPNLF.json","view_paper":"https://pith.science/paper/BGPQ4YGD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2110.11292&json=true","fetch_graph":"https://pith.science/api/pith-number/BGPQ4YGDI2H3VXMZVPFHLPPNLF/graph.json","fetch_events":"https://pith.science/api/pith-number/BGPQ4YGDI2H3VXMZVPFHLPPNLF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BGPQ4YGDI2H3VXMZVPFHLPPNLF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BGPQ4YGDI2H3VXMZVPFHLPPNLF/action/storage_attestation","attest_author":"https://pith.science/pith/BGPQ4YGDI2H3VXMZVPFHLPPNLF/action/author_attestation","sign_citation":"https://pith.science/pith/BGPQ4YGDI2H3VXMZVPFHLPPNLF/action/citation_signature","submit_replication":"https://pith.science/pith/BGPQ4YGDI2H3VXMZVPFHLPPNLF/action/replication_record"}},"created_at":"2026-07-05T03:24:46.029920+00:00","updated_at":"2026-07-05T03:24:46.029920+00:00"}