{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:5JMNL34IVQB4R6HNGK4TP4IWRS","short_pith_number":"pith:5JMNL34I","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"},"canonical_sha256":"ea58d5ef88ac03c8f8ed32b937f1168cae9258e2767c904de20f0813f840620b","source":{"kind":"arxiv","id":"2607.10703","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.10703","created_at":"2026-07-14T01:21:35Z"},{"alias_kind":"arxiv_version","alias_value":"2607.10703v1","created_at":"2026-07-14T01:21:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.10703","created_at":"2026-07-14T01:21:35Z"},{"alias_kind":"pith_short_12","alias_value":"5JMNL34IVQB4","created_at":"2026-07-14T01:21:35Z"},{"alias_kind":"pith_short_16","alias_value":"5JMNL34IVQB4R6HN","created_at":"2026-07-14T01:21:35Z"},{"alias_kind":"pith_short_8","alias_value":"5JMNL34I","created_at":"2026-07-14T01:21:35Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:5JMNL34IVQB4R6HNGK4TP4IWRS","target":"record","payload":{"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"},"canonical_sha256":"ea58d5ef88ac03c8f8ed32b937f1168cae9258e2767c904de20f0813f840620b","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"},"source_kind":"arxiv","source_id":"2607.10703","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-14T01:21:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sojw8omx+hGOYJh/CDz9u4RsY77avlNuk6vm0PNIfZa7+eMpQsWF579Plw7AuwUDw+IX/GluolowvE5VB9s2AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T15:08:47.458071Z"},"content_sha256":"249055dc4c3cbe186440938e02b47a6e4e39e555f0f8ec08c366e06436b6c9a8","schema_version":"1.0","event_id":"sha256:249055dc4c3cbe186440938e02b47a6e4e39e555f0f8ec08c366e06436b6c9a8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:5JMNL34IVQB4R6HNGK4TP4IWRS","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-14T01:21:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BkLsMo9QJyova9Up3w2T9vwh+H6El+vSUvCfd3TrHj769I3V1OUSbY4w69SvMcW1Owo+ooLv2Cit6bt3AFpxDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T15:08:47.460755Z"},"content_sha256":"65c6ac2121f3bca5d7979cdd5d9f134ed8c68370acf49a63c423d6d28cc98f65","schema_version":"1.0","event_id":"sha256:65c6ac2121f3bca5d7979cdd5d9f134ed8c68370acf49a63c423d6d28cc98f65"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:5JMNL34IVQB4R6HNGK4TP4IWRS","target":"integrity","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1007/978-90-481-9591-6) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"doi:10.1007/978-90-481- 9591-6. [LDW16] Andr´ e L¨ offler, Thomas C. van Dijk, and Alexander Wolff. Snapping graph drawings to the grid optimally. CoRR, abs/1608.08844,","arxiv_id":"2607.10703","detector":"doi_compliance","evidence":{"ref_index":9,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"10.1007/978-90-481-","reconstructed_doi":"10.1007/978-90-481-9591-6"},"severity":"advisory","ref_index":9,"audited_at":"2026-07-29T13:12:19.256816Z","event_type":"pith.integrity.v1","detected_doi":"10.1007/978-90-481-9591-6","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"551323bbf0d9bfeb80d96820d7496c7e9819f101ba4a97768312e35115d17efe","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.1.0","detected_arxiv_id":null,"integrity_event_id":13594,"payload_sha256":"b7be2abe683cdfa17c93e47cbc1fff149bb186d4820eaa6b6a82821686ca02ca","signature_b64":null,"signing_key_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-29T13:16:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1bzIWjK0NigD58RcmuztCxqHAcHloDCF1qUuEH5BGBOcObMpkPtgZdmDG2InRBQYscx95Ztm8Rkohs47Hzj5AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T15:08:47.539250Z"},"content_sha256":"5171ddd530c6551e01bbb02ddf20d5cf14531f2a9d1f0720bee41688d4281399","schema_version":"1.0","event_id":"sha256:5171ddd530c6551e01bbb02ddf20d5cf14531f2a9d1f0720bee41688d4281399"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:5JMNL34IVQB4R6HNGK4TP4IWRS","target":"integrity","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1016/0196-6774(91) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"doi:10.1016/0196- 6774(91)90023-R. 27 [CKL+22] Li Chen, Rasmus Kyng, Yang P. Liu, Richard Peng, Maximilian Probst Gutenberg, and Sushant Sachdeva. Maximum flow and minimum-cost flow in almost-linear time. In Proceedings of the 63rd Annual I","arxiv_id":"2607.10703","detector":"doi_compliance","evidence":{"ref_index":3,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"doi:10.1016/0196- 6774(91)90023-R. 27 [CKL+22] Li Chen, Rasmus Kyng, Yang P. Liu, Richard Peng, Maximilian Probst Gutenberg, and Sushant Sachdeva. Maximum flow and minimum-cost flow in almost-linear time. In Proceedings of the 63rd Annual I","reconstructed_doi":"10.1016/0196-6774(91"},"severity":"advisory","ref_index":3,"audited_at":"2026-07-14T09:58:32.865657Z","event_type":"pith.integrity.v1","detected_doi":"10.1016/0196-6774(91","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"3ac8529c1eb82d0db6fa349887c72f84ad01fa23f94bf94fcd4be7550960164f","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null,"integrity_event_id":13214,"payload_sha256":"d9af896ad0a71853ce588928f5ff3ef8a2d874f6d266b15dbe7bfe581e3264b9","signature_b64":"9R4HD5EnWZ9hV6NmTv0siGu4TDt5yBugjKjUlkb0yQ4hOwOKUjb/7buQcY/anjv971tUMhEx5nz0F6XotbQ8Dg==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-14T10:00:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rcIf9R9JwXdhSXMWm9KayKZ2LVE8+iLAF6xwmX4RhA3ciK4bkZmyVdMSzUqz3aJfyMSTa2asjLAmits7XhfWAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T15:08:47.539982Z"},"content_sha256":"b34fae0a257ab63222cfbf6e59b90ba7e7f2498de89a168921688fa8db47c204","schema_version":"1.0","event_id":"sha256:b34fae0a257ab63222cfbf6e59b90ba7e7f2498de89a168921688fa8db47c204"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5JMNL34IVQB4R6HNGK4TP4IWRS/bundle.json","state_url":"https://pith.science/pith/5JMNL34IVQB4R6HNGK4TP4IWRS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5JMNL34IVQB4R6HNGK4TP4IWRS/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-04T15:08:47Z","links":{"resolver":"https://pith.science/pith/5JMNL34IVQB4R6HNGK4TP4IWRS","bundle":"https://pith.science/pith/5JMNL34IVQB4R6HNGK4TP4IWRS/bundle.json","state":"https://pith.science/pith/5JMNL34IVQB4R6HNGK4TP4IWRS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5JMNL34IVQB4R6HNGK4TP4IWRS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:5JMNL34IVQB4R6HNGK4TP4IWRS","merge_version":"pith-open-graph-merge-v1","event_count":4,"valid_event_count":4,"invalid_event_count":0,"equivocation_count":1,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"4217fe711b57d395d8118b166da1259194343678beba0ffa61579c63508adfce","cross_cats_sorted":["cs.DS"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.CG","submitted_at":"2026-07-12T10:54:54Z","title_canon_sha256":"974e49cbcdfade22e562eafbb5aa9916c21a697688b04e472e7db697345d3fc0"},"schema_version":"1.0","source":{"id":"2607.10703","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.10703","created_at":"2026-07-14T01:21:35Z"},{"alias_kind":"arxiv_version","alias_value":"2607.10703v1","created_at":"2026-07-14T01:21:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.10703","created_at":"2026-07-14T01:21:35Z"},{"alias_kind":"pith_short_12","alias_value":"5JMNL34IVQB4","created_at":"2026-07-14T01:21:35Z"},{"alias_kind":"pith_short_16","alias_value":"5JMNL34IVQB4R6HN","created_at":"2026-07-14T01:21:35Z"},{"alias_kind":"pith_short_8","alias_value":"5JMNL34I","created_at":"2026-07-14T01:21:35Z"}],"graph_snapshots":[{"event_id":"sha256:65c6ac2121f3bca5d7979cdd5d9f134ed8c68370acf49a63c423d6d28cc98f65","target":"graph","created_at":"2026-07-14T01:21:35Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2607.10703/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Yu Gao","cross_cats":["cs.DS"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.CG","submitted_at":"2026-07-12T10:54:54Z","title":"Rectilinear Matching to the Integer Grid in Nearly-Linear Time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.10703","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:249055dc4c3cbe186440938e02b47a6e4e39e555f0f8ec08c366e06436b6c9a8","target":"record","created_at":"2026-07-14T01:21:35Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"4217fe711b57d395d8118b166da1259194343678beba0ffa61579c63508adfce","cross_cats_sorted":["cs.DS"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.CG","submitted_at":"2026-07-12T10:54:54Z","title_canon_sha256":"974e49cbcdfade22e562eafbb5aa9916c21a697688b04e472e7db697345d3fc0"},"schema_version":"1.0","source":{"id":"2607.10703","kind":"arxiv","version":1}},"canonical_sha256":"ea58d5ef88ac03c8f8ed32b937f1168cae9258e2767c904de20f0813f840620b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ea58d5ef88ac03c8f8ed32b937f1168cae9258e2767c904de20f0813f840620b","first_computed_at":"2026-07-14T01:21:35.414654Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-14T01:21:35.414654Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RAmrwoO9VZa2UZpi2+9h533MmobixBFFeBDrFGpvjfky7c34DT13pBKj3cEysDdoVGCOs9OAH+C/wTuZyFOYBg==","signature_status":"signed_v1","signed_at":"2026-07-14T01:21:35.415494Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.10703","source_kind":"arxiv","source_version":1}}},"equivocations":[{"signer_id":"pith.science","event_type":"integrity_finding","target":"integrity","event_ids":["sha256:5171ddd530c6551e01bbb02ddf20d5cf14531f2a9d1f0720bee41688d4281399","sha256:b34fae0a257ab63222cfbf6e59b90ba7e7f2498de89a168921688fa8db47c204"]}],"invalid_events":[],"applied_event_ids":["sha256:249055dc4c3cbe186440938e02b47a6e4e39e555f0f8ec08c366e06436b6c9a8","sha256:65c6ac2121f3bca5d7979cdd5d9f134ed8c68370acf49a63c423d6d28cc98f65"],"state_sha256":"2761d5bca7728330d4274611a8bb6c081a550282b7c5ebf9e09643706d139833"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vfeyEKs4OGg/fabGkkt7RZbA890QkFL2uzPuYKJVIJCYm4RmryLbRvNnGJU5O/mWjnfAXSCLdfV4elgZ5iJeCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T15:08:47.550319Z","bundle_sha256":"64491272c612f1d2aad3065a758253a8377842258a3663fe1c896302a976a557"}}