{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:F3V5DIHQV6WX3XBN5BKSPZYLZ6","short_pith_number":"pith:F3V5DIHQ","schema_version":"1.0","canonical_sha256":"2eebd1a0f0afad7ddc2de85527e70bcfbd992cd9b66715bda479f5455752f61e","source":{"kind":"arxiv","id":"1509.05472","version":1},"attestation_state":"computed","paper":{"title":"Learning to Hash for Indexing Big Data - A Survey","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Jun Wang, Sanjiv Kumar, Shih-Fu Chang, Wei Liu","submitted_at":"2015-09-17T23:19:07Z","abstract_excerpt":"The explosive growth in big data has attracted much attention in designing efficient indexing and search methods recently. In many critical applications such as large-scale search and pattern matching, finding the nearest neighbors to a query is a fundamental research problem. However, the straightforward solution using exhaustive comparison is infeasible due to the prohibitive computational complexity and memory requirement. In response, Approximate Nearest Neighbor (ANN) search based on hashing techniques has become popular due to its promising performance in both efficiency and accuracy. Pr"},"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":"1509.05472","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-09-17T23:19:07Z","cross_cats_sorted":[],"title_canon_sha256":"33fa8b637a267131a24724636365dbcc1edf916a488066d4ce6e6081b1f93f7a","abstract_canon_sha256":"371a2177616c677a30d27d83f56881dc428ff684978bd09089f494363e915d80"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:32:43.104582Z","signature_b64":"FjFhaLJVuQGef4pAQMJorI055ZSs4egFDHJ9ZO0XV8bZ8QBa4JMJTvddCNp3gBNtgvVazujVWIWexy+WpuFaDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2eebd1a0f0afad7ddc2de85527e70bcfbd992cd9b66715bda479f5455752f61e","last_reissued_at":"2026-05-18T01:32:43.104130Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:32:43.104130Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning to Hash for Indexing Big Data - A Survey","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Jun Wang, Sanjiv Kumar, Shih-Fu Chang, Wei Liu","submitted_at":"2015-09-17T23:19:07Z","abstract_excerpt":"The explosive growth in big data has attracted much attention in designing efficient indexing and search methods recently. In many critical applications such as large-scale search and pattern matching, finding the nearest neighbors to a query is a fundamental research problem. However, the straightforward solution using exhaustive comparison is infeasible due to the prohibitive computational complexity and memory requirement. In response, Approximate Nearest Neighbor (ANN) search based on hashing techniques has become popular due to its promising performance in both efficiency and accuracy. Pr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.05472","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":"1509.05472","created_at":"2026-05-18T01:32:43.104196+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.05472v1","created_at":"2026-05-18T01:32:43.104196+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.05472","created_at":"2026-05-18T01:32:43.104196+00:00"},{"alias_kind":"pith_short_12","alias_value":"F3V5DIHQV6WX","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_16","alias_value":"F3V5DIHQV6WX3XBN","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_8","alias_value":"F3V5DIHQ","created_at":"2026-05-18T12:29:19.899920+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/F3V5DIHQV6WX3XBN5BKSPZYLZ6","json":"https://pith.science/pith/F3V5DIHQV6WX3XBN5BKSPZYLZ6.json","graph_json":"https://pith.science/api/pith-number/F3V5DIHQV6WX3XBN5BKSPZYLZ6/graph.json","events_json":"https://pith.science/api/pith-number/F3V5DIHQV6WX3XBN5BKSPZYLZ6/events.json","paper":"https://pith.science/paper/F3V5DIHQ"},"agent_actions":{"view_html":"https://pith.science/pith/F3V5DIHQV6WX3XBN5BKSPZYLZ6","download_json":"https://pith.science/pith/F3V5DIHQV6WX3XBN5BKSPZYLZ6.json","view_paper":"https://pith.science/paper/F3V5DIHQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.05472&json=true","fetch_graph":"https://pith.science/api/pith-number/F3V5DIHQV6WX3XBN5BKSPZYLZ6/graph.json","fetch_events":"https://pith.science/api/pith-number/F3V5DIHQV6WX3XBN5BKSPZYLZ6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F3V5DIHQV6WX3XBN5BKSPZYLZ6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F3V5DIHQV6WX3XBN5BKSPZYLZ6/action/storage_attestation","attest_author":"https://pith.science/pith/F3V5DIHQV6WX3XBN5BKSPZYLZ6/action/author_attestation","sign_citation":"https://pith.science/pith/F3V5DIHQV6WX3XBN5BKSPZYLZ6/action/citation_signature","submit_replication":"https://pith.science/pith/F3V5DIHQV6WX3XBN5BKSPZYLZ6/action/replication_record"}},"created_at":"2026-05-18T01:32:43.104196+00:00","updated_at":"2026-05-18T01:32:43.104196+00:00"}