{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:LJMQLVPZKTGT5LKK5HOWTJV4VX","short_pith_number":"pith:LJMQLVPZ","canonical_record":{"source":{"id":"2111.15478","kind":"arxiv","version":5},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2021-11-30T15:14:07Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"61f536d8448fbad3c5d514095b15d7af039fdc97e3458a304585b28fc756f9bc","abstract_canon_sha256":"172cf6bba29af0f068e669cd65ef74338ace70b4e671159d7ef3900f01b20706"},"schema_version":"1.0"},"canonical_sha256":"5a5905d5f954cd3ead4ae9dd69a6bcadfd17b76b3f5c0d604e68cccbdd9afbe0","source":{"kind":"arxiv","id":"2111.15478","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2111.15478","created_at":"2026-07-05T07:51:23Z"},{"alias_kind":"arxiv_version","alias_value":"2111.15478v5","created_at":"2026-07-05T07:51:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2111.15478","created_at":"2026-07-05T07:51:23Z"},{"alias_kind":"pith_short_12","alias_value":"LJMQLVPZKTGT","created_at":"2026-07-05T07:51:23Z"},{"alias_kind":"pith_short_16","alias_value":"LJMQLVPZKTGT5LKK","created_at":"2026-07-05T07:51:23Z"},{"alias_kind":"pith_short_8","alias_value":"LJMQLVPZ","created_at":"2026-07-05T07:51:23Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:LJMQLVPZKTGT5LKK5HOWTJV4VX","target":"record","payload":{"canonical_record":{"source":{"id":"2111.15478","kind":"arxiv","version":5},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2021-11-30T15:14:07Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"61f536d8448fbad3c5d514095b15d7af039fdc97e3458a304585b28fc756f9bc","abstract_canon_sha256":"172cf6bba29af0f068e669cd65ef74338ace70b4e671159d7ef3900f01b20706"},"schema_version":"1.0"},"canonical_sha256":"5a5905d5f954cd3ead4ae9dd69a6bcadfd17b76b3f5c0d604e68cccbdd9afbe0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:51:23.329864Z","signature_b64":"B/FGnhNXOmFcZt4H8/2vkme4d96IzmUAAlcRRzv05ra8O++Ibe7KFFvQLe/KFc70DoVDdCCjUfPyEJRu/N3aAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5a5905d5f954cd3ead4ae9dd69a6bcadfd17b76b3f5c0d604e68cccbdd9afbe0","last_reissued_at":"2026-07-05T07:51:23.329346Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:51:23.329346Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2111.15478","source_version":5,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T07:51:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g8Eu4ecQFMCRXqh1GXJveRBrdTjFqiKdrm7gbxtoSgh3qs8rHFgsY3U76HKoaE0iOM1ZTEBL44l468c3kEBIAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-12T08:28:53.850142Z"},"content_sha256":"ebd21d4dde6ee4101b1ccabe4b57ce1b365904050b7294df5ed5d7d187d9530a","schema_version":"1.0","event_id":"sha256:ebd21d4dde6ee4101b1ccabe4b57ce1b365904050b7294df5ed5d7d187d9530a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:LJMQLVPZKTGT5LKK5HOWTJV4VX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A new near-linear time algorithm for k-nearest neighbor search using a compressed cover tree","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Vitaliy Kurlin, Yury Elkin","submitted_at":"2021-11-30T15:14:07Z","abstract_excerpt":"Given a reference set $R$ of $n$ points and a query set $Q$ of $m$ points in a metric space, this paper studies an important problem of finding $k$-nearest neighbors of every point $q \\in Q$ in the set $R$ in a near-linear time. In the paper at ICML 2006, Beygelzimer, Kakade, and Langford introduced a cover tree on $R$ and attempted to prove that this tree can be built in $O(n\\log n)$ time while the nearest neighbor search can be done in $O(n\\log m)$ time with a hidden dimensionality factor. This paper fills a substantial gap in the past proofs of time complexity by defining a simpler compress"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2111.15478","kind":"arxiv","version":5},"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/2111.15478/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T07:51:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zo5Cjl52jAF8gh3vP0HcXnlTUcGvmSP3oMxL3qk/l28xIqOih6+4YyMAcxCsmbAOmdb5cdAzY71315lWvSvJDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-12T08:28:53.850533Z"},"content_sha256":"f07a44e1d0807180eb886cd47ef810cfc13d3b55c42920f314f81e554a364772","schema_version":"1.0","event_id":"sha256:f07a44e1d0807180eb886cd47ef810cfc13d3b55c42920f314f81e554a364772"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LJMQLVPZKTGT5LKK5HOWTJV4VX/bundle.json","state_url":"https://pith.science/pith/LJMQLVPZKTGT5LKK5HOWTJV4VX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LJMQLVPZKTGT5LKK5HOWTJV4VX/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-12T08:28:53Z","links":{"resolver":"https://pith.science/pith/LJMQLVPZKTGT5LKK5HOWTJV4VX","bundle":"https://pith.science/pith/LJMQLVPZKTGT5LKK5HOWTJV4VX/bundle.json","state":"https://pith.science/pith/LJMQLVPZKTGT5LKK5HOWTJV4VX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LJMQLVPZKTGT5LKK5HOWTJV4VX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:LJMQLVPZKTGT5LKK5HOWTJV4VX","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":"172cf6bba29af0f068e669cd65ef74338ace70b4e671159d7ef3900f01b20706","cross_cats_sorted":["cs.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2021-11-30T15:14:07Z","title_canon_sha256":"61f536d8448fbad3c5d514095b15d7af039fdc97e3458a304585b28fc756f9bc"},"schema_version":"1.0","source":{"id":"2111.15478","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2111.15478","created_at":"2026-07-05T07:51:23Z"},{"alias_kind":"arxiv_version","alias_value":"2111.15478v5","created_at":"2026-07-05T07:51:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2111.15478","created_at":"2026-07-05T07:51:23Z"},{"alias_kind":"pith_short_12","alias_value":"LJMQLVPZKTGT","created_at":"2026-07-05T07:51:23Z"},{"alias_kind":"pith_short_16","alias_value":"LJMQLVPZKTGT5LKK","created_at":"2026-07-05T07:51:23Z"},{"alias_kind":"pith_short_8","alias_value":"LJMQLVPZ","created_at":"2026-07-05T07:51:23Z"}],"graph_snapshots":[{"event_id":"sha256:f07a44e1d0807180eb886cd47ef810cfc13d3b55c42920f314f81e554a364772","target":"graph","created_at":"2026-07-05T07:51:23Z","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/2111.15478/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Given a reference set $R$ of $n$ points and a query set $Q$ of $m$ points in a metric space, this paper studies an important problem of finding $k$-nearest neighbors of every point $q \\in Q$ in the set $R$ in a near-linear time. In the paper at ICML 2006, Beygelzimer, Kakade, and Langford introduced a cover tree on $R$ and attempted to prove that this tree can be built in $O(n\\log n)$ time while the nearest neighbor search can be done in $O(n\\log m)$ time with a hidden dimensionality factor. This paper fills a substantial gap in the past proofs of time complexity by defining a simpler compress","authors_text":"Vitaliy Kurlin, Yury Elkin","cross_cats":["cs.DS"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2021-11-30T15:14:07Z","title":"A new near-linear time algorithm for k-nearest neighbor search using a compressed cover tree"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2111.15478","kind":"arxiv","version":5},"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:ebd21d4dde6ee4101b1ccabe4b57ce1b365904050b7294df5ed5d7d187d9530a","target":"record","created_at":"2026-07-05T07:51:23Z","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":"172cf6bba29af0f068e669cd65ef74338ace70b4e671159d7ef3900f01b20706","cross_cats_sorted":["cs.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2021-11-30T15:14:07Z","title_canon_sha256":"61f536d8448fbad3c5d514095b15d7af039fdc97e3458a304585b28fc756f9bc"},"schema_version":"1.0","source":{"id":"2111.15478","kind":"arxiv","version":5}},"canonical_sha256":"5a5905d5f954cd3ead4ae9dd69a6bcadfd17b76b3f5c0d604e68cccbdd9afbe0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5a5905d5f954cd3ead4ae9dd69a6bcadfd17b76b3f5c0d604e68cccbdd9afbe0","first_computed_at":"2026-07-05T07:51:23.329346Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:51:23.329346Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"B/FGnhNXOmFcZt4H8/2vkme4d96IzmUAAlcRRzv05ra8O++Ibe7KFFvQLe/KFc70DoVDdCCjUfPyEJRu/N3aAw==","signature_status":"signed_v1","signed_at":"2026-07-05T07:51:23.329864Z","signed_message":"canonical_sha256_bytes"},"source_id":"2111.15478","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ebd21d4dde6ee4101b1ccabe4b57ce1b365904050b7294df5ed5d7d187d9530a","sha256:f07a44e1d0807180eb886cd47ef810cfc13d3b55c42920f314f81e554a364772"],"state_sha256":"ef4757809e463e668d62c3d8a17bcb646459d6ce83da26c90f6873e4fc8fe6b9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3/MvGAc7zwm2UfnOjpU021V5Yl8oaTRuHR8EdC7zPaa6p5goSC7P+6k5QduIGkWFaurCLYbMQ8DCjX/g2o78Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-12T08:28:53.852680Z","bundle_sha256":"45d61e72c266a7ddf3b48e9e3b8d1bd8a4a2961ab20f488e0d258b722cdfccf7"}}