{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:LNWSB4KVXPIU3PF5RT3462KZT7","short_pith_number":"pith:LNWSB4KV","canonical_record":{"source":{"id":"2203.00201","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2022-03-01T03:12:17Z","cross_cats_sorted":[],"title_canon_sha256":"82cb9088492b8794010aa39016df2188158485c9828416ab58b325a48f48a750","abstract_canon_sha256":"5e9691fcb4c583e52af878f08f6842870e86f51e3f18484da1d69e99dd8a24c6"},"schema_version":"1.0"},"canonical_sha256":"5b6d20f155bbd14dbcbd8cf7cf69599fc12a8fa273d47b3a02ca37a0bb9ff714","source":{"kind":"arxiv","id":"2203.00201","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2203.00201","created_at":"2026-07-05T04:01:14Z"},{"alias_kind":"arxiv_version","alias_value":"2203.00201v1","created_at":"2026-07-05T04:01:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.00201","created_at":"2026-07-05T04:01:14Z"},{"alias_kind":"pith_short_12","alias_value":"LNWSB4KVXPIU","created_at":"2026-07-05T04:01:14Z"},{"alias_kind":"pith_short_16","alias_value":"LNWSB4KVXPIU3PF5","created_at":"2026-07-05T04:01:14Z"},{"alias_kind":"pith_short_8","alias_value":"LNWSB4KV","created_at":"2026-07-05T04:01:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:LNWSB4KVXPIU3PF5RT3462KZT7","target":"record","payload":{"canonical_record":{"source":{"id":"2203.00201","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2022-03-01T03:12:17Z","cross_cats_sorted":[],"title_canon_sha256":"82cb9088492b8794010aa39016df2188158485c9828416ab58b325a48f48a750","abstract_canon_sha256":"5e9691fcb4c583e52af878f08f6842870e86f51e3f18484da1d69e99dd8a24c6"},"schema_version":"1.0"},"canonical_sha256":"5b6d20f155bbd14dbcbd8cf7cf69599fc12a8fa273d47b3a02ca37a0bb9ff714","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:01:14.992527Z","signature_b64":"saBjhGv1XBIlXloDGJWi1cXckCvRNenXx0+olvPqgysvGJH01RfCQmmEFtjdSQAdqn5gq06O3WmYdEdyYOLzAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5b6d20f155bbd14dbcbd8cf7cf69599fc12a8fa273d47b3a02ca37a0bb9ff714","last_reissued_at":"2026-07-05T04:01:14.992069Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:01:14.992069Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2203.00201","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-05T04:01:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eJzdNg/Cj/3n40s3E6V6KQrefhi3L9FXaZ3JFSml2MMrmx4q+gGxqZ/GgSy0efo45I8qAOafeAeXc0LohaftDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T09:20:02.976307Z"},"content_sha256":"571b4b4bfec9e539e1c6b7ef665198601ed255401b67de8018fbd7361ab9fb07","schema_version":"1.0","event_id":"sha256:571b4b4bfec9e539e1c6b7ef665198601ed255401b67de8018fbd7361ab9fb07"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:LNWSB4KVXPIU3PF5RT3462KZT7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"RMBR: A Regularized Minimum Bayes Risk Reranking Framework for Machine Translation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Baosong Yang, Dayiheng Liu, Yidan Zhang, Yu Wan, Zhenan He","submitted_at":"2022-03-01T03:12:17Z","abstract_excerpt":"Beam search is the most widely used decoding method for neural machine translation (NMT). In practice, the top-1 candidate with the highest log-probability among the n candidates is selected as the preferred one. However, this top-1 candidate may not be the best overall translation among the n-best list. Recently, Minimum Bayes Risk (MBR) decoding has been proposed to improve the quality for NMT, which seeks for a consensus translation that is closest on average to other candidates from the n-best list. We argue that MBR still suffers from the following problems: The utility function only cons"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2203.00201","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/2203.00201/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-05T04:01:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6kNfxRpSG9IGs702zxd1CsESjad3ouozaaZtvo7TNw6qr7mdUDGRpMzcFjcrJTu6RFtPJxhXc6J8O3LSqjHACw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T09:20:02.976679Z"},"content_sha256":"adc98ac7f08d07b9ae5ecb72f41077525f94bcdd0f700689d5d902a93ad7f804","schema_version":"1.0","event_id":"sha256:adc98ac7f08d07b9ae5ecb72f41077525f94bcdd0f700689d5d902a93ad7f804"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LNWSB4KVXPIU3PF5RT3462KZT7/bundle.json","state_url":"https://pith.science/pith/LNWSB4KVXPIU3PF5RT3462KZT7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LNWSB4KVXPIU3PF5RT3462KZT7/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-07-07T09:20:02Z","links":{"resolver":"https://pith.science/pith/LNWSB4KVXPIU3PF5RT3462KZT7","bundle":"https://pith.science/pith/LNWSB4KVXPIU3PF5RT3462KZT7/bundle.json","state":"https://pith.science/pith/LNWSB4KVXPIU3PF5RT3462KZT7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LNWSB4KVXPIU3PF5RT3462KZT7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:LNWSB4KVXPIU3PF5RT3462KZT7","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":"5e9691fcb4c583e52af878f08f6842870e86f51e3f18484da1d69e99dd8a24c6","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2022-03-01T03:12:17Z","title_canon_sha256":"82cb9088492b8794010aa39016df2188158485c9828416ab58b325a48f48a750"},"schema_version":"1.0","source":{"id":"2203.00201","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2203.00201","created_at":"2026-07-05T04:01:14Z"},{"alias_kind":"arxiv_version","alias_value":"2203.00201v1","created_at":"2026-07-05T04:01:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.00201","created_at":"2026-07-05T04:01:14Z"},{"alias_kind":"pith_short_12","alias_value":"LNWSB4KVXPIU","created_at":"2026-07-05T04:01:14Z"},{"alias_kind":"pith_short_16","alias_value":"LNWSB4KVXPIU3PF5","created_at":"2026-07-05T04:01:14Z"},{"alias_kind":"pith_short_8","alias_value":"LNWSB4KV","created_at":"2026-07-05T04:01:14Z"}],"graph_snapshots":[{"event_id":"sha256:adc98ac7f08d07b9ae5ecb72f41077525f94bcdd0f700689d5d902a93ad7f804","target":"graph","created_at":"2026-07-05T04:01:14Z","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/2203.00201/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Beam search is the most widely used decoding method for neural machine translation (NMT). In practice, the top-1 candidate with the highest log-probability among the n candidates is selected as the preferred one. However, this top-1 candidate may not be the best overall translation among the n-best list. Recently, Minimum Bayes Risk (MBR) decoding has been proposed to improve the quality for NMT, which seeks for a consensus translation that is closest on average to other candidates from the n-best list. We argue that MBR still suffers from the following problems: The utility function only cons","authors_text":"Baosong Yang, Dayiheng Liu, Yidan Zhang, Yu Wan, Zhenan He","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2022-03-01T03:12:17Z","title":"RMBR: A Regularized Minimum Bayes Risk Reranking Framework for Machine Translation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2203.00201","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:571b4b4bfec9e539e1c6b7ef665198601ed255401b67de8018fbd7361ab9fb07","target":"record","created_at":"2026-07-05T04:01:14Z","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":"5e9691fcb4c583e52af878f08f6842870e86f51e3f18484da1d69e99dd8a24c6","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2022-03-01T03:12:17Z","title_canon_sha256":"82cb9088492b8794010aa39016df2188158485c9828416ab58b325a48f48a750"},"schema_version":"1.0","source":{"id":"2203.00201","kind":"arxiv","version":1}},"canonical_sha256":"5b6d20f155bbd14dbcbd8cf7cf69599fc12a8fa273d47b3a02ca37a0bb9ff714","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5b6d20f155bbd14dbcbd8cf7cf69599fc12a8fa273d47b3a02ca37a0bb9ff714","first_computed_at":"2026-07-05T04:01:14.992069Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:01:14.992069Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"saBjhGv1XBIlXloDGJWi1cXckCvRNenXx0+olvPqgysvGJH01RfCQmmEFtjdSQAdqn5gq06O3WmYdEdyYOLzAw==","signature_status":"signed_v1","signed_at":"2026-07-05T04:01:14.992527Z","signed_message":"canonical_sha256_bytes"},"source_id":"2203.00201","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:571b4b4bfec9e539e1c6b7ef665198601ed255401b67de8018fbd7361ab9fb07","sha256:adc98ac7f08d07b9ae5ecb72f41077525f94bcdd0f700689d5d902a93ad7f804"],"state_sha256":"dff6e767ad3abc6972c132bb7a445b75c4512a21d544aadbf782bfb26e0bbc45"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iMOLtldH72Z1Ku1B66//cFTFIGw/6ZnzBHHq/3g031ht0wLsNaofbvX5Ial2+fqY+oS3GU1asZrH/bbgjiP+AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T09:20:02.978577Z","bundle_sha256":"5753e9bbae5752e4a9caf724ad71c8bcd2bfd3f30774ba4d34b79abc1e2226ac"}}