{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:LPNRCGUJR2NU26GBCZW3ZSPUYL","short_pith_number":"pith:LPNRCGUJ","schema_version":"1.0","canonical_sha256":"5bdb111a898e9b4d78c1166dbcc9f4c2d1f8860a6087e6726bbd057bacae54b4","source":{"kind":"arxiv","id":"1404.6287","version":1},"attestation_state":"computed","paper":{"title":"Improved Approximation Algorithms for Earth-Mover Distance in Data Streams","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Arman Yousefi, Rafail Ostrovsky","submitted_at":"2014-04-24T22:55:53Z","abstract_excerpt":"For two multisets $S$ and $T$ of points in $[\\Delta]^2$, such that $|S| = |T|= n$, the earth-mover distance (EMD) between $S$ and $T$ is the minimum cost of a perfect bipartite matching with edges between points in $S$ and $T$, i.e., $EMD(S,T) = \\min_{\\pi:S\\rightarrow T}\\sum_{a\\in S}||a-\\pi(a)||_1$, where $\\pi$ ranges over all one-to-one mappings. The sketching complexity of approximating earth-mover distance in the two-dimensional grid is mentioned as one of the open problems in the literature. We give two algorithms for computing EMD between two multi-sets when the number of distinct points "},"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":"1404.6287","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-24T22:55:53Z","cross_cats_sorted":[],"title_canon_sha256":"9b4871456b32f4f0429c09ac5ed90cb7c7dc1d5f4703fd9c12de2c193ca3677e","abstract_canon_sha256":"cb6c341fd5171c4dab3d4c3883b9046bf672fed03d5c143be3e3b46df83459d5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:53:16.951008Z","signature_b64":"wHg/A0h6yhL0oAR937PCdOwBIm9Ot0A0XZvqx2ByQFNoVjJLLeLiOIHN3un0ao9SRARAiABC6PPPzYR7PcOtCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5bdb111a898e9b4d78c1166dbcc9f4c2d1f8860a6087e6726bbd057bacae54b4","last_reissued_at":"2026-05-18T02:53:16.950429Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:53:16.950429Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved Approximation Algorithms for Earth-Mover Distance in Data Streams","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Arman Yousefi, Rafail Ostrovsky","submitted_at":"2014-04-24T22:55:53Z","abstract_excerpt":"For two multisets $S$ and $T$ of points in $[\\Delta]^2$, such that $|S| = |T|= n$, the earth-mover distance (EMD) between $S$ and $T$ is the minimum cost of a perfect bipartite matching with edges between points in $S$ and $T$, i.e., $EMD(S,T) = \\min_{\\pi:S\\rightarrow T}\\sum_{a\\in S}||a-\\pi(a)||_1$, where $\\pi$ ranges over all one-to-one mappings. The sketching complexity of approximating earth-mover distance in the two-dimensional grid is mentioned as one of the open problems in the literature. We give two algorithms for computing EMD between two multi-sets when the number of distinct points "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.6287","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":"1404.6287","created_at":"2026-05-18T02:53:16.950528+00:00"},{"alias_kind":"arxiv_version","alias_value":"1404.6287v1","created_at":"2026-05-18T02:53:16.950528+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.6287","created_at":"2026-05-18T02:53:16.950528+00:00"},{"alias_kind":"pith_short_12","alias_value":"LPNRCGUJR2NU","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_16","alias_value":"LPNRCGUJR2NU26GB","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_8","alias_value":"LPNRCGUJ","created_at":"2026-05-18T12:28:38.356838+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/LPNRCGUJR2NU26GBCZW3ZSPUYL","json":"https://pith.science/pith/LPNRCGUJR2NU26GBCZW3ZSPUYL.json","graph_json":"https://pith.science/api/pith-number/LPNRCGUJR2NU26GBCZW3ZSPUYL/graph.json","events_json":"https://pith.science/api/pith-number/LPNRCGUJR2NU26GBCZW3ZSPUYL/events.json","paper":"https://pith.science/paper/LPNRCGUJ"},"agent_actions":{"view_html":"https://pith.science/pith/LPNRCGUJR2NU26GBCZW3ZSPUYL","download_json":"https://pith.science/pith/LPNRCGUJR2NU26GBCZW3ZSPUYL.json","view_paper":"https://pith.science/paper/LPNRCGUJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1404.6287&json=true","fetch_graph":"https://pith.science/api/pith-number/LPNRCGUJR2NU26GBCZW3ZSPUYL/graph.json","fetch_events":"https://pith.science/api/pith-number/LPNRCGUJR2NU26GBCZW3ZSPUYL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LPNRCGUJR2NU26GBCZW3ZSPUYL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LPNRCGUJR2NU26GBCZW3ZSPUYL/action/storage_attestation","attest_author":"https://pith.science/pith/LPNRCGUJR2NU26GBCZW3ZSPUYL/action/author_attestation","sign_citation":"https://pith.science/pith/LPNRCGUJR2NU26GBCZW3ZSPUYL/action/citation_signature","submit_replication":"https://pith.science/pith/LPNRCGUJR2NU26GBCZW3ZSPUYL/action/replication_record"}},"created_at":"2026-05-18T02:53:16.950528+00:00","updated_at":"2026-05-18T02:53:16.950528+00:00"}