{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:J4CL575WWFHNT2MTOURYRA2IOD","short_pith_number":"pith:J4CL575W","schema_version":"1.0","canonical_sha256":"4f04beffb6b14ed9e993752388834870e57e9f6054c71e9922d6fbe12612d85b","source":{"kind":"arxiv","id":"1903.09358","version":1},"attestation_state":"computed","paper":{"title":"Efficient Algorithms for Geometric Partial Matching","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.DS","authors_text":"Allen Xiao, Hsien-Chih Chang, Pankaj K. Agarwal","submitted_at":"2019-03-22T05:03:14Z","abstract_excerpt":"Let $A$ and $B$ be two point sets in the plane of sizes $r$ and $n$ respectively (assume $r \\leq n$), and let $k$ be a parameter. A matching between $A$ and $B$ is a family of pairs in $A \\times B$ so that any point of $A \\cup B$ appears in at most one pair. Given two positive integers $p$ and $q$, we define the cost of matching $M$ to be $c(M) = \\sum_{(a, b) \\in M}\\|{a-b}\\|_p^q$ where $\\|{\\cdot}\\|_p$ is the $L_p$-norm. The geometric partial matching problem asks to find the minimum-cost size-$k$ matching between $A$ and $B$.\n  We present efficient algorithms for geometric partial matching pro"},"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":"1903.09358","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2019-03-22T05:03:14Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"ba500ec51ce4dafb565be1369d485e307cacca7c738323368a1f6770a1c51efd","abstract_canon_sha256":"49da633015adc54800eea7a006016bf65507f812cc9e9c80ce3ee4ba3a69c443"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:50:39.851084Z","signature_b64":"Y9w9zlLt4x0ZvfXQRd6NKHkGSuYY3lXUcQbwTR7Q/3z5DlM+FnsuXmAq5ni6pc9Wyxp+VajEdRFXimbMPYuWDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4f04beffb6b14ed9e993752388834870e57e9f6054c71e9922d6fbe12612d85b","last_reissued_at":"2026-05-17T23:50:39.850626Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:50:39.850626Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Algorithms for Geometric Partial Matching","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.DS","authors_text":"Allen Xiao, Hsien-Chih Chang, Pankaj K. Agarwal","submitted_at":"2019-03-22T05:03:14Z","abstract_excerpt":"Let $A$ and $B$ be two point sets in the plane of sizes $r$ and $n$ respectively (assume $r \\leq n$), and let $k$ be a parameter. A matching between $A$ and $B$ is a family of pairs in $A \\times B$ so that any point of $A \\cup B$ appears in at most one pair. Given two positive integers $p$ and $q$, we define the cost of matching $M$ to be $c(M) = \\sum_{(a, b) \\in M}\\|{a-b}\\|_p^q$ where $\\|{\\cdot}\\|_p$ is the $L_p$-norm. The geometric partial matching problem asks to find the minimum-cost size-$k$ matching between $A$ and $B$.\n  We present efficient algorithms for geometric partial matching pro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.09358","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":"1903.09358","created_at":"2026-05-17T23:50:39.850692+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.09358v1","created_at":"2026-05-17T23:50:39.850692+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.09358","created_at":"2026-05-17T23:50:39.850692+00:00"},{"alias_kind":"pith_short_12","alias_value":"J4CL575WWFHN","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_16","alias_value":"J4CL575WWFHNT2MT","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_8","alias_value":"J4CL575W","created_at":"2026-05-18T12:33:18.533446+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":2,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/J4CL575WWFHNT2MTOURYRA2IOD","json":"https://pith.science/pith/J4CL575WWFHNT2MTOURYRA2IOD.json","graph_json":"https://pith.science/api/pith-number/J4CL575WWFHNT2MTOURYRA2IOD/graph.json","events_json":"https://pith.science/api/pith-number/J4CL575WWFHNT2MTOURYRA2IOD/events.json","paper":"https://pith.science/paper/J4CL575W"},"agent_actions":{"view_html":"https://pith.science/pith/J4CL575WWFHNT2MTOURYRA2IOD","download_json":"https://pith.science/pith/J4CL575WWFHNT2MTOURYRA2IOD.json","view_paper":"https://pith.science/paper/J4CL575W","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.09358&json=true","fetch_graph":"https://pith.science/api/pith-number/J4CL575WWFHNT2MTOURYRA2IOD/graph.json","fetch_events":"https://pith.science/api/pith-number/J4CL575WWFHNT2MTOURYRA2IOD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J4CL575WWFHNT2MTOURYRA2IOD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J4CL575WWFHNT2MTOURYRA2IOD/action/storage_attestation","attest_author":"https://pith.science/pith/J4CL575WWFHNT2MTOURYRA2IOD/action/author_attestation","sign_citation":"https://pith.science/pith/J4CL575WWFHNT2MTOURYRA2IOD/action/citation_signature","submit_replication":"https://pith.science/pith/J4CL575WWFHNT2MTOURYRA2IOD/action/replication_record"}},"created_at":"2026-05-17T23:50:39.850692+00:00","updated_at":"2026-05-17T23:50:39.850692+00:00"}