{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:HNKOVNRUIHVW34PCWKGWEECD4I","short_pith_number":"pith:HNKOVNRU","schema_version":"1.0","canonical_sha256":"3b54eab63441eb6df1e2b28d621043e213ad3bfdc47456a81e46f6b2c4c9de52","source":{"kind":"arxiv","id":"1411.7273","version":1},"attestation_state":"computed","paper":{"title":"Partial-Matching and Hausdorff RMS Distance Under Translation: Combinatorics and Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.CG","authors_text":"Bal\\'azs Keszegh, Igor Tubis, Matthias Henze, Micha Sharir, Orit E. Raz, Rafel Jaume, Rinat Ben-Avraham","submitted_at":"2014-11-26T15:43:48Z","abstract_excerpt":"We consider the RMS distance (sum of squared distances between pairs of points) under translation between two point sets in the plane, in two different setups. In the partial-matching setup, each point in the smaller set is matched to a distinct point in the bigger set. Although the problem is not known to be polynomial, we establish several structural properties of the underlying subdivision of the plane and derive improved bounds on its complexity. These results lead to the best known algorithm for finding a translation for which the partial-matching RMS distance between the point sets is mi"},"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":"1411.7273","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-11-26T15:43:48Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"7484164edbebf715846fa597debd0b1426296e11c1592769b9e6cc982ee05924","abstract_canon_sha256":"101c9a35601d2ec8ddc81e6f598c8721f9b956d100e2396a407807de3f593394"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:32:44.815604Z","signature_b64":"Hop2T1rTz+zXnGyZA01vR6VzdP2zh9Z8XGtRwShPAa6D358XQrgiHVZLWZOdo/d7g2XDORH0JeYx4arXo7xaAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3b54eab63441eb6df1e2b28d621043e213ad3bfdc47456a81e46f6b2c4c9de52","last_reissued_at":"2026-05-18T02:32:44.815094Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:32:44.815094Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Partial-Matching and Hausdorff RMS Distance Under Translation: Combinatorics and Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.CG","authors_text":"Bal\\'azs Keszegh, Igor Tubis, Matthias Henze, Micha Sharir, Orit E. Raz, Rafel Jaume, Rinat Ben-Avraham","submitted_at":"2014-11-26T15:43:48Z","abstract_excerpt":"We consider the RMS distance (sum of squared distances between pairs of points) under translation between two point sets in the plane, in two different setups. In the partial-matching setup, each point in the smaller set is matched to a distinct point in the bigger set. Although the problem is not known to be polynomial, we establish several structural properties of the underlying subdivision of the plane and derive improved bounds on its complexity. These results lead to the best known algorithm for finding a translation for which the partial-matching RMS distance between the point sets is mi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.7273","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":"1411.7273","created_at":"2026-05-18T02:32:44.815173+00:00"},{"alias_kind":"arxiv_version","alias_value":"1411.7273v1","created_at":"2026-05-18T02:32:44.815173+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.7273","created_at":"2026-05-18T02:32:44.815173+00:00"},{"alias_kind":"pith_short_12","alias_value":"HNKOVNRUIHVW","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_16","alias_value":"HNKOVNRUIHVW34PC","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_8","alias_value":"HNKOVNRU","created_at":"2026-05-18T12:28:30.664211+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/HNKOVNRUIHVW34PCWKGWEECD4I","json":"https://pith.science/pith/HNKOVNRUIHVW34PCWKGWEECD4I.json","graph_json":"https://pith.science/api/pith-number/HNKOVNRUIHVW34PCWKGWEECD4I/graph.json","events_json":"https://pith.science/api/pith-number/HNKOVNRUIHVW34PCWKGWEECD4I/events.json","paper":"https://pith.science/paper/HNKOVNRU"},"agent_actions":{"view_html":"https://pith.science/pith/HNKOVNRUIHVW34PCWKGWEECD4I","download_json":"https://pith.science/pith/HNKOVNRUIHVW34PCWKGWEECD4I.json","view_paper":"https://pith.science/paper/HNKOVNRU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1411.7273&json=true","fetch_graph":"https://pith.science/api/pith-number/HNKOVNRUIHVW34PCWKGWEECD4I/graph.json","fetch_events":"https://pith.science/api/pith-number/HNKOVNRUIHVW34PCWKGWEECD4I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HNKOVNRUIHVW34PCWKGWEECD4I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HNKOVNRUIHVW34PCWKGWEECD4I/action/storage_attestation","attest_author":"https://pith.science/pith/HNKOVNRUIHVW34PCWKGWEECD4I/action/author_attestation","sign_citation":"https://pith.science/pith/HNKOVNRUIHVW34PCWKGWEECD4I/action/citation_signature","submit_replication":"https://pith.science/pith/HNKOVNRUIHVW34PCWKGWEECD4I/action/replication_record"}},"created_at":"2026-05-18T02:32:44.815173+00:00","updated_at":"2026-05-18T02:32:44.815173+00:00"}