{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:S6JSYNHYSUPPROC77ED5ODSHQL","short_pith_number":"pith:S6JSYNHY","schema_version":"1.0","canonical_sha256":"97932c34f8951ef8b85ff907d70e4782e65ea0d3d4b17ca8dedb7b11ad52bcbb","source":{"kind":"arxiv","id":"2306.16844","version":3},"attestation_state":"computed","paper":{"title":"Macro Placement by Wire-Mask-Guided Black-Box Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Chao Qian, Ke Xue, Lei Song, Yunqi Shi","submitted_at":"2023-06-29T10:34:23Z","abstract_excerpt":"The development of very large-scale integration (VLSI) technology has posed new challenges for electronic design automation (EDA) techniques in chip floorplanning. During this process, macro placement is an important subproblem, which tries to determine the positions of all macros with the aim of minimizing half-perimeter wirelength (HPWL) and avoiding overlapping. Previous methods include packing-based, analytical and reinforcement learning methods. In this paper, we propose a new black-box optimization (BBO) framework (called WireMask-BBO) for macro placement, by using a wire-mask-guided gre"},"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":"2306.16844","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-06-29T10:34:23Z","cross_cats_sorted":[],"title_canon_sha256":"59f7fec4ce1745a92c0d100efad1f2d6f568f17c3beadce007f299a874116ed2","abstract_canon_sha256":"b0836397b3a014e196d8c740e147cf26d9011420568a0421cb05f4709965fe42"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:05:45.716057Z","signature_b64":"y0jvBk3DQHiw5U20lY+QOD2tldJW/o2jcItMSGRAUgo1mwPnBJqWgrLuCHda0I+QDzAyauLnz3fWGqjjlG4sBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"97932c34f8951ef8b85ff907d70e4782e65ea0d3d4b17ca8dedb7b11ad52bcbb","last_reissued_at":"2026-07-05T07:05:45.715600Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:05:45.715600Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Macro Placement by Wire-Mask-Guided Black-Box Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Chao Qian, Ke Xue, Lei Song, Yunqi Shi","submitted_at":"2023-06-29T10:34:23Z","abstract_excerpt":"The development of very large-scale integration (VLSI) technology has posed new challenges for electronic design automation (EDA) techniques in chip floorplanning. During this process, macro placement is an important subproblem, which tries to determine the positions of all macros with the aim of minimizing half-perimeter wirelength (HPWL) and avoiding overlapping. Previous methods include packing-based, analytical and reinforcement learning methods. In this paper, we propose a new black-box optimization (BBO) framework (called WireMask-BBO) for macro placement, by using a wire-mask-guided gre"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.16844","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/2306.16844/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":"2306.16844","created_at":"2026-07-05T07:05:45.715658+00:00"},{"alias_kind":"arxiv_version","alias_value":"2306.16844v3","created_at":"2026-07-05T07:05:45.715658+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.16844","created_at":"2026-07-05T07:05:45.715658+00:00"},{"alias_kind":"pith_short_12","alias_value":"S6JSYNHYSUPP","created_at":"2026-07-05T07:05:45.715658+00:00"},{"alias_kind":"pith_short_16","alias_value":"S6JSYNHYSUPPROC7","created_at":"2026-07-05T07:05:45.715658+00:00"},{"alias_kind":"pith_short_8","alias_value":"S6JSYNHY","created_at":"2026-07-05T07:05:45.715658+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":23,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/S6JSYNHYSUPPROC77ED5ODSHQL","json":"https://pith.science/pith/S6JSYNHYSUPPROC77ED5ODSHQL.json","graph_json":"https://pith.science/api/pith-number/S6JSYNHYSUPPROC77ED5ODSHQL/graph.json","events_json":"https://pith.science/api/pith-number/S6JSYNHYSUPPROC77ED5ODSHQL/events.json","paper":"https://pith.science/paper/S6JSYNHY"},"agent_actions":{"view_html":"https://pith.science/pith/S6JSYNHYSUPPROC77ED5ODSHQL","download_json":"https://pith.science/pith/S6JSYNHYSUPPROC77ED5ODSHQL.json","view_paper":"https://pith.science/paper/S6JSYNHY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2306.16844&json=true","fetch_graph":"https://pith.science/api/pith-number/S6JSYNHYSUPPROC77ED5ODSHQL/graph.json","fetch_events":"https://pith.science/api/pith-number/S6JSYNHYSUPPROC77ED5ODSHQL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/S6JSYNHYSUPPROC77ED5ODSHQL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/S6JSYNHYSUPPROC77ED5ODSHQL/action/storage_attestation","attest_author":"https://pith.science/pith/S6JSYNHYSUPPROC77ED5ODSHQL/action/author_attestation","sign_citation":"https://pith.science/pith/S6JSYNHYSUPPROC77ED5ODSHQL/action/citation_signature","submit_replication":"https://pith.science/pith/S6JSYNHYSUPPROC77ED5ODSHQL/action/replication_record"}},"created_at":"2026-07-05T07:05:45.715658+00:00","updated_at":"2026-07-05T07:05:45.715658+00:00"}