{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:M4DMTYJ5NPYI6Z3AVQXY4YOXZI","short_pith_number":"pith:M4DMTYJ5","schema_version":"1.0","canonical_sha256":"6706c9e13d6bf08f6760ac2f8e61d7ca1010b82b73767ba186c9bb805185c522","source":{"kind":"arxiv","id":"1307.6627","version":1},"attestation_state":"computed","paper":{"title":"Minimum d-dimensional arrangement with fixed points","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.DS","authors_text":"Anastasios Sidiropoulos, Anupam Gupta","submitted_at":"2013-07-25T04:08:51Z","abstract_excerpt":"In the Minimum $d$-Dimensional Arrangement Problem (d-dimAP) we are given a graph with edge weights, and the goal is to find a 1-1 map of the vertices into $\\mathbb{Z}^d$ (for some fixed dimension $d\\geq 1$) minimizing the total weighted stretch of the edges. This problem arises in VLSI placement and chip design.\n  Motivated by these applications, we consider a generalization of d-dimAP, where the positions of some of the vertices (pins) is fixed and specified as part of the input. We are asked to extend this partial map to a map of all the vertices, again minimizing the weighted stretch of ed"},"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":"1307.6627","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-07-25T04:08:51Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"908baeba6cb998cd0e6d5a5b880b7ce3a41289957293b21f6821ff757c145c0e","abstract_canon_sha256":"f792fe4ce504bc9000e22052bab7c62acc0981a1ed1ef4bd00edec14fe6c03b8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:17:35.769853Z","signature_b64":"AY+aPXufF4+td1CBhya3h8oum+JgW4PTIjwBxkR9N75eWwwiGMYRJRXP6SNhhvOhfR0HJwB6g8uNbz+wbm97CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6706c9e13d6bf08f6760ac2f8e61d7ca1010b82b73767ba186c9bb805185c522","last_reissued_at":"2026-05-18T03:17:35.769164Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:17:35.769164Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Minimum d-dimensional arrangement with fixed points","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.DS","authors_text":"Anastasios Sidiropoulos, Anupam Gupta","submitted_at":"2013-07-25T04:08:51Z","abstract_excerpt":"In the Minimum $d$-Dimensional Arrangement Problem (d-dimAP) we are given a graph with edge weights, and the goal is to find a 1-1 map of the vertices into $\\mathbb{Z}^d$ (for some fixed dimension $d\\geq 1$) minimizing the total weighted stretch of the edges. This problem arises in VLSI placement and chip design.\n  Motivated by these applications, we consider a generalization of d-dimAP, where the positions of some of the vertices (pins) is fixed and specified as part of the input. We are asked to extend this partial map to a map of all the vertices, again minimizing the weighted stretch of ed"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.6627","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":""},"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":"1307.6627","created_at":"2026-05-18T03:17:35.769278+00:00"},{"alias_kind":"arxiv_version","alias_value":"1307.6627v1","created_at":"2026-05-18T03:17:35.769278+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.6627","created_at":"2026-05-18T03:17:35.769278+00:00"},{"alias_kind":"pith_short_12","alias_value":"M4DMTYJ5NPYI","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_16","alias_value":"M4DMTYJ5NPYI6Z3A","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_8","alias_value":"M4DMTYJ5","created_at":"2026-05-18T12:27:51.066281+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/M4DMTYJ5NPYI6Z3AVQXY4YOXZI","json":"https://pith.science/pith/M4DMTYJ5NPYI6Z3AVQXY4YOXZI.json","graph_json":"https://pith.science/api/pith-number/M4DMTYJ5NPYI6Z3AVQXY4YOXZI/graph.json","events_json":"https://pith.science/api/pith-number/M4DMTYJ5NPYI6Z3AVQXY4YOXZI/events.json","paper":"https://pith.science/paper/M4DMTYJ5"},"agent_actions":{"view_html":"https://pith.science/pith/M4DMTYJ5NPYI6Z3AVQXY4YOXZI","download_json":"https://pith.science/pith/M4DMTYJ5NPYI6Z3AVQXY4YOXZI.json","view_paper":"https://pith.science/paper/M4DMTYJ5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1307.6627&json=true","fetch_graph":"https://pith.science/api/pith-number/M4DMTYJ5NPYI6Z3AVQXY4YOXZI/graph.json","fetch_events":"https://pith.science/api/pith-number/M4DMTYJ5NPYI6Z3AVQXY4YOXZI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M4DMTYJ5NPYI6Z3AVQXY4YOXZI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M4DMTYJ5NPYI6Z3AVQXY4YOXZI/action/storage_attestation","attest_author":"https://pith.science/pith/M4DMTYJ5NPYI6Z3AVQXY4YOXZI/action/author_attestation","sign_citation":"https://pith.science/pith/M4DMTYJ5NPYI6Z3AVQXY4YOXZI/action/citation_signature","submit_replication":"https://pith.science/pith/M4DMTYJ5NPYI6Z3AVQXY4YOXZI/action/replication_record"}},"created_at":"2026-05-18T03:17:35.769278+00:00","updated_at":"2026-05-18T03:17:35.769278+00:00"}