{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:UMSITONOPYTXAI6NBZ2FH3V2HI","short_pith_number":"pith:UMSITONO","canonical_record":{"source":{"id":"1011.4955","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2010-11-22T21:29:23Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"e6d0490634f0af10cc7572259260ceafd1de751eb92b420943b1942130c49bd3","abstract_canon_sha256":"3e8521457002fd6031b233c104fa6b0825d11f70be2c599d280fd5405885354e"},"schema_version":"1.0"},"canonical_sha256":"a32489b9ae7e277023cd0e7453eeba3a1429e3705d11d6693bbe7e36cbe484ef","source":{"kind":"arxiv","id":"1011.4955","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.4955","created_at":"2026-05-18T04:34:54Z"},{"alias_kind":"arxiv_version","alias_value":"1011.4955v1","created_at":"2026-05-18T04:34:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.4955","created_at":"2026-05-18T04:34:54Z"},{"alias_kind":"pith_short_12","alias_value":"UMSITONOPYTX","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_16","alias_value":"UMSITONOPYTXAI6N","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_8","alias_value":"UMSITONO","created_at":"2026-05-18T12:26:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:UMSITONOPYTXAI6NBZ2FH3V2HI","target":"record","payload":{"canonical_record":{"source":{"id":"1011.4955","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2010-11-22T21:29:23Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"e6d0490634f0af10cc7572259260ceafd1de751eb92b420943b1942130c49bd3","abstract_canon_sha256":"3e8521457002fd6031b233c104fa6b0825d11f70be2c599d280fd5405885354e"},"schema_version":"1.0"},"canonical_sha256":"a32489b9ae7e277023cd0e7453eeba3a1429e3705d11d6693bbe7e36cbe484ef","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:34:54.953354Z","signature_b64":"LsZykHG2Z9ktSAyBmGzbVUUAAbRlN7xPnsh0ZMP0HqCNpt/RN1KDoYRwm+PEaLJbVCvWkmFzfYoMGPs68uxGDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a32489b9ae7e277023cd0e7453eeba3a1429e3705d11d6693bbe7e36cbe484ef","last_reissued_at":"2026-05-18T04:34:54.952848Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:34:54.952848Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1011.4955","source_version":1,"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-05-18T04:34:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rGfYoOlZKOiXWbPY2Gyz5ofZklY0gcptT7rVtjwgpJstuizxc2r5q1mTeclw4ZA/yio79RGg5SFK0UIvn9n1BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T21:34:07.598751Z"},"content_sha256":"5ec04fc134ff50fe51de98dc8056d7c99ea1cb885c9464d83d315aa8e81fa1d0","schema_version":"1.0","event_id":"sha256:5ec04fc134ff50fe51de98dc8056d7c99ea1cb885c9464d83d315aa8e81fa1d0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:UMSITONOPYTXAI6NBZ2FH3V2HI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Reverse Nearest Neighbors Search in High Dimensions using Locality-Sensitive Hashing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"David Arthur, Steve Y. Oudot","submitted_at":"2010-11-22T21:29:23Z","abstract_excerpt":"We investigate the problem of finding reverse nearest neighbors efficiently. Although provably good solutions exist for this problem in low or fixed dimensions, to this date the methods proposed in high dimensions are mostly heuristic. We introduce a method that is both provably correct and efficient in all dimensions, based on a reduction of the problem to one instance of $\\e$-nearest neighbor search plus a controlled number of instances of {\\em exhaustive $r$-\\pleb}, a variant of {\\em Point Location among Equal Balls} where all the $r$-balls centered at the data points that contain the query"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.4955","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":""},"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-05-18T04:34:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QouweUwYSJbT4j5LVh4UQTtq8XpVZG8T9yhp84JDlF+a1LFYYLmqOZIrsyvpqGbN1M+HQiz62FtNWjV9R4uCBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T21:34:07.599418Z"},"content_sha256":"133e49e5062011bd29588de9930d5e91ae3287067f0b5fca77aa05607c32e422","schema_version":"1.0","event_id":"sha256:133e49e5062011bd29588de9930d5e91ae3287067f0b5fca77aa05607c32e422"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UMSITONOPYTXAI6NBZ2FH3V2HI/bundle.json","state_url":"https://pith.science/pith/UMSITONOPYTXAI6NBZ2FH3V2HI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UMSITONOPYTXAI6NBZ2FH3V2HI/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-05-30T21:34:07Z","links":{"resolver":"https://pith.science/pith/UMSITONOPYTXAI6NBZ2FH3V2HI","bundle":"https://pith.science/pith/UMSITONOPYTXAI6NBZ2FH3V2HI/bundle.json","state":"https://pith.science/pith/UMSITONOPYTXAI6NBZ2FH3V2HI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UMSITONOPYTXAI6NBZ2FH3V2HI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:UMSITONOPYTXAI6NBZ2FH3V2HI","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":"3e8521457002fd6031b233c104fa6b0825d11f70be2c599d280fd5405885354e","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2010-11-22T21:29:23Z","title_canon_sha256":"e6d0490634f0af10cc7572259260ceafd1de751eb92b420943b1942130c49bd3"},"schema_version":"1.0","source":{"id":"1011.4955","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.4955","created_at":"2026-05-18T04:34:54Z"},{"alias_kind":"arxiv_version","alias_value":"1011.4955v1","created_at":"2026-05-18T04:34:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.4955","created_at":"2026-05-18T04:34:54Z"},{"alias_kind":"pith_short_12","alias_value":"UMSITONOPYTX","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_16","alias_value":"UMSITONOPYTXAI6N","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_8","alias_value":"UMSITONO","created_at":"2026-05-18T12:26:15Z"}],"graph_snapshots":[{"event_id":"sha256:133e49e5062011bd29588de9930d5e91ae3287067f0b5fca77aa05607c32e422","target":"graph","created_at":"2026-05-18T04:34:54Z","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"},"paper":{"abstract_excerpt":"We investigate the problem of finding reverse nearest neighbors efficiently. Although provably good solutions exist for this problem in low or fixed dimensions, to this date the methods proposed in high dimensions are mostly heuristic. We introduce a method that is both provably correct and efficient in all dimensions, based on a reduction of the problem to one instance of $\\e$-nearest neighbor search plus a controlled number of instances of {\\em exhaustive $r$-\\pleb}, a variant of {\\em Point Location among Equal Balls} where all the $r$-balls centered at the data points that contain the query","authors_text":"David Arthur, Steve Y. Oudot","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2010-11-22T21:29:23Z","title":"Reverse Nearest Neighbors Search in High Dimensions using Locality-Sensitive Hashing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.4955","kind":"arxiv","version":1},"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:5ec04fc134ff50fe51de98dc8056d7c99ea1cb885c9464d83d315aa8e81fa1d0","target":"record","created_at":"2026-05-18T04:34:54Z","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":"3e8521457002fd6031b233c104fa6b0825d11f70be2c599d280fd5405885354e","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2010-11-22T21:29:23Z","title_canon_sha256":"e6d0490634f0af10cc7572259260ceafd1de751eb92b420943b1942130c49bd3"},"schema_version":"1.0","source":{"id":"1011.4955","kind":"arxiv","version":1}},"canonical_sha256":"a32489b9ae7e277023cd0e7453eeba3a1429e3705d11d6693bbe7e36cbe484ef","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a32489b9ae7e277023cd0e7453eeba3a1429e3705d11d6693bbe7e36cbe484ef","first_computed_at":"2026-05-18T04:34:54.952848Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:34:54.952848Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LsZykHG2Z9ktSAyBmGzbVUUAAbRlN7xPnsh0ZMP0HqCNpt/RN1KDoYRwm+PEaLJbVCvWkmFzfYoMGPs68uxGDA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:34:54.953354Z","signed_message":"canonical_sha256_bytes"},"source_id":"1011.4955","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5ec04fc134ff50fe51de98dc8056d7c99ea1cb885c9464d83d315aa8e81fa1d0","sha256:133e49e5062011bd29588de9930d5e91ae3287067f0b5fca77aa05607c32e422"],"state_sha256":"9a91e671468aa6077bb18ba80c6f29262f259cdbb90863c5aa1eff89c3424438"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IeYwIBxwdc/ESjoW/mWvFPqO9n6ThmW329wDCu1wtl/H/vMY1+LjI0xUmJFo47RM/572uzLs4jFrfv/Vn/BVCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T21:34:07.602335Z","bundle_sha256":"eef670b620ea32be2346cdae6ea264a374dc68c7b268154f1fa17c983e18b9f6"}}