{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:6PWJCBV7E32MK7YYV5FTKV2OBR","short_pith_number":"pith:6PWJCBV7","schema_version":"1.0","canonical_sha256":"f3ec9106bf26f4c57f18af4b35574e0c4aeb7bdcdecdd8d32cef0e8bf93fadbd","source":{"kind":"arxiv","id":"1907.04426","version":5},"attestation_state":"computed","paper":{"title":"A near-linear time approximation scheme for geometric transportation with arbitrary supplies and spread","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Jiashuai Lu (1) ((1) The University of Texas at Dallas), Kyle Fox (1)","submitted_at":"2019-07-09T21:46:01Z","abstract_excerpt":"The geometric transportation problem takes as input a set of points $P$ in $d$-dimensional Euclidean space and a supply function $\\mu : P \\to \\mathbb{R}$. The goal is to find a transportation map, a non-negative assignment $\\tau : P \\times P \\to \\mathbb{R}_{\\geq 0}$ to pairs of points, so the total assignment leaving each point is equal to its supply, i.e., $\\sum_{r \\in P} \\tau(q, r) - \\sum_{p \\in P} \\tau(p, q) = \\mu(q)$ for all points $q \\in P$. The goal is to minimize the weighted sum of Euclidean distances for the pairs, $\\sum_{(p, q) \\in P \\times P} \\tau(p, q) \\cdot ||q - p||_2$.\n  We desc"},"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":"1907.04426","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2019-07-09T21:46:01Z","cross_cats_sorted":[],"title_canon_sha256":"6e8e1a5129d03225bbac9609b47e3b97873477e6bbd57fc95325749cc20448c1","abstract_canon_sha256":"b03f0f60b9e2d4853dd8b50a0d6bd819298b9f15f44541c04155c7a4bee3637e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:18:59.754804Z","signature_b64":"z0RFtWDTZAFOz94LgV4J1cgEt3i2xNPevORw+cOzhGg9iKP1O/5hZJYIA3FXtNeE4y3WjakdkhxIGAWBwq9wDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f3ec9106bf26f4c57f18af4b35574e0c4aeb7bdcdecdd8d32cef0e8bf93fadbd","last_reissued_at":"2026-07-05T04:18:59.754373Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:18:59.754373Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A near-linear time approximation scheme for geometric transportation with arbitrary supplies and spread","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Jiashuai Lu (1) ((1) The University of Texas at Dallas), Kyle Fox (1)","submitted_at":"2019-07-09T21:46:01Z","abstract_excerpt":"The geometric transportation problem takes as input a set of points $P$ in $d$-dimensional Euclidean space and a supply function $\\mu : P \\to \\mathbb{R}$. The goal is to find a transportation map, a non-negative assignment $\\tau : P \\times P \\to \\mathbb{R}_{\\geq 0}$ to pairs of points, so the total assignment leaving each point is equal to its supply, i.e., $\\sum_{r \\in P} \\tau(q, r) - \\sum_{p \\in P} \\tau(p, q) = \\mu(q)$ for all points $q \\in P$. The goal is to minimize the weighted sum of Euclidean distances for the pairs, $\\sum_{(p, q) \\in P \\times P} \\tau(p, q) \\cdot ||q - p||_2$.\n  We desc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.04426","kind":"arxiv","version":5},"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/1907.04426/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":"1907.04426","created_at":"2026-07-05T04:18:59.754431+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.04426v5","created_at":"2026-07-05T04:18:59.754431+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.04426","created_at":"2026-07-05T04:18:59.754431+00:00"},{"alias_kind":"pith_short_12","alias_value":"6PWJCBV7E32M","created_at":"2026-07-05T04:18:59.754431+00:00"},{"alias_kind":"pith_short_16","alias_value":"6PWJCBV7E32MK7YY","created_at":"2026-07-05T04:18:59.754431+00:00"},{"alias_kind":"pith_short_8","alias_value":"6PWJCBV7","created_at":"2026-07-05T04:18:59.754431+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.10703","citing_title":"Rectilinear Matching to the Integer Grid in Nearly-Linear Time","ref_index":6,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6PWJCBV7E32MK7YYV5FTKV2OBR","json":"https://pith.science/pith/6PWJCBV7E32MK7YYV5FTKV2OBR.json","graph_json":"https://pith.science/api/pith-number/6PWJCBV7E32MK7YYV5FTKV2OBR/graph.json","events_json":"https://pith.science/api/pith-number/6PWJCBV7E32MK7YYV5FTKV2OBR/events.json","paper":"https://pith.science/paper/6PWJCBV7"},"agent_actions":{"view_html":"https://pith.science/pith/6PWJCBV7E32MK7YYV5FTKV2OBR","download_json":"https://pith.science/pith/6PWJCBV7E32MK7YYV5FTKV2OBR.json","view_paper":"https://pith.science/paper/6PWJCBV7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.04426&json=true","fetch_graph":"https://pith.science/api/pith-number/6PWJCBV7E32MK7YYV5FTKV2OBR/graph.json","fetch_events":"https://pith.science/api/pith-number/6PWJCBV7E32MK7YYV5FTKV2OBR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6PWJCBV7E32MK7YYV5FTKV2OBR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6PWJCBV7E32MK7YYV5FTKV2OBR/action/storage_attestation","attest_author":"https://pith.science/pith/6PWJCBV7E32MK7YYV5FTKV2OBR/action/author_attestation","sign_citation":"https://pith.science/pith/6PWJCBV7E32MK7YYV5FTKV2OBR/action/citation_signature","submit_replication":"https://pith.science/pith/6PWJCBV7E32MK7YYV5FTKV2OBR/action/replication_record"}},"created_at":"2026-07-05T04:18:59.754431+00:00","updated_at":"2026-07-05T04:18:59.754431+00:00"}