{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:CPZWJQ7C3V4XJDNWXKPQRYS5XJ","short_pith_number":"pith:CPZWJQ7C","schema_version":"1.0","canonical_sha256":"13f364c3e2dd79748db6ba9f08e25dba49aa9273d2f33a1f5a1f1409f5917fae","source":{"kind":"arxiv","id":"2507.14261","version":1},"attestation_state":"computed","paper":{"title":"FAMST: Fast Approximate Minimum Spanning Tree Construction for Large-Scale and High-Dimensional Data","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.DS","authors_text":"Mahmood K. M. Almansoori, Miklos Telek","submitted_at":"2025-07-18T12:53:58Z","abstract_excerpt":"We present Fast Approximate Minimum Spanning Tree (FAMST), a novel algorithm that addresses the computational challenges of constructing Minimum Spanning Trees (MSTs) for large-scale and high-dimensional datasets. FAMST utilizes a three-phase approach: Approximate Nearest Neighbor (ANN) graph construction, ANN inter-component connection, and iterative edge refinement. For a dataset of $n$ points in a $d$-dimensional space, FAMST achieves $\\mathcal{O}(dn \\log n)$ time complexity and $\\mathcal{O}(dn + kn)$ space complexity when $k$ nearest neighbors are considered, which is a significant improve"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2507.14261","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2025-07-18T12:53:58Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"d4969e4809f0bd0c3e3b054f031b3a93641ca6fb34abf6bb1fb7635f6b92fd74","abstract_canon_sha256":"44e225e5729feb434a48f221257072517d0a08d8923afcdfdb2816909bb79f20"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:40:02.944400Z","signature_b64":"yy7WwiuhOgiL2RiB7Yq6MCa+Y8K63CNlbiYeaag9V2l9L64X7r3ArhLiCDKaq3jG70C6eODqnm6dP3/6c+ClBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"13f364c3e2dd79748db6ba9f08e25dba49aa9273d2f33a1f5a1f1409f5917fae","last_reissued_at":"2026-07-05T11:40:02.943920Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:40:02.943920Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"FAMST: Fast Approximate Minimum Spanning Tree Construction for Large-Scale and High-Dimensional Data","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.DS","authors_text":"Mahmood K. M. Almansoori, Miklos Telek","submitted_at":"2025-07-18T12:53:58Z","abstract_excerpt":"We present Fast Approximate Minimum Spanning Tree (FAMST), a novel algorithm that addresses the computational challenges of constructing Minimum Spanning Trees (MSTs) for large-scale and high-dimensional datasets. FAMST utilizes a three-phase approach: Approximate Nearest Neighbor (ANN) graph construction, ANN inter-component connection, and iterative edge refinement. For a dataset of $n$ points in a $d$-dimensional space, FAMST achieves $\\mathcal{O}(dn \\log n)$ time complexity and $\\mathcal{O}(dn + kn)$ space complexity when $k$ nearest neighbors are considered, which is a significant improve"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.14261","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2507.14261/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2507.14261","created_at":"2026-07-05T11:40:02.943992+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.14261v1","created_at":"2026-07-05T11:40:02.943992+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.14261","created_at":"2026-07-05T11:40:02.943992+00:00"},{"alias_kind":"pith_short_12","alias_value":"CPZWJQ7C3V4X","created_at":"2026-07-05T11:40:02.943992+00:00"},{"alias_kind":"pith_short_16","alias_value":"CPZWJQ7C3V4XJDNW","created_at":"2026-07-05T11:40:02.943992+00:00"},{"alias_kind":"pith_short_8","alias_value":"CPZWJQ7C","created_at":"2026-07-05T11:40:02.943992+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CPZWJQ7C3V4XJDNWXKPQRYS5XJ","json":"https://pith.science/pith/CPZWJQ7C3V4XJDNWXKPQRYS5XJ.json","graph_json":"https://pith.science/api/pith-number/CPZWJQ7C3V4XJDNWXKPQRYS5XJ/graph.json","events_json":"https://pith.science/api/pith-number/CPZWJQ7C3V4XJDNWXKPQRYS5XJ/events.json","paper":"https://pith.science/paper/CPZWJQ7C"},"agent_actions":{"view_html":"https://pith.science/pith/CPZWJQ7C3V4XJDNWXKPQRYS5XJ","download_json":"https://pith.science/pith/CPZWJQ7C3V4XJDNWXKPQRYS5XJ.json","view_paper":"https://pith.science/paper/CPZWJQ7C","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.14261&json=true","fetch_graph":"https://pith.science/api/pith-number/CPZWJQ7C3V4XJDNWXKPQRYS5XJ/graph.json","fetch_events":"https://pith.science/api/pith-number/CPZWJQ7C3V4XJDNWXKPQRYS5XJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CPZWJQ7C3V4XJDNWXKPQRYS5XJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CPZWJQ7C3V4XJDNWXKPQRYS5XJ/action/storage_attestation","attest_author":"https://pith.science/pith/CPZWJQ7C3V4XJDNWXKPQRYS5XJ/action/author_attestation","sign_citation":"https://pith.science/pith/CPZWJQ7C3V4XJDNWXKPQRYS5XJ/action/citation_signature","submit_replication":"https://pith.science/pith/CPZWJQ7C3V4XJDNWXKPQRYS5XJ/action/replication_record"}},"created_at":"2026-07-05T11:40:02.943992+00:00","updated_at":"2026-07-05T11:40:02.943992+00:00"}