{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:LDPVBIOFHGBK5P4J7DHOFPVXDD","short_pith_number":"pith:LDPVBIOF","schema_version":"1.0","canonical_sha256":"58df50a1c53982aebf89f8cee2beb718f929bc916bdc1b94281158c94e4ce3d5","source":{"kind":"arxiv","id":"2502.17632","version":1},"attestation_state":"computed","paper":{"title":"The Power of Graph Signal Processing for Chip Placement Acceleration","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Fan Yang, Hai Zhou, Jia Wang, Li Shang, Xuan Zeng, Yiting Liu","submitted_at":"2025-02-24T20:28:26Z","abstract_excerpt":"Placement is a critical task with high computation complexity in VLSI physical design. Modern analytical placers formulate the placement objective as a nonlinear optimization task, which suffers a long iteration time. To accelerate and enhance the placement process, recent studies have turned to deep learning-based approaches, particularly leveraging graph convolution networks (GCNs). However, learning-based placers require time- and data-consuming model training due to the complexity of circuit placement that involves large-scale cells and design-specific graph statistics.\n  This paper propos"},"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":"2502.17632","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-02-24T20:28:26Z","cross_cats_sorted":[],"title_canon_sha256":"208aca824ecccc7c245c2828c2bcda6dc3ebe2d3699b83b422e1ad899103b4bf","abstract_canon_sha256":"d52db31a0d1306ae1928f5605d1e0b64619642eb9e252091d3aca82197cc6857"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:19:41.513475Z","signature_b64":"jCyDUZSvdPajOYRNfmWdvzfB7uzHe23tuBokXjkAgNp/soZjo5ZdBD8uM0iigxL0FZQUugZVMpv8P7viwsFbAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"58df50a1c53982aebf89f8cee2beb718f929bc916bdc1b94281158c94e4ce3d5","last_reissued_at":"2026-07-05T10:19:41.512916Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:19:41.512916Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Power of Graph Signal Processing for Chip Placement Acceleration","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Fan Yang, Hai Zhou, Jia Wang, Li Shang, Xuan Zeng, Yiting Liu","submitted_at":"2025-02-24T20:28:26Z","abstract_excerpt":"Placement is a critical task with high computation complexity in VLSI physical design. Modern analytical placers formulate the placement objective as a nonlinear optimization task, which suffers a long iteration time. To accelerate and enhance the placement process, recent studies have turned to deep learning-based approaches, particularly leveraging graph convolution networks (GCNs). However, learning-based placers require time- and data-consuming model training due to the complexity of circuit placement that involves large-scale cells and design-specific graph statistics.\n  This paper propos"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.17632","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/2502.17632/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":"2502.17632","created_at":"2026-07-05T10:19:41.512977+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.17632v1","created_at":"2026-07-05T10:19:41.512977+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.17632","created_at":"2026-07-05T10:19:41.512977+00:00"},{"alias_kind":"pith_short_12","alias_value":"LDPVBIOFHGBK","created_at":"2026-07-05T10:19:41.512977+00:00"},{"alias_kind":"pith_short_16","alias_value":"LDPVBIOFHGBK5P4J","created_at":"2026-07-05T10:19:41.512977+00:00"},{"alias_kind":"pith_short_8","alias_value":"LDPVBIOF","created_at":"2026-07-05T10:19:41.512977+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LDPVBIOFHGBK5P4J7DHOFPVXDD","json":"https://pith.science/pith/LDPVBIOFHGBK5P4J7DHOFPVXDD.json","graph_json":"https://pith.science/api/pith-number/LDPVBIOFHGBK5P4J7DHOFPVXDD/graph.json","events_json":"https://pith.science/api/pith-number/LDPVBIOFHGBK5P4J7DHOFPVXDD/events.json","paper":"https://pith.science/paper/LDPVBIOF"},"agent_actions":{"view_html":"https://pith.science/pith/LDPVBIOFHGBK5P4J7DHOFPVXDD","download_json":"https://pith.science/pith/LDPVBIOFHGBK5P4J7DHOFPVXDD.json","view_paper":"https://pith.science/paper/LDPVBIOF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.17632&json=true","fetch_graph":"https://pith.science/api/pith-number/LDPVBIOFHGBK5P4J7DHOFPVXDD/graph.json","fetch_events":"https://pith.science/api/pith-number/LDPVBIOFHGBK5P4J7DHOFPVXDD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LDPVBIOFHGBK5P4J7DHOFPVXDD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LDPVBIOFHGBK5P4J7DHOFPVXDD/action/storage_attestation","attest_author":"https://pith.science/pith/LDPVBIOFHGBK5P4J7DHOFPVXDD/action/author_attestation","sign_citation":"https://pith.science/pith/LDPVBIOFHGBK5P4J7DHOFPVXDD/action/citation_signature","submit_replication":"https://pith.science/pith/LDPVBIOFHGBK5P4J7DHOFPVXDD/action/replication_record"}},"created_at":"2026-07-05T10:19:41.512977+00:00","updated_at":"2026-07-05T10:19:41.512977+00:00"}