{"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"}