{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:YBTSQFHE6MG3LXJS7LRPZS2BPL","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"0655257eab76a22c45cf2dfd16a7a636e2c2fc00d3b8d9446f86c08b97acfc1d","cross_cats_sorted":["math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-20T23:43:24Z","title_canon_sha256":"42b95aa66999fbd6419e88f4c8d240f2871efdadfab92c14a1a482569066ebab"},"schema_version":"1.0","source":{"id":"1908.07645","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.07645","created_at":"2026-07-05T02:02:00Z"},{"alias_kind":"arxiv_version","alias_value":"1908.07645v4","created_at":"2026-07-05T02:02:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.07645","created_at":"2026-07-05T02:02:00Z"},{"alias_kind":"pith_short_12","alias_value":"YBTSQFHE6MG3","created_at":"2026-07-05T02:02:00Z"},{"alias_kind":"pith_short_16","alias_value":"YBTSQFHE6MG3LXJS","created_at":"2026-07-05T02:02:00Z"},{"alias_kind":"pith_short_8","alias_value":"YBTSQFHE","created_at":"2026-07-05T02:02:00Z"}],"graph_snapshots":[{"event_id":"sha256:ddfa9ef1bb0f9f3e6deaacf9190b9e2bea40afb10088a4d2bad9f135886849a0","target":"graph","created_at":"2026-07-05T02:02:00Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1908.07645/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Suppose $V$ is an $n$-element set where for each $x \\in V$, the elements of $V \\setminus \\{x\\}$ are ranked by their similarity to $x$. The $K$-nearest neighbor graph is a directed graph including an arc from each $x$ to the $K$ points of $V \\setminus \\{x\\}$ most similar to $x$. Constructive approximation to this graph using far fewer than $n^2$ comparisons is important for the analysis of large high-dimensional data sets. $K$-Nearest Neighbor Descent is a parameter-free heuristic where a sequence of graph approximations is constructed, in which second neighbors in one approximation are propose","authors_text":"Jacob D. Baron, R. W. R. Darling","cross_cats":["math.ST","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-20T23:43:24Z","title":"K-Nearest Neighbor Approximation Via the Friend-of-a-Friend Principle"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.07645","kind":"arxiv","version":4},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:a9d32968ed5d55bb6071d827f62e7fc81fcb55eeae79575bcd10261a85919a52","target":"record","created_at":"2026-07-05T02:02:00Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"0655257eab76a22c45cf2dfd16a7a636e2c2fc00d3b8d9446f86c08b97acfc1d","cross_cats_sorted":["math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-20T23:43:24Z","title_canon_sha256":"42b95aa66999fbd6419e88f4c8d240f2871efdadfab92c14a1a482569066ebab"},"schema_version":"1.0","source":{"id":"1908.07645","kind":"arxiv","version":4}},"canonical_sha256":"c0672814e4f30db5dd32fae2fccb417af2fb80ddf9fc273744113d5408783b29","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c0672814e4f30db5dd32fae2fccb417af2fb80ddf9fc273744113d5408783b29","first_computed_at":"2026-07-05T02:02:00.830763Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:02:00.830763Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UxXpgJZJT/ZFWtZc4P/QQUx+62HHXYCjWWvjRSZ/3CCtooaiVKGA4y4CZ300BrkgVUgUGPklZ7XgrdbaxyORDg==","signature_status":"signed_v1","signed_at":"2026-07-05T02:02:00.831164Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.07645","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a9d32968ed5d55bb6071d827f62e7fc81fcb55eeae79575bcd10261a85919a52","sha256:ddfa9ef1bb0f9f3e6deaacf9190b9e2bea40afb10088a4d2bad9f135886849a0"],"state_sha256":"189dfae4014d682ead727d168f94a1e341076145778d04b9e442dbda68399dfd"}