{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:JBGJSBSG3VPO7SVDSW4OBCL75Y","short_pith_number":"pith:JBGJSBSG","canonical_record":{"source":{"id":"1205.2930","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2012-05-14T02:27:52Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"735b70724b7b66fec09c9d68e266a930fcd9f0a3f328068853febd47db07eac9","abstract_canon_sha256":"56a93f137bd22307c443ecf14a059d764e91e7a974ab3df55eb0c48f3279a651"},"schema_version":"1.0"},"canonical_sha256":"484c990646dd5eefcaa395b8e0897fee22414e786a14dee027febc44480c2bee","source":{"kind":"arxiv","id":"1205.2930","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.2930","created_at":"2026-05-18T03:55:45Z"},{"alias_kind":"arxiv_version","alias_value":"1205.2930v1","created_at":"2026-05-18T03:55:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.2930","created_at":"2026-05-18T03:55:45Z"},{"alias_kind":"pith_short_12","alias_value":"JBGJSBSG3VPO","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"JBGJSBSG3VPO7SVD","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"JBGJSBSG","created_at":"2026-05-18T12:27:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:JBGJSBSG3VPO7SVDSW4OBCL75Y","target":"record","payload":{"canonical_record":{"source":{"id":"1205.2930","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2012-05-14T02:27:52Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"735b70724b7b66fec09c9d68e266a930fcd9f0a3f328068853febd47db07eac9","abstract_canon_sha256":"56a93f137bd22307c443ecf14a059d764e91e7a974ab3df55eb0c48f3279a651"},"schema_version":"1.0"},"canonical_sha256":"484c990646dd5eefcaa395b8e0897fee22414e786a14dee027febc44480c2bee","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:55:45.654776Z","signature_b64":"YMicEiLYr0dKa5CyshN0tP32TFbArWI2rlYoEpe6Td5QJetm26ba95oDzvRPhwuY9VcyO1DmEDVH1JknGMYqBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"484c990646dd5eefcaa395b8e0897fee22414e786a14dee027febc44480c2bee","last_reissued_at":"2026-05-18T03:55:45.654226Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:55:45.654226Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1205.2930","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-18T03:55:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eYJLt4vUklYOlGrthSi5w5vdbgf89hTs/pqtPcEzS8/Vh9Xz/u8wTZC+yrjb9y4l9n1h4cCZtz9WMCPK9+6jDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T11:59:16.480274Z"},"content_sha256":"afc51bbf54253ee43e63637c6dc00f9e826a533fd3dd19effc12a970cef95083","schema_version":"1.0","event_id":"sha256:afc51bbf54253ee43e63637c6dc00f9e826a533fd3dd19effc12a970cef95083"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:JBGJSBSG3VPO7SVDSW4OBCL75Y","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Density Sensitive Hashing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.IR","authors_text":"Cheng Li, Deng Cai, Yue Lin","submitted_at":"2012-05-14T02:27:52Z","abstract_excerpt":"Nearest neighbors search is a fundamental problem in various research fields like machine learning, data mining and pattern recognition. Recently, hashing-based approaches, e.g., Locality Sensitive Hashing (LSH), are proved to be effective for scalable high dimensional nearest neighbors search. Many hashing algorithms found their theoretic root in random projection. Since these algorithms generate the hash tables (projections) randomly, a large number of hash tables (i.e., long codewords) are required in order to achieve both high precision and recall. To address this limitation, we propose a "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.2930","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-18T03:55:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JjxS/yZu5Q/oe91XIu/Zff9E9I/t24Wj/xOKBZWHsgkMB7XqPDPOzKgXSwFWnRoP8XsbNKMf6KxPtrpnfVg2Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T11:59:16.480642Z"},"content_sha256":"be47260d4c8c25869d863557fe85c9b797e9a601a5edb789eefc13bee18f46c2","schema_version":"1.0","event_id":"sha256:be47260d4c8c25869d863557fe85c9b797e9a601a5edb789eefc13bee18f46c2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JBGJSBSG3VPO7SVDSW4OBCL75Y/bundle.json","state_url":"https://pith.science/pith/JBGJSBSG3VPO7SVDSW4OBCL75Y/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JBGJSBSG3VPO7SVDSW4OBCL75Y/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-21T11:59:16Z","links":{"resolver":"https://pith.science/pith/JBGJSBSG3VPO7SVDSW4OBCL75Y","bundle":"https://pith.science/pith/JBGJSBSG3VPO7SVDSW4OBCL75Y/bundle.json","state":"https://pith.science/pith/JBGJSBSG3VPO7SVDSW4OBCL75Y/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JBGJSBSG3VPO7SVDSW4OBCL75Y/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:JBGJSBSG3VPO7SVDSW4OBCL75Y","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":"56a93f137bd22307c443ecf14a059d764e91e7a974ab3df55eb0c48f3279a651","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2012-05-14T02:27:52Z","title_canon_sha256":"735b70724b7b66fec09c9d68e266a930fcd9f0a3f328068853febd47db07eac9"},"schema_version":"1.0","source":{"id":"1205.2930","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.2930","created_at":"2026-05-18T03:55:45Z"},{"alias_kind":"arxiv_version","alias_value":"1205.2930v1","created_at":"2026-05-18T03:55:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.2930","created_at":"2026-05-18T03:55:45Z"},{"alias_kind":"pith_short_12","alias_value":"JBGJSBSG3VPO","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"JBGJSBSG3VPO7SVD","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"JBGJSBSG","created_at":"2026-05-18T12:27:11Z"}],"graph_snapshots":[{"event_id":"sha256:be47260d4c8c25869d863557fe85c9b797e9a601a5edb789eefc13bee18f46c2","target":"graph","created_at":"2026-05-18T03:55:45Z","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 neighbors search is a fundamental problem in various research fields like machine learning, data mining and pattern recognition. Recently, hashing-based approaches, e.g., Locality Sensitive Hashing (LSH), are proved to be effective for scalable high dimensional nearest neighbors search. Many hashing algorithms found their theoretic root in random projection. Since these algorithms generate the hash tables (projections) randomly, a large number of hash tables (i.e., long codewords) are required in order to achieve both high precision and recall. To address this limitation, we propose a ","authors_text":"Cheng Li, Deng Cai, Yue Lin","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2012-05-14T02:27:52Z","title":"Density Sensitive Hashing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.2930","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:afc51bbf54253ee43e63637c6dc00f9e826a533fd3dd19effc12a970cef95083","target":"record","created_at":"2026-05-18T03:55:45Z","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":"56a93f137bd22307c443ecf14a059d764e91e7a974ab3df55eb0c48f3279a651","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2012-05-14T02:27:52Z","title_canon_sha256":"735b70724b7b66fec09c9d68e266a930fcd9f0a3f328068853febd47db07eac9"},"schema_version":"1.0","source":{"id":"1205.2930","kind":"arxiv","version":1}},"canonical_sha256":"484c990646dd5eefcaa395b8e0897fee22414e786a14dee027febc44480c2bee","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"484c990646dd5eefcaa395b8e0897fee22414e786a14dee027febc44480c2bee","first_computed_at":"2026-05-18T03:55:45.654226Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:55:45.654226Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YMicEiLYr0dKa5CyshN0tP32TFbArWI2rlYoEpe6Td5QJetm26ba95oDzvRPhwuY9VcyO1DmEDVH1JknGMYqBg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:55:45.654776Z","signed_message":"canonical_sha256_bytes"},"source_id":"1205.2930","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:afc51bbf54253ee43e63637c6dc00f9e826a533fd3dd19effc12a970cef95083","sha256:be47260d4c8c25869d863557fe85c9b797e9a601a5edb789eefc13bee18f46c2"],"state_sha256":"b809faf865e8bb2eb61232af613e11e9f2fcf4dfe75d4f5c9688f098370690ac"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T6sUOvBs/gAwJJWPSfJYftSvonFaEl2JkrM/l+CUipGfddlwMMluy9k7OXLulOx0i4fVn0ixIJs4FLWQ/KAsBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-21T11:59:16.482723Z","bundle_sha256":"516077cac3e49d3532bdc37d0d9dc33560c6c965a0fbf0f3a1bce9819f9acb7c"}}