{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:AM76MKQW5XG7L3GGN74ELY3PVH","short_pith_number":"pith:AM76MKQW","schema_version":"1.0","canonical_sha256":"033fe62a16edcdf5ecc66ff845e36fa9dc23e4dbc65d1b268f295c76eee0ad34","source":{"kind":"arxiv","id":"1809.08782","version":2},"attestation_state":"computed","paper":{"title":"Norm-Ranging LSH for Maximum Inner Product Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Hongzhi Chen, James Cheng, Jinfeng Li, Xiao Yan, Xinyan Dai","submitted_at":"2018-09-24T07:20:45Z","abstract_excerpt":"Neyshabur and Srebro proposed Simple-LSH, which is the state-of-the-art hashing method for maximum inner product search (MIPS) with performance guarantee. We found that the performance of Simple-LSH, in both theory and practice, suffers from long tails in the 2-norm distribution of real datasets. We propose Norm-ranging LSH, which addresses the excessive normalization problem caused by long tails in Simple-LSH by partitioning a dataset into multiple sub-datasets and building a hash index for each sub-dataset independently. We prove that Norm-ranging LSH has lower query time complexity than Sim"},"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":"1809.08782","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-09-24T07:20:45Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"cf51b2764786dd0641c5c1b99a68bd9b4780edf205888777d56d150e84ee09af","abstract_canon_sha256":"73a6c65c02f6ff06bd2d49361fab0ea41711ecd9d01c069e9d98fcd403e3bae6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:44.277700Z","signature_b64":"50G6RwY0pi8xwOugozK+dZmy4EpQR3xxuwDz8tA7uQmqCo/R62QlFDqrxB/XrAKVbZTNJNLYs2AVmOLDIJWsBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"033fe62a16edcdf5ecc66ff845e36fa9dc23e4dbc65d1b268f295c76eee0ad34","last_reissued_at":"2026-05-18T00:02:44.277232Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:44.277232Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Norm-Ranging LSH for Maximum Inner Product Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Hongzhi Chen, James Cheng, Jinfeng Li, Xiao Yan, Xinyan Dai","submitted_at":"2018-09-24T07:20:45Z","abstract_excerpt":"Neyshabur and Srebro proposed Simple-LSH, which is the state-of-the-art hashing method for maximum inner product search (MIPS) with performance guarantee. We found that the performance of Simple-LSH, in both theory and practice, suffers from long tails in the 2-norm distribution of real datasets. We propose Norm-ranging LSH, which addresses the excessive normalization problem caused by long tails in Simple-LSH by partitioning a dataset into multiple sub-datasets and building a hash index for each sub-dataset independently. We prove that Norm-ranging LSH has lower query time complexity than Sim"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.08782","kind":"arxiv","version":2},"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":"1809.08782","created_at":"2026-05-18T00:02:44.277297+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.08782v2","created_at":"2026-05-18T00:02:44.277297+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.08782","created_at":"2026-05-18T00:02:44.277297+00:00"},{"alias_kind":"pith_short_12","alias_value":"AM76MKQW5XG7","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_16","alias_value":"AM76MKQW5XG7L3GG","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_8","alias_value":"AM76MKQW","created_at":"2026-05-18T12:32:13.499390+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/AM76MKQW5XG7L3GGN74ELY3PVH","json":"https://pith.science/pith/AM76MKQW5XG7L3GGN74ELY3PVH.json","graph_json":"https://pith.science/api/pith-number/AM76MKQW5XG7L3GGN74ELY3PVH/graph.json","events_json":"https://pith.science/api/pith-number/AM76MKQW5XG7L3GGN74ELY3PVH/events.json","paper":"https://pith.science/paper/AM76MKQW"},"agent_actions":{"view_html":"https://pith.science/pith/AM76MKQW5XG7L3GGN74ELY3PVH","download_json":"https://pith.science/pith/AM76MKQW5XG7L3GGN74ELY3PVH.json","view_paper":"https://pith.science/paper/AM76MKQW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.08782&json=true","fetch_graph":"https://pith.science/api/pith-number/AM76MKQW5XG7L3GGN74ELY3PVH/graph.json","fetch_events":"https://pith.science/api/pith-number/AM76MKQW5XG7L3GGN74ELY3PVH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AM76MKQW5XG7L3GGN74ELY3PVH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AM76MKQW5XG7L3GGN74ELY3PVH/action/storage_attestation","attest_author":"https://pith.science/pith/AM76MKQW5XG7L3GGN74ELY3PVH/action/author_attestation","sign_citation":"https://pith.science/pith/AM76MKQW5XG7L3GGN74ELY3PVH/action/citation_signature","submit_replication":"https://pith.science/pith/AM76MKQW5XG7L3GGN74ELY3PVH/action/replication_record"}},"created_at":"2026-05-18T00:02:44.277297+00:00","updated_at":"2026-05-18T00:02:44.277297+00:00"}