Paper Citation Record · LEDGER

Approximating High-Dimensional Earth Mover's Distance as Fast as Closest Pair

As of 11 August 2026, this Paper Citation Record lists 20 of 20 outbound references and 1 inbound Pith citation observation for arXiv:2508.06774.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2508.06774 v1

Coverage vector

measured 20 of 20 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-05T22:49:06.766089Z

measured 21 of 21 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-11T06:34:44.6726+00:00

measured 1 of 1 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-02T22:57:01.410942Z

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: cited_works

Reference resolution

20 of 20 outbound references displayed

verified exact0
verified fuzzy15
unresolved2
parse uncertain0
malformed identifier1
metadata mismatch2

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation e4922025-9b19-436f-af35-0666e5d19ced · outbound

This paper cites Polynomial Representations of Threshold Functions with Applications.

Approximating High-Dimensional Earth Mover's Distance as Fast as Closest Pair Polynomial Representations of Threshold Functions with Applications

Reference 1

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T22:49:10.837698Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

Observation e9e159fa-bf4b-4b07-a124-91b49cb8efad · outbound

This paper cites New streaming algo- rithms for high dimensional EMD and MST.

Approximating High-Dimensional Earth Mover's Distance as Fast as Closest Pair New streaming algo- rithms for high dimensional EMD and MST

Reference 8

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T22:49:09.841838Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

Observation b93a7c41-50bc-4453-a954-44975a3e9e80 · outbound

This paper cites Approximate Nearest Neighbor: Towards Removing the Curse of Dimensionality.

Approximating High-Dimensional Earth Mover's Distance as Fast as Closest Pair Approximate Nearest Neighbor: Towards Removing the Curse of Dimensionality

Reference 9

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T22:49:09.660475Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

Observation 35cdd9de-b124-48e3-8c9d-e50314a46e1c · outbound

This paper cites Preconditioning and Locality in Algorithm Design.

Approximating High-Dimensional Earth Mover's Distance as Fast as Closest Pair Preconditioning and Locality in Algorithm Design

Reference 12

Resolution: metadata mismatch; raw_fallback, observed 2026-08-05T22:49:07.243260Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

Observation 046bb326-2b0f-44a7-bf43-f6695750d6f5 · outbound

This paper cites Finding Correlations in Subquadratic Time, with Applications to Learning Parities and the Closest Pair Problem.

Approximating High-Dimensional Earth Mover's Distance as Fast as Closest Pair Finding Correlations in Subquadratic Time, with Applications to Learning Parities and the Closest Pair Problem

Reference 18

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T22:49:08.255209Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

Observation 4189b402-00c3-4027-a419-2af25216de14 · outbound

This paper cites 2023, pp.

Approximating High-Dimensional Earth Mover's Distance as Fast as Closest Pair 2023, pp

Reference 20

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T22:49:07.751716Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

Observation 088465b9-6e9e-447c-927a-cc522498accb · outbound

This paper cites A near-linear time ε-approximation algo- rithm for geometric bipartite matching.

Approximating High-Dimensional Earth Mover's Distance as Fast as Closest Pair A near-linear time ε-approximation algo- rithm for geometric bipartite matching

Reference 1268

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T22:49:08.736157Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

Observation a5832266-1dd6-42e7-a2f3-7ddba0d6b387 · outbound

This paper cites On a greedy heuristic for complete match- ing.

Approximating High-Dimensional Earth Mover's Distance as Fast as Closest Pair On a greedy heuristic for complete match- ing

Reference 1991

Resolution: malformed identifier; raw_fallback, observed 2026-08-05T22:49:08.907482Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

Observation e8655f06-5f91-4857-849f-694506b0f4a0 · outbound

This paper cites Embedding lpm into l 1 n.

Approximating High-Dimensional Earth Mover's Distance as Fast as Closest Pair Embedding lpm into l 1 n

Reference 2003

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T22:49:09.230295Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

Observation f6787342-edf4-4065-b25d-f0a20ff491dc · outbound

This paper cites On the difference between closest, furthest, and orthogonal pairs: Nearly-linear vs barely-subquadratic complexity.

Approximating High-Dimensional Earth Mover's Distance as Fast as Closest Pair On the difference between closest, furthest, and orthogonal pairs: Nearly-linear vs barely-subquadratic complexity

Reference 2008

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T22:49:07.957032Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

Observation cf51f4af-abca-4e4a-ba2d-70d44f074b55 · outbound

This paper cites Optimal Data-Dependent Hashing for Approximate Near Neighbors.

Approximating High-Dimensional Earth Mover's Distance as Fast as Closest Pair Optimal Data-Dependent Hashing for Approximate Near Neighbors

Reference 2009

Resolution: unresolved; no resolver link, observed 2026-08-05T22:49:05.013753Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d8d84cb0-bc60-4183-bd86-cbb086d8d87d · outbound

This paper cites Approximate Nearest Neighbors: Towards Remov- ing the Curse of Dimensionality.

Approximating High-Dimensional Earth Mover's Distance as Fast as Closest Pair Approximate Nearest Neighbors: Towards Remov- ing the Curse of Dimensionality

Reference 2013

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T22:49:09.394507Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

Observation 1cd181b3-620a-4ee0-baf2-99ae3d06c6f7 · outbound

This paper cites Nearly maximum flows in nearly linear time.

Approximating High-Dimensional Earth Mover's Distance as Fast as Closest Pair Nearly maximum flows in nearly linear time

Reference 2015

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T22:49:08.447804Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

Observation f1ad9571-ee1a-4d67-a75c-756d0bd6068d · outbound

This paper cites Faster algorithms for the geometric transportation problem.

Approximating High-Dimensional Earth Mover's Distance as Fast as Closest Pair Faster algorithms for the geometric transportation problem

Reference 2016

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T22:49:10.551239Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

Observation e6b43f95-0b23-496f-a566-89dabde64bf2 · outbound

This paper cites Deter- ministic, near-linear ε-approximation algorithm for geometric bipartite matching.

Approximating High-Dimensional Earth Mover's Distance as Fast as Closest Pair Deter- ministic, near-linear ε-approximation algorithm for geometric bipartite matching

Reference 2017

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T22:49:10.394240Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

Observation 00fa4775-41e3-43df-a201-ee8fed8e5942 · outbound

This paper cites Lower Bounds on the Distortion of Embedding Finite Metric Spaces in Graphs.

Approximating High-Dimensional Earth Mover's Distance as Fast as Closest Pair Lower Bounds on the Distortion of Embedding Finite Metric Spaces in Graphs

Reference 2019

Resolution: unresolved; no resolver link, observed 2026-08-05T22:49:06.017317Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 733c9423-d6f9-4adc-91a4-704f1790146a · outbound

This paper cites Parallel approximate undirected shortest paths via low hop emulators.

Approximating High-Dimensional Earth Mover's Distance as Fast as Closest Pair Parallel approximate undirected shortest paths via low hop emulators

Reference 2020

Resolution: metadata mismatch; raw_fallback, observed 2026-08-05T22:49:07.454309Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

Observation 45a10a4d-9d62-4af4-a53b-00f10144d395 · outbound

This paper cites Computational Optimal Transport: With Appli- cations to Data Science.

Approximating High-Dimensional Earth Mover's Distance as Fast as Closest Pair Computational Optimal Transport: With Appli- cations to Data Science

Reference 2021

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T22:49:09.091226Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

Observation 8a85bb30-806f-436e-bf4f-d567ef8d1176 · outbound

This paper cites Eu- clidean minimum spanning trees and bichromatic closest pairs.

Approximating High-Dimensional Earth Mover's Distance as Fast as Closest Pair Eu- clidean minimum spanning trees and bichromatic closest pairs

Reference 2022

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T22:49:10.175332Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

Observation 43e78e15-60b3-4bda-a948-ba45a62b7291 · outbound

This paper cites Similarity estimation techniques from rounding algorithms.

Approximating High-Dimensional Earth Mover's Distance as Fast as Closest Pair Similarity estimation techniques from rounding algorithms

Reference 2023

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T22:49:09.979514Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

Pith citing papers

Observation e60b578e-9d8c-4264-8cb4-f132d168e926 · inbound

PiPNN: Ultra-Scalable Graph-Based Nearest Neighbor Indexing cites this paper.

PiPNN: Ultra-Scalable Graph-Based Nearest Neighbor Indexing Approximating High-Dimensional Earth Mover's Distance as Fast as Closest Pair

Reference 2025

Resolution: unresolved; no resolver link, observed 2026-08-02T22:57:01.410942Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.