{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:HWF4PED3GGZ6L5O3TY6IGG2OWZ","short_pith_number":"pith:HWF4PED3","canonical_record":{"source":{"id":"1904.01032","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2019-04-01T18:01:08Z","cross_cats_sorted":[],"title_canon_sha256":"482572a7d7ba2c053966f2eef07bdabfd78888fc23eea04b789840fecf0b2c59","abstract_canon_sha256":"935242e5ecfa6e65a159a40e1857f3340c30eca4919a4ae610f11d0e4112bd45"},"schema_version":"1.0"},"canonical_sha256":"3d8bc7907b31b3e5f5db9e3c831b4eb65725e8008647cf90f5ccaedbc0c13020","source":{"kind":"arxiv","id":"1904.01032","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.01032","created_at":"2026-05-17T23:42:32Z"},{"alias_kind":"arxiv_version","alias_value":"1904.01032v3","created_at":"2026-05-17T23:42:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.01032","created_at":"2026-05-17T23:42:32Z"},{"alias_kind":"pith_short_12","alias_value":"HWF4PED3GGZ6","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"HWF4PED3GGZ6L5O3","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"HWF4PED3","created_at":"2026-05-18T12:33:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:HWF4PED3GGZ6L5O3TY6IGG2OWZ","target":"record","payload":{"canonical_record":{"source":{"id":"1904.01032","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2019-04-01T18:01:08Z","cross_cats_sorted":[],"title_canon_sha256":"482572a7d7ba2c053966f2eef07bdabfd78888fc23eea04b789840fecf0b2c59","abstract_canon_sha256":"935242e5ecfa6e65a159a40e1857f3340c30eca4919a4ae610f11d0e4112bd45"},"schema_version":"1.0"},"canonical_sha256":"3d8bc7907b31b3e5f5db9e3c831b4eb65725e8008647cf90f5ccaedbc0c13020","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:32.372455Z","signature_b64":"/OLKr1ZcWs+4sdWgU4x4no20h63y5cCAUPi5V9wHE+VMa0mVxlMMv5KUaO+hkZ3BTzYT4ej0wXJA8l0RBL3fAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3d8bc7907b31b3e5f5db9e3c831b4eb65725e8008647cf90f5ccaedbc0c13020","last_reissued_at":"2026-05-17T23:42:32.371694Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:32.371694Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1904.01032","source_version":3,"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-05-17T23:42:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oEHXXBD8Kw3mBMqO8imE/fD2+jrr1DAmgqMhidEbyQg+E2r8hDZHsRduONgQKhBSErOv/90hGYAun5sLiFcWDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T15:40:00.856786Z"},"content_sha256":"636ac5d8cf8b3429825a5beeff99873c98f1d131d73e167e568957cc126bc1bf","schema_version":"1.0","event_id":"sha256:636ac5d8cf8b3429825a5beeff99873c98f1d131d73e167e568957cc126bc1bf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:HWF4PED3GGZ6L5O3TY6IGG2OWZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning to Stop in Structured Prediction for Neural Machine Translation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Liang Huang, Mingbo Ma, Renjie Zheng","submitted_at":"2019-04-01T18:01:08Z","abstract_excerpt":"Beam search optimization resolves many issues in neural machine translation. However, this method lacks principled stopping criteria and does not learn how to stop during training, and the model naturally prefers the longer hypotheses during the testing time in practice since they use the raw score instead of the probability-based score. We propose a novel ranking method which enables an optimal beam search stopping criteria. We further introduce a structured prediction loss function which penalizes suboptimal finished candidates produced by beam search during training. Experiments of neural m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.01032","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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-05-17T23:42:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wYHEKNIjq+W3Ma6Z2XJkKVKCtxOPtooqF1b3s2P1nWlOOziv0+GjrwnhLzWFspIC/DYuY87Miw6q6ZiTHDhQCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T15:40:00.857138Z"},"content_sha256":"4674458cd344e3bbf2eb5f68bfe38544b951d92b8a1340ff47c6bc3f6a7b81bf","schema_version":"1.0","event_id":"sha256:4674458cd344e3bbf2eb5f68bfe38544b951d92b8a1340ff47c6bc3f6a7b81bf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HWF4PED3GGZ6L5O3TY6IGG2OWZ/bundle.json","state_url":"https://pith.science/pith/HWF4PED3GGZ6L5O3TY6IGG2OWZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HWF4PED3GGZ6L5O3TY6IGG2OWZ/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-06-02T15:40:00Z","links":{"resolver":"https://pith.science/pith/HWF4PED3GGZ6L5O3TY6IGG2OWZ","bundle":"https://pith.science/pith/HWF4PED3GGZ6L5O3TY6IGG2OWZ/bundle.json","state":"https://pith.science/pith/HWF4PED3GGZ6L5O3TY6IGG2OWZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HWF4PED3GGZ6L5O3TY6IGG2OWZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:HWF4PED3GGZ6L5O3TY6IGG2OWZ","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":"935242e5ecfa6e65a159a40e1857f3340c30eca4919a4ae610f11d0e4112bd45","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2019-04-01T18:01:08Z","title_canon_sha256":"482572a7d7ba2c053966f2eef07bdabfd78888fc23eea04b789840fecf0b2c59"},"schema_version":"1.0","source":{"id":"1904.01032","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.01032","created_at":"2026-05-17T23:42:32Z"},{"alias_kind":"arxiv_version","alias_value":"1904.01032v3","created_at":"2026-05-17T23:42:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.01032","created_at":"2026-05-17T23:42:32Z"},{"alias_kind":"pith_short_12","alias_value":"HWF4PED3GGZ6","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"HWF4PED3GGZ6L5O3","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"HWF4PED3","created_at":"2026-05-18T12:33:18Z"}],"graph_snapshots":[{"event_id":"sha256:4674458cd344e3bbf2eb5f68bfe38544b951d92b8a1340ff47c6bc3f6a7b81bf","target":"graph","created_at":"2026-05-17T23:42:32Z","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"},"paper":{"abstract_excerpt":"Beam search optimization resolves many issues in neural machine translation. However, this method lacks principled stopping criteria and does not learn how to stop during training, and the model naturally prefers the longer hypotheses during the testing time in practice since they use the raw score instead of the probability-based score. We propose a novel ranking method which enables an optimal beam search stopping criteria. We further introduce a structured prediction loss function which penalizes suboptimal finished candidates produced by beam search during training. Experiments of neural m","authors_text":"Liang Huang, Mingbo Ma, Renjie Zheng","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2019-04-01T18:01:08Z","title":"Learning to Stop in Structured Prediction for Neural Machine Translation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.01032","kind":"arxiv","version":3},"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:636ac5d8cf8b3429825a5beeff99873c98f1d131d73e167e568957cc126bc1bf","target":"record","created_at":"2026-05-17T23:42:32Z","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":"935242e5ecfa6e65a159a40e1857f3340c30eca4919a4ae610f11d0e4112bd45","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2019-04-01T18:01:08Z","title_canon_sha256":"482572a7d7ba2c053966f2eef07bdabfd78888fc23eea04b789840fecf0b2c59"},"schema_version":"1.0","source":{"id":"1904.01032","kind":"arxiv","version":3}},"canonical_sha256":"3d8bc7907b31b3e5f5db9e3c831b4eb65725e8008647cf90f5ccaedbc0c13020","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3d8bc7907b31b3e5f5db9e3c831b4eb65725e8008647cf90f5ccaedbc0c13020","first_computed_at":"2026-05-17T23:42:32.371694Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:42:32.371694Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/OLKr1ZcWs+4sdWgU4x4no20h63y5cCAUPi5V9wHE+VMa0mVxlMMv5KUaO+hkZ3BTzYT4ej0wXJA8l0RBL3fAQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:42:32.372455Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.01032","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:636ac5d8cf8b3429825a5beeff99873c98f1d131d73e167e568957cc126bc1bf","sha256:4674458cd344e3bbf2eb5f68bfe38544b951d92b8a1340ff47c6bc3f6a7b81bf"],"state_sha256":"50fd022f9ebbe66372d7088fc034c0e7a0cf749a8e2d31e10da92c5fdf9818c5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d4FPqcOFTAmNbKG2PPz1TdAz33WqldFydFYs8b0Yms8Tj5X7RtwuN81nDouKFo7C9VikzXCOvVbyoy1qTWy8Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T15:40:00.859100Z","bundle_sha256":"652a377693303c3564b0626272de7e0a29cc0ac1104acfd89f513bb7688722d6"}}