Paper Citation Record · LEDGER

FAMST: Fast Approximate Minimum Spanning Tree Construction for Large-Scale and High-Dimensional Data

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.

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

pith.paper-citation-record.v1
2507.14261 v1

Coverage vector

measured 27 of 27 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-06T16:21:13.166098Z

measured 27 of 27 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-16T06:30:59.297886+00:00

measured 0 of 0 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links

measured 0 of 1 external citation measurements

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

Source: cited_works

Reference resolution

27 of 27 outbound references displayed

verified exact3
verified fuzzy24
unresolved0
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 2a9467b0-9617-42bb-bc05-b583daee18bb · outbound

This paper cites A comprehensive survey of clustering algorithms,.

FAMST: Fast Approximate Minimum Spanning Tree Construction for Large-Scale and High-Dimensional Data A comprehensive survey of clustering algorithms,

Reference 1

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T16:21:13.580615Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation 9851184f-a027-436a-9bee-f45a3a31b601 · outbound

This paper cites A survey on large datasets minimum spanning trees,.

FAMST: Fast Approximate Minimum Spanning Tree Construction for Large-Scale and High-Dimensional Data A survey on large datasets minimum spanning trees,

Reference 2

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T16:21:13.566067Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation a390904f-6a32-4f74-ad2d-406e6f2eeef7 · outbound

This paper cites Fast euclidean minimum spanning tree: algorithm, analysis, and applications,.

FAMST: Fast Approximate Minimum Spanning Tree Construction for Large-Scale and High-Dimensional Data Fast euclidean minimum spanning tree: algorithm, analysis, and applications,

Reference 3

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T16:21:13.552130Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation c8610172-6c83-4b00-9e91-37c6d055b2f8 · outbound

This paper cites Approximate Tree Completion and Learning-Augmented Algorithms for Metric Minimum Spanning Trees.

FAMST: Fast Approximate Minimum Spanning Tree Construction for Large-Scale and High-Dimensional Data Approximate Tree Completion and Learning-Augmented Algorithms for Metric Minimum Spanning Trees

Reference 4

Resolution: verified exact; local_arxiv, observed 2026-08-06T16:21:13.248258Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation de734d4d-40fc-4080-8a8e-b660bd638f9a · outbound

This paper cites New algorithms for efficient high-dimensional nonpara- metric classification.,.

FAMST: Fast Approximate Minimum Spanning Tree Construction for Large-Scale and High-Dimensional Data New algorithms for efficient high-dimensional nonpara- metric classification.,

Reference 5

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T16:21:13.537740Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation ae175e2d-0cda-46e8-9200-8c9d8705eb32 · outbound

This paper cites Nearest-neighbor search on a time budget via max-margin trees,.

FAMST: Fast Approximate Minimum Spanning Tree Construction for Large-Scale and High-Dimensional Data Nearest-neighbor search on a time budget via max-margin trees,

Reference 6

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T16:21:13.523563Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation f167db1d-c820-4b0a-b38b-d7d81ee4b19a · outbound

This paper cites Revisiting kd-tree for nearest neighbor search,.

FAMST: Fast Approximate Minimum Spanning Tree Construction for Large-Scale and High-Dimensional Data Revisiting kd-tree for nearest neighbor search,

Reference 7

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T16:21:13.509244Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation 5b5505ee-022e-4283-8764-9e0aced80c77 · outbound

This paper cites Insights into efficient k-nearest neighbor clas- sification with convolutional neural codes,.

FAMST: Fast Approximate Minimum Spanning Tree Construction for Large-Scale and High-Dimensional Data Insights into efficient k-nearest neighbor clas- sification with convolutional neural codes,

Reference 8

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T16:21:13.495395Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation 6bc07fb9-ea86-4aaa-b743-939967f18792 · outbound

This paper cites A divide-and-conquer approach for minimum spanning tree- based clustering,.

FAMST: Fast Approximate Minimum Spanning Tree Construction for Large-Scale and High-Dimensional Data A divide-and-conquer approach for minimum spanning tree- based clustering,

Reference 9

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T16:21:13.481525Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation f5018001-43b4-404f-9b6b-01450eea4315 · outbound

This paper cites A fast minimum spanning tree algorithm based on k-means,.

FAMST: Fast Approximate Minimum Spanning Tree Construction for Large-Scale and High-Dimensional Data A fast minimum spanning tree algorithm based on k-means,

Reference 10

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T16:21:13.467353Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation 9ee97fee-1bb6-4c86-b88c-05744acd6a53 · outbound

This paper cites Fast approximate minimum spanning tree based clustering algorithm,.

FAMST: Fast Approximate Minimum Spanning Tree Construction for Large-Scale and High-Dimensional Data Fast approximate minimum spanning tree based clustering algorithm,

Reference 11

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T16:21:13.453108Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation 63404a0f-3020-41af-999e-9e6cf939a8d5 · outbound

This paper cites kMiST: A kd-tree based fast minimum spanning tree algorithm,.

FAMST: Fast Approximate Minimum Spanning Tree Construction for Large-Scale and High-Dimensional Data kMiST: A kd-tree based fast minimum spanning tree algorithm,

Reference 12

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T16:21:13.438887Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation e8452bf7-8f52-4cbd-b5ae-3f115f998c32 · outbound

This paper cites Fast parallel algorithms for euclidean minimum spanning tree and hierarchical spatial clustering,.

FAMST: Fast Approximate Minimum Spanning Tree Construction for Large-Scale and High-Dimensional Data Fast parallel algorithms for euclidean minimum spanning tree and hierarchical spatial clustering,

Reference 13

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T16:21:13.423601Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation 9ced803e-f687-4796-8b1c-6cc5e57d737f · outbound

This paper cites A decomposition of multidimensional point sets with applications to k-nearest-neighbors and n-body potential fields,.

FAMST: Fast Approximate Minimum Spanning Tree Construction for Large-Scale and High-Dimensional Data A decomposition of multidimensional point sets with applications to k-nearest-neighbors and n-body potential fields,

Reference 14

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T16:21:13.409801Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation dd37979d-11f4-4a77-85bd-c31cf6206eb7 · outbound

This paper cites I/o-efficient well-separated pair decom- position and applications,.

FAMST: Fast Approximate Minimum Spanning Tree Construction for Large-Scale and High-Dimensional Data I/o-efficient well-separated pair decom- position and applications,

Reference 15

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T16:21:13.396531Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation 6381129e-3d0a-4304-8132-23a98cf1a12d · outbound

This paper cites Fast and memory-efficient approximate minimum spanning tree generation for large datasets,.

FAMST: Fast Approximate Minimum Spanning Tree Construction for Large-Scale and High-Dimensional Data Fast and memory-efficient approximate minimum spanning tree generation for large datasets,

Reference 16

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T16:21:13.383082Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation a7beb4c8-db74-490e-b995-9cd867dfa041 · outbound

This paper cites Approximate nearest neighbor algorithm based on navigable small world graphs,.

FAMST: Fast Approximate Minimum Spanning Tree Construction for Large-Scale and High-Dimensional Data Approximate nearest neighbor algorithm based on navigable small world graphs,

Reference 17

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T16:21:13.370044Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation a2a932e5-0cef-4c8b-ac35-320e447cfd05 · outbound

This paper cites Efficient and robust approximate nearest neighbor search using hier- archical navigable small world graphs,.

FAMST: Fast Approximate Minimum Spanning Tree Construction for Large-Scale and High-Dimensional Data Efficient and robust approximate nearest neighbor search using hier- archical navigable small world graphs,

Reference 18

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T16:21:13.357038Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation 6e89ff5b-c5d3-4336-bb4e-b8837c5e4b01 · outbound

This paper cites FISHDBC: Flexible, Incremental, Scalable, Hierarchical Density-Based Clustering for Arbitrary Data and Distance.

FAMST: Fast Approximate Minimum Spanning Tree Construction for Large-Scale and High-Dimensional Data FISHDBC: Flexible, Incremental, Scalable, Hierarchical Density-Based Clustering for Arbitrary Data and Distance

Reference 19

Resolution: verified exact; local_arxiv, observed 2026-08-06T16:21:13.228526Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation 5e936d12-f225-4842-9a6e-80cc87622ec4 · outbound

This paper cites Efficient k-nearest neighbor graph construction for generic similarity measures,.

FAMST: Fast Approximate Minimum Spanning Tree Construction for Large-Scale and High-Dimensional Data Efficient k-nearest neighbor graph construction for generic similarity measures,

Reference 20

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T16:21:13.344220Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation 3b014aa0-1f61-4ca3-9592-734fb900c6a4 · outbound

This paper cites Pynndescent: A python nearest neighbor descent for approximate nearest neighbors,.

FAMST: Fast Approximate Minimum Spanning Tree Construction for Large-Scale and High-Dimensional Data Pynndescent: A python nearest neighbor descent for approximate nearest neighbors,

Reference 21

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T16:21:13.331709Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation 76be06e5-dbd4-4e65-b074-0ba945930fcf · outbound

This paper cites Fast k-nn graph construction by gpu based nn-descent,.

FAMST: Fast Approximate Minimum Spanning Tree Construction for Large-Scale and High-Dimensional Data Fast k-nn graph construction by gpu based nn-descent,

Reference 22

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T16:21:13.317301Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation 6c672072-8cec-44cf-95e4-047f3f584a67 · outbound

This paper cites Mistree: a python package for constructing and analysing minimum spanning trees,.

FAMST: Fast Approximate Minimum Spanning Tree Construction for Large-Scale and High-Dimensional Data Mistree: a python package for constructing and analysing minimum spanning trees,

Reference 23

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T16:21:13.303767Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation 694084d7-6403-42f8-a139-97279bf66518 · outbound

This paper cites K-Nearest Neighbor Approximation Via the Friend-of-a-Friend Principle.

FAMST: Fast Approximate Minimum Spanning Tree Construction for Large-Scale and High-Dimensional Data K-Nearest Neighbor Approximation Via the Friend-of-a-Friend Principle

Reference 24

Resolution: verified exact; local_arxiv, observed 2026-08-06T16:21:13.207922Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation bf5a25b0-ac87-451b-ade5-f1ce769bd48e · outbound

This paper cites Deep learning face attributes in the wild,.

FAMST: Fast Approximate Minimum Spanning Tree Construction for Large-Scale and High-Dimensional Data Deep learning face attributes in the wild,

Reference 25

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T16:21:13.289854Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation 55617d57-e304-42d5-94b8-cbd5052c52b6 · outbound

This paper cites Constructing a high-dimensional k nn-graph using a z-order curve,.

FAMST: Fast Approximate Minimum Spanning Tree Construction for Large-Scale and High-Dimensional Data Constructing a high-dimensional k nn-graph using a z-order curve,

Reference 26

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T16:21:13.275867Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation a678dd39-c524-409e-9637-9a06943ee4a9 · outbound

This paper cites Song: Approximate nearest neighbor search on gpu,.

FAMST: Fast Approximate Minimum Spanning Tree Construction for Large-Scale and High-Dimensional Data Song: Approximate nearest neighbor search on gpu,

Reference 27

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T16:21:13.261897Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Pith citing papers

No inbound Pith citation observations are available.