{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:A36WZULY4FQ34RYQE2TLE2VNTE","short_pith_number":"pith:A36WZULY","canonical_record":{"source":{"id":"1510.01991","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2015-10-07T15:39:39Z","cross_cats_sorted":[],"title_canon_sha256":"0d70c04d60d829d76500e29aacc6e901f1355bb49b643994d775b9c0b92f720a","abstract_canon_sha256":"1dba16a2163e75c30b359acddc39821e5a6364f0cb23691643e74cad7afefbba"},"schema_version":"1.0"},"canonical_sha256":"06fd6cd178e161be471026a6b26aad991261830d7b79498f6baae24c44ead7c5","source":{"kind":"arxiv","id":"1510.01991","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.01991","created_at":"2026-05-18T01:14:35Z"},{"alias_kind":"arxiv_version","alias_value":"1510.01991v1","created_at":"2026-05-18T01:14:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.01991","created_at":"2026-05-18T01:14:35Z"},{"alias_kind":"pith_short_12","alias_value":"A36WZULY4FQ3","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"A36WZULY4FQ34RYQ","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"A36WZULY","created_at":"2026-05-18T12:29:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:A36WZULY4FQ34RYQE2TLE2VNTE","target":"record","payload":{"canonical_record":{"source":{"id":"1510.01991","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2015-10-07T15:39:39Z","cross_cats_sorted":[],"title_canon_sha256":"0d70c04d60d829d76500e29aacc6e901f1355bb49b643994d775b9c0b92f720a","abstract_canon_sha256":"1dba16a2163e75c30b359acddc39821e5a6364f0cb23691643e74cad7afefbba"},"schema_version":"1.0"},"canonical_sha256":"06fd6cd178e161be471026a6b26aad991261830d7b79498f6baae24c44ead7c5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:14:35.864673Z","signature_b64":"3Yj0oOzA0wyP+v33cDejTxlH+c+1sHWVGgBkvDR91SyLc4i9JjOv0SbhWRrzVjbQDLq/c3NLYHDtOpOcYwz0BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"06fd6cd178e161be471026a6b26aad991261830d7b79498f6baae24c44ead7c5","last_reissued_at":"2026-05-18T01:14:35.863952Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:14:35.863952Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1510.01991","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:14:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d9OnXGdWwbPz3pOjbF1sSsnjc9owigEVl+qQ1y6uzEVqs6ZxPNIXbQF90voectBi6moKqq4PjTLR3IoGUs2sBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T23:38:38.584402Z"},"content_sha256":"4af7c9d3ecb41623a5a74871177e5799a0aeae445feae557d9860a64f7585e9a","schema_version":"1.0","event_id":"sha256:4af7c9d3ecb41623a5a74871177e5799a0aeae445feae557d9860a64f7585e9a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:A36WZULY4FQ34RYQE2TLE2VNTE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"HDIdx: High-Dimensional Indexing for Efficient Approximate Nearest Neighbor Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Jintao Li, Ji Wan, Pengcheng Wu, Sheng Tang, Steven C.H. Hoi, Yongdong Zhang","submitted_at":"2015-10-07T15:39:39Z","abstract_excerpt":"Fast Nearest Neighbor (NN) search is a fundamental challenge in large-scale data processing and analytics, particularly for analyzing multimedia contents which are often of high dimensionality. Instead of using exact NN search, extensive research efforts have been focusing on approximate NN search algorithms. In this work, we present \"HDIdx\", an efficient high-dimensional indexing library for fast approximate NN search, which is open-source and written in Python. It offers a family of state-of-the-art algorithms that convert input high-dimensional vectors into compact binary codes, making them"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.01991","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:14:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l3nFfcQj1i+mMi3ew5vxt5sHacenwsBpn5/59jI714V6lonmSq4Yj82bYUQfhafhTUTCNCUCh6rLdfrcq8PTDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T23:38:38.585088Z"},"content_sha256":"e7858d8002d3f9f3a80540a6bc9419cc448223e2e6903ead90cd6473b290ac8d","schema_version":"1.0","event_id":"sha256:e7858d8002d3f9f3a80540a6bc9419cc448223e2e6903ead90cd6473b290ac8d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/A36WZULY4FQ34RYQE2TLE2VNTE/bundle.json","state_url":"https://pith.science/pith/A36WZULY4FQ34RYQE2TLE2VNTE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/A36WZULY4FQ34RYQE2TLE2VNTE/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-25T23:38:38Z","links":{"resolver":"https://pith.science/pith/A36WZULY4FQ34RYQE2TLE2VNTE","bundle":"https://pith.science/pith/A36WZULY4FQ34RYQE2TLE2VNTE/bundle.json","state":"https://pith.science/pith/A36WZULY4FQ34RYQE2TLE2VNTE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/A36WZULY4FQ34RYQE2TLE2VNTE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:A36WZULY4FQ34RYQE2TLE2VNTE","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":"1dba16a2163e75c30b359acddc39821e5a6364f0cb23691643e74cad7afefbba","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2015-10-07T15:39:39Z","title_canon_sha256":"0d70c04d60d829d76500e29aacc6e901f1355bb49b643994d775b9c0b92f720a"},"schema_version":"1.0","source":{"id":"1510.01991","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.01991","created_at":"2026-05-18T01:14:35Z"},{"alias_kind":"arxiv_version","alias_value":"1510.01991v1","created_at":"2026-05-18T01:14:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.01991","created_at":"2026-05-18T01:14:35Z"},{"alias_kind":"pith_short_12","alias_value":"A36WZULY4FQ3","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"A36WZULY4FQ34RYQ","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"A36WZULY","created_at":"2026-05-18T12:29:10Z"}],"graph_snapshots":[{"event_id":"sha256:e7858d8002d3f9f3a80540a6bc9419cc448223e2e6903ead90cd6473b290ac8d","target":"graph","created_at":"2026-05-18T01:14:35Z","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":"Fast Nearest Neighbor (NN) search is a fundamental challenge in large-scale data processing and analytics, particularly for analyzing multimedia contents which are often of high dimensionality. Instead of using exact NN search, extensive research efforts have been focusing on approximate NN search algorithms. In this work, we present \"HDIdx\", an efficient high-dimensional indexing library for fast approximate NN search, which is open-source and written in Python. It offers a family of state-of-the-art algorithms that convert input high-dimensional vectors into compact binary codes, making them","authors_text":"Jintao Li, Ji Wan, Pengcheng Wu, Sheng Tang, Steven C.H. Hoi, Yongdong Zhang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2015-10-07T15:39:39Z","title":"HDIdx: High-Dimensional Indexing for Efficient Approximate Nearest Neighbor Search"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.01991","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:4af7c9d3ecb41623a5a74871177e5799a0aeae445feae557d9860a64f7585e9a","target":"record","created_at":"2026-05-18T01:14:35Z","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":"1dba16a2163e75c30b359acddc39821e5a6364f0cb23691643e74cad7afefbba","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2015-10-07T15:39:39Z","title_canon_sha256":"0d70c04d60d829d76500e29aacc6e901f1355bb49b643994d775b9c0b92f720a"},"schema_version":"1.0","source":{"id":"1510.01991","kind":"arxiv","version":1}},"canonical_sha256":"06fd6cd178e161be471026a6b26aad991261830d7b79498f6baae24c44ead7c5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"06fd6cd178e161be471026a6b26aad991261830d7b79498f6baae24c44ead7c5","first_computed_at":"2026-05-18T01:14:35.863952Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:14:35.863952Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3Yj0oOzA0wyP+v33cDejTxlH+c+1sHWVGgBkvDR91SyLc4i9JjOv0SbhWRrzVjbQDLq/c3NLYHDtOpOcYwz0BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:14:35.864673Z","signed_message":"canonical_sha256_bytes"},"source_id":"1510.01991","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4af7c9d3ecb41623a5a74871177e5799a0aeae445feae557d9860a64f7585e9a","sha256:e7858d8002d3f9f3a80540a6bc9419cc448223e2e6903ead90cd6473b290ac8d"],"state_sha256":"bdac9156cfdaecc0c91bf129630a1e4fce9f65a97d5e603685346105e4877e7b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9m3bXllWYDzrdvDEysT7WiXE0b2rKmA+Y2QvT1zyoQXPzvg506i8qDfhGFQjfgKD1TizcLg6NoJ09v8QFbPxDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T23:38:38.588835Z","bundle_sha256":"c676e822a135f3e4da991e27da0b10c889ab8148a9405cc81bc996083c60e041"}}