{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:JPS3YIGKDHED27GFIUQCMV25LE","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":"e552148b72fab5a7cfa7a2bb87a72e94439571d9763317d3b77dd3842bd75159","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2021-12-15T14:21:26Z","title_canon_sha256":"93bbd03f3a0589f5a96150ebd0968768f815de27ad234ecaf50d4549211339e0"},"schema_version":"1.0","source":{"id":"2112.08152","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2112.08152","created_at":"2026-07-05T03:41:18Z"},{"alias_kind":"arxiv_version","alias_value":"2112.08152v1","created_at":"2026-07-05T03:41:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2112.08152","created_at":"2026-07-05T03:41:18Z"},{"alias_kind":"pith_short_12","alias_value":"JPS3YIGKDHED","created_at":"2026-07-05T03:41:18Z"},{"alias_kind":"pith_short_16","alias_value":"JPS3YIGKDHED27GF","created_at":"2026-07-05T03:41:18Z"},{"alias_kind":"pith_short_8","alias_value":"JPS3YIGK","created_at":"2026-07-05T03:41:18Z"}],"graph_snapshots":[{"event_id":"sha256:51939a660ae4d1bf5a70341f1dd4a47032208851f06ca9ca57694ac7422f856e","target":"graph","created_at":"2026-07-05T03:41:18Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2112.08152/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"$k$NN based neural machine translation ($k$NN-MT) has achieved state-of-the-art results in a variety of MT tasks. One significant shortcoming of $k$NN-MT lies in its inefficiency in identifying the $k$ nearest neighbors of the query representation from the entire datastore, which is prohibitively time-intensive when the datastore size is large. In this work, we propose \\textbf{Faster $k$NN-MT} to address this issue. The core idea of Faster $k$NN-MT is to use a hierarchical clustering strategy to approximate the distance between the query and a data point in the datastore, which is decomposed i","authors_text":"Guoyin Wang, Jiwei Li, Rongbin Ouyang, Shi Zong, Shuhe Wang, Tianwei Zhang, Xiaoya Li, Yuxian Meng","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2021-12-15T14:21:26Z","title":"Faster Nearest Neighbor Machine Translation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2112.08152","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:6d828dd7dae8b20151efc853c69b3d35facab1ef712d4b180640428963c0fdcd","target":"record","created_at":"2026-07-05T03:41:18Z","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":"e552148b72fab5a7cfa7a2bb87a72e94439571d9763317d3b77dd3842bd75159","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2021-12-15T14:21:26Z","title_canon_sha256":"93bbd03f3a0589f5a96150ebd0968768f815de27ad234ecaf50d4549211339e0"},"schema_version":"1.0","source":{"id":"2112.08152","kind":"arxiv","version":1}},"canonical_sha256":"4be5bc20ca19c83d7cc5452026575d5925557ed7fb13ffc33cef72763964d683","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4be5bc20ca19c83d7cc5452026575d5925557ed7fb13ffc33cef72763964d683","first_computed_at":"2026-07-05T03:41:18.347777Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:41:18.347777Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"px9Hbtz8fzv1BI8YOKXmGz3kMNwVu53SA4OFGVLZtU7oEnqhnXGi6UPqmkXFvrdVc2Ntq/C/xH8cMhnHevQOBg==","signature_status":"signed_v1","signed_at":"2026-07-05T03:41:18.348333Z","signed_message":"canonical_sha256_bytes"},"source_id":"2112.08152","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6d828dd7dae8b20151efc853c69b3d35facab1ef712d4b180640428963c0fdcd","sha256:51939a660ae4d1bf5a70341f1dd4a47032208851f06ca9ca57694ac7422f856e"],"state_sha256":"2e80018a41b8c591bf606ef57707939bd9ad58905cbf4c5ee4d6e5014038e00a"}