{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:Q3ZQPPPUYFR3RA3OPCZ2A7TKBP","short_pith_number":"pith:Q3ZQPPPU","canonical_record":{"source":{"id":"1408.2927","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-08-13T07:29:12Z","cross_cats_sorted":["cs.CV","cs.DB"],"title_canon_sha256":"2761a108bafd734301f494dc1e2d95ed5cdd747af57acc9e129edb0b476c569c","abstract_canon_sha256":"6e268892de0bb6cf4d189e1706fba72b3358a40f580cfc0e471f942c728e7d84"},"schema_version":"1.0"},"canonical_sha256":"86f307bdf4c163b8836e78b3a07e6a0bcd9fad36d259e1fc623008eb86caabff","source":{"kind":"arxiv","id":"1408.2927","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.2927","created_at":"2026-05-18T02:45:20Z"},{"alias_kind":"arxiv_version","alias_value":"1408.2927v1","created_at":"2026-05-18T02:45:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.2927","created_at":"2026-05-18T02:45:20Z"},{"alias_kind":"pith_short_12","alias_value":"Q3ZQPPPUYFR3","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"Q3ZQPPPUYFR3RA3O","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"Q3ZQPPPU","created_at":"2026-05-18T12:28:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:Q3ZQPPPUYFR3RA3OPCZ2A7TKBP","target":"record","payload":{"canonical_record":{"source":{"id":"1408.2927","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-08-13T07:29:12Z","cross_cats_sorted":["cs.CV","cs.DB"],"title_canon_sha256":"2761a108bafd734301f494dc1e2d95ed5cdd747af57acc9e129edb0b476c569c","abstract_canon_sha256":"6e268892de0bb6cf4d189e1706fba72b3358a40f580cfc0e471f942c728e7d84"},"schema_version":"1.0"},"canonical_sha256":"86f307bdf4c163b8836e78b3a07e6a0bcd9fad36d259e1fc623008eb86caabff","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:45:20.963290Z","signature_b64":"LZ2kgonZZSZX2beNfwZqdZ8HebJsIgs4vogbENDu4ewzohqJM3qnYj7kLxOPCtisjYZxKtCFyVMFFUl5GPXYDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"86f307bdf4c163b8836e78b3a07e6a0bcd9fad36d259e1fc623008eb86caabff","last_reissued_at":"2026-05-18T02:45:20.962878Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:45:20.962878Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1408.2927","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-18T02:45:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dHWcD4YWfUEF0hEbdQenbeuA+V+u2oL866bQO6038A2RZZo58dz74qyXPPaGyc2TillX2Vy0Yf9RxBhDgcB4Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T01:54:30.127250Z"},"content_sha256":"8aeebef3093cf79360eea1632b536a8fb9fd3837068b453c0022d6596b03c40d","schema_version":"1.0","event_id":"sha256:8aeebef3093cf79360eea1632b536a8fb9fd3837068b453c0022d6596b03c40d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:Q3ZQPPPUYFR3RA3OPCZ2A7TKBP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Hashing for Similarity Search: A Survey","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.DB"],"primary_cat":"cs.DS","authors_text":"Heng Tao Shen, Jianqiu Ji, Jingdong Wang, Jingkuan Song","submitted_at":"2014-08-13T07:29:12Z","abstract_excerpt":"Similarity search (nearest neighbor search) is a problem of pursuing the data items whose distances to a query item are the smallest from a large database. Various methods have been developed to address this problem, and recently a lot of efforts have been devoted to approximate search. In this paper, we present a survey on one of the main solutions, hashing, which has been widely studied since the pioneering work locality sensitive hashing. We divide the hashing algorithms two main categories: locality sensitive hashing, which designs hash functions without exploring the data distribution and"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.2927","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-18T02:45:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"11ux3niNhm96qb+KKGUBh03I6y+EVxvUhwiHdwe8dDy7uu16vpI2XAVXCg6s1cHqS6kUrbWKbfLaKTwLd3hgBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T01:54:30.127996Z"},"content_sha256":"70fd1dadb26a9dfcbc3e9c07710b8e2013bb5c890372ebf68e976159e404e907","schema_version":"1.0","event_id":"sha256:70fd1dadb26a9dfcbc3e9c07710b8e2013bb5c890372ebf68e976159e404e907"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Q3ZQPPPUYFR3RA3OPCZ2A7TKBP/bundle.json","state_url":"https://pith.science/pith/Q3ZQPPPUYFR3RA3OPCZ2A7TKBP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Q3ZQPPPUYFR3RA3OPCZ2A7TKBP/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-31T01:54:30Z","links":{"resolver":"https://pith.science/pith/Q3ZQPPPUYFR3RA3OPCZ2A7TKBP","bundle":"https://pith.science/pith/Q3ZQPPPUYFR3RA3OPCZ2A7TKBP/bundle.json","state":"https://pith.science/pith/Q3ZQPPPUYFR3RA3OPCZ2A7TKBP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Q3ZQPPPUYFR3RA3OPCZ2A7TKBP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:Q3ZQPPPUYFR3RA3OPCZ2A7TKBP","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":"6e268892de0bb6cf4d189e1706fba72b3358a40f580cfc0e471f942c728e7d84","cross_cats_sorted":["cs.CV","cs.DB"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-08-13T07:29:12Z","title_canon_sha256":"2761a108bafd734301f494dc1e2d95ed5cdd747af57acc9e129edb0b476c569c"},"schema_version":"1.0","source":{"id":"1408.2927","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.2927","created_at":"2026-05-18T02:45:20Z"},{"alias_kind":"arxiv_version","alias_value":"1408.2927v1","created_at":"2026-05-18T02:45:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.2927","created_at":"2026-05-18T02:45:20Z"},{"alias_kind":"pith_short_12","alias_value":"Q3ZQPPPUYFR3","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"Q3ZQPPPUYFR3RA3O","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"Q3ZQPPPU","created_at":"2026-05-18T12:28:43Z"}],"graph_snapshots":[{"event_id":"sha256:70fd1dadb26a9dfcbc3e9c07710b8e2013bb5c890372ebf68e976159e404e907","target":"graph","created_at":"2026-05-18T02:45:20Z","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":"Similarity search (nearest neighbor search) is a problem of pursuing the data items whose distances to a query item are the smallest from a large database. Various methods have been developed to address this problem, and recently a lot of efforts have been devoted to approximate search. In this paper, we present a survey on one of the main solutions, hashing, which has been widely studied since the pioneering work locality sensitive hashing. We divide the hashing algorithms two main categories: locality sensitive hashing, which designs hash functions without exploring the data distribution and","authors_text":"Heng Tao Shen, Jianqiu Ji, Jingdong Wang, Jingkuan Song","cross_cats":["cs.CV","cs.DB"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-08-13T07:29:12Z","title":"Hashing for Similarity Search: A Survey"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.2927","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:8aeebef3093cf79360eea1632b536a8fb9fd3837068b453c0022d6596b03c40d","target":"record","created_at":"2026-05-18T02:45:20Z","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":"6e268892de0bb6cf4d189e1706fba72b3358a40f580cfc0e471f942c728e7d84","cross_cats_sorted":["cs.CV","cs.DB"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-08-13T07:29:12Z","title_canon_sha256":"2761a108bafd734301f494dc1e2d95ed5cdd747af57acc9e129edb0b476c569c"},"schema_version":"1.0","source":{"id":"1408.2927","kind":"arxiv","version":1}},"canonical_sha256":"86f307bdf4c163b8836e78b3a07e6a0bcd9fad36d259e1fc623008eb86caabff","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"86f307bdf4c163b8836e78b3a07e6a0bcd9fad36d259e1fc623008eb86caabff","first_computed_at":"2026-05-18T02:45:20.962878Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:45:20.962878Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LZ2kgonZZSZX2beNfwZqdZ8HebJsIgs4vogbENDu4ewzohqJM3qnYj7kLxOPCtisjYZxKtCFyVMFFUl5GPXYDA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:45:20.963290Z","signed_message":"canonical_sha256_bytes"},"source_id":"1408.2927","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8aeebef3093cf79360eea1632b536a8fb9fd3837068b453c0022d6596b03c40d","sha256:70fd1dadb26a9dfcbc3e9c07710b8e2013bb5c890372ebf68e976159e404e907"],"state_sha256":"8e4cf4563849d61e2b70e747b9deece652453c41ecf6ec791dcd2f95cfd8ae6c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0UvOLkQTEv0PIV3QNcIx34ySc1WbhQxe7PNKn7SnDKoz5VYXD2WTBb8T/f1pXAY9RcZz2YBUWjjKD/czIz8tDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T01:54:30.131868Z","bundle_sha256":"6c2c19114e673244f116b7423434a3c6fc9b34f918ba9b04f17b32fb60b9a66a"}}