{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:URDP6AYGKF2NN2CG5V762FORPT","short_pith_number":"pith:URDP6AYG","canonical_record":{"source":{"id":"2201.06553","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2022-01-17T18:12:38Z","cross_cats_sorted":["cs.CC","cs.DS"],"title_canon_sha256":"65e762c70d9dfd7636f2de95cc70b9bd6aece1039f6583985139a6ab2650b524","abstract_canon_sha256":"b4cf43eb8294f9ef0a9521634160052ef3ade89cd5d6f3f60086c6b135386553"},"schema_version":"1.0"},"canonical_sha256":"a446ff03065174d6e846ed7fed15d17cd82f71065cdca22da79708f84c74c56b","source":{"kind":"arxiv","id":"2201.06553","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2201.06553","created_at":"2026-07-05T03:50:04Z"},{"alias_kind":"arxiv_version","alias_value":"2201.06553v2","created_at":"2026-07-05T03:50:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2201.06553","created_at":"2026-07-05T03:50:04Z"},{"alias_kind":"pith_short_12","alias_value":"URDP6AYGKF2N","created_at":"2026-07-05T03:50:04Z"},{"alias_kind":"pith_short_16","alias_value":"URDP6AYGKF2NN2CG","created_at":"2026-07-05T03:50:04Z"},{"alias_kind":"pith_short_8","alias_value":"URDP6AYG","created_at":"2026-07-05T03:50:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:URDP6AYGKF2NN2CG5V762FORPT","target":"record","payload":{"canonical_record":{"source":{"id":"2201.06553","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2022-01-17T18:12:38Z","cross_cats_sorted":["cs.CC","cs.DS"],"title_canon_sha256":"65e762c70d9dfd7636f2de95cc70b9bd6aece1039f6583985139a6ab2650b524","abstract_canon_sha256":"b4cf43eb8294f9ef0a9521634160052ef3ade89cd5d6f3f60086c6b135386553"},"schema_version":"1.0"},"canonical_sha256":"a446ff03065174d6e846ed7fed15d17cd82f71065cdca22da79708f84c74c56b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:50:04.835551Z","signature_b64":"PA+ObWeu39Evp1gPi69LRfK8E/VMPBiVCiuJMpxvGmIWjpDWrioWyI2j/9HCibO4dU5rsAoyChfNz8bFYtl6AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a446ff03065174d6e846ed7fed15d17cd82f71065cdca22da79708f84c74c56b","last_reissued_at":"2026-07-05T03:50:04.835110Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:50:04.835110Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2201.06553","source_version":2,"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-05T03:50:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xfbimlyT5CCBWhU1RfLQUY606Jur/DTq8MV2Hj3rc9nFv2qf0IpgasmW2/kHp52PK1SIciBrZA3Jj/dL6LgUAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-27T08:02:09.754514Z"},"content_sha256":"fdfd6497e9759b19c28faf672881dd02c824686a8138cb0e2eeaa715d6a0f6d0","schema_version":"1.0","event_id":"sha256:fdfd6497e9759b19c28faf672881dd02c824686a8138cb0e2eeaa715d6a0f6d0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:URDP6AYGKF2NN2CG5V762FORPT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Paired compressed cover trees guarantee a near linear parametrized complexity for all $k$-nearest neighbors search in an arbitrary metric space","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC","cs.DS"],"primary_cat":"cs.CG","authors_text":"Vitaliy Kurlin, Yury Elkin","submitted_at":"2022-01-17T18:12:38Z","abstract_excerpt":"This paper studies the important problem of finding all $k$-nearest neighbors to points of a query set $Q$ in another reference set $R$ within any metric space. Our previous work defined compressed cover trees and corrected the key arguments in several past papers for challenging datasets. In 2009 Ram, Lee, March, and Gray attempted to improve the time complexity by using pairs of cover trees on the query and reference sets. In 2015 Curtin with the above co-authors used extra parameters to finally prove a time complexity for $k=1$. The current work fills all previous gaps and improves the near"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2201.06553","kind":"arxiv","version":2},"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/2201.06553/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-05T03:50:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ljSixPmMY0kyiMDITdlecl8d39Gk7PXy5+Ec0LxsQbHmZ4No5wn4nQSemVYJVVZtAGI/qzvZfCRlB3indFMjBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-27T08:02:09.754920Z"},"content_sha256":"8c67e67981cff49fde395096e745cee169a6b5ade04f55cb1278476509c5f39a","schema_version":"1.0","event_id":"sha256:8c67e67981cff49fde395096e745cee169a6b5ade04f55cb1278476509c5f39a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/URDP6AYGKF2NN2CG5V762FORPT/bundle.json","state_url":"https://pith.science/pith/URDP6AYGKF2NN2CG5V762FORPT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/URDP6AYGKF2NN2CG5V762FORPT/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-27T08:02:09Z","links":{"resolver":"https://pith.science/pith/URDP6AYGKF2NN2CG5V762FORPT","bundle":"https://pith.science/pith/URDP6AYGKF2NN2CG5V762FORPT/bundle.json","state":"https://pith.science/pith/URDP6AYGKF2NN2CG5V762FORPT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/URDP6AYGKF2NN2CG5V762FORPT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:URDP6AYGKF2NN2CG5V762FORPT","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":"b4cf43eb8294f9ef0a9521634160052ef3ade89cd5d6f3f60086c6b135386553","cross_cats_sorted":["cs.CC","cs.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2022-01-17T18:12:38Z","title_canon_sha256":"65e762c70d9dfd7636f2de95cc70b9bd6aece1039f6583985139a6ab2650b524"},"schema_version":"1.0","source":{"id":"2201.06553","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2201.06553","created_at":"2026-07-05T03:50:04Z"},{"alias_kind":"arxiv_version","alias_value":"2201.06553v2","created_at":"2026-07-05T03:50:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2201.06553","created_at":"2026-07-05T03:50:04Z"},{"alias_kind":"pith_short_12","alias_value":"URDP6AYGKF2N","created_at":"2026-07-05T03:50:04Z"},{"alias_kind":"pith_short_16","alias_value":"URDP6AYGKF2NN2CG","created_at":"2026-07-05T03:50:04Z"},{"alias_kind":"pith_short_8","alias_value":"URDP6AYG","created_at":"2026-07-05T03:50:04Z"}],"graph_snapshots":[{"event_id":"sha256:8c67e67981cff49fde395096e745cee169a6b5ade04f55cb1278476509c5f39a","target":"graph","created_at":"2026-07-05T03:50:04Z","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/2201.06553/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper studies the important problem of finding all $k$-nearest neighbors to points of a query set $Q$ in another reference set $R$ within any metric space. Our previous work defined compressed cover trees and corrected the key arguments in several past papers for challenging datasets. In 2009 Ram, Lee, March, and Gray attempted to improve the time complexity by using pairs of cover trees on the query and reference sets. In 2015 Curtin with the above co-authors used extra parameters to finally prove a time complexity for $k=1$. The current work fills all previous gaps and improves the near","authors_text":"Vitaliy Kurlin, Yury Elkin","cross_cats":["cs.CC","cs.DS"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2022-01-17T18:12:38Z","title":"Paired compressed cover trees guarantee a near linear parametrized complexity for all $k$-nearest neighbors search in an arbitrary metric space"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2201.06553","kind":"arxiv","version":2},"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:fdfd6497e9759b19c28faf672881dd02c824686a8138cb0e2eeaa715d6a0f6d0","target":"record","created_at":"2026-07-05T03:50:04Z","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":"b4cf43eb8294f9ef0a9521634160052ef3ade89cd5d6f3f60086c6b135386553","cross_cats_sorted":["cs.CC","cs.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2022-01-17T18:12:38Z","title_canon_sha256":"65e762c70d9dfd7636f2de95cc70b9bd6aece1039f6583985139a6ab2650b524"},"schema_version":"1.0","source":{"id":"2201.06553","kind":"arxiv","version":2}},"canonical_sha256":"a446ff03065174d6e846ed7fed15d17cd82f71065cdca22da79708f84c74c56b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a446ff03065174d6e846ed7fed15d17cd82f71065cdca22da79708f84c74c56b","first_computed_at":"2026-07-05T03:50:04.835110Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:50:04.835110Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PA+ObWeu39Evp1gPi69LRfK8E/VMPBiVCiuJMpxvGmIWjpDWrioWyI2j/9HCibO4dU5rsAoyChfNz8bFYtl6AA==","signature_status":"signed_v1","signed_at":"2026-07-05T03:50:04.835551Z","signed_message":"canonical_sha256_bytes"},"source_id":"2201.06553","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fdfd6497e9759b19c28faf672881dd02c824686a8138cb0e2eeaa715d6a0f6d0","sha256:8c67e67981cff49fde395096e745cee169a6b5ade04f55cb1278476509c5f39a"],"state_sha256":"9b43d582387afd4bcd2614230f7438d0f9067aaaec16cc1ea93a3f6a5836d2f2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WsCoLADM+fgus6p2tiAxeXYSM2VbKgH4BVyWEDXJLrDVsv1xoLJVb3rCboO3FkOtPkJHGYdq64onx9r46ovSDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-27T08:02:09.757429Z","bundle_sha256":"816780e53ba20074e25d674d957e4b4b560b4bd18131c1863cb721580981d794"}}