{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:2EOGBKU3KIZ5SAKIQAVEDLGJRF","short_pith_number":"pith:2EOGBKU3","canonical_record":{"source":{"id":"2401.02749","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2024-01-05T11:02:08Z","cross_cats_sorted":["cs.CL"],"title_canon_sha256":"552cb889939c23727224c3e61915107763321fce669bee1a82c24088544628a2","abstract_canon_sha256":"65c9a37ed15d5f2b110f9df980186efd5442e83e44e7a211f5a4084efc307479"},"schema_version":"1.0"},"canonical_sha256":"d11c60aa9b5233d90148802a41acc98949d10cf71c695ec583c0e21921d2a486","source":{"kind":"arxiv","id":"2401.02749","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2401.02749","created_at":"2026-07-05T08:30:30Z"},{"alias_kind":"arxiv_version","alias_value":"2401.02749v2","created_at":"2026-07-05T08:30:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.02749","created_at":"2026-07-05T08:30:30Z"},{"alias_kind":"pith_short_12","alias_value":"2EOGBKU3KIZ5","created_at":"2026-07-05T08:30:30Z"},{"alias_kind":"pith_short_16","alias_value":"2EOGBKU3KIZ5SAKI","created_at":"2026-07-05T08:30:30Z"},{"alias_kind":"pith_short_8","alias_value":"2EOGBKU3","created_at":"2026-07-05T08:30:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:2EOGBKU3KIZ5SAKIQAVEDLGJRF","target":"record","payload":{"canonical_record":{"source":{"id":"2401.02749","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2024-01-05T11:02:08Z","cross_cats_sorted":["cs.CL"],"title_canon_sha256":"552cb889939c23727224c3e61915107763321fce669bee1a82c24088544628a2","abstract_canon_sha256":"65c9a37ed15d5f2b110f9df980186efd5442e83e44e7a211f5a4084efc307479"},"schema_version":"1.0"},"canonical_sha256":"d11c60aa9b5233d90148802a41acc98949d10cf71c695ec583c0e21921d2a486","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:30:30.721121Z","signature_b64":"xbrOAB+ZoMZCD7NVTs9uQA4vJirkqIXAcJAwEnZAa/nzixeXqQg021DJVoA4edZlBxm6eVpureAP4shuWkanDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d11c60aa9b5233d90148802a41acc98949d10cf71c695ec583c0e21921d2a486","last_reissued_at":"2026-07-05T08:30:30.720556Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:30:30.720556Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2401.02749","source_version":2,"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:30:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aV85coKJ2JFmxEVb+iVYESYvcjuDmMtVYytVjkkeXiXYp2N1kn8LuwcsOWnpE/Vlgzz7jIVcs9P9xuC/snFxCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T15:02:28.842156Z"},"content_sha256":"480b12ef49f1bbea6d30878f4834aa78a8110ed355b3dff91d2073993290999f","schema_version":"1.0","event_id":"sha256:480b12ef49f1bbea6d30878f4834aa78a8110ed355b3dff91d2073993290999f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:2EOGBKU3KIZ5SAKIQAVEDLGJRF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Hyperparameter-Free Approach for Faster Minimum Bayes Risk Decoding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL"],"primary_cat":"cs.AI","authors_text":"Kaito Ariu, Yuu Jinnai","submitted_at":"2024-01-05T11:02:08Z","abstract_excerpt":"Minimum Bayes-Risk (MBR) decoding is shown to be a powerful alternative to beam search decoding for a wide range of text generation tasks. However, MBR requires a huge amount of time for inference to compute the MBR objective, which makes the method infeasible in many situations where response time is critical. Confidence-based pruning (CBP) (Cheng and Vlachos, 2023) has recently been proposed to reduce the inference time in machine translation tasks. Although it is shown to significantly reduce the amount of computation, it requires hyperparameter tuning using a development set to be effectiv"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.02749","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/2401.02749/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:30:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S2lGemE0nWWQ/G/o2YL2aJqYAR5jqdFYP1uqQ/r2gqrE32EoPeb6HDynQ0mL6q0C/2adgsl6csZhcjeMXB0fCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T15:02:28.842662Z"},"content_sha256":"e643d013505f1e8cf4478b6cd5ca84513aa847405d1555708a943d0483eb4e45","schema_version":"1.0","event_id":"sha256:e643d013505f1e8cf4478b6cd5ca84513aa847405d1555708a943d0483eb4e45"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2EOGBKU3KIZ5SAKIQAVEDLGJRF/bundle.json","state_url":"https://pith.science/pith/2EOGBKU3KIZ5SAKIQAVEDLGJRF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2EOGBKU3KIZ5SAKIQAVEDLGJRF/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-16T15:02:28Z","links":{"resolver":"https://pith.science/pith/2EOGBKU3KIZ5SAKIQAVEDLGJRF","bundle":"https://pith.science/pith/2EOGBKU3KIZ5SAKIQAVEDLGJRF/bundle.json","state":"https://pith.science/pith/2EOGBKU3KIZ5SAKIQAVEDLGJRF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2EOGBKU3KIZ5SAKIQAVEDLGJRF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:2EOGBKU3KIZ5SAKIQAVEDLGJRF","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":"65c9a37ed15d5f2b110f9df980186efd5442e83e44e7a211f5a4084efc307479","cross_cats_sorted":["cs.CL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2024-01-05T11:02:08Z","title_canon_sha256":"552cb889939c23727224c3e61915107763321fce669bee1a82c24088544628a2"},"schema_version":"1.0","source":{"id":"2401.02749","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2401.02749","created_at":"2026-07-05T08:30:30Z"},{"alias_kind":"arxiv_version","alias_value":"2401.02749v2","created_at":"2026-07-05T08:30:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.02749","created_at":"2026-07-05T08:30:30Z"},{"alias_kind":"pith_short_12","alias_value":"2EOGBKU3KIZ5","created_at":"2026-07-05T08:30:30Z"},{"alias_kind":"pith_short_16","alias_value":"2EOGBKU3KIZ5SAKI","created_at":"2026-07-05T08:30:30Z"},{"alias_kind":"pith_short_8","alias_value":"2EOGBKU3","created_at":"2026-07-05T08:30:30Z"}],"graph_snapshots":[{"event_id":"sha256:e643d013505f1e8cf4478b6cd5ca84513aa847405d1555708a943d0483eb4e45","target":"graph","created_at":"2026-07-05T08:30:30Z","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/2401.02749/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Minimum Bayes-Risk (MBR) decoding is shown to be a powerful alternative to beam search decoding for a wide range of text generation tasks. However, MBR requires a huge amount of time for inference to compute the MBR objective, which makes the method infeasible in many situations where response time is critical. Confidence-based pruning (CBP) (Cheng and Vlachos, 2023) has recently been proposed to reduce the inference time in machine translation tasks. Although it is shown to significantly reduce the amount of computation, it requires hyperparameter tuning using a development set to be effectiv","authors_text":"Kaito Ariu, Yuu Jinnai","cross_cats":["cs.CL"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2024-01-05T11:02:08Z","title":"Hyperparameter-Free Approach for Faster Minimum Bayes Risk Decoding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.02749","kind":"arxiv","version":2},"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:480b12ef49f1bbea6d30878f4834aa78a8110ed355b3dff91d2073993290999f","target":"record","created_at":"2026-07-05T08:30:30Z","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":"65c9a37ed15d5f2b110f9df980186efd5442e83e44e7a211f5a4084efc307479","cross_cats_sorted":["cs.CL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2024-01-05T11:02:08Z","title_canon_sha256":"552cb889939c23727224c3e61915107763321fce669bee1a82c24088544628a2"},"schema_version":"1.0","source":{"id":"2401.02749","kind":"arxiv","version":2}},"canonical_sha256":"d11c60aa9b5233d90148802a41acc98949d10cf71c695ec583c0e21921d2a486","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d11c60aa9b5233d90148802a41acc98949d10cf71c695ec583c0e21921d2a486","first_computed_at":"2026-07-05T08:30:30.720556Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:30:30.720556Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xbrOAB+ZoMZCD7NVTs9uQA4vJirkqIXAcJAwEnZAa/nzixeXqQg021DJVoA4edZlBxm6eVpureAP4shuWkanDw==","signature_status":"signed_v1","signed_at":"2026-07-05T08:30:30.721121Z","signed_message":"canonical_sha256_bytes"},"source_id":"2401.02749","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:480b12ef49f1bbea6d30878f4834aa78a8110ed355b3dff91d2073993290999f","sha256:e643d013505f1e8cf4478b6cd5ca84513aa847405d1555708a943d0483eb4e45"],"state_sha256":"c5cce0aab2df8a707f6bf929db4f2289a174b9f594ceb4719eb1e90d429bec1f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Dub3UQrf0lBmUQwE/T0qP9Dr2c03XS6u/KfFwECKn6tSrEAE2KP0MHqztCGMUuEi4MgOd8sk0vMDTQWoQb1zCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T15:02:28.847521Z","bundle_sha256":"45ae35109e9ba82d99a8597a427fe2a490a1512a702e8271844428f8de832200"}}