{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:MENT43KIDKC5JQUJYILTMFDQBR","short_pith_number":"pith:MENT43KI","schema_version":"1.0","canonical_sha256":"611b3e6d481a85d4c289c2173614700c6bb36dd79fc7a79a006eab476cd55caa","source":{"kind":"arxiv","id":"2411.09694","version":2},"attestation_state":"computed","paper":{"title":"A Bayesian Optimization Approach to Machine Translation Reranking","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Andreas Vlachos, Julius Cheng, Maike Z\\\"ufle, Vil\\'em Zouhar","submitted_at":"2024-11-14T18:58:23Z","abstract_excerpt":"Reranking a list of candidates from a machine translation system with an external scoring model and returning the highest-scoring candidate remains a simple and effective method for improving the overall output quality. Translation scoring models continue to grow in size, with the best models being comparable to generation models. Thus, reranking can add substantial computational cost to the translation pipeline. In this work, we pose reranking as a Bayesian optimization (BayesOpt) problem. By strategically selecting candidates to score based on a balance of exploration and exploitation, we sh"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2411.09694","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2024-11-14T18:58:23Z","cross_cats_sorted":[],"title_canon_sha256":"e751448d26ed393085bc1fea9d6ae8a58b64799afe601e9c7bf0086c39089998","abstract_canon_sha256":"2f0272b5dd9ad48df4ea5f130b08523aefd368b03969a231c3f04f0ac273c7c8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:55:26.033410Z","signature_b64":"hdVUDrbKGqMEHiWWQFuqMH/zGCxzoDM6B7PlZq0KFNm4OGfs7uSQofKTSa+kZHrpVgFJ4zSHaHhbfhYANgnuDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"611b3e6d481a85d4c289c2173614700c6bb36dd79fc7a79a006eab476cd55caa","last_reissued_at":"2026-07-05T10:55:26.032904Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:55:26.032904Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Bayesian Optimization Approach to Machine Translation Reranking","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Andreas Vlachos, Julius Cheng, Maike Z\\\"ufle, Vil\\'em Zouhar","submitted_at":"2024-11-14T18:58:23Z","abstract_excerpt":"Reranking a list of candidates from a machine translation system with an external scoring model and returning the highest-scoring candidate remains a simple and effective method for improving the overall output quality. Translation scoring models continue to grow in size, with the best models being comparable to generation models. Thus, reranking can add substantial computational cost to the translation pipeline. In this work, we pose reranking as a Bayesian optimization (BayesOpt) problem. By strategically selecting candidates to score based on a balance of exploration and exploitation, we sh"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.09694","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/2411.09694/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2411.09694","created_at":"2026-07-05T10:55:26.032969+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.09694v2","created_at":"2026-07-05T10:55:26.032969+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.09694","created_at":"2026-07-05T10:55:26.032969+00:00"},{"alias_kind":"pith_short_12","alias_value":"MENT43KIDKC5","created_at":"2026-07-05T10:55:26.032969+00:00"},{"alias_kind":"pith_short_16","alias_value":"MENT43KIDKC5JQUJ","created_at":"2026-07-05T10:55:26.032969+00:00"},{"alias_kind":"pith_short_8","alias_value":"MENT43KI","created_at":"2026-07-05T10:55:26.032969+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MENT43KIDKC5JQUJYILTMFDQBR","json":"https://pith.science/pith/MENT43KIDKC5JQUJYILTMFDQBR.json","graph_json":"https://pith.science/api/pith-number/MENT43KIDKC5JQUJYILTMFDQBR/graph.json","events_json":"https://pith.science/api/pith-number/MENT43KIDKC5JQUJYILTMFDQBR/events.json","paper":"https://pith.science/paper/MENT43KI"},"agent_actions":{"view_html":"https://pith.science/pith/MENT43KIDKC5JQUJYILTMFDQBR","download_json":"https://pith.science/pith/MENT43KIDKC5JQUJYILTMFDQBR.json","view_paper":"https://pith.science/paper/MENT43KI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.09694&json=true","fetch_graph":"https://pith.science/api/pith-number/MENT43KIDKC5JQUJYILTMFDQBR/graph.json","fetch_events":"https://pith.science/api/pith-number/MENT43KIDKC5JQUJYILTMFDQBR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MENT43KIDKC5JQUJYILTMFDQBR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MENT43KIDKC5JQUJYILTMFDQBR/action/storage_attestation","attest_author":"https://pith.science/pith/MENT43KIDKC5JQUJYILTMFDQBR/action/author_attestation","sign_citation":"https://pith.science/pith/MENT43KIDKC5JQUJYILTMFDQBR/action/citation_signature","submit_replication":"https://pith.science/pith/MENT43KIDKC5JQUJYILTMFDQBR/action/replication_record"}},"created_at":"2026-07-05T10:55:26.032969+00:00","updated_at":"2026-07-05T10:55:26.032969+00:00"}