{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:UJY23HJCTPDKMCA34W4EMXYRXU","short_pith_number":"pith:UJY23HJC","canonical_record":{"source":{"id":"1804.06829","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2018-04-18T17:28:48Z","cross_cats_sorted":[],"title_canon_sha256":"bd07459ca5e3bce62e127cfef1f0ad832101edb3c038c78436c556507f1d99a7","abstract_canon_sha256":"e7fa48edfcbe5cce5489d3d6055d649b2ea5f90e53b0e095cf95f672c6f9990c"},"schema_version":"1.0"},"canonical_sha256":"a271ad9d229bc6a6081be5b8465f11bd11033635dbf0fac11eb0e940809be0c7","source":{"kind":"arxiv","id":"1804.06829","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.06829","created_at":"2026-05-18T00:17:52Z"},{"alias_kind":"arxiv_version","alias_value":"1804.06829v2","created_at":"2026-05-18T00:17:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.06829","created_at":"2026-05-18T00:17:52Z"},{"alias_kind":"pith_short_12","alias_value":"UJY23HJCTPDK","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"UJY23HJCTPDKMCA3","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"UJY23HJC","created_at":"2026-05-18T12:32:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:UJY23HJCTPDKMCA34W4EMXYRXU","target":"record","payload":{"canonical_record":{"source":{"id":"1804.06829","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2018-04-18T17:28:48Z","cross_cats_sorted":[],"title_canon_sha256":"bd07459ca5e3bce62e127cfef1f0ad832101edb3c038c78436c556507f1d99a7","abstract_canon_sha256":"e7fa48edfcbe5cce5489d3d6055d649b2ea5f90e53b0e095cf95f672c6f9990c"},"schema_version":"1.0"},"canonical_sha256":"a271ad9d229bc6a6081be5b8465f11bd11033635dbf0fac11eb0e940809be0c7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:52.938905Z","signature_b64":"LrZxIGCl3asgxwv+DD9Iif00iFj84ozxwhKSUB+J0EEJRCeW7q5RD8pXRHZypUhK50wRTG/Iz2u1UYJoQr5CDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a271ad9d229bc6a6081be5b8465f11bd11033635dbf0fac11eb0e940809be0c7","last_reissued_at":"2026-05-18T00:17:52.938294Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:52.938294Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1804.06829","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-05-18T00:17:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0hbf78uNBKRJijrPZWEJQTbgoBXedL25Iq3von1k+hAlor4O1kp5WoEkXmtv7LrCSvfa7l2ci7nt6R40fvQTDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T04:28:50.831860Z"},"content_sha256":"071d472868174f679f28eca8f7bd5e2671b9ea6d3f7baebb3e0ee20fa8f7564d","schema_version":"1.0","event_id":"sha256:071d472868174f679f28eca8f7bd5e2671b9ea6d3f7baebb3e0ee20fa8f7564d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:UJY23HJCTPDKMCA34W4EMXYRXU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"HD-Index: Pushing the Scalability-Accuracy Boundary for Approximate kNN Search in High-Dimensional Spaces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Akhil Arora, Arnab Bhattacharya, Piyush Kumar, Sakshi Sinha","submitted_at":"2018-04-18T17:28:48Z","abstract_excerpt":"Nearest neighbor searching of large databases in high-dimensional spaces is inherently difficult due to the curse of dimensionality. A flavor of approximation is, therefore, necessary to practically solve the problem of nearest neighbor search. In this paper, we propose a novel yet simple indexing scheme, HD-Index, to solve the problem of approximate k-nearest neighbor queries in massive high-dimensional databases. HD-Index consists of a set of novel hierarchical structures called RDB-trees built on Hilbert keys of database objects. The leaves of the RDB-trees store distances of database objec"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.06829","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":""},"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-18T00:17:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cowmgSUyr+L929Ip0jsT8QPOVhW2Gvklky2kndJarNP46syb3DC5C9wUbCB3WAqg2m0d8/npenF0xeq41V7hAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T04:28:50.832425Z"},"content_sha256":"4ab6e68cd833d5dee8c7baabc1b4eef8bcec09181bc7bb2a18faa5c23a45b927","schema_version":"1.0","event_id":"sha256:4ab6e68cd833d5dee8c7baabc1b4eef8bcec09181bc7bb2a18faa5c23a45b927"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UJY23HJCTPDKMCA34W4EMXYRXU/bundle.json","state_url":"https://pith.science/pith/UJY23HJCTPDKMCA34W4EMXYRXU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UJY23HJCTPDKMCA34W4EMXYRXU/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-27T04:28:50Z","links":{"resolver":"https://pith.science/pith/UJY23HJCTPDKMCA34W4EMXYRXU","bundle":"https://pith.science/pith/UJY23HJCTPDKMCA34W4EMXYRXU/bundle.json","state":"https://pith.science/pith/UJY23HJCTPDKMCA34W4EMXYRXU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UJY23HJCTPDKMCA34W4EMXYRXU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:UJY23HJCTPDKMCA34W4EMXYRXU","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":"e7fa48edfcbe5cce5489d3d6055d649b2ea5f90e53b0e095cf95f672c6f9990c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2018-04-18T17:28:48Z","title_canon_sha256":"bd07459ca5e3bce62e127cfef1f0ad832101edb3c038c78436c556507f1d99a7"},"schema_version":"1.0","source":{"id":"1804.06829","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.06829","created_at":"2026-05-18T00:17:52Z"},{"alias_kind":"arxiv_version","alias_value":"1804.06829v2","created_at":"2026-05-18T00:17:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.06829","created_at":"2026-05-18T00:17:52Z"},{"alias_kind":"pith_short_12","alias_value":"UJY23HJCTPDK","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"UJY23HJCTPDKMCA3","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"UJY23HJC","created_at":"2026-05-18T12:32:56Z"}],"graph_snapshots":[{"event_id":"sha256:4ab6e68cd833d5dee8c7baabc1b4eef8bcec09181bc7bb2a18faa5c23a45b927","target":"graph","created_at":"2026-05-18T00:17:52Z","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":"Nearest neighbor searching of large databases in high-dimensional spaces is inherently difficult due to the curse of dimensionality. A flavor of approximation is, therefore, necessary to practically solve the problem of nearest neighbor search. In this paper, we propose a novel yet simple indexing scheme, HD-Index, to solve the problem of approximate k-nearest neighbor queries in massive high-dimensional databases. HD-Index consists of a set of novel hierarchical structures called RDB-trees built on Hilbert keys of database objects. The leaves of the RDB-trees store distances of database objec","authors_text":"Akhil Arora, Arnab Bhattacharya, Piyush Kumar, Sakshi Sinha","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2018-04-18T17:28:48Z","title":"HD-Index: Pushing the Scalability-Accuracy Boundary for Approximate kNN Search in High-Dimensional Spaces"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.06829","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:071d472868174f679f28eca8f7bd5e2671b9ea6d3f7baebb3e0ee20fa8f7564d","target":"record","created_at":"2026-05-18T00:17:52Z","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":"e7fa48edfcbe5cce5489d3d6055d649b2ea5f90e53b0e095cf95f672c6f9990c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2018-04-18T17:28:48Z","title_canon_sha256":"bd07459ca5e3bce62e127cfef1f0ad832101edb3c038c78436c556507f1d99a7"},"schema_version":"1.0","source":{"id":"1804.06829","kind":"arxiv","version":2}},"canonical_sha256":"a271ad9d229bc6a6081be5b8465f11bd11033635dbf0fac11eb0e940809be0c7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a271ad9d229bc6a6081be5b8465f11bd11033635dbf0fac11eb0e940809be0c7","first_computed_at":"2026-05-18T00:17:52.938294Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:17:52.938294Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LrZxIGCl3asgxwv+DD9Iif00iFj84ozxwhKSUB+J0EEJRCeW7q5RD8pXRHZypUhK50wRTG/Iz2u1UYJoQr5CDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:17:52.938905Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.06829","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:071d472868174f679f28eca8f7bd5e2671b9ea6d3f7baebb3e0ee20fa8f7564d","sha256:4ab6e68cd833d5dee8c7baabc1b4eef8bcec09181bc7bb2a18faa5c23a45b927"],"state_sha256":"43c5bbc8b34e61d368f949a2250c342163c3c694ad2b850385ea312c6403923b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EFRD0cv3iwbw4LLuXJb7y79GCm649Py9UE50eh71V+pzpt8CWTkMYW1cUCPIsaoGSfWgcrsS+3EI5WcZltXhCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T04:28:50.835337Z","bundle_sha256":"1cc5c5a07bb03bffdc4b8b17e8ee3b1e22be5cfeaa0be7554cc222ff1b2c7c7a"}}