{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:HVTM2A56BPZ3YBNKQASCUIVE2A","short_pith_number":"pith:HVTM2A56","schema_version":"1.0","canonical_sha256":"3d66cd03be0bf3bc05aa80242a22a4d006ec2e946b312fd91e003d92dffdacbe","source":{"kind":"arxiv","id":"2207.08398","version":1},"attestation_state":"computed","paper":{"title":"Bayesian Optimization for Macro Placement","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AR"],"primary_cat":"cs.LG","authors_text":"Changyong Oh, Dana Kianfar, Max Welling, Mysore Sriram, Payal Agarwal, Rehan Ahmed, Rishubh Khurana, Roberto Bondesan, Romain Lepert","submitted_at":"2022-07-18T06:17:06Z","abstract_excerpt":"Macro placement is the problem of placing memory blocks on a chip canvas. It can be formulated as a combinatorial optimization problem over sequence pairs, a representation which describes the relative positions of macros. Solving this problem is particularly challenging since the objective function is expensive to evaluate. In this paper, we develop a novel approach to macro placement using Bayesian optimization (BO) over sequence pairs. BO is a machine learning technique that uses a probabilistic surrogate model and an acquisition function that balances exploration and exploitation to effici"},"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":"2207.08398","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-07-18T06:17:06Z","cross_cats_sorted":["cs.AR"],"title_canon_sha256":"02ce5e95fd607c97158d2e5bdb6c52b2cdc7ed8efe7baaabab746d6bb62bfa81","abstract_canon_sha256":"b3e060d6a7288342df415023179180cb7f14d8275d562e225e6ed4790f1e22fc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:41:04.240079Z","signature_b64":"Cc0nJrUZG29uuGjIDaiIsH4Rq24eIH6g6KKSjsO9c4jzYYMPGTOfWXeU0PlGE5kMmx+hHxLzllsKZBs9SX7qBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3d66cd03be0bf3bc05aa80242a22a4d006ec2e946b312fd91e003d92dffdacbe","last_reissued_at":"2026-07-05T04:41:04.239619Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:41:04.239619Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bayesian Optimization for Macro Placement","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AR"],"primary_cat":"cs.LG","authors_text":"Changyong Oh, Dana Kianfar, Max Welling, Mysore Sriram, Payal Agarwal, Rehan Ahmed, Rishubh Khurana, Roberto Bondesan, Romain Lepert","submitted_at":"2022-07-18T06:17:06Z","abstract_excerpt":"Macro placement is the problem of placing memory blocks on a chip canvas. It can be formulated as a combinatorial optimization problem over sequence pairs, a representation which describes the relative positions of macros. Solving this problem is particularly challenging since the objective function is expensive to evaluate. In this paper, we develop a novel approach to macro placement using Bayesian optimization (BO) over sequence pairs. BO is a machine learning technique that uses a probabilistic surrogate model and an acquisition function that balances exploration and exploitation to effici"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2207.08398","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/2207.08398/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":"2207.08398","created_at":"2026-07-05T04:41:04.239678+00:00"},{"alias_kind":"arxiv_version","alias_value":"2207.08398v1","created_at":"2026-07-05T04:41:04.239678+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2207.08398","created_at":"2026-07-05T04:41:04.239678+00:00"},{"alias_kind":"pith_short_12","alias_value":"HVTM2A56BPZ3","created_at":"2026-07-05T04:41:04.239678+00:00"},{"alias_kind":"pith_short_16","alias_value":"HVTM2A56BPZ3YBNK","created_at":"2026-07-05T04:41:04.239678+00:00"},{"alias_kind":"pith_short_8","alias_value":"HVTM2A56","created_at":"2026-07-05T04:41:04.239678+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":15,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HVTM2A56BPZ3YBNKQASCUIVE2A","json":"https://pith.science/pith/HVTM2A56BPZ3YBNKQASCUIVE2A.json","graph_json":"https://pith.science/api/pith-number/HVTM2A56BPZ3YBNKQASCUIVE2A/graph.json","events_json":"https://pith.science/api/pith-number/HVTM2A56BPZ3YBNKQASCUIVE2A/events.json","paper":"https://pith.science/paper/HVTM2A56"},"agent_actions":{"view_html":"https://pith.science/pith/HVTM2A56BPZ3YBNKQASCUIVE2A","download_json":"https://pith.science/pith/HVTM2A56BPZ3YBNKQASCUIVE2A.json","view_paper":"https://pith.science/paper/HVTM2A56","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2207.08398&json=true","fetch_graph":"https://pith.science/api/pith-number/HVTM2A56BPZ3YBNKQASCUIVE2A/graph.json","fetch_events":"https://pith.science/api/pith-number/HVTM2A56BPZ3YBNKQASCUIVE2A/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HVTM2A56BPZ3YBNKQASCUIVE2A/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HVTM2A56BPZ3YBNKQASCUIVE2A/action/storage_attestation","attest_author":"https://pith.science/pith/HVTM2A56BPZ3YBNKQASCUIVE2A/action/author_attestation","sign_citation":"https://pith.science/pith/HVTM2A56BPZ3YBNKQASCUIVE2A/action/citation_signature","submit_replication":"https://pith.science/pith/HVTM2A56BPZ3YBNKQASCUIVE2A/action/replication_record"}},"created_at":"2026-07-05T04:41:04.239678+00:00","updated_at":"2026-07-05T04:41:04.239678+00:00"}