{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:26VNSSRCSYEDTBQ2JEYSEWTATU","short_pith_number":"pith:26VNSSRC","canonical_record":{"source":{"id":"1610.00574","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2016-09-14T23:16:37Z","cross_cats_sorted":["cs.DS","cs.IR","cs.LG"],"title_canon_sha256":"cb3874fd1ab72756670b7b36dd7db084d6ca114b0375dc829e5043b14ce4a1d9","abstract_canon_sha256":"9b7d7ea68040cc27bfff88adb5e70be09516608c0b6361eb73cc8e16233ccbba"},"schema_version":"1.0"},"canonical_sha256":"d7aad94a22960839861a4931225a609d18fdb5412f3794a08c450f9b814357e9","source":{"kind":"arxiv","id":"1610.00574","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.00574","created_at":"2026-05-18T00:18:09Z"},{"alias_kind":"arxiv_version","alias_value":"1610.00574v2","created_at":"2026-05-18T00:18:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.00574","created_at":"2026-05-18T00:18:09Z"},{"alias_kind":"pith_short_12","alias_value":"26VNSSRCSYED","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"26VNSSRCSYEDTBQ2","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"26VNSSRC","created_at":"2026-05-18T12:29:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:26VNSSRCSYEDTBQ2JEYSEWTATU","target":"record","payload":{"canonical_record":{"source":{"id":"1610.00574","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2016-09-14T23:16:37Z","cross_cats_sorted":["cs.DS","cs.IR","cs.LG"],"title_canon_sha256":"cb3874fd1ab72756670b7b36dd7db084d6ca114b0375dc829e5043b14ce4a1d9","abstract_canon_sha256":"9b7d7ea68040cc27bfff88adb5e70be09516608c0b6361eb73cc8e16233ccbba"},"schema_version":"1.0"},"canonical_sha256":"d7aad94a22960839861a4931225a609d18fdb5412f3794a08c450f9b814357e9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:18:09.890494Z","signature_b64":"YO+frz19pbAvgwb9iO114oHWdoXCma/a6KfNk4LbBajQmcVeIEtLcqCK8768PjDu4MJy01FsG8sigMVFWKqQDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d7aad94a22960839861a4931225a609d18fdb5412f3794a08c450f9b814357e9","last_reissued_at":"2026-05-18T00:18:09.889918Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:18:09.889918Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1610.00574","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:18:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yo3RY0hX4M3mzdoL97+hA3hQ5aZh/WUG0NJ+nnKF9cyNvX4cc2YmgA5sknWypJZVcTQGksVZJiCTSRvq5fg1BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T09:14:47.424419Z"},"content_sha256":"59abf33796b16057f462b5e862e4bdffb39887d5c94fc816a4145d98bb3a685c","schema_version":"1.0","event_id":"sha256:59abf33796b16057f462b5e862e4bdffb39887d5c94fc816a4145d98bb3a685c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:26VNSSRCSYEDTBQ2JEYSEWTATU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast Cosine Similarity Search in Binary Space with Angular Multi-index Hashing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.IR","cs.LG"],"primary_cat":"cs.DB","authors_text":"Ladan Tahvildari, Sepehr Eghbali","submitted_at":"2016-09-14T23:16:37Z","abstract_excerpt":"Given a large dataset of binary codes and a binary query point, we address how to efficiently find $K$ codes in the dataset that yield the largest cosine similarities to the query. The straightforward answer to this problem is to compare the query with all items in the dataset, but this is practical only for small datasets. One potential solution to enhance the search time and achieve sublinear cost is to use a hash table populated with binary codes of the dataset and then look up the nearby buckets to the query to retrieve the nearest neighbors. However, if codes are compared in terms of cosi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.00574","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:18:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3sBoSz/XW1FRgtI8UOw4uv2aD94/mqF4nF7V/MVzu/Cicesf92aJDQxmZn4+mczEUPU8jm2T6tZV+9ZqEgAMBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T09:14:47.424776Z"},"content_sha256":"706cb05f5fb865ebfd54f1bc67e382610191a419665427174ccbc6871b46adca","schema_version":"1.0","event_id":"sha256:706cb05f5fb865ebfd54f1bc67e382610191a419665427174ccbc6871b46adca"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/26VNSSRCSYEDTBQ2JEYSEWTATU/bundle.json","state_url":"https://pith.science/pith/26VNSSRCSYEDTBQ2JEYSEWTATU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/26VNSSRCSYEDTBQ2JEYSEWTATU/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-03T09:14:47Z","links":{"resolver":"https://pith.science/pith/26VNSSRCSYEDTBQ2JEYSEWTATU","bundle":"https://pith.science/pith/26VNSSRCSYEDTBQ2JEYSEWTATU/bundle.json","state":"https://pith.science/pith/26VNSSRCSYEDTBQ2JEYSEWTATU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/26VNSSRCSYEDTBQ2JEYSEWTATU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:26VNSSRCSYEDTBQ2JEYSEWTATU","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"9b7d7ea68040cc27bfff88adb5e70be09516608c0b6361eb73cc8e16233ccbba","cross_cats_sorted":["cs.DS","cs.IR","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2016-09-14T23:16:37Z","title_canon_sha256":"cb3874fd1ab72756670b7b36dd7db084d6ca114b0375dc829e5043b14ce4a1d9"},"schema_version":"1.0","source":{"id":"1610.00574","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.00574","created_at":"2026-05-18T00:18:09Z"},{"alias_kind":"arxiv_version","alias_value":"1610.00574v2","created_at":"2026-05-18T00:18:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.00574","created_at":"2026-05-18T00:18:09Z"},{"alias_kind":"pith_short_12","alias_value":"26VNSSRCSYED","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"26VNSSRCSYEDTBQ2","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"26VNSSRC","created_at":"2026-05-18T12:29:52Z"}],"graph_snapshots":[{"event_id":"sha256:706cb05f5fb865ebfd54f1bc67e382610191a419665427174ccbc6871b46adca","target":"graph","created_at":"2026-05-18T00:18:09Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Given a large dataset of binary codes and a binary query point, we address how to efficiently find $K$ codes in the dataset that yield the largest cosine similarities to the query. The straightforward answer to this problem is to compare the query with all items in the dataset, but this is practical only for small datasets. One potential solution to enhance the search time and achieve sublinear cost is to use a hash table populated with binary codes of the dataset and then look up the nearby buckets to the query to retrieve the nearest neighbors. However, if codes are compared in terms of cosi","authors_text":"Ladan Tahvildari, Sepehr Eghbali","cross_cats":["cs.DS","cs.IR","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2016-09-14T23:16:37Z","title":"Fast Cosine Similarity Search in Binary Space with Angular Multi-index Hashing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.00574","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:59abf33796b16057f462b5e862e4bdffb39887d5c94fc816a4145d98bb3a685c","target":"record","created_at":"2026-05-18T00:18:09Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"9b7d7ea68040cc27bfff88adb5e70be09516608c0b6361eb73cc8e16233ccbba","cross_cats_sorted":["cs.DS","cs.IR","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2016-09-14T23:16:37Z","title_canon_sha256":"cb3874fd1ab72756670b7b36dd7db084d6ca114b0375dc829e5043b14ce4a1d9"},"schema_version":"1.0","source":{"id":"1610.00574","kind":"arxiv","version":2}},"canonical_sha256":"d7aad94a22960839861a4931225a609d18fdb5412f3794a08c450f9b814357e9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d7aad94a22960839861a4931225a609d18fdb5412f3794a08c450f9b814357e9","first_computed_at":"2026-05-18T00:18:09.889918Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:18:09.889918Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YO+frz19pbAvgwb9iO114oHWdoXCma/a6KfNk4LbBajQmcVeIEtLcqCK8768PjDu4MJy01FsG8sigMVFWKqQDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:18:09.890494Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.00574","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:59abf33796b16057f462b5e862e4bdffb39887d5c94fc816a4145d98bb3a685c","sha256:706cb05f5fb865ebfd54f1bc67e382610191a419665427174ccbc6871b46adca"],"state_sha256":"07a986eb7ffe866db3663f31b6559a91552cd91eb69c3e905cf7b1ebb1949335"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pRz+skefQNA+6ktt/FOGD19FunSzTISzQhlHaTuNKMi/bxq0kmoTLGr2fWmjt78udnbc7ArMCzudv1jFi35aDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-03T09:14:47.426739Z","bundle_sha256":"be548d33730ccffd0b4f5309d8cb07fffb4737884b7b1ba63ba8e783796d3d59"}}