{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:SOEMGFDRWFGEG7IX3GSC2UBK3F","short_pith_number":"pith:SOEMGFDR","schema_version":"1.0","canonical_sha256":"9388c31471b14c437d17d9a42d502ad9794d71829645fa60949f91f22eb59fef","source":{"kind":"arxiv","id":"2111.00234","version":2},"attestation_state":"computed","paper":{"title":"On Joint Learning for Solving Placement and Routing in Chip Design","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Junchi Yan, Ruoyu Cheng","submitted_at":"2021-10-30T11:41:49Z","abstract_excerpt":"For its advantage in GPU acceleration and less dependency on human experts, machine learning has been an emerging tool for solving the placement and routing problems, as two critical steps in modern chip design flow. Being still in its early stage, there are fundamental issues: scalability, reward design, and end-to-end learning paradigm etc. To achieve end-to-end placement learning, we first propose a joint learning method termed by DeepPlace for the placement of macros and standard cells, by the integration of reinforcement learning with a gradient based optimization scheme. To further bridg"},"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":"2111.00234","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-10-30T11:41:49Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"a0e8c62debf374351e6d106e5e5a63e70ba38a2042bcf1b3e5ad915e3e93d023","abstract_canon_sha256":"2c97413feee184cef23a71769d5b16feacc4cc802c4928619ae8f113cefc91c0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:43:45.036434Z","signature_b64":"0FJ3gJ1IOlMgE4p6zdNrE/Gx6TvJW+bXC0YojWdgVZq2OA+EuXrP46y0yH0l33GvrZVCtt22iqxqEF8AVQAcCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9388c31471b14c437d17d9a42d502ad9794d71829645fa60949f91f22eb59fef","last_reissued_at":"2026-07-05T03:43:45.036097Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:43:45.036097Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Joint Learning for Solving Placement and Routing in Chip Design","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Junchi Yan, Ruoyu Cheng","submitted_at":"2021-10-30T11:41:49Z","abstract_excerpt":"For its advantage in GPU acceleration and less dependency on human experts, machine learning has been an emerging tool for solving the placement and routing problems, as two critical steps in modern chip design flow. Being still in its early stage, there are fundamental issues: scalability, reward design, and end-to-end learning paradigm etc. To achieve end-to-end placement learning, we first propose a joint learning method termed by DeepPlace for the placement of macros and standard cells, by the integration of reinforcement learning with a gradient based optimization scheme. To further bridg"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2111.00234","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/2111.00234/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":"2111.00234","created_at":"2026-07-05T03:43:45.036151+00:00"},{"alias_kind":"arxiv_version","alias_value":"2111.00234v2","created_at":"2026-07-05T03:43:45.036151+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2111.00234","created_at":"2026-07-05T03:43:45.036151+00:00"},{"alias_kind":"pith_short_12","alias_value":"SOEMGFDRWFGE","created_at":"2026-07-05T03:43:45.036151+00:00"},{"alias_kind":"pith_short_16","alias_value":"SOEMGFDRWFGEG7IX","created_at":"2026-07-05T03:43:45.036151+00:00"},{"alias_kind":"pith_short_8","alias_value":"SOEMGFDR","created_at":"2026-07-05T03:43:45.036151+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.16445","citing_title":"DAS-MP: Enabling High-Quality Macro Placement with Enhanced Dataflow Awareness","ref_index":12,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SOEMGFDRWFGEG7IX3GSC2UBK3F","json":"https://pith.science/pith/SOEMGFDRWFGEG7IX3GSC2UBK3F.json","graph_json":"https://pith.science/api/pith-number/SOEMGFDRWFGEG7IX3GSC2UBK3F/graph.json","events_json":"https://pith.science/api/pith-number/SOEMGFDRWFGEG7IX3GSC2UBK3F/events.json","paper":"https://pith.science/paper/SOEMGFDR"},"agent_actions":{"view_html":"https://pith.science/pith/SOEMGFDRWFGEG7IX3GSC2UBK3F","download_json":"https://pith.science/pith/SOEMGFDRWFGEG7IX3GSC2UBK3F.json","view_paper":"https://pith.science/paper/SOEMGFDR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2111.00234&json=true","fetch_graph":"https://pith.science/api/pith-number/SOEMGFDRWFGEG7IX3GSC2UBK3F/graph.json","fetch_events":"https://pith.science/api/pith-number/SOEMGFDRWFGEG7IX3GSC2UBK3F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SOEMGFDRWFGEG7IX3GSC2UBK3F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SOEMGFDRWFGEG7IX3GSC2UBK3F/action/storage_attestation","attest_author":"https://pith.science/pith/SOEMGFDRWFGEG7IX3GSC2UBK3F/action/author_attestation","sign_citation":"https://pith.science/pith/SOEMGFDRWFGEG7IX3GSC2UBK3F/action/citation_signature","submit_replication":"https://pith.science/pith/SOEMGFDRWFGEG7IX3GSC2UBK3F/action/replication_record"}},"created_at":"2026-07-05T03:43:45.036151+00:00","updated_at":"2026-07-05T03:43:45.036151+00:00"}