{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:32PLZ2UHBVGAQP34BJ24HH3NIX","short_pith_number":"pith:32PLZ2UH","schema_version":"1.0","canonical_sha256":"de9ebcea870d4c083f7c0a75c39f6d45d4de3114f9a4677e5bc40636117da509","source":{"kind":"arxiv","id":"2508.06774","version":1},"attestation_state":"computed","paper":{"title":"Approximating High-Dimensional Earth Mover's Distance as Fast as Closest Pair","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DS","authors_text":"Erik Waingarten, Lorenzo Beretta, Rajesh Jayaram, Vincent Cohen-Addad","submitted_at":"2025-08-09T02:00:53Z","abstract_excerpt":"We give a reduction from $(1+\\varepsilon)$-approximate Earth Mover's Distance (EMD) to $(1+\\varepsilon)$-approximate Closest Pair (CP). As a consequence, we improve the fastest known approximation algorithm for high-dimensional EMD. Here, given $p\\in [1, 2]$ and two sets of $n$ points $X,Y \\subseteq (\\mathbb R^d,\\ell_p)$, their EMD is the minimum cost of a perfect matching between $X$ and $Y$, where the cost of matching two vectors is their $\\ell_p$ distance. Further, CP is the basic problem of finding a pair of points realizing $\\min_{x \\in X, y\\in Y} ||x-y||_p$. Our contribution is twofold: "},"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":"2508.06774","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-08-09T02:00:53Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"c88ba7b572d8c8546c4e510df3aec22c3068a9fc271f1e9bef9c85b7142badfd","abstract_canon_sha256":"5cb40df2ab14d038370479bc8815d0b5bd7a7e01368802dff1528053613e261f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:59:19.638376Z","signature_b64":"QLphhqJ0zliYp9BwhzTR0cvl6WFx7rqWDD9mLtt8ff9EeE/rpBYnQi2j4QCHeMslH5jVZqQJyrohUYkddXmSCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"de9ebcea870d4c083f7c0a75c39f6d45d4de3114f9a4677e5bc40636117da509","last_reissued_at":"2026-07-05T11:59:19.637928Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:59:19.637928Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximating High-Dimensional Earth Mover's Distance as Fast as Closest Pair","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DS","authors_text":"Erik Waingarten, Lorenzo Beretta, Rajesh Jayaram, Vincent Cohen-Addad","submitted_at":"2025-08-09T02:00:53Z","abstract_excerpt":"We give a reduction from $(1+\\varepsilon)$-approximate Earth Mover's Distance (EMD) to $(1+\\varepsilon)$-approximate Closest Pair (CP). As a consequence, we improve the fastest known approximation algorithm for high-dimensional EMD. Here, given $p\\in [1, 2]$ and two sets of $n$ points $X,Y \\subseteq (\\mathbb R^d,\\ell_p)$, their EMD is the minimum cost of a perfect matching between $X$ and $Y$, where the cost of matching two vectors is their $\\ell_p$ distance. Further, CP is the basic problem of finding a pair of points realizing $\\min_{x \\in X, y\\in Y} ||x-y||_p$. Our contribution is twofold: "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.06774","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/2508.06774/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":"2508.06774","created_at":"2026-07-05T11:59:19.637985+00:00"},{"alias_kind":"arxiv_version","alias_value":"2508.06774v1","created_at":"2026-07-05T11:59:19.637985+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.06774","created_at":"2026-07-05T11:59:19.637985+00:00"},{"alias_kind":"pith_short_12","alias_value":"32PLZ2UHBVGA","created_at":"2026-07-05T11:59:19.637985+00:00"},{"alias_kind":"pith_short_16","alias_value":"32PLZ2UHBVGAQP34","created_at":"2026-07-05T11:59:19.637985+00:00"},{"alias_kind":"pith_short_8","alias_value":"32PLZ2UH","created_at":"2026-07-05T11:59:19.637985+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/32PLZ2UHBVGAQP34BJ24HH3NIX","json":"https://pith.science/pith/32PLZ2UHBVGAQP34BJ24HH3NIX.json","graph_json":"https://pith.science/api/pith-number/32PLZ2UHBVGAQP34BJ24HH3NIX/graph.json","events_json":"https://pith.science/api/pith-number/32PLZ2UHBVGAQP34BJ24HH3NIX/events.json","paper":"https://pith.science/paper/32PLZ2UH"},"agent_actions":{"view_html":"https://pith.science/pith/32PLZ2UHBVGAQP34BJ24HH3NIX","download_json":"https://pith.science/pith/32PLZ2UHBVGAQP34BJ24HH3NIX.json","view_paper":"https://pith.science/paper/32PLZ2UH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2508.06774&json=true","fetch_graph":"https://pith.science/api/pith-number/32PLZ2UHBVGAQP34BJ24HH3NIX/graph.json","fetch_events":"https://pith.science/api/pith-number/32PLZ2UHBVGAQP34BJ24HH3NIX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/32PLZ2UHBVGAQP34BJ24HH3NIX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/32PLZ2UHBVGAQP34BJ24HH3NIX/action/storage_attestation","attest_author":"https://pith.science/pith/32PLZ2UHBVGAQP34BJ24HH3NIX/action/author_attestation","sign_citation":"https://pith.science/pith/32PLZ2UHBVGAQP34BJ24HH3NIX/action/citation_signature","submit_replication":"https://pith.science/pith/32PLZ2UHBVGAQP34BJ24HH3NIX/action/replication_record"}},"created_at":"2026-07-05T11:59:19.637985+00:00","updated_at":"2026-07-05T11:59:19.637985+00:00"}