{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:JBGJSBSG3VPO7SVDSW4OBCL75Y","short_pith_number":"pith:JBGJSBSG","schema_version":"1.0","canonical_sha256":"484c990646dd5eefcaa395b8e0897fee22414e786a14dee027febc44480c2bee","source":{"kind":"arxiv","id":"1205.2930","version":1},"attestation_state":"computed","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 "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1205.2930","created_at":"2026-05-18T03:55:45.654286+00:00"},{"alias_kind":"arxiv_version","alias_value":"1205.2930v1","created_at":"2026-05-18T03:55:45.654286+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.2930","created_at":"2026-05-18T03:55:45.654286+00:00"},{"alias_kind":"pith_short_12","alias_value":"JBGJSBSG3VPO","created_at":"2026-05-18T12:27:11.947152+00:00"},{"alias_kind":"pith_short_16","alias_value":"JBGJSBSG3VPO7SVD","created_at":"2026-05-18T12:27:11.947152+00:00"},{"alias_kind":"pith_short_8","alias_value":"JBGJSBSG","created_at":"2026-05-18T12:27:11.947152+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JBGJSBSG3VPO7SVDSW4OBCL75Y","json":"https://pith.science/pith/JBGJSBSG3VPO7SVDSW4OBCL75Y.json","graph_json":"https://pith.science/api/pith-number/JBGJSBSG3VPO7SVDSW4OBCL75Y/graph.json","events_json":"https://pith.science/api/pith-number/JBGJSBSG3VPO7SVDSW4OBCL75Y/events.json","paper":"https://pith.science/paper/JBGJSBSG"},"agent_actions":{"view_html":"https://pith.science/pith/JBGJSBSG3VPO7SVDSW4OBCL75Y","download_json":"https://pith.science/pith/JBGJSBSG3VPO7SVDSW4OBCL75Y.json","view_paper":"https://pith.science/paper/JBGJSBSG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1205.2930&json=true","fetch_graph":"https://pith.science/api/pith-number/JBGJSBSG3VPO7SVDSW4OBCL75Y/graph.json","fetch_events":"https://pith.science/api/pith-number/JBGJSBSG3VPO7SVDSW4OBCL75Y/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JBGJSBSG3VPO7SVDSW4OBCL75Y/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JBGJSBSG3VPO7SVDSW4OBCL75Y/action/storage_attestation","attest_author":"https://pith.science/pith/JBGJSBSG3VPO7SVDSW4OBCL75Y/action/author_attestation","sign_citation":"https://pith.science/pith/JBGJSBSG3VPO7SVDSW4OBCL75Y/action/citation_signature","submit_replication":"https://pith.science/pith/JBGJSBSG3VPO7SVDSW4OBCL75Y/action/replication_record"}},"created_at":"2026-05-18T03:55:45.654286+00:00","updated_at":"2026-05-18T03:55:45.654286+00:00"}