{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:7FTPTTIUZPM2ZOJBNFV7QFH777","short_pith_number":"pith:7FTPTTIU","canonical_record":{"source":{"id":"1902.08498","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2019-02-20T19:31:14Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"398909239146665ddf0833da8a65c7f9491bfbf83b65c876f8dcedebfc3489d6","abstract_canon_sha256":"cd761cb6dadd18e94f3f3fdc262b5446838ffbcdadd3fc2b0409dd40dfcb4d9f"},"schema_version":"1.0"},"canonical_sha256":"f966f9cd14cbd9acb921696bf814ffffc1fa184b1f0cdaf8c0c573ff4e683906","source":{"kind":"arxiv","id":"1902.08498","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.08498","created_at":"2026-05-17T23:39:24Z"},{"alias_kind":"arxiv_version","alias_value":"1902.08498v2","created_at":"2026-05-17T23:39:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.08498","created_at":"2026-05-17T23:39:24Z"},{"alias_kind":"pith_short_12","alias_value":"7FTPTTIUZPM2","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"7FTPTTIUZPM2ZOJB","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"7FTPTTIU","created_at":"2026-05-18T12:33:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:7FTPTTIUZPM2ZOJBNFV7QFH777","target":"record","payload":{"canonical_record":{"source":{"id":"1902.08498","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2019-02-20T19:31:14Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"398909239146665ddf0833da8a65c7f9491bfbf83b65c876f8dcedebfc3489d6","abstract_canon_sha256":"cd761cb6dadd18e94f3f3fdc262b5446838ffbcdadd3fc2b0409dd40dfcb4d9f"},"schema_version":"1.0"},"canonical_sha256":"f966f9cd14cbd9acb921696bf814ffffc1fa184b1f0cdaf8c0c573ff4e683906","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:24.779818Z","signature_b64":"swbdMFc4shuq4l/cJLX7beJHUeNvaTn+iLCZe8jc0hGkjA8r+Id4POe4JnbnmjZexYL4cYJUYkwZpn01XYOSBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f966f9cd14cbd9acb921696bf814ffffc1fa184b1f0cdaf8c0c573ff4e683906","last_reissued_at":"2026-05-17T23:39:24.779249Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:24.779249Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1902.08498","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-17T23:39:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"izUpzk54PsgYlMLnE0irnywWzRg5jbQlLA34JaBW6zXhXjLYnCqhSHIVnCs5m0bEmEmi6EOs4CBSorar4fMQBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T04:15:04.936936Z"},"content_sha256":"cdd80cc462fbbd7bcdb40c8d3291e109d8aadbd2347b9bdb3c6c10466ef97d59","schema_version":"1.0","event_id":"sha256:cdd80cc462fbbd7bcdb40c8d3291e109d8aadbd2347b9bdb3c6c10466ef97d59"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:7FTPTTIUZPM2ZOJBNFV7QFH777","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast and Exact Nearest Neighbor Search in Hamming Space on Full-Text Search Engines","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.IR","authors_text":"Binwei Yang, Cun Mu, Guang Yang, Jun Zhao, Zheng Yan","submitted_at":"2019-02-20T19:31:14Z","abstract_excerpt":"A growing interest has been witnessed recently from both academia and industry in building nearest neighbor search (NNS) solutions on top of full-text search engines. Compared with other NNS systems, such solutions are capable of effectively reducing main memory consumption, coherently supporting multi-model search and being immediately ready for production deployment. In this paper, we continue the journey to explore specifically how to empower full-text search engines with fast and exact NNS in Hamming space (i.e., the set of binary codes). By revisiting three techniques (bit operation, subs"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.08498","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-17T23:39:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2BdMGeS+0Od6NUFceb+EbSoYr7b0IsQBTv2miNpcyAsoVianTeetdO/vkoHrVCBFnKNV5xQxvjm4OPlS+VcWCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T04:15:04.937281Z"},"content_sha256":"57635c44d8faca06959102a4e27239b49ef4405209f49f643cfef8fb5793adca","schema_version":"1.0","event_id":"sha256:57635c44d8faca06959102a4e27239b49ef4405209f49f643cfef8fb5793adca"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7FTPTTIUZPM2ZOJBNFV7QFH777/bundle.json","state_url":"https://pith.science/pith/7FTPTTIUZPM2ZOJBNFV7QFH777/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7FTPTTIUZPM2ZOJBNFV7QFH777/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-05-30T04:15:04Z","links":{"resolver":"https://pith.science/pith/7FTPTTIUZPM2ZOJBNFV7QFH777","bundle":"https://pith.science/pith/7FTPTTIUZPM2ZOJBNFV7QFH777/bundle.json","state":"https://pith.science/pith/7FTPTTIUZPM2ZOJBNFV7QFH777/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7FTPTTIUZPM2ZOJBNFV7QFH777/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:7FTPTTIUZPM2ZOJBNFV7QFH777","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":"cd761cb6dadd18e94f3f3fdc262b5446838ffbcdadd3fc2b0409dd40dfcb4d9f","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2019-02-20T19:31:14Z","title_canon_sha256":"398909239146665ddf0833da8a65c7f9491bfbf83b65c876f8dcedebfc3489d6"},"schema_version":"1.0","source":{"id":"1902.08498","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.08498","created_at":"2026-05-17T23:39:24Z"},{"alias_kind":"arxiv_version","alias_value":"1902.08498v2","created_at":"2026-05-17T23:39:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.08498","created_at":"2026-05-17T23:39:24Z"},{"alias_kind":"pith_short_12","alias_value":"7FTPTTIUZPM2","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"7FTPTTIUZPM2ZOJB","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"7FTPTTIU","created_at":"2026-05-18T12:33:12Z"}],"graph_snapshots":[{"event_id":"sha256:57635c44d8faca06959102a4e27239b49ef4405209f49f643cfef8fb5793adca","target":"graph","created_at":"2026-05-17T23:39:24Z","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":"A growing interest has been witnessed recently from both academia and industry in building nearest neighbor search (NNS) solutions on top of full-text search engines. Compared with other NNS systems, such solutions are capable of effectively reducing main memory consumption, coherently supporting multi-model search and being immediately ready for production deployment. In this paper, we continue the journey to explore specifically how to empower full-text search engines with fast and exact NNS in Hamming space (i.e., the set of binary codes). By revisiting three techniques (bit operation, subs","authors_text":"Binwei Yang, Cun Mu, Guang Yang, Jun Zhao, Zheng Yan","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2019-02-20T19:31:14Z","title":"Fast and Exact Nearest Neighbor Search in Hamming Space on Full-Text Search Engines"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.08498","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:cdd80cc462fbbd7bcdb40c8d3291e109d8aadbd2347b9bdb3c6c10466ef97d59","target":"record","created_at":"2026-05-17T23:39:24Z","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":"cd761cb6dadd18e94f3f3fdc262b5446838ffbcdadd3fc2b0409dd40dfcb4d9f","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2019-02-20T19:31:14Z","title_canon_sha256":"398909239146665ddf0833da8a65c7f9491bfbf83b65c876f8dcedebfc3489d6"},"schema_version":"1.0","source":{"id":"1902.08498","kind":"arxiv","version":2}},"canonical_sha256":"f966f9cd14cbd9acb921696bf814ffffc1fa184b1f0cdaf8c0c573ff4e683906","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f966f9cd14cbd9acb921696bf814ffffc1fa184b1f0cdaf8c0c573ff4e683906","first_computed_at":"2026-05-17T23:39:24.779249Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:24.779249Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"swbdMFc4shuq4l/cJLX7beJHUeNvaTn+iLCZe8jc0hGkjA8r+Id4POe4JnbnmjZexYL4cYJUYkwZpn01XYOSBg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:24.779818Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.08498","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cdd80cc462fbbd7bcdb40c8d3291e109d8aadbd2347b9bdb3c6c10466ef97d59","sha256:57635c44d8faca06959102a4e27239b49ef4405209f49f643cfef8fb5793adca"],"state_sha256":"2d0d77b132c60a10125070fa3c8291b964685615ccda82c90f9a7e1a01ba29ca"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rvsgGTmDodwFY157Lkh86Hwib4auNapKv6okXrBwsPW8kTwOgoqoY4VeSXjLipWiDTwuC/CVVvwjPx7+lYK/Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T04:15:04.939227Z","bundle_sha256":"06e19257dae069d1fcb9f1411ce2002add4d064a7ea8335e30eb126adad1e0aa"}}