{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:5TQ6L73FPWE77SPGK4NYN6PB3A","short_pith_number":"pith:5TQ6L73F","schema_version":"1.0","canonical_sha256":"ece1e5ff657d89ffc9e6571b86f9e1d82f47bcc84f395388b978ee16b9127e04","source":{"kind":"arxiv","id":"2307.03043","version":1},"attestation_state":"computed","paper":{"title":"A Near-Linear Time Algorithm for the Chamfer Distance","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CG","cs.GR","cs.LG"],"primary_cat":"cs.DS","authors_text":"Ainesh Bakshi, Erik Waingarten, Piotr Indyk, Rajesh Jayaram, Sandeep Silwal","submitted_at":"2023-07-06T15:07:48Z","abstract_excerpt":"For any two point sets $A,B \\subset \\mathbb{R}^d$ of size up to $n$, the Chamfer distance from $A$ to $B$ is defined as $\\text{CH}(A,B)=\\sum_{a \\in A} \\min_{b \\in B} d_X(a,b)$, where $d_X$ is the underlying distance measure (e.g., the Euclidean or Manhattan distance). The Chamfer distance is a popular measure of dissimilarity between point clouds, used in many machine learning, computer vision, and graphics applications, and admits a straightforward $O(d n^2)$-time brute force algorithm. Further, the Chamfer distance is often used as a proxy for the more computationally demanding Earth-Mover ("},"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":"2307.03043","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-07-06T15:07:48Z","cross_cats_sorted":["cs.CG","cs.GR","cs.LG"],"title_canon_sha256":"e7819c0178fd2998795cb1ee8e975c6a625ad415d30e58edc91c1c1806b41b33","abstract_canon_sha256":"edc2283c9498a7f9acf8c4ee502acaea08d71d81b57e33e6cef05d4393b9a22c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:28:27.466580Z","signature_b64":"BtP7sGK3mxC/N5v2y1DzsCcZ00W2vtCt7SUEpDTA3nCkp7/V417d23NbC+QgJDzy3qfs8TTF4T8bz0y87h0CBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ece1e5ff657d89ffc9e6571b86f9e1d82f47bcc84f395388b978ee16b9127e04","last_reissued_at":"2026-07-05T06:28:27.466049Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:28:27.466049Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Near-Linear Time Algorithm for the Chamfer Distance","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CG","cs.GR","cs.LG"],"primary_cat":"cs.DS","authors_text":"Ainesh Bakshi, Erik Waingarten, Piotr Indyk, Rajesh Jayaram, Sandeep Silwal","submitted_at":"2023-07-06T15:07:48Z","abstract_excerpt":"For any two point sets $A,B \\subset \\mathbb{R}^d$ of size up to $n$, the Chamfer distance from $A$ to $B$ is defined as $\\text{CH}(A,B)=\\sum_{a \\in A} \\min_{b \\in B} d_X(a,b)$, where $d_X$ is the underlying distance measure (e.g., the Euclidean or Manhattan distance). The Chamfer distance is a popular measure of dissimilarity between point clouds, used in many machine learning, computer vision, and graphics applications, and admits a straightforward $O(d n^2)$-time brute force algorithm. Further, the Chamfer distance is often used as a proxy for the more computationally demanding Earth-Mover ("},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.03043","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/2307.03043/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":"2307.03043","created_at":"2026-07-05T06:28:27.466160+00:00"},{"alias_kind":"arxiv_version","alias_value":"2307.03043v1","created_at":"2026-07-05T06:28:27.466160+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.03043","created_at":"2026-07-05T06:28:27.466160+00:00"},{"alias_kind":"pith_short_12","alias_value":"5TQ6L73FPWE7","created_at":"2026-07-05T06:28:27.466160+00:00"},{"alias_kind":"pith_short_16","alias_value":"5TQ6L73FPWE77SPG","created_at":"2026-07-05T06:28:27.466160+00:00"},{"alias_kind":"pith_short_8","alias_value":"5TQ6L73F","created_at":"2026-07-05T06:28:27.466160+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.25280","citing_title":"Approximate Algorithms for Chamfer Distance Under Translation","ref_index":3,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5TQ6L73FPWE77SPGK4NYN6PB3A","json":"https://pith.science/pith/5TQ6L73FPWE77SPGK4NYN6PB3A.json","graph_json":"https://pith.science/api/pith-number/5TQ6L73FPWE77SPGK4NYN6PB3A/graph.json","events_json":"https://pith.science/api/pith-number/5TQ6L73FPWE77SPGK4NYN6PB3A/events.json","paper":"https://pith.science/paper/5TQ6L73F"},"agent_actions":{"view_html":"https://pith.science/pith/5TQ6L73FPWE77SPGK4NYN6PB3A","download_json":"https://pith.science/pith/5TQ6L73FPWE77SPGK4NYN6PB3A.json","view_paper":"https://pith.science/paper/5TQ6L73F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2307.03043&json=true","fetch_graph":"https://pith.science/api/pith-number/5TQ6L73FPWE77SPGK4NYN6PB3A/graph.json","fetch_events":"https://pith.science/api/pith-number/5TQ6L73FPWE77SPGK4NYN6PB3A/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5TQ6L73FPWE77SPGK4NYN6PB3A/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5TQ6L73FPWE77SPGK4NYN6PB3A/action/storage_attestation","attest_author":"https://pith.science/pith/5TQ6L73FPWE77SPGK4NYN6PB3A/action/author_attestation","sign_citation":"https://pith.science/pith/5TQ6L73FPWE77SPGK4NYN6PB3A/action/citation_signature","submit_replication":"https://pith.science/pith/5TQ6L73FPWE77SPGK4NYN6PB3A/action/replication_record"}},"created_at":"2026-07-05T06:28:27.466160+00:00","updated_at":"2026-07-05T06:28:27.466160+00:00"}