{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:R3HZXJCB2RXII4ZBT5BEJQBGAM","short_pith_number":"pith:R3HZXJCB","schema_version":"1.0","canonical_sha256":"8ecf9ba441d46e8473219f4244c026033acd4f14702d8fec33a04e9cf9e748d7","source":{"kind":"arxiv","id":"2204.06175","version":2},"attestation_state":"computed","paper":{"title":"Efficient Cluster-Based k-Nearest-Neighbor Machine Translation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Boxing Chen, Dexin Wang, Deyi Xiong, Kai Fan","submitted_at":"2022-04-13T05:46:31Z","abstract_excerpt":"k-Nearest-Neighbor Machine Translation (kNN-MT) has been recently proposed as a non-parametric solution for domain adaptation in neural machine translation (NMT). It aims to alleviate the performance degradation of advanced MT systems in translating out-of-domain sentences by coordinating with an additional token-level feature-based retrieval module constructed from in-domain data. Previous studies have already demonstrated that non-parametric NMT is even superior to models fine-tuned on out-of-domain data. In spite of this success, kNN retrieval is at the expense of high latency, in particula"},"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":"2204.06175","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2022-04-13T05:46:31Z","cross_cats_sorted":[],"title_canon_sha256":"be024936d86454756b5738d051bb8ca338217a33eb8f7bae6066f64d1b7e1b3d","abstract_canon_sha256":"75d9c822c040d6eeba038dc6a94f499706de014fecd55e890eec90175ad6e28b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:19:58.051412Z","signature_b64":"pqXkVODfzZwuqgb8+U2tcFP16VcKK++NIf2fbRUp6Vv3oQyBuzcCXsl7vEOQs8NBlBWXb3yTT07MQ2+vtgnrBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8ecf9ba441d46e8473219f4244c026033acd4f14702d8fec33a04e9cf9e748d7","last_reissued_at":"2026-07-05T04:19:58.050907Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:19:58.050907Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Cluster-Based k-Nearest-Neighbor Machine Translation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Boxing Chen, Dexin Wang, Deyi Xiong, Kai Fan","submitted_at":"2022-04-13T05:46:31Z","abstract_excerpt":"k-Nearest-Neighbor Machine Translation (kNN-MT) has been recently proposed as a non-parametric solution for domain adaptation in neural machine translation (NMT). It aims to alleviate the performance degradation of advanced MT systems in translating out-of-domain sentences by coordinating with an additional token-level feature-based retrieval module constructed from in-domain data. Previous studies have already demonstrated that non-parametric NMT is even superior to models fine-tuned on out-of-domain data. In spite of this success, kNN retrieval is at the expense of high latency, in particula"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2204.06175","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2204.06175/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2204.06175","created_at":"2026-07-05T04:19:58.050957+00:00"},{"alias_kind":"arxiv_version","alias_value":"2204.06175v2","created_at":"2026-07-05T04:19:58.050957+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2204.06175","created_at":"2026-07-05T04:19:58.050957+00:00"},{"alias_kind":"pith_short_12","alias_value":"R3HZXJCB2RXI","created_at":"2026-07-05T04:19:58.050957+00:00"},{"alias_kind":"pith_short_16","alias_value":"R3HZXJCB2RXII4ZB","created_at":"2026-07-05T04:19:58.050957+00:00"},{"alias_kind":"pith_short_8","alias_value":"R3HZXJCB","created_at":"2026-07-05T04:19:58.050957+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.09259","citing_title":"Psychology-Driven Enhancement of Humour Translation","ref_index":35,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/R3HZXJCB2RXII4ZBT5BEJQBGAM","json":"https://pith.science/pith/R3HZXJCB2RXII4ZBT5BEJQBGAM.json","graph_json":"https://pith.science/api/pith-number/R3HZXJCB2RXII4ZBT5BEJQBGAM/graph.json","events_json":"https://pith.science/api/pith-number/R3HZXJCB2RXII4ZBT5BEJQBGAM/events.json","paper":"https://pith.science/paper/R3HZXJCB"},"agent_actions":{"view_html":"https://pith.science/pith/R3HZXJCB2RXII4ZBT5BEJQBGAM","download_json":"https://pith.science/pith/R3HZXJCB2RXII4ZBT5BEJQBGAM.json","view_paper":"https://pith.science/paper/R3HZXJCB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2204.06175&json=true","fetch_graph":"https://pith.science/api/pith-number/R3HZXJCB2RXII4ZBT5BEJQBGAM/graph.json","fetch_events":"https://pith.science/api/pith-number/R3HZXJCB2RXII4ZBT5BEJQBGAM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/R3HZXJCB2RXII4ZBT5BEJQBGAM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/R3HZXJCB2RXII4ZBT5BEJQBGAM/action/storage_attestation","attest_author":"https://pith.science/pith/R3HZXJCB2RXII4ZBT5BEJQBGAM/action/author_attestation","sign_citation":"https://pith.science/pith/R3HZXJCB2RXII4ZBT5BEJQBGAM/action/citation_signature","submit_replication":"https://pith.science/pith/R3HZXJCB2RXII4ZBT5BEJQBGAM/action/replication_record"}},"created_at":"2026-07-05T04:19:58.050957+00:00","updated_at":"2026-07-05T04:19:58.050957+00:00"}