{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:MRUM4JJGQ7QKQIITYSHDAIZ6N2","short_pith_number":"pith:MRUM4JJG","canonical_record":{"source":{"id":"1610.10001","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2016-10-31T16:27:08Z","cross_cats_sorted":[],"title_canon_sha256":"e0cc262719ffd48de03f272843c53981fb35d4dfe7d13ff62679f950bd0788c7","abstract_canon_sha256":"2259f4785292d937667c83f945dbb2bf08c99924aa6dd3de9355eb3cd4149130"},"schema_version":"1.0"},"canonical_sha256":"6468ce252687e0a82113c48e30233e6e85df60cd85fc3354f6edc30ccc90276f","source":{"kind":"arxiv","id":"1610.10001","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.10001","created_at":"2026-05-18T01:00:46Z"},{"alias_kind":"arxiv_version","alias_value":"1610.10001v1","created_at":"2026-05-18T01:00:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.10001","created_at":"2026-05-18T01:00:46Z"},{"alias_kind":"pith_short_12","alias_value":"MRUM4JJGQ7QK","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"MRUM4JJGQ7QKQIIT","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"MRUM4JJG","created_at":"2026-05-18T12:30:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:MRUM4JJGQ7QKQIITYSHDAIZ6N2","target":"record","payload":{"canonical_record":{"source":{"id":"1610.10001","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2016-10-31T16:27:08Z","cross_cats_sorted":[],"title_canon_sha256":"e0cc262719ffd48de03f272843c53981fb35d4dfe7d13ff62679f950bd0788c7","abstract_canon_sha256":"2259f4785292d937667c83f945dbb2bf08c99924aa6dd3de9355eb3cd4149130"},"schema_version":"1.0"},"canonical_sha256":"6468ce252687e0a82113c48e30233e6e85df60cd85fc3354f6edc30ccc90276f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:00:46.758002Z","signature_b64":"CDXCoE2UCbwY5/FT1hk9FP8iNfK8zU01ilFx60IQNQ/vb3091YsQbXWTwiYsovWkvtkQugmhp/8aKBr53RbDAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6468ce252687e0a82113c48e30233e6e85df60cd85fc3354f6edc30ccc90276f","last_reissued_at":"2026-05-18T01:00:46.757531Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:00:46.757531Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1610.10001","source_version":1,"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-18T01:00:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WYVd3Mldbw5Agu+ytjLET0jqe7FhP7a8GLVK6f5yVOEfP+z9cqKWT0DcsKhOmXQq5uxZr5VudgoyFSfp6QYvCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T00:06:10.829072Z"},"content_sha256":"5b398b7d621d9e434f456bbe62900db563d8b82050b7182e1c93f4848e127324","schema_version":"1.0","event_id":"sha256:5b398b7d621d9e434f456bbe62900db563d8b82050b7182e1c93f4848e127324"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:MRUM4JJGQ7QKQIITYSHDAIZ6N2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Off the Beaten Path: Let's Replace Term-Based Retrieval with k-NN Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"David Novak, Eric Nyberg, Leonid Boytsov, Yury Malkov","submitted_at":"2016-10-31T16:27:08Z","abstract_excerpt":"Retrieval pipelines commonly rely on a term-based search to obtain candidate records, which are subsequently re-ranked. Some candidates are missed by this approach, e.g., due to a vocabulary mismatch. We address this issue by replacing the term-based search with a generic k-NN retrieval algorithm, where a similarity function can take into account subtle term associations. While an exact brute-force k-NN search using this similarity function is slow, we demonstrate that an approximate algorithm can be nearly two orders of magnitude faster at the expense of only a small loss in accuracy. A retri"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.10001","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"},"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-18T01:00:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S17H1HiYr2lsG8WetvomcthTde9vWHbTuN8cHr3tlvTvilwRgl6a9YRXc5rfReN4IIFpznj5ivtzNCocZqx6CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T00:06:10.829759Z"},"content_sha256":"3f2716e91c03e4265330405407ff867b1f542805205c846b9292528aba36f3ca","schema_version":"1.0","event_id":"sha256:3f2716e91c03e4265330405407ff867b1f542805205c846b9292528aba36f3ca"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MRUM4JJGQ7QKQIITYSHDAIZ6N2/bundle.json","state_url":"https://pith.science/pith/MRUM4JJGQ7QKQIITYSHDAIZ6N2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MRUM4JJGQ7QKQIITYSHDAIZ6N2/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-26T00:06:10Z","links":{"resolver":"https://pith.science/pith/MRUM4JJGQ7QKQIITYSHDAIZ6N2","bundle":"https://pith.science/pith/MRUM4JJGQ7QKQIITYSHDAIZ6N2/bundle.json","state":"https://pith.science/pith/MRUM4JJGQ7QKQIITYSHDAIZ6N2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MRUM4JJGQ7QKQIITYSHDAIZ6N2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:MRUM4JJGQ7QKQIITYSHDAIZ6N2","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":"2259f4785292d937667c83f945dbb2bf08c99924aa6dd3de9355eb3cd4149130","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2016-10-31T16:27:08Z","title_canon_sha256":"e0cc262719ffd48de03f272843c53981fb35d4dfe7d13ff62679f950bd0788c7"},"schema_version":"1.0","source":{"id":"1610.10001","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.10001","created_at":"2026-05-18T01:00:46Z"},{"alias_kind":"arxiv_version","alias_value":"1610.10001v1","created_at":"2026-05-18T01:00:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.10001","created_at":"2026-05-18T01:00:46Z"},{"alias_kind":"pith_short_12","alias_value":"MRUM4JJGQ7QK","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"MRUM4JJGQ7QKQIIT","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"MRUM4JJG","created_at":"2026-05-18T12:30:32Z"}],"graph_snapshots":[{"event_id":"sha256:3f2716e91c03e4265330405407ff867b1f542805205c846b9292528aba36f3ca","target":"graph","created_at":"2026-05-18T01:00:46Z","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":"Retrieval pipelines commonly rely on a term-based search to obtain candidate records, which are subsequently re-ranked. Some candidates are missed by this approach, e.g., due to a vocabulary mismatch. We address this issue by replacing the term-based search with a generic k-NN retrieval algorithm, where a similarity function can take into account subtle term associations. While an exact brute-force k-NN search using this similarity function is slow, we demonstrate that an approximate algorithm can be nearly two orders of magnitude faster at the expense of only a small loss in accuracy. A retri","authors_text":"David Novak, Eric Nyberg, Leonid Boytsov, Yury Malkov","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2016-10-31T16:27:08Z","title":"Off the Beaten Path: Let's Replace Term-Based Retrieval with k-NN Search"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.10001","kind":"arxiv","version":1},"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:5b398b7d621d9e434f456bbe62900db563d8b82050b7182e1c93f4848e127324","target":"record","created_at":"2026-05-18T01:00:46Z","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":"2259f4785292d937667c83f945dbb2bf08c99924aa6dd3de9355eb3cd4149130","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2016-10-31T16:27:08Z","title_canon_sha256":"e0cc262719ffd48de03f272843c53981fb35d4dfe7d13ff62679f950bd0788c7"},"schema_version":"1.0","source":{"id":"1610.10001","kind":"arxiv","version":1}},"canonical_sha256":"6468ce252687e0a82113c48e30233e6e85df60cd85fc3354f6edc30ccc90276f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6468ce252687e0a82113c48e30233e6e85df60cd85fc3354f6edc30ccc90276f","first_computed_at":"2026-05-18T01:00:46.757531Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:00:46.757531Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CDXCoE2UCbwY5/FT1hk9FP8iNfK8zU01ilFx60IQNQ/vb3091YsQbXWTwiYsovWkvtkQugmhp/8aKBr53RbDAw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:00:46.758002Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.10001","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5b398b7d621d9e434f456bbe62900db563d8b82050b7182e1c93f4848e127324","sha256:3f2716e91c03e4265330405407ff867b1f542805205c846b9292528aba36f3ca"],"state_sha256":"6908e8899741e92e13b23a1587755862de474c85edd53babbbc4fdecf995f863"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8SHEjKTXAE1EdERsXT7ZUfBdvfQcA+oYL/ZkeWbTfevKG/0KFIX65wOaWqY6Pewt+QCYtZlIfm214/LLz4dnBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T00:06:10.833283Z","bundle_sha256":"43f90d09093ae06ea859242d03cb9445d9b1673277dbcd8a26335a5a97077ada"}}