{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:OU4HBYDAOO7ALCXRKQTJ4KXNWB","short_pith_number":"pith:OU4HBYDA","canonical_record":{"source":{"id":"2406.02832","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2024-06-05T00:54:03Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"cf3d3a34743cbfbbe1cd4e701bf8d3bf064588fba41cb61284722cadde7691e6","abstract_canon_sha256":"ad08841c7042aa3779c966a567e891a5c8829746ab9f492de6f5184022dff892"},"schema_version":"1.0"},"canonical_sha256":"753870e06073be058af154269e2aedb055e45b1837e0577861de9e2163cf4c4c","source":{"kind":"arxiv","id":"2406.02832","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2406.02832","created_at":"2026-07-05T08:27:31Z"},{"alias_kind":"arxiv_version","alias_value":"2406.02832v1","created_at":"2026-07-05T08:27:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.02832","created_at":"2026-07-05T08:27:31Z"},{"alias_kind":"pith_short_12","alias_value":"OU4HBYDAOO7A","created_at":"2026-07-05T08:27:31Z"},{"alias_kind":"pith_short_16","alias_value":"OU4HBYDAOO7ALCXR","created_at":"2026-07-05T08:27:31Z"},{"alias_kind":"pith_short_8","alias_value":"OU4HBYDA","created_at":"2026-07-05T08:27:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:OU4HBYDAOO7ALCXRKQTJ4KXNWB","target":"record","payload":{"canonical_record":{"source":{"id":"2406.02832","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2024-06-05T00:54:03Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"cf3d3a34743cbfbbe1cd4e701bf8d3bf064588fba41cb61284722cadde7691e6","abstract_canon_sha256":"ad08841c7042aa3779c966a567e891a5c8829746ab9f492de6f5184022dff892"},"schema_version":"1.0"},"canonical_sha256":"753870e06073be058af154269e2aedb055e45b1837e0577861de9e2163cf4c4c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:27:31.094664Z","signature_b64":"AqZS3DQBj2g0SIEP0HFusJ0Gzis9NpSIuQ1eF1251XL4GLACqL7uLsUuEU2j2j4czUwFcNKYLiOL4oml/PCvCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"753870e06073be058af154269e2aedb055e45b1837e0577861de9e2163cf4c4c","last_reissued_at":"2026-07-05T08:27:31.094160Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:27:31.094160Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2406.02832","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-05T08:27:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w/ubQefrMniMkVQ6fjdxJ99CUD21mGZwX3ka1b8GXu0skEhq/Xuje3gr5A8rJZU1IxobVomxDW4oyABgUFreCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T07:03:06.572490Z"},"content_sha256":"7bbe11d57a019b3a2865aff3d4d42edce40ec6ede47d6e46bb9575b8004c54c0","schema_version":"1.0","event_id":"sha256:7bbe11d57a019b3a2865aff3d4d42edce40ec6ede47d6e46bb9575b8004c54c0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:OU4HBYDAOO7ALCXRKQTJ4KXNWB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Minimum Bayes Risk Decoding using Low-Rank Matrix Completion Algorithms","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CL","authors_text":"David Vilar, Firas Trabelsi, Mara Finkelstein, Markus Freitag","submitted_at":"2024-06-05T00:54:03Z","abstract_excerpt":"Minimum Bayes Risk (MBR) decoding is a powerful decoding strategy widely used for text generation tasks, but its quadratic computational complexity limits its practical application. This paper presents a novel approach for approximating MBR decoding using matrix completion techniques, focusing on the task of machine translation. We formulate MBR decoding as a matrix completion problem, where the utility metric scores between candidate hypotheses and pseudo-reference translations form a low-rank matrix. First, we empirically show that the scores matrices indeed have a low-rank structure. Then, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.02832","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/2406.02832/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-05T08:27:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IIDhj9spw/T69+qSLuZWpW1c7Y89GvNBsqGUiR0ZRZZ9hScdYtxmTxKwnzOnIdSHcnaPd3ptHIQwbwx0mV6LCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T07:03:06.573479Z"},"content_sha256":"e059a5c93d9385984187812524076e8686c62a6317099c796661171d64bf3d85","schema_version":"1.0","event_id":"sha256:e059a5c93d9385984187812524076e8686c62a6317099c796661171d64bf3d85"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OU4HBYDAOO7ALCXRKQTJ4KXNWB/bundle.json","state_url":"https://pith.science/pith/OU4HBYDAOO7ALCXRKQTJ4KXNWB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OU4HBYDAOO7ALCXRKQTJ4KXNWB/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-05T07:03:06Z","links":{"resolver":"https://pith.science/pith/OU4HBYDAOO7ALCXRKQTJ4KXNWB","bundle":"https://pith.science/pith/OU4HBYDAOO7ALCXRKQTJ4KXNWB/bundle.json","state":"https://pith.science/pith/OU4HBYDAOO7ALCXRKQTJ4KXNWB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OU4HBYDAOO7ALCXRKQTJ4KXNWB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:OU4HBYDAOO7ALCXRKQTJ4KXNWB","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":"ad08841c7042aa3779c966a567e891a5c8829746ab9f492de6f5184022dff892","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2024-06-05T00:54:03Z","title_canon_sha256":"cf3d3a34743cbfbbe1cd4e701bf8d3bf064588fba41cb61284722cadde7691e6"},"schema_version":"1.0","source":{"id":"2406.02832","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2406.02832","created_at":"2026-07-05T08:27:31Z"},{"alias_kind":"arxiv_version","alias_value":"2406.02832v1","created_at":"2026-07-05T08:27:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.02832","created_at":"2026-07-05T08:27:31Z"},{"alias_kind":"pith_short_12","alias_value":"OU4HBYDAOO7A","created_at":"2026-07-05T08:27:31Z"},{"alias_kind":"pith_short_16","alias_value":"OU4HBYDAOO7ALCXR","created_at":"2026-07-05T08:27:31Z"},{"alias_kind":"pith_short_8","alias_value":"OU4HBYDA","created_at":"2026-07-05T08:27:31Z"}],"graph_snapshots":[{"event_id":"sha256:e059a5c93d9385984187812524076e8686c62a6317099c796661171d64bf3d85","target":"graph","created_at":"2026-07-05T08:27:31Z","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/2406.02832/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Minimum Bayes Risk (MBR) decoding is a powerful decoding strategy widely used for text generation tasks, but its quadratic computational complexity limits its practical application. This paper presents a novel approach for approximating MBR decoding using matrix completion techniques, focusing on the task of machine translation. We formulate MBR decoding as a matrix completion problem, where the utility metric scores between candidate hypotheses and pseudo-reference translations form a low-rank matrix. First, we empirically show that the scores matrices indeed have a low-rank structure. Then, ","authors_text":"David Vilar, Firas Trabelsi, Mara Finkelstein, Markus Freitag","cross_cats":["cs.LG"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2024-06-05T00:54:03Z","title":"Efficient Minimum Bayes Risk Decoding using Low-Rank Matrix Completion Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.02832","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:7bbe11d57a019b3a2865aff3d4d42edce40ec6ede47d6e46bb9575b8004c54c0","target":"record","created_at":"2026-07-05T08:27:31Z","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":"ad08841c7042aa3779c966a567e891a5c8829746ab9f492de6f5184022dff892","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2024-06-05T00:54:03Z","title_canon_sha256":"cf3d3a34743cbfbbe1cd4e701bf8d3bf064588fba41cb61284722cadde7691e6"},"schema_version":"1.0","source":{"id":"2406.02832","kind":"arxiv","version":1}},"canonical_sha256":"753870e06073be058af154269e2aedb055e45b1837e0577861de9e2163cf4c4c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"753870e06073be058af154269e2aedb055e45b1837e0577861de9e2163cf4c4c","first_computed_at":"2026-07-05T08:27:31.094160Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:27:31.094160Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AqZS3DQBj2g0SIEP0HFusJ0Gzis9NpSIuQ1eF1251XL4GLACqL7uLsUuEU2j2j4czUwFcNKYLiOL4oml/PCvCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T08:27:31.094664Z","signed_message":"canonical_sha256_bytes"},"source_id":"2406.02832","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7bbe11d57a019b3a2865aff3d4d42edce40ec6ede47d6e46bb9575b8004c54c0","sha256:e059a5c93d9385984187812524076e8686c62a6317099c796661171d64bf3d85"],"state_sha256":"bd19d69ac3bc65fba56cd2701e1df994bf63c20266eef09f799ab545cd2e16b6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qk52IvhGCwX3tQpNe0ltkSJ1/MdBlwsc6M/1bSLlYc3n1TlqCiZZSGhnaSsL2P8lZL4VkGv57enDgIkQUjURAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T07:03:06.599419Z","bundle_sha256":"287e32677403b818e02c28e76d2027d37cd553cefb6e3df44c741a45b0578891"}}