{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:AB6U7SO2GZGIW4QXNK4UHT3CDA","short_pith_number":"pith:AB6U7SO2","schema_version":"1.0","canonical_sha256":"007d4fc9da364c8b72176ab943cf621821bb196de08a85d2500b2ec65134211f","source":{"kind":"arxiv","id":"2407.12282","version":3},"attestation_state":"computed","paper":{"title":"Chip Placement with Diffusion Models","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.AR"],"primary_cat":"cs.LG","authors_text":"Chun Deng, John Wawrzynek, Leena Elzeiny, Minh Nguyen, Pieter Abbeel, Vint Lee","submitted_at":"2024-07-17T03:02:24Z","abstract_excerpt":"Macro placement is a vital step in digital circuit design that defines the physical location of large collections of components, known as macros, on a 2D chip. Because key performance metrics of the chip are determined by the placement, optimizing it is crucial. Existing learning-based methods typically fall short because of their reliance on reinforcement learning (RL), which is slow and struggles to generalize, requiring online training on each new circuit. Instead, we train a diffusion model capable of placing new circuits zero-shot, using guided sampling in lieu of RL to optimize placement"},"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":"2407.12282","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-07-17T03:02:24Z","cross_cats_sorted":["cs.AI","cs.AR"],"title_canon_sha256":"7f89eb60a90c0469cdfb786cd8110a26809837a70ebaba3551b89f3f6d504afc","abstract_canon_sha256":"dd0c9fb2e1fbd29ac3f44c67a8c3eb4978e250b1961a6a006420121d630f8806"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:18:39.326748Z","signature_b64":"3cmWCHeA9sE0EjHhdq1le+UQ4GqF+c7EtlN1dXh/BxWz5LDwMOYofOATAt/hb3Zb0KMfJVlZsk46QUWC8k/FAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"007d4fc9da364c8b72176ab943cf621821bb196de08a85d2500b2ec65134211f","last_reissued_at":"2026-07-05T11:18:39.326230Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:18:39.326230Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Chip Placement with Diffusion Models","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.AR"],"primary_cat":"cs.LG","authors_text":"Chun Deng, John Wawrzynek, Leena Elzeiny, Minh Nguyen, Pieter Abbeel, Vint Lee","submitted_at":"2024-07-17T03:02:24Z","abstract_excerpt":"Macro placement is a vital step in digital circuit design that defines the physical location of large collections of components, known as macros, on a 2D chip. Because key performance metrics of the chip are determined by the placement, optimizing it is crucial. Existing learning-based methods typically fall short because of their reliance on reinforcement learning (RL), which is slow and struggles to generalize, requiring online training on each new circuit. Instead, we train a diffusion model capable of placing new circuits zero-shot, using guided sampling in lieu of RL to optimize placement"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.12282","kind":"arxiv","version":3},"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/2407.12282/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":"2407.12282","created_at":"2026-07-05T11:18:39.326289+00:00"},{"alias_kind":"arxiv_version","alias_value":"2407.12282v3","created_at":"2026-07-05T11:18:39.326289+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.12282","created_at":"2026-07-05T11:18:39.326289+00:00"},{"alias_kind":"pith_short_12","alias_value":"AB6U7SO2GZGI","created_at":"2026-07-05T11:18:39.326289+00:00"},{"alias_kind":"pith_short_16","alias_value":"AB6U7SO2GZGIW4QX","created_at":"2026-07-05T11:18:39.326289+00:00"},{"alias_kind":"pith_short_8","alias_value":"AB6U7SO2","created_at":"2026-07-05T11:18:39.326289+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2510.15897","citing_title":"DiffPlace: A Conditional Diffusion Framework for Simultaneous VLSI Placement Beyond Sequential Paradigms","ref_index":5,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AB6U7SO2GZGIW4QXNK4UHT3CDA","json":"https://pith.science/pith/AB6U7SO2GZGIW4QXNK4UHT3CDA.json","graph_json":"https://pith.science/api/pith-number/AB6U7SO2GZGIW4QXNK4UHT3CDA/graph.json","events_json":"https://pith.science/api/pith-number/AB6U7SO2GZGIW4QXNK4UHT3CDA/events.json","paper":"https://pith.science/paper/AB6U7SO2"},"agent_actions":{"view_html":"https://pith.science/pith/AB6U7SO2GZGIW4QXNK4UHT3CDA","download_json":"https://pith.science/pith/AB6U7SO2GZGIW4QXNK4UHT3CDA.json","view_paper":"https://pith.science/paper/AB6U7SO2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2407.12282&json=true","fetch_graph":"https://pith.science/api/pith-number/AB6U7SO2GZGIW4QXNK4UHT3CDA/graph.json","fetch_events":"https://pith.science/api/pith-number/AB6U7SO2GZGIW4QXNK4UHT3CDA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AB6U7SO2GZGIW4QXNK4UHT3CDA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AB6U7SO2GZGIW4QXNK4UHT3CDA/action/storage_attestation","attest_author":"https://pith.science/pith/AB6U7SO2GZGIW4QXNK4UHT3CDA/action/author_attestation","sign_citation":"https://pith.science/pith/AB6U7SO2GZGIW4QXNK4UHT3CDA/action/citation_signature","submit_replication":"https://pith.science/pith/AB6U7SO2GZGIW4QXNK4UHT3CDA/action/replication_record"}},"created_at":"2026-07-05T11:18:39.326289+00:00","updated_at":"2026-07-05T11:18:39.326289+00:00"}