{"as_of":"2026-08-16T15:21:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b1e074f14cbb2cea43f055d51a3ae1281a214b0e3dea80fcbba1906e585e7b54","coverage":[{"denominator":29,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":29,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T12:19:29.648017Z","state":"measured"},{"denominator":30,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":30,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+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-06T16:21:13.154488Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-06T16:21:13.200645Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1908.07645","last_updated":"2020-12-28T17:43:48Z","snapshot_observed_at":"2026-08-14T22:43:01.269117Z","submitted_at":"2019-08-20T23:43:24Z","title":"K-Nearest Neighbor Approximation Via the Friend-of-a-Friend Principle","version":4},"cited_work":{"arxiv_id":"1908.07645","doi":null,"metadata_source":"pith","pith_arxiv_id":"1908.07645","snapshot_observed_at":"2026-08-06T16:21:13.200645Z","title":"K-Nearest Neighbor Approximation Via the Friend-of-a-Friend Principle","venue":"math.CO","work_id":"a6fa55b5-5839-4b21-b542-68d5314343b4","year":2019},"citing_paper":{"arxiv_id":"2507.14261","last_updated":"2025-07-18T12:53:58Z","snapshot_observed_at":"2026-08-09T14:18:20.402730Z","submitted_at":"2025-07-18T12:53:58Z","title":"FAMST: Fast Approximate Minimum Spanning Tree Construction for Large-Scale and High-Dimensional Data","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-06T16:21:13.154488Z"},"links":{"cited_paper":"/paper/1908.07645","citing_paper":"/paper/2507.14261"},"observation_digest":"sha256:af66a913ce6093f8b6d44c49bbc5a00764edbe293003c2865a572eb332f45b5a","observation_id":"694084d7-6403-42f8-a139-97279bf66518","resolution":{"observed_at":"2026-08-06T16:21:13.207922Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1908.07645/citation-record","integrity":"/paper/1908.07645/integrity","json":"/paper/1908.07645/citation-record.json","paper":"/paper/1908.07645"},"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-14T12:19:30.441667Z","title":"An extreme value theory for sequence matching","venue":null,"work_id":"dbd6f432-fabf-4f30-8207-4d6809034eba","year":1986},"citing_paper":{"arxiv_id":"1908.07645","last_updated":"2020-12-28T17:43:48Z","snapshot_observed_at":"2026-08-14T22:43:01.269117Z","submitted_at":"2019-08-20T23:43:24Z","title":"K-Nearest Neighbor Approximation Via the Friend-of-a-Friend Principle","version":4},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T12:19:29.452037Z"},"links":{"citing_paper":"/paper/1908.07645"},"observation_digest":"sha256:fe8be6ec42e7822899e727d85feb0b42c3741b1087bb11025a508e97cb2a7a36","observation_id":"ee146ec8-64a6-47e6-b299-7689a3b5c724","resolution":{"observed_at":"2026-08-14T12:19:30.447372Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T12:19:30.418403Z","title":null,"venue":null,"work_id":"3a0aa0b8-bf5e-4d5e-b9df-734a7ed0fe6e","year":1998},"citing_paper":{"arxiv_id":"1908.07645","last_updated":"2020-12-28T17:43:48Z","snapshot_observed_at":"2026-08-14T22:43:01.269117Z","submitted_at":"2019-08-20T23:43:24Z","title":"K-Nearest Neighbor Approximation Via the Friend-of-a-Friend Principle","version":4},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T12:19:29.458781Z"},"links":{"citing_paper":"/paper/1908.07645"},"observation_digest":"sha256:cfd6685f1e814bab34b029c8418a733737f7f1d6ca99eb9d74b751f99d6d3aae","observation_id":"4729ab15-1468-4c6a-803e-a56407dd1568","resolution":{"observed_at":"2026-08-14T12:19:30.427492Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T12:19:30.394539Z","title":"An LCS-based string metric","venue":null,"work_id":"f1a1f5c1-f5c2-4355-ae25-afc9bea4fa35","year":2009},"citing_paper":{"arxiv_id":"1908.07645","last_updated":"2020-12-28T17:43:48Z","snapshot_observed_at":"2026-08-14T22:43:01.269117Z","submitted_at":"2019-08-20T23:43:24Z","title":"K-Nearest Neighbor Approximation Via the Friend-of-a-Friend Principle","version":4},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T12:19:29.466816Z"},"links":{"citing_paper":"/paper/1908.07645"},"observation_digest":"sha256:244d527c1e6acd4716f77ddbefcfae9abc72fb7e33b75e5ad36e7cc9180df71e","observation_id":"84eb5429-0fa2-4b21-8693-dcf02e08ac99","resolution":{"observed_at":"2026-08-14T12:19:30.403739Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T12:19:30.375264Z","title":null,"venue":null,"work_id":"bf34cb54-aa2a-45e1-ac5c-2778de465a08","year":2019},"citing_paper":{"arxiv_id":"1908.07645","last_updated":"2020-12-28T17:43:48Z","snapshot_observed_at":"2026-08-14T22:43:01.269117Z","submitted_at":"2019-08-20T23:43:24Z","title":"K-Nearest Neighbor Approximation Via the Friend-of-a-Friend Principle","version":4},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T12:19:29.475951Z"},"links":{"citing_paper":"/paper/1908.07645"},"observation_digest":"sha256:adb07d8fe497476a2d3572bdd641eea9ac72eda14004eb491420fae9c4cf63b0","observation_id":"7a21badc-0825-4728-b57c-cc617fd9cba2","resolution":{"observed_at":"2026-08-14T12:19:30.380536Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T12:19:30.347140Z","title":"Benchmarks of approximate nearest neighbor libraries in Python","venue":null,"work_id":"031361a8-4e21-4d7e-9f1e-81806376a91a","year":null},"citing_paper":{"arxiv_id":"1908.07645","last_updated":"2020-12-28T17:43:48Z","snapshot_observed_at":"2026-08-14T22:43:01.269117Z","submitted_at":"2019-08-20T23:43:24Z","title":"K-Nearest Neighbor Approximation Via the Friend-of-a-Friend Principle","version":4},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T12:19:29.485452Z"},"links":{"citing_paper":"/paper/1908.07645"},"observation_digest":"sha256:50e319c97efe730239971eba319469e3f94e67f8a275152a89bb023ae01e9e0b","observation_id":"50230839-db52-411a-8f81-0b65faa99b17","resolution":{"observed_at":"2026-08-14T12:19:30.353194Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T12:19:30.322080Z","title":"Bollob´ as; W","venue":null,"work_id":"b4ee11e6-2f1e-43f2-8ebc-da672a45429c","year":1982},"citing_paper":{"arxiv_id":"1908.07645","last_updated":"2020-12-28T17:43:48Z","snapshot_observed_at":"2026-08-14T22:43:01.269117Z","submitted_at":"2019-08-20T23:43:24Z","title":"K-Nearest Neighbor Approximation Via the Friend-of-a-Friend Principle","version":4},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T12:19:29.493744Z"},"links":{"citing_paper":"/paper/1908.07645"},"observation_digest":"sha256:6c353a66ddc3b2f7ac107103b26a696f7046c3a40bfa6cd11d9417fdf1a3f0ca","observation_id":"1f368ee3-9ded-4c5e-bed6-02e249fe2453","resolution":{"observed_at":"2026-08-14T12:19:30.328922Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T12:19:30.302065Z","title":"Experiments with comparator-based nearest neighbor descent","venue":null,"work_id":"b2a85273-d478-484b-a38a-24bcb44cb735","year":2020},"citing_paper":{"arxiv_id":"1908.07645","last_updated":"2020-12-28T17:43:48Z","snapshot_observed_at":"2026-08-14T22:43:01.269117Z","submitted_at":"2019-08-20T23:43:24Z","title":"K-Nearest Neighbor Approximation Via the Friend-of-a-Friend Principle","version":4},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T12:19:29.499655Z"},"links":{"citing_paper":"/paper/1908.07645"},"observation_digest":"sha256:a7b2a1c2bd4ac011f6e7c92fe27aaf7d7c3559453a7ecaa673cbec150b146c1a","observation_id":"7f4e59e8-6653-425e-b6be-0a00480fa03c","resolution":{"observed_at":"2026-08-14T12:19:30.308987Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T12:19:30.244900Z","title":"prank2xy: Clustering and low dimensional projection of ranking systems","venue":null,"work_id":"e41ada9e-0987-42c2-a697-86c15f82989d","year":2020},"citing_paper":{"arxiv_id":"1908.07645","last_updated":"2020-12-28T17:43:48Z","snapshot_observed_at":"2026-08-14T22:43:01.269117Z","submitted_at":"2019-08-20T23:43:24Z","title":"K-Nearest Neighbor Approximation Via the Friend-of-a-Friend Principle","version":4},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T12:19:29.506265Z"},"links":{"citing_paper":"/paper/1908.07645"},"observation_digest":"sha256:9b4b5f0731c930b999045f543830b2e2d156672910f4aa09defdf922ed8042a4","observation_id":"d2629ff7-0255-4184-be5c-55d9312824a3","resolution":{"observed_at":"2026-08-14T12:19:30.286603Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T12:19:30.222938Z","title":"Mirrokni","venue":null,"work_id":"c59202d5-0a7d-4eb1-b850-8557c56ab13a","year":2004},"citing_paper":{"arxiv_id":"1908.07645","last_updated":"2020-12-28T17:43:48Z","snapshot_observed_at":"2026-08-14T22:43:01.269117Z","submitted_at":"2019-08-20T23:43:24Z","title":"K-Nearest Neighbor Approximation Via the Friend-of-a-Friend Principle","version":4},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T12:19:29.512482Z"},"links":{"citing_paper":"/paper/1908.07645"},"observation_digest":"sha256:98a58c96cc5630ab904f37667b67a83319f007e1bed7e06c8eaf1868dca4c120","observation_id":"d20fced0-e44e-49e1-9b66-c8342b64c226","resolution":{"observed_at":"2026-08-14T12:19:30.228486Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T12:19:30.199916Z","title":"A Probabilistic Theory of Pattern Recognition","venue":null,"work_id":"ae9490ab-6338-4983-8afe-973eb25c473a","year":2013},"citing_paper":{"arxiv_id":"1908.07645","last_updated":"2020-12-28T17:43:48Z","snapshot_observed_at":"2026-08-14T22:43:01.269117Z","submitted_at":"2019-08-20T23:43:24Z","title":"K-Nearest Neighbor Approximation Via the Friend-of-a-Friend Principle","version":4},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-14T12:19:29.517868Z"},"links":{"citing_paper":"/paper/1908.07645"},"observation_digest":"sha256:6e9d8b6d00f129af1c7551a5707aacba825154b8bc0edb99d99de9608acf215c","observation_id":"32d7c7d8-7fa9-468c-a678-da3b244c9003","resolution":{"observed_at":"2026-08-14T12:19:30.205735Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T12:19:30.180431Z","title":"Efficient k-nearest neighbor graph construction for generic simi- larity measures","venue":null,"work_id":"5934e2a5-ad9a-4865-9953-ac1e7fcb37f2","year":2011},"citing_paper":{"arxiv_id":"1908.07645","last_updated":"2020-12-28T17:43:48Z","snapshot_observed_at":"2026-08-14T22:43:01.269117Z","submitted_at":"2019-08-20T23:43:24Z","title":"K-Nearest Neighbor Approximation Via the Friend-of-a-Friend Principle","version":4},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-14T12:19:29.524066Z"},"links":{"citing_paper":"/paper/1908.07645"},"observation_digest":"sha256:95b5e62e1f83b672f8b35b4b747bba12c2258eae2134d7ab09730ad918c31822","observation_id":"ba5c8ac7-143c-49e1-8c15-87de5ad07226","resolution":{"observed_at":"2026-08-14T12:19:30.186485Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T12:19:30.157369Z","title":"Ester; H.-P","venue":null,"work_id":"bbcc1ba4-08f0-463e-9cef-17f92eb8b1de","year":1996},"citing_paper":{"arxiv_id":"1908.07645","last_updated":"2020-12-28T17:43:48Z","snapshot_observed_at":"2026-08-14T22:43:01.269117Z","submitted_at":"2019-08-20T23:43:24Z","title":"K-Nearest Neighbor Approximation Via the Friend-of-a-Friend Principle","version":4},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T12:19:29.529968Z"},"links":{"citing_paper":"/paper/1908.07645"},"observation_digest":"sha256:b22771cb154dbc035e4c5d04f56b39791577743075a5802a08a603522cfbbe96","observation_id":"1b5d8a35-00a4-4ea2-8423-f755f7a89cff","resolution":{"observed_at":"2026-08-14T12:19:30.164536Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T12:19:30.129213Z","title":"The diameter of sparse random graphs","venue":null,"work_id":"1cd2970c-c5c2-491f-b523-893130a10911","year":2007},"citing_paper":{"arxiv_id":"1908.07645","last_updated":"2020-12-28T17:43:48Z","snapshot_observed_at":"2026-08-14T22:43:01.269117Z","submitted_at":"2019-08-20T23:43:24Z","title":"K-Nearest Neighbor Approximation Via the Friend-of-a-Friend Principle","version":4},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-14T12:19:29.537820Z"},"links":{"citing_paper":"/paper/1908.07645"},"observation_digest":"sha256:856f1af67072e503f4e668162875858ee6aa52e1fb8a2b30221ecba3bb3ac63e","observation_id":"6bfb3f33-cf3c-44df-9c33-11555f732194","resolution":{"observed_at":"2026-08-14T12:19:30.138415Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T12:19:30.110916Z","title":"Goyal; Y","venue":null,"work_id":"3216b130-387e-47f0-a2ce-0a9d4f984d86","year":2008},"citing_paper":{"arxiv_id":"1908.07645","last_updated":"2020-12-28T17:43:48Z","snapshot_observed_at":"2026-08-14T22:43:01.269117Z","submitted_at":"2019-08-20T23:43:24Z","title":"K-Nearest Neighbor Approximation Via the Friend-of-a-Friend Principle","version":4},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-14T12:19:29.545151Z"},"links":{"citing_paper":"/paper/1908.07645"},"observation_digest":"sha256:0888a6949250a8e9087ac0364a7756f4697d46914436833b24fea371f5676cab","observation_id":"3afe7843-f6f4-4517-85e0-2e29dd93c5b3","resolution":{"observed_at":"2026-08-14T12:19:30.116715Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1704.01460","last_updated":"2017-04-05T14:54:28Z","snapshot_observed_at":"2026-08-14T21:08:10.184954Z","submitted_at":"2017-04-05T14:54:28Z","title":"Comparison Based Nearest Neighbor Search","version":1},"cited_work":{"arxiv_id":"1704.01460","doi":null,"metadata_source":"pith","pith_arxiv_id":"1704.01460","snapshot_observed_at":"2026-08-14T12:19:29.738557Z","title":"Comparison Based Nearest Neighbor Search","venue":"stat.ML","work_id":"545fe103-c8a5-4887-bc41-f5928dc5fc95","year":2017},"citing_paper":{"arxiv_id":"1908.07645","last_updated":"2020-12-28T17:43:48Z","snapshot_observed_at":"2026-08-14T22:43:01.269117Z","submitted_at":"2019-08-20T23:43:24Z","title":"K-Nearest Neighbor Approximation Via the Friend-of-a-Friend Principle","version":4},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-14T12:19:29.551955Z"},"links":{"cited_paper":"/paper/1704.01460","citing_paper":"/paper/1908.07645"},"observation_digest":"sha256:e3298a95d57adc779de6f517c7bbfc845243e192de064ace477bed323d8fd711","observation_id":"79d52003-8db9-42d3-bf51-8d5773455515","resolution":{"observed_at":"2026-08-14T12:19:29.750343Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T12:19:30.087614Z","title":"Houle; Michael Nett","venue":null,"work_id":"c2f84539-e4c5-4e4a-a02e-b8dd3de11048","year":2015},"citing_paper":{"arxiv_id":"1908.07645","last_updated":"2020-12-28T17:43:48Z","snapshot_observed_at":"2026-08-14T22:43:01.269117Z","submitted_at":"2019-08-20T23:43:24Z","title":"K-Nearest Neighbor Approximation Via the Friend-of-a-Friend Principle","version":4},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-14T12:19:29.559115Z"},"links":{"citing_paper":"/paper/1908.07645"},"observation_digest":"sha256:99079260a8b49ac54891513f362c7f0926e7a709e7da64e032bdbe464987cd67","observation_id":"e7bf821a-2b7d-40e2-8001-7ee47a3cc14f","resolution":{"observed_at":"2026-08-14T12:19:30.094218Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T12:19:30.060116Z","title":"Fast perfect sampling from linear extensions","venue":null,"work_id":"91db06f6-15ef-4b68-bc98-8d672e4d91f3","year":2006},"citing_paper":{"arxiv_id":"1908.07645","last_updated":"2020-12-28T17:43:48Z","snapshot_observed_at":"2026-08-14T22:43:01.269117Z","submitted_at":"2019-08-20T23:43:24Z","title":"K-Nearest Neighbor Approximation Via the Friend-of-a-Friend Principle","version":4},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-14T12:19:29.566392Z"},"links":{"citing_paper":"/paper/1908.07645"},"observation_digest":"sha256:746d853f86859ac78e8e306cc6ffec814dea612cd211983cb967921f264e21af","observation_id":"f305754f-b0ba-4b58-8525-aca57e4affb2","resolution":{"observed_at":"2026-08-14T12:19:30.069772Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T12:19:30.033336Z","title":"Indyk; R","venue":null,"work_id":"b4d08cac-a1c6-45b1-97f6-285f6ae6e125","year":1998},"citing_paper":{"arxiv_id":"1908.07645","last_updated":"2020-12-28T17:43:48Z","snapshot_observed_at":"2026-08-14T22:43:01.269117Z","submitted_at":"2019-08-20T23:43:24Z","title":"K-Nearest Neighbor Approximation Via the Friend-of-a-Friend Principle","version":4},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-14T12:19:29.575300Z"},"links":{"citing_paper":"/paper/1908.07645"},"observation_digest":"sha256:8437bc012254f88e5d44b3da6df2ec5e345568da3ac5601dc401c3d82d909a70","observation_id":"27eb4c45-f905-44f5-8d15-3531386c0631","resolution":{"observed_at":"2026-08-14T12:19:30.043568Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T12:19:30.008446Z","title":"Foundations of Modern Probability , 2nd ed","venue":null,"work_id":"bb36d23c-e07a-493d-8bfd-da7e88fb7bef","year":2001},"citing_paper":{"arxiv_id":"1908.07645","last_updated":"2020-12-28T17:43:48Z","snapshot_observed_at":"2026-08-14T22:43:01.269117Z","submitted_at":"2019-08-20T23:43:24Z","title":"K-Nearest Neighbor Approximation Via the Friend-of-a-Friend Principle","version":4},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-14T12:19:29.582633Z"},"links":{"citing_paper":"/paper/1908.07645"},"observation_digest":"sha256:87d870cf8812bfeea23d4ab522274a2f74bec3af02f7c02bcc393cfd0b0e698b","observation_id":"9e7614f6-bec3-4c83-8a9a-5e9472080fe5","resolution":{"observed_at":"2026-08-14T12:19:30.017949Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T12:19:29.979126Z","title":"Kleindessner; U","venue":null,"work_id":"e66a5276-7a03-4124-aa63-6cd533013ac2","year":2014},"citing_paper":{"arxiv_id":"1908.07645","last_updated":"2020-12-28T17:43:48Z","snapshot_observed_at":"2026-08-14T22:43:01.269117Z","submitted_at":"2019-08-20T23:43:24Z","title":"K-Nearest Neighbor Approximation Via the Friend-of-a-Friend Principle","version":4},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-14T12:19:29.588619Z"},"links":{"citing_paper":"/paper/1908.07645"},"observation_digest":"sha256:50da159920e032b0520f1ae8f2734c0949cd5118260d6acae41e6a252300d0af","observation_id":"afe50024-58f8-4575-82d8-42e0a8e089cf","resolution":{"observed_at":"2026-08-14T12:19:29.986047Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T12:19:29.940998Z","title":"Kleindessner; U","venue":null,"work_id":"802ab0ec-607b-478e-acc4-65dcb88693f0","year":2017},"citing_paper":{"arxiv_id":"1908.07645","last_updated":"2020-12-28T17:43:48Z","snapshot_observed_at":"2026-08-14T22:43:01.269117Z","submitted_at":"2019-08-20T23:43:24Z","title":"K-Nearest Neighbor Approximation Via the Friend-of-a-Friend Principle","version":4},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-14T12:19:29.594408Z"},"links":{"citing_paper":"/paper/1908.07645"},"observation_digest":"sha256:9c23cc2ef08483c3f4d1f502e283ed51e2f9d4e5ab31bd04b2d3e1a742b19b86","observation_id":"32233408-697e-4327-8c31-cb48e2abb62e","resolution":{"observed_at":"2026-08-14T12:19:29.956706Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T12:19:29.919660Z","title":"Krivelevich","venue":null,"work_id":"54d49c45-31d4-4b09-a700-dabdbf293d15","year":2019},"citing_paper":{"arxiv_id":"1908.07645","last_updated":"2020-12-28T17:43:48Z","snapshot_observed_at":"2026-08-14T22:43:01.269117Z","submitted_at":"2019-08-20T23:43:24Z","title":"K-Nearest Neighbor Approximation Via the Friend-of-a-Friend Principle","version":4},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-14T12:19:29.599716Z"},"links":{"citing_paper":"/paper/1908.07645"},"observation_digest":"sha256:3973c666c5ea56833135ef3bbaa0c01d54ff87917d7ca4e4a2fb17dba06cf550","observation_id":"242ea45e-2ad2-4f2a-a16f-8a764f88bb90","resolution":{"observed_at":"2026-08-14T12:19:29.926267Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T12:19:29.888974Z","title":"pynndescent: A Python nearest neighbor descent for approximate nearest neigh- bors","venue":null,"work_id":"4a0c465c-d6c9-4535-89ae-c5be2470e635","year":2018},"citing_paper":{"arxiv_id":"1908.07645","last_updated":"2020-12-28T17:43:48Z","snapshot_observed_at":"2026-08-14T22:43:01.269117Z","submitted_at":"2019-08-20T23:43:24Z","title":"K-Nearest Neighbor Approximation Via the Friend-of-a-Friend Principle","version":4},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-14T12:19:29.605179Z"},"links":{"citing_paper":"/paper/1908.07645"},"observation_digest":"sha256:81dd217fad64e22cf4042dfcd3585d13de8aae59b85016c890de5ab6a20f6b28","observation_id":"69a57df9-46fd-4661-bae1-000aecbc361a","resolution":{"observed_at":"2026-08-14T12:19:29.896628Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1802.03426","last_updated":"2020-09-18T01:56:41Z","snapshot_observed_at":"2026-08-02T15:32:07.466568Z","submitted_at":"2018-02-09T19:39:33Z","title":"UMAP: Uniform Manifold Approximation and Projection for Dimension Reduction","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1802.03426","snapshot_observed_at":"2026-08-14T12:19:29.614325Z","title":"UMAP: uniform manifold approximation and projection for dimension reduction","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"1908.07645","last_updated":"2020-12-28T17:43:48Z","snapshot_observed_at":"2026-08-14T22:43:01.269117Z","submitted_at":"2019-08-20T23:43:24Z","title":"K-Nearest Neighbor Approximation Via the Friend-of-a-Friend Principle","version":4},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-14T12:19:29.614325Z"},"links":{"cited_paper":"/paper/1802.03426","citing_paper":"/paper/1908.07645"},"observation_digest":"sha256:46d9f1edd9ed49bfa69d7dde56ead6a3bec855e63c6e41451876ed2a523bcefb","observation_id":"5e0f36f8-85b3-4799-ad77-a6366c23c541","resolution":{"observed_at":"2026-08-14T12:19:29.614325Z","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-14T12:19:29.865777Z","title":null,"venue":null,"work_id":"c01851e6-7c36-44b4-b381-9a9ae7be256c","year":2014},"citing_paper":{"arxiv_id":"1908.07645","last_updated":"2020-12-28T17:43:48Z","snapshot_observed_at":"2026-08-14T22:43:01.269117Z","submitted_at":"2019-08-20T23:43:24Z","title":"K-Nearest Neighbor Approximation Via the Friend-of-a-Friend Principle","version":4},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-14T12:19:29.621551Z"},"links":{"citing_paper":"/paper/1908.07645"},"observation_digest":"sha256:1bcadef3412a02e71b5144ada601bcdf65b3b4330bb291b967ef1733a5f1d90d","observation_id":"34b191dd-09fd-4b83-b5bc-fa7616c4f708","resolution":{"observed_at":"2026-08-14T12:19:29.872053Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T12:19:29.840490Z","title":"McKay; R","venue":null,"work_id":"32797fcf-4427-4876-81ea-9e5bd227ac3f","year":1995},"citing_paper":{"arxiv_id":"1908.07645","last_updated":"2020-12-28T17:43:48Z","snapshot_observed_at":"2026-08-14T22:43:01.269117Z","submitted_at":"2019-08-20T23:43:24Z","title":"K-Nearest Neighbor Approximation Via the Friend-of-a-Friend Principle","version":4},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-14T12:19:29.627614Z"},"links":{"citing_paper":"/paper/1908.07645"},"observation_digest":"sha256:c2c89d4820ffc09244668214561c11865d361ad4a6302bfd0937e2a8579b678e","observation_id":"2f25cca0-3703-4202-bf3f-ba78933d7af1","resolution":{"observed_at":"2026-08-14T12:19:29.849459Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T12:19:29.822113Z","title":"Tschopp; S","venue":null,"work_id":"78b9f3ce-127b-4d91-aa9c-96fe49a5d5c2","year":2011},"citing_paper":{"arxiv_id":"1908.07645","last_updated":"2020-12-28T17:43:48Z","snapshot_observed_at":"2026-08-14T22:43:01.269117Z","submitted_at":"2019-08-20T23:43:24Z","title":"K-Nearest Neighbor Approximation Via the Friend-of-a-Friend Principle","version":4},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-14T12:19:29.634571Z"},"links":{"citing_paper":"/paper/1908.07645"},"observation_digest":"sha256:bff065dcd1814ad7417143d6ce0800fe2d39b05f8ff8d81497fa99a109aed35f","observation_id":"e3676f69-ee3e-40f7-b4da-a5ccd0d63973","resolution":{"observed_at":"2026-08-14T12:19:29.827759Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T12:19:29.801330Z","title":null,"venue":null,"work_id":"34e6d445-8f92-4738-a92f-5044edf023cf","year":2012},"citing_paper":{"arxiv_id":"1908.07645","last_updated":"2020-12-28T17:43:48Z","snapshot_observed_at":"2026-08-14T22:43:01.269117Z","submitted_at":"2019-08-20T23:43:24Z","title":"K-Nearest Neighbor Approximation Via the Friend-of-a-Friend Principle","version":4},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-14T12:19:29.641030Z"},"links":{"citing_paper":"/paper/1908.07645"},"observation_digest":"sha256:7b181cdcd0dd382b4fb8db80fb10d2af79ccc36f6741937762e7c4b52c6d59a2","observation_id":"dc476623-ba2b-451e-917b-46fc9a2ef5bd","resolution":{"observed_at":"2026-08-14T12:19:29.807865Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T12:19:29.771964Z","title":null,"venue":null,"work_id":"bdc5e55e-f420-4c1e-8e1d-b5d759e9ac19","year":2001},"citing_paper":{"arxiv_id":"1908.07645","last_updated":"2020-12-28T17:43:48Z","snapshot_observed_at":"2026-08-14T22:43:01.269117Z","submitted_at":"2019-08-20T23:43:24Z","title":"K-Nearest Neighbor Approximation Via the Friend-of-a-Friend Principle","version":4},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-14T12:19:29.648017Z"},"links":{"citing_paper":"/paper/1908.07645"},"observation_digest":"sha256:f613eb2ac1526b0aea6789a234a13cb32e2080b0499a024ffe38213f36709d0b","observation_id":"9d1434d6-b703-49e1-95cb-28ae43d59d99","resolution":{"observed_at":"2026-08-14T12:19:29.785056Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"1908.07645","last_updated":"2020-12-28T17:43:48Z","latest_version":4,"primary_category":"math.CO","snapshot_observed_at":"2026-08-14T22:43:01.269117Z","submitted_at":"2019-08-20T23:43:24Z","title":"K-Nearest Neighbor Approximation Via the Friend-of-a-Friend Principle"},"reference_resolution":{"displayed":29,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":6,"verified_exact":1,"verified_fuzzy":22},"total_outbound_references":29},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 29 of 29 outbound references and 1 inbound Pith citation observation for arXiv:1908.07645."}