{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:DZVA5BMIA6M23UMOY35ELE7D24","short_pith_number":"pith:DZVA5BMI","canonical_record":{"source":{"id":"1506.04867","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-06-16T08:15:39Z","cross_cats_sorted":[],"title_canon_sha256":"3ed4d3cc4e937070690aa76c89936ef1b90ccb1a3e6e940226e81036f63bbc1a","abstract_canon_sha256":"933bfb92611cb816d1b3476885281daf7b4eaf7d98a4c36779edeac3101d2611"},"schema_version":"1.0"},"canonical_sha256":"1e6a0e85880799add18ec6fa4593e3d73bd688acb9acd74ac18875b937aeb043","source":{"kind":"arxiv","id":"1506.04867","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.04867","created_at":"2026-05-18T01:48:05Z"},{"alias_kind":"arxiv_version","alias_value":"1506.04867v1","created_at":"2026-05-18T01:48:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.04867","created_at":"2026-05-18T01:48:05Z"},{"alias_kind":"pith_short_12","alias_value":"DZVA5BMIA6M2","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"DZVA5BMIA6M23UMO","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"DZVA5BMI","created_at":"2026-05-18T12:29:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:DZVA5BMIA6M23UMOY35ELE7D24","target":"record","payload":{"canonical_record":{"source":{"id":"1506.04867","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-06-16T08:15:39Z","cross_cats_sorted":[],"title_canon_sha256":"3ed4d3cc4e937070690aa76c89936ef1b90ccb1a3e6e940226e81036f63bbc1a","abstract_canon_sha256":"933bfb92611cb816d1b3476885281daf7b4eaf7d98a4c36779edeac3101d2611"},"schema_version":"1.0"},"canonical_sha256":"1e6a0e85880799add18ec6fa4593e3d73bd688acb9acd74ac18875b937aeb043","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:48:05.675412Z","signature_b64":"ZQ6pBg/CdmyWCVEAMBMGwAkIOIj9euk3GH07JXrZlVArVLchBQaJlImXKSdIJMqSrpnHaRWpYmKs583l9BF7Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1e6a0e85880799add18ec6fa4593e3d73bd688acb9acd74ac18875b937aeb043","last_reissued_at":"2026-05-18T01:48:05.674869Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:48:05.674869Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1506.04867","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-18T01:48:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ygl4Sd68sGcvcCgq6sSYQyNF1Y4zPxQmMVVUYzlUtRqVw/kdpo5XoYD4YIXzXd7P916PhmRJ3YU0kD5gKrARAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T10:42:36.324785Z"},"content_sha256":"6769582b03132cb0fd0f6699457d8716a25d7b595bdc01ffa85ce71f258aae92","schema_version":"1.0","event_id":"sha256:6769582b03132cb0fd0f6699457d8716a25d7b595bdc01ffa85ce71f258aae92"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:DZVA5BMIA6M23UMOY35ELE7D24","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Reverse k Nearest Neighbor evaluation for hierarchical index","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Debajyoti Bera, Siddharth Dawar, Vikram Goyal","submitted_at":"2015-06-16T08:15:39Z","abstract_excerpt":"\"Reverse Nearest Neighbor\" query finds applications in decision support systems, profile-based marketing, emergency services etc. In this paper, we point out a few flaws in the branch and bound algorithms proposed earlier for computing monochromatic RkNN queries over data points stored in hierarchical index. We give suitable counter examples to validate our claims and propose a correct algorithm for the corresponding problem. We show that our algorithm is correct by identifying necessary conditions behind correctness of algorithms for this problem."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.04867","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-18T01:48:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BFN9thDe2vO2eUgwEhFccBh29xOLTjW38jbTVELHm0P2lMX72cVzSMZ+uF7wrNMlN7A5ROjPrtmtO81ZzZ5iCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T10:42:36.325617Z"},"content_sha256":"69c9863cac681412a2bbd33c6aacab4e44d0f5f1a277e785979680e9ccf04c2e","schema_version":"1.0","event_id":"sha256:69c9863cac681412a2bbd33c6aacab4e44d0f5f1a277e785979680e9ccf04c2e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DZVA5BMIA6M23UMOY35ELE7D24/bundle.json","state_url":"https://pith.science/pith/DZVA5BMIA6M23UMOY35ELE7D24/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DZVA5BMIA6M23UMOY35ELE7D24/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-30T10:42:36Z","links":{"resolver":"https://pith.science/pith/DZVA5BMIA6M23UMOY35ELE7D24","bundle":"https://pith.science/pith/DZVA5BMIA6M23UMOY35ELE7D24/bundle.json","state":"https://pith.science/pith/DZVA5BMIA6M23UMOY35ELE7D24/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DZVA5BMIA6M23UMOY35ELE7D24/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:DZVA5BMIA6M23UMOY35ELE7D24","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":"933bfb92611cb816d1b3476885281daf7b4eaf7d98a4c36779edeac3101d2611","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-06-16T08:15:39Z","title_canon_sha256":"3ed4d3cc4e937070690aa76c89936ef1b90ccb1a3e6e940226e81036f63bbc1a"},"schema_version":"1.0","source":{"id":"1506.04867","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.04867","created_at":"2026-05-18T01:48:05Z"},{"alias_kind":"arxiv_version","alias_value":"1506.04867v1","created_at":"2026-05-18T01:48:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.04867","created_at":"2026-05-18T01:48:05Z"},{"alias_kind":"pith_short_12","alias_value":"DZVA5BMIA6M2","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"DZVA5BMIA6M23UMO","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"DZVA5BMI","created_at":"2026-05-18T12:29:17Z"}],"graph_snapshots":[{"event_id":"sha256:69c9863cac681412a2bbd33c6aacab4e44d0f5f1a277e785979680e9ccf04c2e","target":"graph","created_at":"2026-05-18T01:48:05Z","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":"\"Reverse Nearest Neighbor\" query finds applications in decision support systems, profile-based marketing, emergency services etc. In this paper, we point out a few flaws in the branch and bound algorithms proposed earlier for computing monochromatic RkNN queries over data points stored in hierarchical index. We give suitable counter examples to validate our claims and propose a correct algorithm for the corresponding problem. We show that our algorithm is correct by identifying necessary conditions behind correctness of algorithms for this problem.","authors_text":"Debajyoti Bera, Siddharth Dawar, Vikram Goyal","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-06-16T08:15:39Z","title":"Efficient Reverse k Nearest Neighbor evaluation for hierarchical index"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.04867","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:6769582b03132cb0fd0f6699457d8716a25d7b595bdc01ffa85ce71f258aae92","target":"record","created_at":"2026-05-18T01:48:05Z","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":"933bfb92611cb816d1b3476885281daf7b4eaf7d98a4c36779edeac3101d2611","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-06-16T08:15:39Z","title_canon_sha256":"3ed4d3cc4e937070690aa76c89936ef1b90ccb1a3e6e940226e81036f63bbc1a"},"schema_version":"1.0","source":{"id":"1506.04867","kind":"arxiv","version":1}},"canonical_sha256":"1e6a0e85880799add18ec6fa4593e3d73bd688acb9acd74ac18875b937aeb043","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1e6a0e85880799add18ec6fa4593e3d73bd688acb9acd74ac18875b937aeb043","first_computed_at":"2026-05-18T01:48:05.674869Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:48:05.674869Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZQ6pBg/CdmyWCVEAMBMGwAkIOIj9euk3GH07JXrZlVArVLchBQaJlImXKSdIJMqSrpnHaRWpYmKs583l9BF7Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:48:05.675412Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.04867","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6769582b03132cb0fd0f6699457d8716a25d7b595bdc01ffa85ce71f258aae92","sha256:69c9863cac681412a2bbd33c6aacab4e44d0f5f1a277e785979680e9ccf04c2e"],"state_sha256":"a4f76a23728fa93942069f2948a7708318e0b766f3029008d83006663c466f38"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hrl+cJzoagiFhHvYjLO74Vm7lowewfIAvMofnXzZunscrUELO6uDroFeQwTSYpzFRW7uBp8Qc/xCUx8ogDoFDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T10:42:36.328207Z","bundle_sha256":"9afb8f1a04c18a61159d52ddf057cc3f326f23a7ca24412a135eb8e21828a103"}}