{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:PUZ2FUTIIHRO43KGARL27EZMGZ","short_pith_number":"pith:PUZ2FUTI","canonical_record":{"source":{"id":"2311.14919","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2023-11-25T03:38:14Z","cross_cats_sorted":[],"title_canon_sha256":"93f6515eaae3f1ecd2b04c48ab999f91701a64224c239e67a67ee8d566d29bee","abstract_canon_sha256":"c7ffc589b2cfb55c10a55701df135cf25c9638889dac1e97238643066d4df58c"},"schema_version":"1.0"},"canonical_sha256":"7d33a2d26841e2ee6d460457af932c364c006ebe24960fcdea02a0b8ec9bce79","source":{"kind":"arxiv","id":"2311.14919","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2311.14919","created_at":"2026-07-05T07:16:55Z"},{"alias_kind":"arxiv_version","alias_value":"2311.14919v1","created_at":"2026-07-05T07:16:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.14919","created_at":"2026-07-05T07:16:55Z"},{"alias_kind":"pith_short_12","alias_value":"PUZ2FUTIIHRO","created_at":"2026-07-05T07:16:55Z"},{"alias_kind":"pith_short_16","alias_value":"PUZ2FUTIIHRO43KG","created_at":"2026-07-05T07:16:55Z"},{"alias_kind":"pith_short_8","alias_value":"PUZ2FUTI","created_at":"2026-07-05T07:16:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:PUZ2FUTIIHRO43KGARL27EZMGZ","target":"record","payload":{"canonical_record":{"source":{"id":"2311.14919","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2023-11-25T03:38:14Z","cross_cats_sorted":[],"title_canon_sha256":"93f6515eaae3f1ecd2b04c48ab999f91701a64224c239e67a67ee8d566d29bee","abstract_canon_sha256":"c7ffc589b2cfb55c10a55701df135cf25c9638889dac1e97238643066d4df58c"},"schema_version":"1.0"},"canonical_sha256":"7d33a2d26841e2ee6d460457af932c364c006ebe24960fcdea02a0b8ec9bce79","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:16:55.670780Z","signature_b64":"a2qQ8E93fHpGHBtuS8hnhEF6eELbmcc1nOTQTEiSaKCpSX3k+pCbSZK2kCG/G18IHqqpaTysjPyFim7Lo06xBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7d33a2d26841e2ee6d460457af932c364c006ebe24960fcdea02a0b8ec9bce79","last_reissued_at":"2026-07-05T07:16:55.670313Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:16:55.670313Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2311.14919","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-05T07:16:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4m65cFmxjASYxDlzaZJV8kGPoR1LidjCRU0h/kpMwsNMkn/F+/uVE7fDzB6D9PnWJCI/vR5nfxYaVFqH0qUzCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-08T22:33:37.946946Z"},"content_sha256":"3f1821853767dd300d189b6c58f19e11d7dc3610fc2bf6a07bb2df65cfd5c856","schema_version":"1.0","event_id":"sha256:3f1821853767dd300d189b6c58f19e11d7dc3610fc2bf6a07bb2df65cfd5c856"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:PUZ2FUTIIHRO43KGARL27EZMGZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Faster Minimum Bayes Risk Decoding with Confidence-based Pruning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Andreas Vlachos, Julius Cheng","submitted_at":"2023-11-25T03:38:14Z","abstract_excerpt":"Minimum Bayes risk (MBR) decoding outputs the hypothesis with the highest expected utility over the model distribution for some utility function. It has been shown to improve accuracy over beam search in conditional language generation problems and especially neural machine translation, in both human and automatic evaluations. However, the standard sampling-based algorithm for MBR is substantially more computationally expensive than beam search, requiring a large number of samples as well as a quadratic number of calls to the utility function, limiting its applicability. We describe an algorit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.14919","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/2311.14919/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-05T07:16:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U65Zg/ipoCnoVRnpgIiQ80WYV3Db48Rv27XODT5g3JFX8PYX9TgoD4GhlO9Kp0WE3YQrYQm2h9nziWKMfB/pBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-08T22:33:37.947307Z"},"content_sha256":"0aca54c6fdf781728534e0b62970f3b6aaff76f17dbfacefbf41fe7efb8a0379","schema_version":"1.0","event_id":"sha256:0aca54c6fdf781728534e0b62970f3b6aaff76f17dbfacefbf41fe7efb8a0379"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PUZ2FUTIIHRO43KGARL27EZMGZ/bundle.json","state_url":"https://pith.science/pith/PUZ2FUTIIHRO43KGARL27EZMGZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PUZ2FUTIIHRO43KGARL27EZMGZ/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-08T22:33:37Z","links":{"resolver":"https://pith.science/pith/PUZ2FUTIIHRO43KGARL27EZMGZ","bundle":"https://pith.science/pith/PUZ2FUTIIHRO43KGARL27EZMGZ/bundle.json","state":"https://pith.science/pith/PUZ2FUTIIHRO43KGARL27EZMGZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PUZ2FUTIIHRO43KGARL27EZMGZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:PUZ2FUTIIHRO43KGARL27EZMGZ","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":"c7ffc589b2cfb55c10a55701df135cf25c9638889dac1e97238643066d4df58c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2023-11-25T03:38:14Z","title_canon_sha256":"93f6515eaae3f1ecd2b04c48ab999f91701a64224c239e67a67ee8d566d29bee"},"schema_version":"1.0","source":{"id":"2311.14919","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2311.14919","created_at":"2026-07-05T07:16:55Z"},{"alias_kind":"arxiv_version","alias_value":"2311.14919v1","created_at":"2026-07-05T07:16:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.14919","created_at":"2026-07-05T07:16:55Z"},{"alias_kind":"pith_short_12","alias_value":"PUZ2FUTIIHRO","created_at":"2026-07-05T07:16:55Z"},{"alias_kind":"pith_short_16","alias_value":"PUZ2FUTIIHRO43KG","created_at":"2026-07-05T07:16:55Z"},{"alias_kind":"pith_short_8","alias_value":"PUZ2FUTI","created_at":"2026-07-05T07:16:55Z"}],"graph_snapshots":[{"event_id":"sha256:0aca54c6fdf781728534e0b62970f3b6aaff76f17dbfacefbf41fe7efb8a0379","target":"graph","created_at":"2026-07-05T07:16:55Z","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/2311.14919/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Minimum Bayes risk (MBR) decoding outputs the hypothesis with the highest expected utility over the model distribution for some utility function. It has been shown to improve accuracy over beam search in conditional language generation problems and especially neural machine translation, in both human and automatic evaluations. However, the standard sampling-based algorithm for MBR is substantially more computationally expensive than beam search, requiring a large number of samples as well as a quadratic number of calls to the utility function, limiting its applicability. We describe an algorit","authors_text":"Andreas Vlachos, Julius Cheng","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2023-11-25T03:38:14Z","title":"Faster Minimum Bayes Risk Decoding with Confidence-based Pruning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.14919","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:3f1821853767dd300d189b6c58f19e11d7dc3610fc2bf6a07bb2df65cfd5c856","target":"record","created_at":"2026-07-05T07:16:55Z","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":"c7ffc589b2cfb55c10a55701df135cf25c9638889dac1e97238643066d4df58c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2023-11-25T03:38:14Z","title_canon_sha256":"93f6515eaae3f1ecd2b04c48ab999f91701a64224c239e67a67ee8d566d29bee"},"schema_version":"1.0","source":{"id":"2311.14919","kind":"arxiv","version":1}},"canonical_sha256":"7d33a2d26841e2ee6d460457af932c364c006ebe24960fcdea02a0b8ec9bce79","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7d33a2d26841e2ee6d460457af932c364c006ebe24960fcdea02a0b8ec9bce79","first_computed_at":"2026-07-05T07:16:55.670313Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:16:55.670313Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"a2qQ8E93fHpGHBtuS8hnhEF6eELbmcc1nOTQTEiSaKCpSX3k+pCbSZK2kCG/G18IHqqpaTysjPyFim7Lo06xBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T07:16:55.670780Z","signed_message":"canonical_sha256_bytes"},"source_id":"2311.14919","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3f1821853767dd300d189b6c58f19e11d7dc3610fc2bf6a07bb2df65cfd5c856","sha256:0aca54c6fdf781728534e0b62970f3b6aaff76f17dbfacefbf41fe7efb8a0379"],"state_sha256":"e2a81b16ce9eade4f8cc4806d11b9749e20e7425a898deb9a2da1332252cb8fc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Buat+a9Or7dthqdW0mYQigUzrba5ilrxO3Qpfo2oTvMte3G4s94l/o+C9Th2uNCC+LNsjVHKRkBp0gZ+NJaVBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-08T22:33:37.949230Z","bundle_sha256":"f3a537e862c332866dea76b82c8829bf77b921bd41062cc25ce168cb27d43574"}}