{"as_of":"2026-08-16T15:33:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:6cd096de3c490e93d2aab9b5560778c52ba6064d94267ff810e6203a7dd4ee00","coverage":[{"denominator":27,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":27,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T16:21:13.166098Z","state":"measured"},{"denominator":27,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":27,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"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":[],"links":{"evidence":"/evidence","html":"/paper/2507.14261/citation-record","integrity":"/paper/2507.14261/integrity","json":"/paper/2507.14261/citation-record.json","paper":"/paper/2507.14261"},"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-06T16:21:13.576201Z","title":"A comprehensive survey of clustering algorithms,","venue":null,"work_id":"f43d40c6-629d-4522-9446-8849d79c32d8","year":2015},"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":1,"source":"pdf_text","source_observed_at":"2026-08-06T16:21:13.065031Z"},"links":{"citing_paper":"/paper/2507.14261"},"observation_digest":"sha256:204217e9c2aac6c34ea0d0703f22821ec9d4c014781ccd2556594b971986817f","observation_id":"2a9467b0-9617-42bb-bc05-b583daee18bb","resolution":{"observed_at":"2026-08-06T16:21:13.580615Z","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-06T16:21:13.561765Z","title":"A survey on large datasets minimum spanning trees,","venue":null,"work_id":"120d1bf5-6e4a-4835-9e21-f402ebf4e290","year":2022},"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":2,"source":"pdf_text","source_observed_at":"2026-08-06T16:21:13.069622Z"},"links":{"citing_paper":"/paper/2507.14261"},"observation_digest":"sha256:0fb90b61c4a8599454fcdc5a59ed972aa91b6dd82acb58d041cad194366c71f9","observation_id":"9851184f-a027-436a-9bee-f45a3a31b601","resolution":{"observed_at":"2026-08-06T16:21:13.566067Z","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-06T16:21:13.547617Z","title":"Fast euclidean minimum spanning tree: algorithm, analysis, and applications,","venue":null,"work_id":"c6785b02-54e1-4c1d-951f-3bdede2a887f","year":2010},"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":3,"source":"pdf_text","source_observed_at":"2026-08-06T16:21:13.073752Z"},"links":{"citing_paper":"/paper/2507.14261"},"observation_digest":"sha256:2bfb76359ab47d49a69da07d178b88b1c184c5b96df47acbd814e7e9470452ed","observation_id":"a390904f-6a32-4f74-ad2d-406e6f2eeef7","resolution":{"observed_at":"2026-08-06T16:21:13.552130Z","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":"2502.12993","last_updated":"2025-02-18T16:13:46Z","snapshot_observed_at":"2026-08-16T12:57:16.126569Z","submitted_at":"2025-02-18T16:13:46Z","title":"Approximate Tree Completion and Learning-Augmented Algorithms for Metric Minimum Spanning Trees","version":1},"cited_work":{"arxiv_id":"2502.12993","doi":null,"metadata_source":"pith","pith_arxiv_id":"2502.12993","snapshot_observed_at":"2026-08-06T16:21:13.243976Z","title":"Approximate Tree Completion and Learning-Augmented Algorithms for Metric Minimum Spanning Trees","venue":"cs.DS","work_id":"1d68a6ae-7d60-449b-afac-09ef3b438847","year":2025},"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":4,"source":"pdf_text","source_observed_at":"2026-08-06T16:21:13.077839Z"},"links":{"cited_paper":"/paper/2502.12993","citing_paper":"/paper/2507.14261"},"observation_digest":"sha256:686325b12ec835dded9a8488e1ec8bf8eee09ec28288e10c955630f1026d13ff","observation_id":"c8610172-6c83-4b00-9e91-37c6d055b2f8","resolution":{"observed_at":"2026-08-06T16:21:13.248258Z","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-06T16:21:13.533562Z","title":"New algorithms for efficient high-dimensional nonpara- metric classification.,","venue":null,"work_id":"6b9d1bcf-66d4-44ae-9405-73f99e13d6d1","year":2006},"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":5,"source":"pdf_text","source_observed_at":"2026-08-06T16:21:13.082422Z"},"links":{"citing_paper":"/paper/2507.14261"},"observation_digest":"sha256:491b51b5b51b3a4c31a6585694c2ed51d8d4c3f9767b668f896170617c328c0f","observation_id":"de734d4d-40fc-4080-8a8e-b660bd638f9a","resolution":{"observed_at":"2026-08-06T16:21:13.537740Z","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-06T16:21:13.519266Z","title":"Nearest-neighbor search on a time budget via max-margin trees,","venue":null,"work_id":"fe974aba-c372-47a8-952d-da1daf75fc31","year":2012},"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":6,"source":"pdf_text","source_observed_at":"2026-08-06T16:21:13.086452Z"},"links":{"citing_paper":"/paper/2507.14261"},"observation_digest":"sha256:9a02dd469f7e418ccd489186795229b7086bf1c5ebfd3ff5f346dc0ed822aead","observation_id":"ae175e2d-0cda-46e8-9200-8c9d8705eb32","resolution":{"observed_at":"2026-08-06T16:21:13.523563Z","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-06T16:21:13.504565Z","title":"Revisiting kd-tree for nearest neighbor search,","venue":null,"work_id":"6a6a2cf6-652e-437a-b28b-4410f40f6f8f","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":7,"source":"pdf_text","source_observed_at":"2026-08-06T16:21:13.090763Z"},"links":{"citing_paper":"/paper/2507.14261"},"observation_digest":"sha256:d192ce0afa7d8226333457318d52e7f0ed490f2459c895af436600cf3ac85d25","observation_id":"f167db1d-c820-4b0a-b38b-d7d81ee4b19a","resolution":{"observed_at":"2026-08-06T16:21:13.509244Z","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-06T16:21:13.491120Z","title":"Insights into efficient k-nearest neighbor clas- sification with convolutional neural codes,","venue":null,"work_id":"2c3715b8-e42a-4a21-a471-7cd99f13ea65","year":2020},"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":8,"source":"pdf_text","source_observed_at":"2026-08-06T16:21:13.094583Z"},"links":{"citing_paper":"/paper/2507.14261"},"observation_digest":"sha256:fb2a481117cfef1793a77e7a9f07445cd97f69dddd472add0ebef369d28bc7cf","observation_id":"5b5505ee-022e-4283-8764-9e0aced80c77","resolution":{"observed_at":"2026-08-06T16:21:13.495395Z","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-06T16:21:13.477194Z","title":"A divide-and-conquer approach for minimum spanning tree- based clustering,","venue":null,"work_id":"7294b897-2002-48e2-9da7-8505af6ee6d2","year":2009},"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":9,"source":"pdf_text","source_observed_at":"2026-08-06T16:21:13.098483Z"},"links":{"citing_paper":"/paper/2507.14261"},"observation_digest":"sha256:1da7db15b3d20d3faa994fa2099e264482de33015a7b959995bb39abcb48d932","observation_id":"6bc07fb9-ea86-4aaa-b743-939967f18792","resolution":{"observed_at":"2026-08-06T16:21:13.481525Z","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-06T16:21:13.463126Z","title":"A fast minimum spanning tree algorithm based on k-means,","venue":null,"work_id":"88229f3e-e252-4c7f-9b62-ea32d53e4b85","year":2015},"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":10,"source":"pdf_text","source_observed_at":"2026-08-06T16:21:13.102156Z"},"links":{"citing_paper":"/paper/2507.14261"},"observation_digest":"sha256:c5c7a5979711010367d34b5f6e3f6802bc9011aa99f21e7e156a4b95f6c5c60b","observation_id":"f5018001-43b4-404f-9b6b-01450eea4315","resolution":{"observed_at":"2026-08-06T16:21:13.467353Z","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-06T16:21:13.449036Z","title":"Fast approximate minimum spanning tree based clustering algorithm,","venue":null,"work_id":"520e4e8c-ebdc-4a6c-9224-505b19210c7d","year":2018},"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":11,"source":"pdf_text","source_observed_at":"2026-08-06T16:21:13.105791Z"},"links":{"citing_paper":"/paper/2507.14261"},"observation_digest":"sha256:fe837ed21f9255e113ee6b98afca0fa2a1e382107fa88a30b777ee5f2b195f7e","observation_id":"9ee97fee-1bb6-4c86-b88c-05744acd6a53","resolution":{"observed_at":"2026-08-06T16:21:13.453108Z","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-06T16:21:13.434315Z","title":"kMiST: A kd-tree based fast minimum spanning tree algorithm,","venue":null,"work_id":"4e1e3ec1-85df-4ef2-aa63-4fa595b8d2a2","year":2024},"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":12,"source":"pdf_text","source_observed_at":"2026-08-06T16:21:13.109430Z"},"links":{"citing_paper":"/paper/2507.14261"},"observation_digest":"sha256:d7158b859a3ec0085a3a6b59df47a7a7cdccbf3aebcb971781fa0b7b5968ce6d","observation_id":"63404a0f-3020-41af-999e-9e6cf939a8d5","resolution":{"observed_at":"2026-08-06T16:21:13.438887Z","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-06T16:21:13.419114Z","title":"Fast parallel algorithms for euclidean minimum spanning tree and hierarchical spatial clustering,","venue":null,"work_id":"bb539052-5600-4f64-92a3-ccd608761440","year":2021},"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":13,"source":"pdf_text","source_observed_at":"2026-08-06T16:21:13.113538Z"},"links":{"citing_paper":"/paper/2507.14261"},"observation_digest":"sha256:b026dfe67f0f591b1269d18b3130bbdabaaa65dce27e6afe507437422e21fb52","observation_id":"e8452bf7-8f52-4cbd-b5ae-3f115f998c32","resolution":{"observed_at":"2026-08-06T16:21:13.423601Z","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-06T16:21:13.405486Z","title":"A decomposition of multidimensional point sets with applications to k-nearest-neighbors and n-body potential fields,","venue":null,"work_id":"fa3f564d-05c0-432c-9244-487675bce81c","year":1995},"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":14,"source":"pdf_text","source_observed_at":"2026-08-06T16:21:13.117240Z"},"links":{"citing_paper":"/paper/2507.14261"},"observation_digest":"sha256:1ab96e7e1c6b4427d501b4ed7aacdd027f6b60796f27a47c1389ca7f7e868cd7","observation_id":"9ced803e-f687-4796-8b1c-6cc5e57d737f","resolution":{"observed_at":"2026-08-06T16:21:13.409801Z","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-06T16:21:13.391946Z","title":"I/o-efficient well-separated pair decom- position and applications,","venue":null,"work_id":"99e86aa0-03d6-4275-af42-63898cc56617","year":2006},"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":15,"source":"pdf_text","source_observed_at":"2026-08-06T16:21:13.120947Z"},"links":{"citing_paper":"/paper/2507.14261"},"observation_digest":"sha256:3bb281924f6196bb53327015b7ac32552e73c8ed81de289965531e82390d73ea","observation_id":"dd37979d-11f4-4a77-85bd-c31cf6206eb7","resolution":{"observed_at":"2026-08-06T16:21:13.396531Z","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-06T16:21:13.378807Z","title":"Fast and memory-efficient approximate minimum spanning tree generation for large datasets,","venue":null,"work_id":"719bd68f-754d-45dd-815e-5980ad68085e","year":2025},"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":16,"source":"pdf_text","source_observed_at":"2026-08-06T16:21:13.125192Z"},"links":{"citing_paper":"/paper/2507.14261"},"observation_digest":"sha256:459641f06fcddc6d8335f6be9fc0d05e4d404cf4ec55351da5e57ee81f8a0632","observation_id":"6381129e-3d0a-4304-8132-23a98cf1a12d","resolution":{"observed_at":"2026-08-06T16:21:13.383082Z","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-06T16:21:13.366225Z","title":"Approximate nearest neighbor algorithm based on navigable small world graphs,","venue":null,"work_id":"b5852dd6-9e2b-452b-9d16-8bbefb006ab8","year":2014},"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":17,"source":"pdf_text","source_observed_at":"2026-08-06T16:21:13.128797Z"},"links":{"citing_paper":"/paper/2507.14261"},"observation_digest":"sha256:3038a3f0f0e67cb05eae6464534e25dbb10758a6007e5361e4f2cdf467974421","observation_id":"a7beb4c8-db74-490e-b995-9cd867dfa041","resolution":{"observed_at":"2026-08-06T16:21:13.370044Z","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-06T16:21:13.353113Z","title":"Efficient and robust approximate nearest neighbor search using hier- archical navigable small world graphs,","venue":null,"work_id":"8f2dbd87-5d61-45c0-9cb0-cba274a06e56","year":2018},"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":18,"source":"pdf_text","source_observed_at":"2026-08-06T16:21:13.132271Z"},"links":{"citing_paper":"/paper/2507.14261"},"observation_digest":"sha256:67cc57663aec62fc12d4cae42c346101bc1d44542535c16f468a43f9450f705b","observation_id":"a2a932e5-0cef-4c8b-ac35-320e447cfd05","resolution":{"observed_at":"2026-08-06T16:21:13.357038Z","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":"1910.07283","last_updated":"2019-10-16T11:06:23Z","snapshot_observed_at":"2026-07-06T08:29:59.117695Z","submitted_at":"2019-10-16T11:06:23Z","title":"FISHDBC: Flexible, Incremental, Scalable, Hierarchical Density-Based Clustering for Arbitrary Data and Distance","version":1},"cited_work":{"arxiv_id":"1910.07283","doi":null,"metadata_source":"pith","pith_arxiv_id":"1910.07283","snapshot_observed_at":"2026-08-06T16:21:13.224154Z","title":"FISHDBC: Flexible, Incremental, Scalable, Hierarchical Density-Based Clustering for Arbitrary Data and Distance","venue":"cs.LG","work_id":"9a183de0-4484-44d4-b841-5423432e46a7","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":19,"source":"pdf_text","source_observed_at":"2026-08-06T16:21:13.135763Z"},"links":{"cited_paper":"/paper/1910.07283","citing_paper":"/paper/2507.14261"},"observation_digest":"sha256:9a6484166efbd3c63deb6ec5d389a4eb16ffd91a436c7ea8ae94e9dd3b3b7d38","observation_id":"6e89ff5b-c5d3-4336-bb4e-b8837c5e4b01","resolution":{"observed_at":"2026-08-06T16:21:13.228526Z","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-06T16:21:13.340320Z","title":"Efficient k-nearest neighbor graph construction for generic similarity measures,","venue":null,"work_id":"ef04410c-c1b2-4043-90d4-3cbd3efe5507","year":2011},"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":20,"source":"pdf_text","source_observed_at":"2026-08-06T16:21:13.139642Z"},"links":{"citing_paper":"/paper/2507.14261"},"observation_digest":"sha256:d3a4aeec7f6c9ddf5130c2753184b7aa352a28e36d057423f65da06ef1e6668a","observation_id":"5e936d12-f225-4842-9a6e-80cc87622ec4","resolution":{"observed_at":"2026-08-06T16:21:13.344220Z","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-06T16:21:13.327476Z","title":"Pynndescent: A python nearest neighbor descent for approximate nearest neighbors,","venue":null,"work_id":"dd76914e-18e8-4327-9d88-45ceb53f2231","year":2018},"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":21,"source":"pdf_text","source_observed_at":"2026-08-06T16:21:13.143630Z"},"links":{"citing_paper":"/paper/2507.14261"},"observation_digest":"sha256:614b3a1ab4c7d35347b6eeec2ad2b2bd25efb81491e5439a0fe1cb8329b17092","observation_id":"3b014aa0-1f61-4ca3-9592-734fb900c6a4","resolution":{"observed_at":"2026-08-06T16:21:13.331709Z","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-06T16:21:13.313029Z","title":"Fast k-nn graph construction by gpu based nn-descent,","venue":null,"work_id":"890ef8a2-4068-4094-a4cd-1a8c72b2bffc","year":1929},"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":22,"source":"pdf_text","source_observed_at":"2026-08-06T16:21:13.147135Z"},"links":{"citing_paper":"/paper/2507.14261"},"observation_digest":"sha256:f4e1f089fce59721ed1f3e01b2958feca3bea48ac5410df620cf633cc70b434f","observation_id":"76be06e5-dbd4-4e65-b074-0ba945930fcf","resolution":{"observed_at":"2026-08-06T16:21:13.317301Z","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-06T16:21:13.299671Z","title":"Mistree: a python package for constructing and analysing minimum spanning trees,","venue":null,"work_id":"e70ced65-9629-4d83-add4-455b0d6f41f9","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":23,"source":"pdf_text","source_observed_at":"2026-08-06T16:21:13.150680Z"},"links":{"citing_paper":"/paper/2507.14261"},"observation_digest":"sha256:970cf83b0fb0c0c53356c0415dd5c3b7a4a48bd80e797a4566b78d05969171af","observation_id":"6c672072-8cec-44cf-95e4-047f3f584a67","resolution":{"observed_at":"2026-08-06T16:21:13.303767Z","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":"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:21:13.285185Z","title":"Deep learning face attributes in the wild,","venue":null,"work_id":"22a337fe-089a-4b97-a541-bb07bdb1aa2e","year":2015},"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":25,"source":"pdf_text","source_observed_at":"2026-08-06T16:21:13.158866Z"},"links":{"citing_paper":"/paper/2507.14261"},"observation_digest":"sha256:b478be9a8f04d132cd8d50d90bb82f75e75dba90a58416f4236c4a4dee3cebaf","observation_id":"bf5a25b0-ac87-451b-ade5-f1ce769bd48e","resolution":{"observed_at":"2026-08-06T16:21:13.289854Z","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-06T16:21:13.271483Z","title":"Constructing a high-dimensional k nn-graph using a z-order curve,","venue":null,"work_id":"5c2a671a-8f5f-4fdf-a43e-8ea306bd87a0","year":2018},"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":26,"source":"pdf_text","source_observed_at":"2026-08-06T16:21:13.162530Z"},"links":{"citing_paper":"/paper/2507.14261"},"observation_digest":"sha256:0f8cd0b8758ba21c7a43654e8baa692e1199f862fdbda83770717ab873fd830f","observation_id":"55617d57-e304-42d5-94b8-cbd5052c52b6","resolution":{"observed_at":"2026-08-06T16:21:13.275867Z","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-06T16:21:13.257970Z","title":"Song: Approximate nearest neighbor search on gpu,","venue":null,"work_id":"3a355566-baba-479a-b17e-8cf41eb16b19","year":2020},"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":27,"source":"pdf_text","source_observed_at":"2026-08-06T16:21:13.166098Z"},"links":{"citing_paper":"/paper/2507.14261"},"observation_digest":"sha256:8b4a35af4f7c0c88d3a50c771c4f0a535eae09ee8a9e9ef6f3e07d18b6530199","observation_id":"a678dd39-c524-409e-9637-9a06943ee4a9","resolution":{"observed_at":"2026-08-06T16:21:13.261897Z","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"}}],"paper":{"arxiv_id":"2507.14261","last_updated":"2025-07-18T12:53:58Z","latest_version":1,"primary_category":"cs.DS","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"},"reference_resolution":{"displayed":27,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":3,"verified_fuzzy":24},"total_outbound_references":27},"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 27 of 27 outbound references and 0 inbound Pith citation observations for arXiv:2507.14261."}