{"as_of":"2026-08-11T08:50:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:bb7cc8c43bd8112df5aa3062bdb1a9106cb160dbc36e263cd50d9b5a7863532a","coverage":[{"denominator":20,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":20,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T22:49:06.766089Z","state":"measured"},{"denominator":21,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":21,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-02T22:57:01.410942Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2508.06774","last_updated":"2025-08-09T02:00:53Z","snapshot_observed_at":"2026-08-09T21:45:20.646347Z","submitted_at":"2025-08-09T02:00:53Z","title":"Approximating High-Dimensional Earth Mover's Distance as Fast as Closest Pair","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2508.06774","snapshot_observed_at":"2026-08-02T22:57:01.410942Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.21247","last_updated":"2026-07-10T19:02:20Z","snapshot_observed_at":"2026-08-09T21:45:36.906593Z","submitted_at":"2026-02-17T02:18:17Z","title":"PiPNN: Ultra-Scalable Graph-Based Nearest Neighbor Indexing","version":3},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-02T22:57:01.410942Z"},"links":{"cited_paper":"/paper/2508.06774","citing_paper":"/paper/2602.21247"},"observation_digest":"sha256:55921f4ad400c78ea1e60b6383cbaf2b072643b01a79f295fb24fd9eeb2b3141","observation_id":"e60b578e-9d8c-4264-8cb4-f132d168e926","resolution":{"observed_at":"2026-08-02T22:57:01.410942Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2508.06774/citation-record","integrity":"/paper/2508.06774/integrity","json":"/paper/2508.06774/citation-record.json","paper":"/paper/2508.06774"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T22:49:10.695840Z","title":"Polynomial Representations of Threshold Functions with Applications","venue":null,"work_id":"3e16d112-aadf-44cc-a32b-a77017f47807","year":2016},"citing_paper":{"arxiv_id":"2508.06774","last_updated":"2025-08-09T02:00:53Z","snapshot_observed_at":"2026-08-09T21:45:20.646347Z","submitted_at":"2025-08-09T02:00:53Z","title":"Approximating High-Dimensional Earth Mover's Distance as Fast as Closest Pair","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-05T22:49:04.615547Z"},"links":{"citing_paper":"/paper/2508.06774"},"observation_digest":"sha256:d51ddc13e0d3f5deaf69f0a95437575a83a6d7af763fa3f70dab1f6b096ed297","observation_id":"e4922025-9b19-436f-af35-0666e5d19ced","resolution":{"observed_at":"2026-08-05T22:49:10.837698Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T22:49:09.745326Z","title":"New streaming algo- rithms for high dimensional EMD and MST","venue":null,"work_id":"3d2b3da3-3d29-488b-b44d-e72632edcf4c","year":2022},"citing_paper":{"arxiv_id":"2508.06774","last_updated":"2025-08-09T02:00:53Z","snapshot_observed_at":"2026-08-09T21:45:20.646347Z","submitted_at":"2025-08-09T02:00:53Z","title":"Approximating High-Dimensional Earth Mover's Distance as Fast as Closest Pair","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-05T22:49:05.331476Z"},"links":{"citing_paper":"/paper/2508.06774"},"observation_digest":"sha256:5b91b4b029b42531a67f694a214fa7e4c39ed362b916e3ec57a1cc107d536214","observation_id":"e9e159fa-bf4b-4b07-a124-91b49cb8efad","resolution":{"observed_at":"2026-08-05T22:49:09.841838Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T22:49:09.529822Z","title":"Approximate Nearest Neighbor: Towards Removing the Curse of Dimensionality","venue":null,"work_id":"aad1cc1f-b17d-46ac-969d-22cbab7e8275","year":2012},"citing_paper":{"arxiv_id":"2508.06774","last_updated":"2025-08-09T02:00:53Z","snapshot_observed_at":"2026-08-09T21:45:20.646347Z","submitted_at":"2025-08-09T02:00:53Z","title":"Approximating High-Dimensional Earth Mover's Distance as Fast as Closest Pair","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-05T22:49:05.483269Z"},"links":{"citing_paper":"/paper/2508.06774"},"observation_digest":"sha256:1ff449e17f8a264f83b76984f3eb5e75c1a9a4cf2134fb09b7d815f3fdedd2fb","observation_id":"b93a7c41-50bc-4453-a954-44975a3e9e80","resolution":{"observed_at":"2026-08-05T22:49:09.660475Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"7713.33842","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T22:49:07.087145Z","title":"Preconditioning and Locality in Algorithm Design","venue":null,"work_id":"030f6804-30d8-44e4-8971-392b38233b7a","year":2020},"citing_paper":{"arxiv_id":"2508.06774","last_updated":"2025-08-09T02:00:53Z","snapshot_observed_at":"2026-08-09T21:45:20.646347Z","submitted_at":"2025-08-09T02:00:53Z","title":"Approximating High-Dimensional Earth Mover's Distance as Fast as Closest Pair","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-05T22:49:05.747113Z"},"links":{"citing_paper":"/paper/2508.06774"},"observation_digest":"sha256:170722a571abe6b4bbbedbea472a3c873c57c81401dc2f5a95aadf7bea208b4c","observation_id":"35cdd9de-b124-48e3-8c9d-e50314a46e1c","resolution":{"observed_at":"2026-08-05T22:49:07.243260Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T22:49:08.107727Z","title":"Finding Correlations in Subquadratic Time, with Applications to Learning Parities and the Closest Pair Problem","venue":null,"work_id":"a53b5320-be38-4d85-8fb2-d60ddfd6fc1a","year":2015},"citing_paper":{"arxiv_id":"2508.06774","last_updated":"2025-08-09T02:00:53Z","snapshot_observed_at":"2026-08-09T21:45:20.646347Z","submitted_at":"2025-08-09T02:00:53Z","title":"Approximating High-Dimensional Earth Mover's Distance as Fast as Closest Pair","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-05T22:49:06.512841Z"},"links":{"citing_paper":"/paper/2508.06774"},"observation_digest":"sha256:87f71ce1997ea41e4217f572d4435cb721db921d0ffe2567d8e7c0a0e6f19ab3","observation_id":"046bb326-2b0f-44a7-bf43-f6695750d6f5","resolution":{"observed_at":"2026-08-05T22:49:08.255209Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T22:49:07.552209Z","title":"2023, pp","venue":null,"work_id":"de5cc139-7f27-43f7-8074-b08836c47bce","year":2023},"citing_paper":{"arxiv_id":"2508.06774","last_updated":"2025-08-09T02:00:53Z","snapshot_observed_at":"2026-08-09T21:45:20.646347Z","submitted_at":"2025-08-09T02:00:53Z","title":"Approximating High-Dimensional Earth Mover's Distance as Fast as Closest Pair","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-05T22:49:06.766089Z"},"links":{"citing_paper":"/paper/2508.06774"},"observation_digest":"sha256:f1b3fbc4cd0996e14745eb52ddb479e0a5f4bbadd9984f8afa68da7d90d05835","observation_id":"4189b402-00c3-4027-a419-2af25216de14","resolution":{"observed_at":"2026-08-05T22:49:07.751716Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T22:49:08.563315Z","title":"A near-linear time ε-approximation algo- rithm for geometric bipartite matching","venue":null,"work_id":"07def621-7427-4c58-9dd8-47917bd2424a","year":2012},"citing_paper":{"arxiv_id":"2508.06774","last_updated":"2025-08-09T02:00:53Z","snapshot_observed_at":"2026-08-09T21:45:20.646347Z","submitted_at":"2025-08-09T02:00:53Z","title":"Approximating High-Dimensional Earth Mover's Distance as Fast as Closest Pair","version":1},"reference_index":1268,"source":"pdf_text","source_observed_at":"2026-08-05T22:49:06.248873Z"},"links":{"citing_paper":"/paper/2508.06774"},"observation_digest":"sha256:8a89147f9e8f929ffe33cccad080bd83f1bc4408076d6d040ea052c7dd7e7b52","observation_id":"088465b9-6e9e-447c-927a-cc522498accb","resolution":{"observed_at":"2026-08-05T22:49:08.736157Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T22:49:08.815236Z","title":"On a greedy heuristic for complete match- ing","venue":null,"work_id":"d1d217ce-e896-406b-9b9a-539ccc911a47","year":1991},"citing_paper":{"arxiv_id":"2508.06774","last_updated":"2025-08-09T02:00:53Z","snapshot_observed_at":"2026-08-09T21:45:20.646347Z","submitted_at":"2025-08-09T02:00:53Z","title":"Approximating High-Dimensional Earth Mover's Distance as Fast as Closest Pair","version":1},"reference_index":1991,"source":"pdf_text","source_observed_at":"2026-08-05T22:49:06.102444Z"},"links":{"citing_paper":"/paper/2508.06774"},"observation_digest":"sha256:7933c9e1a7d38c23f32389addbd69038bee7fab162aa6311d9085e91ba9a7de9","observation_id":"a5832266-1dd6-42e7-a2f3-7ddba0d6b387","resolution":{"observed_at":"2026-08-05T22:49:08.907482Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T22:49:09.155438Z","title":"Embedding lpm into l 1 n","venue":null,"work_id":"3016a70d-362d-48ad-a7f0-66ea5f23be41","year":1982},"citing_paper":{"arxiv_id":"2508.06774","last_updated":"2025-08-09T02:00:53Z","snapshot_observed_at":"2026-08-09T21:45:20.646347Z","submitted_at":"2025-08-09T02:00:53Z","title":"Approximating High-Dimensional Earth Mover's Distance as Fast as Closest Pair","version":1},"reference_index":2003,"source":"pdf_text","source_observed_at":"2026-08-05T22:49:05.671507Z"},"links":{"citing_paper":"/paper/2508.06774"},"observation_digest":"sha256:a3b5699ad32b2a4c6390a0f45556cd2d45f5f081321f5edfae41d0c2f3090158","observation_id":"e8655f06-5f91-4857-849f-694506b0f4a0","resolution":{"observed_at":"2026-08-05T22:49:09.230295Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T22:49:07.883957Z","title":"On the difference between closest, furthest, and orthogonal pairs: Nearly-linear vs barely-subquadratic complexity","venue":null,"work_id":"0f173ae5-94ff-43b3-9f57-0cdd1e63d806","year":2018},"citing_paper":{"arxiv_id":"2508.06774","last_updated":"2025-08-09T02:00:53Z","snapshot_observed_at":"2026-08-09T21:45:20.646347Z","submitted_at":"2025-08-09T02:00:53Z","title":"Approximating High-Dimensional Earth Mover's Distance as Fast as Closest Pair","version":1},"reference_index":2008,"source":"pdf_text","source_observed_at":"2026-08-05T22:49:06.615619Z"},"links":{"citing_paper":"/paper/2508.06774"},"observation_digest":"sha256:bad02417338120af67078564f9caad52fb7a7200b1d47ebad85d610db48090d4","observation_id":"f6787342-edf4-4065-b25d-f0a20ff491dc","resolution":{"observed_at":"2026-08-05T22:49:07.957032Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1501.01062","last_updated":"2015-07-16T03:37:53Z","snapshot_observed_at":"2026-08-03T01:49:33.138555Z","submitted_at":"2015-01-06T02:21:59Z","title":"Optimal Data-Dependent Hashing for Approximate Near Neighbors","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1501.01062","snapshot_observed_at":"2026-08-05T22:49:05.013753Z","title":"Optimal Data-Dependent Hashing for Ap- proximate Near Neighbors","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2508.06774","last_updated":"2025-08-09T02:00:53Z","snapshot_observed_at":"2026-08-09T21:45:20.646347Z","submitted_at":"2025-08-09T02:00:53Z","title":"Approximating High-Dimensional Earth Mover's Distance as Fast as Closest Pair","version":1},"reference_index":2009,"source":"pdf_text","source_observed_at":"2026-08-05T22:49:05.013753Z"},"links":{"cited_paper":"/paper/1501.01062","citing_paper":"/paper/2508.06774"},"observation_digest":"sha256:c1b02cbc2e40f19776d9b02b29af97239f6c1a2e88bf451062e6709a769f5c74","observation_id":"cf51f4af-abca-4e4a-ba2d-70d44f074b55","resolution":{"observed_at":"2026-08-05T22:49:05.013753Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T22:49:09.317062Z","title":"Approximate Nearest Neighbors: Towards Remov- ing the Curse of Dimensionality","venue":null,"work_id":"753606d9-ef9f-42af-9890-868aa23cc124","year":1998},"citing_paper":{"arxiv_id":"2508.06774","last_updated":"2025-08-09T02:00:53Z","snapshot_observed_at":"2026-08-09T21:45:20.646347Z","submitted_at":"2025-08-09T02:00:53Z","title":"Approximating High-Dimensional Earth Mover's Distance as Fast as Closest Pair","version":1},"reference_index":2013,"source":"pdf_text","source_observed_at":"2026-08-05T22:49:05.562241Z"},"links":{"citing_paper":"/paper/2508.06774"},"observation_digest":"sha256:dc5427d23997c891b0b501ed2d2638b120d32649b7ef7abe866da9f626a4432c","observation_id":"d8d84cb0-bc60-4183-bd86-cbb086d8d87d","resolution":{"observed_at":"2026-08-05T22:49:09.394507Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T22:49:08.378323Z","title":"Nearly maximum flows in nearly linear time","venue":null,"work_id":"94217a93-e001-4917-99ee-ff04510c8d5d","year":2013},"citing_paper":{"arxiv_id":"2508.06774","last_updated":"2025-08-09T02:00:53Z","snapshot_observed_at":"2026-08-09T21:45:20.646347Z","submitted_at":"2025-08-09T02:00:53Z","title":"Approximating High-Dimensional Earth Mover's Distance as Fast as Closest Pair","version":1},"reference_index":2015,"source":"pdf_text","source_observed_at":"2026-08-05T22:49:06.405630Z"},"links":{"citing_paper":"/paper/2508.06774"},"observation_digest":"sha256:6cb03f8c371dd026576e0bd1b07cc71407fe63e970a25095d5306a65529ae935","observation_id":"1cd181b3-620a-4ee0-baf2-99ae3d06c6f7","resolution":{"observed_at":"2026-08-05T22:49:08.447804Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T22:49:10.485320Z","title":"Faster algorithms for the geometric transportation problem","venue":null,"work_id":"80f9d600-3f84-4025-9243-66784b0fc62c","year":2017},"citing_paper":{"arxiv_id":"2508.06774","last_updated":"2025-08-09T02:00:53Z","snapshot_observed_at":"2026-08-09T21:45:20.646347Z","submitted_at":"2025-08-09T02:00:53Z","title":"Approximating High-Dimensional Earth Mover's Distance as Fast as Closest Pair","version":1},"reference_index":2016,"source":"pdf_text","source_observed_at":"2026-08-05T22:49:04.702294Z"},"links":{"citing_paper":"/paper/2508.06774"},"observation_digest":"sha256:3605ff9962c5028d0c08f3f601704b432bfd913116d83d00badd423b1dc2cd5a","observation_id":"f1ad9571-ee1a-4d67-a75c-756d0bd6068d","resolution":{"observed_at":"2026-08-05T22:49:10.551239Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T22:49:10.290072Z","title":"Deter- ministic, near-linear ε-approximation algorithm for geometric bipartite matching","venue":null,"work_id":"50c42a71-a86f-4be7-8e5b-e9e62ce76219","year":2022},"citing_paper":{"arxiv_id":"2508.06774","last_updated":"2025-08-09T02:00:53Z","snapshot_observed_at":"2026-08-09T21:45:20.646347Z","submitted_at":"2025-08-09T02:00:53Z","title":"Approximating High-Dimensional Earth Mover's Distance as Fast as Closest Pair","version":1},"reference_index":2017,"source":"pdf_text","source_observed_at":"2026-08-05T22:49:04.804762Z"},"links":{"citing_paper":"/paper/2508.06774"},"observation_digest":"sha256:b6858e34f7fe1bbd492bc6e969b693f322b17b89c0ae30fc987ec622dca9f102","observation_id":"e6b43f95-0b23-496f-a566-89dabde64bf2","resolution":{"observed_at":"2026-08-05T22:49:10.394240Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T22:49:06.017317Z","title":"Lower Bounds on the Distortion of Embedding Finite Metric Spaces in Graphs","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2508.06774","last_updated":"2025-08-09T02:00:53Z","snapshot_observed_at":"2026-08-09T21:45:20.646347Z","submitted_at":"2025-08-09T02:00:53Z","title":"Approximating High-Dimensional Earth Mover's Distance as Fast as Closest Pair","version":1},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-05T22:49:06.017317Z"},"links":{"citing_paper":"/paper/2508.06774"},"observation_digest":"sha256:ba0b163ce03856068576b1879f3aabcfe1a50fe9b9d59018a49882eedbabc5ab","observation_id":"00fa4775-41e3-43df-a201-ee8fed8e5942","resolution":{"observed_at":"2026-08-05T22:49:06.017317Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"7713.33843","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T22:49:07.414554Z","title":"Parallel approximate undirected shortest paths via low hop emulators","venue":null,"work_id":"b958fc91-e192-426e-a2cf-840517973698","year":2020},"citing_paper":{"arxiv_id":"2508.06774","last_updated":"2025-08-09T02:00:53Z","snapshot_observed_at":"2026-08-09T21:45:20.646347Z","submitted_at":"2025-08-09T02:00:53Z","title":"Approximating High-Dimensional Earth Mover's Distance as Fast as Closest Pair","version":1},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-05T22:49:05.106934Z"},"links":{"citing_paper":"/paper/2508.06774"},"observation_digest":"sha256:c708f9be5269120be52bd82dc68bb1e4418600da13d40101f028536b365efa9b","observation_id":"733c9423-d6f9-4adc-91a4-704f1790146a","resolution":{"observed_at":"2026-08-05T22:49:07.454309Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T22:49:08.976352Z","title":"Computational Optimal Transport: With Appli- cations to Data Science","venue":null,"work_id":"99db552c-81ba-45f6-afc8-ea90b5f05394","year":2019},"citing_paper":{"arxiv_id":"2508.06774","last_updated":"2025-08-09T02:00:53Z","snapshot_observed_at":"2026-08-09T21:45:20.646347Z","submitted_at":"2025-08-09T02:00:53Z","title":"Approximating High-Dimensional Earth Mover's Distance as Fast as Closest Pair","version":1},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-05T22:49:05.879350Z"},"links":{"citing_paper":"/paper/2508.06774"},"observation_digest":"sha256:320c1c394328ee48842c8ddb5663af38012860f2d776af777b346b6e9200a19f","observation_id":"45a10a4d-9d62-4af4-a53b-00f10144d395","resolution":{"observed_at":"2026-08-05T22:49:09.091226Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T22:49:10.074164Z","title":"Eu- clidean minimum spanning trees and bichromatic closest pairs","venue":null,"work_id":"5cd98a7d-74f3-4f9a-92b7-07b5a0df9187","year":1990},"citing_paper":{"arxiv_id":"2508.06774","last_updated":"2025-08-09T02:00:53Z","snapshot_observed_at":"2026-08-09T21:45:20.646347Z","submitted_at":"2025-08-09T02:00:53Z","title":"Approximating High-Dimensional Earth Mover's Distance as Fast as Closest Pair","version":1},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-05T22:49:04.943565Z"},"links":{"citing_paper":"/paper/2508.06774"},"observation_digest":"sha256:9d644be3e1a9fc4e9765cff3bd2c4599b46b686104fe29b5a6a4020fddd50460","observation_id":"8a85bb30-806f-436e-bf4f-d567ef8d1176","resolution":{"observed_at":"2026-08-05T22:49:10.175332Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T22:49:09.912724Z","title":"Similarity estimation techniques from rounding algorithms","venue":null,"work_id":"2560dbd7-4c5f-4fee-a466-0500cd0f3c84","year":2002},"citing_paper":{"arxiv_id":"2508.06774","last_updated":"2025-08-09T02:00:53Z","snapshot_observed_at":"2026-08-09T21:45:20.646347Z","submitted_at":"2025-08-09T02:00:53Z","title":"Approximating High-Dimensional Earth Mover's Distance as Fast as Closest Pair","version":1},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-05T22:49:05.217129Z"},"links":{"citing_paper":"/paper/2508.06774"},"observation_digest":"sha256:22bbe76f1df84aed46b0e0644e7e3f9e170552d6851107efdc26aa724484e696","observation_id":"43e78e15-60b3-4bda-a948-ba45a62b7291","resolution":{"observed_at":"2026-08-05T22:49:09.979514Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2508.06774","last_updated":"2025-08-09T02:00:53Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-09T21:45:20.646347Z","submitted_at":"2025-08-09T02:00:53Z","title":"Approximating High-Dimensional Earth Mover's Distance as Fast as Closest Pair"},"reference_resolution":{"displayed":20,"state_counts":{"malformed_identifier":1,"metadata_mismatch":2,"parse_uncertain":0,"unresolved":2,"verified_exact":0,"verified_fuzzy":15},"total_outbound_references":20},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"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."}