{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:BXU6PSYXG7MOZKLAOQWMR4BNND","short_pith_number":"pith:BXU6PSYX","canonical_record":{"source":{"id":"2305.17351","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2023-05-27T03:15:10Z","cross_cats_sorted":[],"title_canon_sha256":"e4304b1fc22e5104e8c8da1fb3eaa54e82251829ba953bed2e469c1be69ded7f","abstract_canon_sha256":"ba902271083657ad7f05da322a687ecc943b6b27ffa423773a5bffc272a9d639"},"schema_version":"1.0"},"canonical_sha256":"0de9e7cb1737d8eca960742cc8f02d68ef26f433b68118871046fca768b330a3","source":{"kind":"arxiv","id":"2305.17351","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2305.17351","created_at":"2026-07-05T06:14:26Z"},{"alias_kind":"arxiv_version","alias_value":"2305.17351v1","created_at":"2026-07-05T06:14:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.17351","created_at":"2026-07-05T06:14:26Z"},{"alias_kind":"pith_short_12","alias_value":"BXU6PSYXG7MO","created_at":"2026-07-05T06:14:26Z"},{"alias_kind":"pith_short_16","alias_value":"BXU6PSYXG7MOZKLA","created_at":"2026-07-05T06:14:26Z"},{"alias_kind":"pith_short_8","alias_value":"BXU6PSYX","created_at":"2026-07-05T06:14:26Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:BXU6PSYXG7MOZKLAOQWMR4BNND","target":"record","payload":{"canonical_record":{"source":{"id":"2305.17351","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2023-05-27T03:15:10Z","cross_cats_sorted":[],"title_canon_sha256":"e4304b1fc22e5104e8c8da1fb3eaa54e82251829ba953bed2e469c1be69ded7f","abstract_canon_sha256":"ba902271083657ad7f05da322a687ecc943b6b27ffa423773a5bffc272a9d639"},"schema_version":"1.0"},"canonical_sha256":"0de9e7cb1737d8eca960742cc8f02d68ef26f433b68118871046fca768b330a3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:14:26.791982Z","signature_b64":"uXendTt4ntlHx9BgaY/LAoNAuojrWBhkYgJmKkimPpVHnbsmkJSJeKoRhwE47M2OJIcvH0YEcU2vnZC2yCkgDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0de9e7cb1737d8eca960742cc8f02d68ef26f433b68118871046fca768b330a3","last_reissued_at":"2026-07-05T06:14:26.791409Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:14:26.791409Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2305.17351","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-07-05T06:14:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"If1zSZmHU/JfWqNddaU+wXkhQIDwf6s6koPO/ZgHfC3XAZHnnTW3J8EX8yDBSUWrJn96Os4iPvwaLVDkp80+AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T08:47:16.707655Z"},"content_sha256":"6a8bdcc0156c734c0222f13b0c76b0fd7437edee84d3a9787c4049a05c03e40c","schema_version":"1.0","event_id":"sha256:6a8bdcc0156c734c0222f13b0c76b0fd7437edee84d3a9787c4049a05c03e40c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:BXU6PSYXG7MOZKLAOQWMR4BNND","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Disambiguated Lexically Constrained Neural Machine Translation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Chuanqi Dong, Jinpeng Zhang, Ke Wang, Min Zhang, Nini Xiao, Xiangyu Duan, Yuqi Zhang","submitted_at":"2023-05-27T03:15:10Z","abstract_excerpt":"Lexically constrained neural machine translation (LCNMT), which controls the translation generation with pre-specified constraints, is important in many practical applications. Current approaches to LCNMT typically assume that the pre-specified lexical constraints are contextually appropriate. This assumption limits their application to real-world scenarios where a source lexicon may have multiple target constraints, and disambiguation is needed to select the most suitable one. In this paper, we propose disambiguated LCNMT (D-LCNMT) to solve the problem. D-LCNMT is a robust and effective two-s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.17351","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2305.17351/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"},"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-07-05T06:14:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yR+QPIdwOZ6S2H9r3DdUf8rfPpbfM77f8cjqqnzdfHhciYJObtvs+GB1OPvONPVnRMC8WftT/X8N4a9V8rJ4AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T08:47:16.708133Z"},"content_sha256":"9f995553b59244181b52d53195ecba8757ab26c578aa512456c7044f8afd08a0","schema_version":"1.0","event_id":"sha256:9f995553b59244181b52d53195ecba8757ab26c578aa512456c7044f8afd08a0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BXU6PSYXG7MOZKLAOQWMR4BNND/bundle.json","state_url":"https://pith.science/pith/BXU6PSYXG7MOZKLAOQWMR4BNND/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BXU6PSYXG7MOZKLAOQWMR4BNND/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-08-06T08:47:16Z","links":{"resolver":"https://pith.science/pith/BXU6PSYXG7MOZKLAOQWMR4BNND","bundle":"https://pith.science/pith/BXU6PSYXG7MOZKLAOQWMR4BNND/bundle.json","state":"https://pith.science/pith/BXU6PSYXG7MOZKLAOQWMR4BNND/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BXU6PSYXG7MOZKLAOQWMR4BNND/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:BXU6PSYXG7MOZKLAOQWMR4BNND","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":"ba902271083657ad7f05da322a687ecc943b6b27ffa423773a5bffc272a9d639","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2023-05-27T03:15:10Z","title_canon_sha256":"e4304b1fc22e5104e8c8da1fb3eaa54e82251829ba953bed2e469c1be69ded7f"},"schema_version":"1.0","source":{"id":"2305.17351","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2305.17351","created_at":"2026-07-05T06:14:26Z"},{"alias_kind":"arxiv_version","alias_value":"2305.17351v1","created_at":"2026-07-05T06:14:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.17351","created_at":"2026-07-05T06:14:26Z"},{"alias_kind":"pith_short_12","alias_value":"BXU6PSYXG7MO","created_at":"2026-07-05T06:14:26Z"},{"alias_kind":"pith_short_16","alias_value":"BXU6PSYXG7MOZKLA","created_at":"2026-07-05T06:14:26Z"},{"alias_kind":"pith_short_8","alias_value":"BXU6PSYX","created_at":"2026-07-05T06:14:26Z"}],"graph_snapshots":[{"event_id":"sha256:9f995553b59244181b52d53195ecba8757ab26c578aa512456c7044f8afd08a0","target":"graph","created_at":"2026-07-05T06:14:26Z","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/2305.17351/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Lexically constrained neural machine translation (LCNMT), which controls the translation generation with pre-specified constraints, is important in many practical applications. Current approaches to LCNMT typically assume that the pre-specified lexical constraints are contextually appropriate. This assumption limits their application to real-world scenarios where a source lexicon may have multiple target constraints, and disambiguation is needed to select the most suitable one. In this paper, we propose disambiguated LCNMT (D-LCNMT) to solve the problem. D-LCNMT is a robust and effective two-s","authors_text":"Chuanqi Dong, Jinpeng Zhang, Ke Wang, Min Zhang, Nini Xiao, Xiangyu Duan, Yuqi Zhang","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2023-05-27T03:15:10Z","title":"Disambiguated Lexically Constrained Neural Machine Translation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.17351","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:6a8bdcc0156c734c0222f13b0c76b0fd7437edee84d3a9787c4049a05c03e40c","target":"record","created_at":"2026-07-05T06:14:26Z","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":"ba902271083657ad7f05da322a687ecc943b6b27ffa423773a5bffc272a9d639","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2023-05-27T03:15:10Z","title_canon_sha256":"e4304b1fc22e5104e8c8da1fb3eaa54e82251829ba953bed2e469c1be69ded7f"},"schema_version":"1.0","source":{"id":"2305.17351","kind":"arxiv","version":1}},"canonical_sha256":"0de9e7cb1737d8eca960742cc8f02d68ef26f433b68118871046fca768b330a3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0de9e7cb1737d8eca960742cc8f02d68ef26f433b68118871046fca768b330a3","first_computed_at":"2026-07-05T06:14:26.791409Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:14:26.791409Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uXendTt4ntlHx9BgaY/LAoNAuojrWBhkYgJmKkimPpVHnbsmkJSJeKoRhwE47M2OJIcvH0YEcU2vnZC2yCkgDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T06:14:26.791982Z","signed_message":"canonical_sha256_bytes"},"source_id":"2305.17351","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6a8bdcc0156c734c0222f13b0c76b0fd7437edee84d3a9787c4049a05c03e40c","sha256:9f995553b59244181b52d53195ecba8757ab26c578aa512456c7044f8afd08a0"],"state_sha256":"91e84310739e53826f9bbf828d736cb0364eb6f922d018964d388fb3e906c77a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CD8lzbwMnZ2zrh9GtDLrEGotbUuLoeINXXBZRcSE9z7CxLxsl7eF4PN4LFpZjU4pY0X0bJP2zsKIHVqcwXM9Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T08:47:16.711355Z","bundle_sha256":"22c6a0f45b3bca6fd900912c40b5b279d1963ae2a9b2337a0594818a8c7919d3"}}