{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:3LOF65BY5XF3GEDZQZFHGQ252A","short_pith_number":"pith:3LOF65BY","schema_version":"1.0","canonical_sha256":"dadc5f7438edcbb31079864a73435dd0040a5d7d76161c38e8e536f613dcf7ee","source":{"kind":"arxiv","id":"1506.01092","version":1},"attestation_state":"computed","paper":{"title":"Bilinear Random Projections for Locality-Sensitive Binary Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Saehoon Kim, Seungjin Choi","submitted_at":"2015-06-03T00:30:26Z","abstract_excerpt":"Locality-sensitive hashing (LSH) is a popular data-independent indexing method for approximate similarity search, where random projections followed by quantization hash the points from the database so as to ensure that the probability of collision is much higher for objects that are close to each other than for those that are far apart. Most of high-dimensional visual descriptors for images exhibit a natural matrix structure. When visual descriptors are represented by high-dimensional feature vectors and long binary codes are assigned, a random projection matrix requires expensive complexities"},"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":"1506.01092","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-06-03T00:30:26Z","cross_cats_sorted":[],"title_canon_sha256":"8fd4408a8218e8a62acfc8e5d1bfccb16dde45a99e917d2ef1fdb5b869c218e0","abstract_canon_sha256":"6024af0c00bbb3e471651a0f8e0665bf2634782957d0218e627a749ca8e8ba3a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:58:26.415637Z","signature_b64":"SOlLgDdKekmKJMuh8aaI1PZzxkY39O0OMRIJzGWGG3TFsSIp7NhjNRaPVJunI+sVngtbyBd+VX/Huon+OWBvBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dadc5f7438edcbb31079864a73435dd0040a5d7d76161c38e8e536f613dcf7ee","last_reissued_at":"2026-05-18T01:58:26.414996Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:58:26.414996Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bilinear Random Projections for Locality-Sensitive Binary Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Saehoon Kim, Seungjin Choi","submitted_at":"2015-06-03T00:30:26Z","abstract_excerpt":"Locality-sensitive hashing (LSH) is a popular data-independent indexing method for approximate similarity search, where random projections followed by quantization hash the points from the database so as to ensure that the probability of collision is much higher for objects that are close to each other than for those that are far apart. Most of high-dimensional visual descriptors for images exhibit a natural matrix structure. When visual descriptors are represented by high-dimensional feature vectors and long binary codes are assigned, a random projection matrix requires expensive complexities"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.01092","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":"1506.01092","created_at":"2026-05-18T01:58:26.415108+00:00"},{"alias_kind":"arxiv_version","alias_value":"1506.01092v1","created_at":"2026-05-18T01:58:26.415108+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.01092","created_at":"2026-05-18T01:58:26.415108+00:00"},{"alias_kind":"pith_short_12","alias_value":"3LOF65BY5XF3","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_16","alias_value":"3LOF65BY5XF3GEDZ","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_8","alias_value":"3LOF65BY","created_at":"2026-05-18T12:29:02.477457+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/3LOF65BY5XF3GEDZQZFHGQ252A","json":"https://pith.science/pith/3LOF65BY5XF3GEDZQZFHGQ252A.json","graph_json":"https://pith.science/api/pith-number/3LOF65BY5XF3GEDZQZFHGQ252A/graph.json","events_json":"https://pith.science/api/pith-number/3LOF65BY5XF3GEDZQZFHGQ252A/events.json","paper":"https://pith.science/paper/3LOF65BY"},"agent_actions":{"view_html":"https://pith.science/pith/3LOF65BY5XF3GEDZQZFHGQ252A","download_json":"https://pith.science/pith/3LOF65BY5XF3GEDZQZFHGQ252A.json","view_paper":"https://pith.science/paper/3LOF65BY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1506.01092&json=true","fetch_graph":"https://pith.science/api/pith-number/3LOF65BY5XF3GEDZQZFHGQ252A/graph.json","fetch_events":"https://pith.science/api/pith-number/3LOF65BY5XF3GEDZQZFHGQ252A/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3LOF65BY5XF3GEDZQZFHGQ252A/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3LOF65BY5XF3GEDZQZFHGQ252A/action/storage_attestation","attest_author":"https://pith.science/pith/3LOF65BY5XF3GEDZQZFHGQ252A/action/author_attestation","sign_citation":"https://pith.science/pith/3LOF65BY5XF3GEDZQZFHGQ252A/action/citation_signature","submit_replication":"https://pith.science/pith/3LOF65BY5XF3GEDZQZFHGQ252A/action/replication_record"}},"created_at":"2026-05-18T01:58:26.415108+00:00","updated_at":"2026-05-18T01:58:26.415108+00:00"}