{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:6SNPZUCBE4GA4Y4EYD2QILJXPO","short_pith_number":"pith:6SNPZUCB","schema_version":"1.0","canonical_sha256":"f49afcd041270c0e6384c0f5042d377b8f955df5157b24aab8fce820873b1257","source":{"kind":"arxiv","id":"1212.6110","version":1},"attestation_state":"computed","paper":{"title":"Hyperplane Arrangements and Locality-Sensitive Hashing with Lift","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR","stat.ML"],"primary_cat":"cs.LG","authors_text":"Makiko Konoshima, Yui Noma","submitted_at":"2012-12-26T02:14:41Z","abstract_excerpt":"Locality-sensitive hashing converts high-dimensional feature vectors, such as image and speech, into bit arrays and allows high-speed similarity calculation with the Hamming distance. There is a hashing scheme that maps feature vectors to bit arrays depending on the signs of the inner products between feature vectors and the normal vectors of hyperplanes placed in the feature space. This hashing can be seen as a discretization of the feature space by hyperplanes. If labels for data are given, one can determine the hyperplanes by using learning algorithms. However, many proposed learning method"},"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":"1212.6110","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-12-26T02:14:41Z","cross_cats_sorted":["cs.IR","stat.ML"],"title_canon_sha256":"1b92ba5ed6358ee6cdc39cbe43d841ebd8427ea871cbd2d2ffbe7906b44ef0ea","abstract_canon_sha256":"d5fd1071642cb34fbcdb67acd8ef6a053bbbbecf1b977102393a949f88ab6a91"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:37:42.738925Z","signature_b64":"cB1UFEHM1B+HJ0lrP5K342RNi/taW7O6fc8QjpjBVK2L+j6+h7/Qcd+Bbb8aVSSLKPwyeifNcN6RzOFKwr3MAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f49afcd041270c0e6384c0f5042d377b8f955df5157b24aab8fce820873b1257","last_reissued_at":"2026-05-18T03:37:42.738186Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:37:42.738186Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hyperplane Arrangements and Locality-Sensitive Hashing with Lift","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR","stat.ML"],"primary_cat":"cs.LG","authors_text":"Makiko Konoshima, Yui Noma","submitted_at":"2012-12-26T02:14:41Z","abstract_excerpt":"Locality-sensitive hashing converts high-dimensional feature vectors, such as image and speech, into bit arrays and allows high-speed similarity calculation with the Hamming distance. There is a hashing scheme that maps feature vectors to bit arrays depending on the signs of the inner products between feature vectors and the normal vectors of hyperplanes placed in the feature space. This hashing can be seen as a discretization of the feature space by hyperplanes. If labels for data are given, one can determine the hyperplanes by using learning algorithms. However, many proposed learning method"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.6110","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":"1212.6110","created_at":"2026-05-18T03:37:42.738290+00:00"},{"alias_kind":"arxiv_version","alias_value":"1212.6110v1","created_at":"2026-05-18T03:37:42.738290+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.6110","created_at":"2026-05-18T03:37:42.738290+00:00"},{"alias_kind":"pith_short_12","alias_value":"6SNPZUCBE4GA","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_16","alias_value":"6SNPZUCBE4GA4Y4E","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_8","alias_value":"6SNPZUCB","created_at":"2026-05-18T12:26:56.085431+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/6SNPZUCBE4GA4Y4EYD2QILJXPO","json":"https://pith.science/pith/6SNPZUCBE4GA4Y4EYD2QILJXPO.json","graph_json":"https://pith.science/api/pith-number/6SNPZUCBE4GA4Y4EYD2QILJXPO/graph.json","events_json":"https://pith.science/api/pith-number/6SNPZUCBE4GA4Y4EYD2QILJXPO/events.json","paper":"https://pith.science/paper/6SNPZUCB"},"agent_actions":{"view_html":"https://pith.science/pith/6SNPZUCBE4GA4Y4EYD2QILJXPO","download_json":"https://pith.science/pith/6SNPZUCBE4GA4Y4EYD2QILJXPO.json","view_paper":"https://pith.science/paper/6SNPZUCB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1212.6110&json=true","fetch_graph":"https://pith.science/api/pith-number/6SNPZUCBE4GA4Y4EYD2QILJXPO/graph.json","fetch_events":"https://pith.science/api/pith-number/6SNPZUCBE4GA4Y4EYD2QILJXPO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6SNPZUCBE4GA4Y4EYD2QILJXPO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6SNPZUCBE4GA4Y4EYD2QILJXPO/action/storage_attestation","attest_author":"https://pith.science/pith/6SNPZUCBE4GA4Y4EYD2QILJXPO/action/author_attestation","sign_citation":"https://pith.science/pith/6SNPZUCBE4GA4Y4EYD2QILJXPO/action/citation_signature","submit_replication":"https://pith.science/pith/6SNPZUCBE4GA4Y4EYD2QILJXPO/action/replication_record"}},"created_at":"2026-05-18T03:37:42.738290+00:00","updated_at":"2026-05-18T03:37:42.738290+00:00"}