{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:5JMNL34IVQB4R6HNGK4TP4IWRS","short_pith_number":"pith:5JMNL34I","schema_version":"1.0","canonical_sha256":"ea58d5ef88ac03c8f8ed32b937f1168cae9258e2767c904de20f0813f840620b","source":{"kind":"arxiv","id":"2607.10703","version":1},"attestation_state":"computed","paper":{"title":"Rectilinear Matching to the Integer Grid in Nearly-Linear Time","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Yu Gao","submitted_at":"2026-07-12T10:54:54Z","abstract_excerpt":"Rectilinear matching to the integer grid asks to assign each of $n$ points in $\\mathbb R^2$ to a distinct point of $\\mathbb Z^2$, minimizing total $\\ell_1$ movement. The main difficulty is that the target set is infinite: one must first identify a finite set of relevant grid points without losing optimality.\n  We prove a geometric compression theorem for this infinite-target problem. In $O(n\\log^2 n)$ time, we construct a set $\\mathcal{C}$ of asymptotically optimal size $O(n)$ such that, simultaneously for every $p\\in[1,\\infty]$, some optimal $\\ell_p$ assignment uses only points of $\\mathcal{C"},"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":"2607.10703","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.CG","submitted_at":"2026-07-12T10:54:54Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"974e49cbcdfade22e562eafbb5aa9916c21a697688b04e472e7db697345d3fc0","abstract_canon_sha256":"4217fe711b57d395d8118b166da1259194343678beba0ffa61579c63508adfce"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-14T01:21:35.415494Z","signature_b64":"RAmrwoO9VZa2UZpi2+9h533MmobixBFFeBDrFGpvjfky7c34DT13pBKj3cEysDdoVGCOs9OAH+C/wTuZyFOYBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ea58d5ef88ac03c8f8ed32b937f1168cae9258e2767c904de20f0813f840620b","last_reissued_at":"2026-07-14T01:21:35.414654Z","signature_status":"signed_v1","first_computed_at":"2026-07-14T01:21:35.414654Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Rectilinear Matching to the Integer Grid in Nearly-Linear Time","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Yu Gao","submitted_at":"2026-07-12T10:54:54Z","abstract_excerpt":"Rectilinear matching to the integer grid asks to assign each of $n$ points in $\\mathbb R^2$ to a distinct point of $\\mathbb Z^2$, minimizing total $\\ell_1$ movement. The main difficulty is that the target set is infinite: one must first identify a finite set of relevant grid points without losing optimality.\n  We prove a geometric compression theorem for this infinite-target problem. In $O(n\\log^2 n)$ time, we construct a set $\\mathcal{C}$ of asymptotically optimal size $O(n)$ such that, simultaneously for every $p\\in[1,\\infty]$, some optimal $\\ell_p$ assignment uses only points of $\\mathcal{C"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.10703","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/2607.10703/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":"2607.10703","created_at":"2026-07-14T01:21:35.415071+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.10703v1","created_at":"2026-07-14T01:21:35.415071+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.10703","created_at":"2026-07-14T01:21:35.415071+00:00"},{"alias_kind":"pith_short_12","alias_value":"5JMNL34IVQB4","created_at":"2026-07-14T01:21:35.415071+00:00"},{"alias_kind":"pith_short_16","alias_value":"5JMNL34IVQB4R6HN","created_at":"2026-07-14T01:21:35.415071+00:00"},{"alias_kind":"pith_short_8","alias_value":"5JMNL34I","created_at":"2026-07-14T01:21:35.415071+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/5JMNL34IVQB4R6HNGK4TP4IWRS","json":"https://pith.science/pith/5JMNL34IVQB4R6HNGK4TP4IWRS.json","graph_json":"https://pith.science/api/pith-number/5JMNL34IVQB4R6HNGK4TP4IWRS/graph.json","events_json":"https://pith.science/api/pith-number/5JMNL34IVQB4R6HNGK4TP4IWRS/events.json","paper":"https://pith.science/paper/5JMNL34I"},"agent_actions":{"view_html":"https://pith.science/pith/5JMNL34IVQB4R6HNGK4TP4IWRS","download_json":"https://pith.science/pith/5JMNL34IVQB4R6HNGK4TP4IWRS.json","view_paper":"https://pith.science/paper/5JMNL34I","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.10703&json=true","fetch_graph":"https://pith.science/api/pith-number/5JMNL34IVQB4R6HNGK4TP4IWRS/graph.json","fetch_events":"https://pith.science/api/pith-number/5JMNL34IVQB4R6HNGK4TP4IWRS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5JMNL34IVQB4R6HNGK4TP4IWRS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5JMNL34IVQB4R6HNGK4TP4IWRS/action/storage_attestation","attest_author":"https://pith.science/pith/5JMNL34IVQB4R6HNGK4TP4IWRS/action/author_attestation","sign_citation":"https://pith.science/pith/5JMNL34IVQB4R6HNGK4TP4IWRS/action/citation_signature","submit_replication":"https://pith.science/pith/5JMNL34IVQB4R6HNGK4TP4IWRS/action/replication_record"}},"created_at":"2026-07-14T01:21:35.415071+00:00","updated_at":"2026-07-14T01:21:35.415071+00:00"}