{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:UVTAOTVPHJ3YLDCJ74YI2OSR54","short_pith_number":"pith:UVTAOTVP","schema_version":"1.0","canonical_sha256":"a566074eaf3a77858c49ff308d3a51ef2776d3537d58c6295d77b40e62054ab0","source":{"kind":"arxiv","id":"1810.10046","version":2},"attestation_state":"computed","paper":{"title":"Approximating the Quadratic Transportation Metric in Near-Linear Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.DS","authors_text":"Alessandro Rudi, Francis Bach, Jason Altschuler, Jonathan Weed","submitted_at":"2018-10-23T18:50:19Z","abstract_excerpt":"Computing the quadratic transportation metric (also called the $2$-Wasserstein distance or root mean square distance) between two point clouds, or, more generally, two discrete distributions, is a fundamental problem in machine learning, statistics, computer graphics, and theoretical computer science. A long line of work has culminated in a sophisticated geometric algorithm due to Agarwal and Sharathkumar in 2014, which runs in time $\\tilde{O}(n^{3/2})$, where $n$ is the number of points. However, obtaining faster algorithms has proven difficult since the $2$-Wasserstein distance is known to h"},"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":"1810.10046","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-10-23T18:50:19Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"7af234db044a353b0f13045500be1002c2224126434199cd18f3983ea55aa2ee","abstract_canon_sha256":"58720580b7c933aabf44ef27859b08a471fc3f1810fa9119f92a726c859bc5cc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:58:13.529428Z","signature_b64":"kHWmSxP1QvwR6VrL1Ep6ySuVVqdk1w9r1Vt2KoGumAKv3T1BnfIjhPJCwjUfoOmdymWS7GKMJIuqFsDxsVw7Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a566074eaf3a77858c49ff308d3a51ef2776d3537d58c6295d77b40e62054ab0","last_reissued_at":"2026-05-17T23:58:13.529034Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:58:13.529034Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximating the Quadratic Transportation Metric in Near-Linear Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.DS","authors_text":"Alessandro Rudi, Francis Bach, Jason Altschuler, Jonathan Weed","submitted_at":"2018-10-23T18:50:19Z","abstract_excerpt":"Computing the quadratic transportation metric (also called the $2$-Wasserstein distance or root mean square distance) between two point clouds, or, more generally, two discrete distributions, is a fundamental problem in machine learning, statistics, computer graphics, and theoretical computer science. A long line of work has culminated in a sophisticated geometric algorithm due to Agarwal and Sharathkumar in 2014, which runs in time $\\tilde{O}(n^{3/2})$, where $n$ is the number of points. However, obtaining faster algorithms has proven difficult since the $2$-Wasserstein distance is known to h"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.10046","kind":"arxiv","version":2},"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":"1810.10046","created_at":"2026-05-17T23:58:13.529097+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.10046v2","created_at":"2026-05-17T23:58:13.529097+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.10046","created_at":"2026-05-17T23:58:13.529097+00:00"},{"alias_kind":"pith_short_12","alias_value":"UVTAOTVPHJ3Y","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_16","alias_value":"UVTAOTVPHJ3YLDCJ","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_8","alias_value":"UVTAOTVP","created_at":"2026-05-18T12:32:56.356000+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.20122","citing_title":"Optimizing Computational-Statistical Runtime for Wasserstein Distance Estimation","ref_index":5,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UVTAOTVPHJ3YLDCJ74YI2OSR54","json":"https://pith.science/pith/UVTAOTVPHJ3YLDCJ74YI2OSR54.json","graph_json":"https://pith.science/api/pith-number/UVTAOTVPHJ3YLDCJ74YI2OSR54/graph.json","events_json":"https://pith.science/api/pith-number/UVTAOTVPHJ3YLDCJ74YI2OSR54/events.json","paper":"https://pith.science/paper/UVTAOTVP"},"agent_actions":{"view_html":"https://pith.science/pith/UVTAOTVPHJ3YLDCJ74YI2OSR54","download_json":"https://pith.science/pith/UVTAOTVPHJ3YLDCJ74YI2OSR54.json","view_paper":"https://pith.science/paper/UVTAOTVP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.10046&json=true","fetch_graph":"https://pith.science/api/pith-number/UVTAOTVPHJ3YLDCJ74YI2OSR54/graph.json","fetch_events":"https://pith.science/api/pith-number/UVTAOTVPHJ3YLDCJ74YI2OSR54/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UVTAOTVPHJ3YLDCJ74YI2OSR54/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UVTAOTVPHJ3YLDCJ74YI2OSR54/action/storage_attestation","attest_author":"https://pith.science/pith/UVTAOTVPHJ3YLDCJ74YI2OSR54/action/author_attestation","sign_citation":"https://pith.science/pith/UVTAOTVPHJ3YLDCJ74YI2OSR54/action/citation_signature","submit_replication":"https://pith.science/pith/UVTAOTVPHJ3YLDCJ74YI2OSR54/action/replication_record"}},"created_at":"2026-05-17T23:58:13.529097+00:00","updated_at":"2026-05-17T23:58:13.529097+00:00"}