{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:IEDUSXUNSRHHWCLZYQR7MYZ6LQ","short_pith_number":"pith:IEDUSXUN","canonical_record":{"source":{"id":"1609.08144","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2016-09-26T19:59:55Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"7e1f30af6bb78f3b01e138dd4c95c0225405b345dc64dcb2de9ce5d5e167c230","abstract_canon_sha256":"f8728cf6bc353f04780df8a769aa5b6792264ff8dd0e04d7bfd682bf2a9cfe92"},"schema_version":"1.0"},"canonical_sha256":"4107495e8d944e7b0979c423f6633e5c37fd1fe1cfb8fa27e6cc97c6099f2e03","source":{"kind":"arxiv","id":"1609.08144","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.08144","created_at":"2026-07-04T21:27:34Z"},{"alias_kind":"arxiv_version","alias_value":"1609.08144v2","created_at":"2026-07-04T21:27:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.08144","created_at":"2026-07-04T21:27:34Z"},{"alias_kind":"pith_short_12","alias_value":"IEDUSXUNSRHH","created_at":"2026-07-04T21:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"IEDUSXUNSRHHWCLZ","created_at":"2026-07-04T21:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"IEDUSXUN","created_at":"2026-07-04T21:27:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:IEDUSXUNSRHHWCLZYQR7MYZ6LQ","target":"record","payload":{"canonical_record":{"source":{"id":"1609.08144","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2016-09-26T19:59:55Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"7e1f30af6bb78f3b01e138dd4c95c0225405b345dc64dcb2de9ce5d5e167c230","abstract_canon_sha256":"f8728cf6bc353f04780df8a769aa5b6792264ff8dd0e04d7bfd682bf2a9cfe92"},"schema_version":"1.0"},"canonical_sha256":"4107495e8d944e7b0979c423f6633e5c37fd1fe1cfb8fa27e6cc97c6099f2e03","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T21:27:34.571619Z","signature_b64":"RFTXQOnaSHojP4PC7kEGtQVuitgLs4KM7YVo1VrJKM24itkhJcq9lDTRDolFfpUUXtE2IJWapssYbpsIJ6j2Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4107495e8d944e7b0979c423f6633e5c37fd1fe1cfb8fa27e6cc97c6099f2e03","last_reissued_at":"2026-07-04T21:27:34.571107Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T21:27:34.571107Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1609.08144","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-04T21:27:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4eF9DuJwa6adPnPoSFn0a56KdWvs+IgMlRJTzOt/fbW+6rtwxzZnSN1W0lgFNq8Hj2IWvrs9vRXeOhFPCyYcAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-26T15:35:55.716732Z"},"content_sha256":"ce522365643cd27282312ddefb27cbd8181cb4c51ff14c464e75cac365fe2b8f","schema_version":"1.0","event_id":"sha256:ce522365643cd27282312ddefb27cbd8181cb4c51ff14c464e75cac365fe2b8f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:IEDUSXUNSRHHWCLZYQR7MYZ6LQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Google's Neural Machine Translation System: Bridging the Gap between Human and Machine Translation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"GNMT, a deep LSTM neural machine translation system with wordpieces and coverage penalties, reduces translation errors by an average of 60% compared to phrase-based systems.","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.CL","authors_text":"Alex Rudnick, Apurva Shah, Cliff Young, George Kurian, Greg Corrado, Hideto Kazawa, Jason Riesa, Jason Smith, Jeff Klingner, Jeffrey Dean, Keith Stevens, Klaus Macherey, {\\L}ukasz Kaiser, Macduff Hughes, Maxim Krikun, Melvin Johnson, Mike Schuster, Mohammad Norouzi, Nishant Patil, Oriol Vinyals, Qin Gao, Quoc V. Le, Stephan Gouws, Taku Kudo, Wei Wang, Wolfgang Macherey, Xiaobing Liu, Yonghui Wu, Yoshikiyo Kato, Yuan Cao, Zhifeng Chen","submitted_at":"2016-09-26T19:59:55Z","abstract_excerpt":"Neural Machine Translation (NMT) is an end-to-end learning approach for automated translation, with the potential to overcome many of the weaknesses of conventional phrase-based translation systems. Unfortunately, NMT systems are known to be computationally expensive both in training and in translation inference. Also, most NMT systems have difficulty with rare words. These issues have hindered NMT's use in practical deployments and services, where both accuracy and speed are essential. In this work, we present GNMT, Google's Neural Machine Translation system, which attempts to address many of"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"Using a human side-by-side evaluation on a set of isolated simple sentences, it reduces translation errors by an average of 60% compared to Google's phrase-based production system.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That the measured gains are attributable to the described architectural choices (attention placement, wordpieces, coverage penalty) rather than differences in training data scale or compute, and that results on simple sentences generalize to complex, domain-specific text.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"GNMT deploys 8-layer LSTMs with attention, wordpieces, low-precision inference, and coverage-penalized beam search to match state-of-the-art on WMT'14 En-Fr and En-De while cutting translation errors by 60% in human evaluations.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"GNMT, a deep LSTM neural machine translation system with wordpieces and coverage penalties, reduces translation errors by an average of 60% compared to phrase-based systems.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"bc17a0358a1506ab42c63d7038ea35f80b9ae4eef5a72712acaa7fe7cafe4360"},"source":{"id":"1609.08144","kind":"arxiv","version":2},"verdict":{"id":"4882b53b-1857-42cf-9d4a-e0d4055e262b","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-12T15:16:34.439988Z","strongest_claim":"Using a human side-by-side evaluation on a set of isolated simple sentences, it reduces translation errors by an average of 60% compared to Google's phrase-based production system.","one_line_summary":"GNMT deploys 8-layer LSTMs with attention, wordpieces, low-precision inference, and coverage-penalized beam search to match state-of-the-art on WMT'14 En-Fr and En-De while cutting translation errors by 60% in human evaluations.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That the measured gains are attributable to the described architectural choices (attention placement, wordpieces, coverage penalty) rather than differences in training data scale or compute, and that results on simple sentences generalize to complex, domain-specific text.","pith_extraction_headline":"GNMT, a deep LSTM neural machine translation system with wordpieces and coverage penalties, reduces translation errors by an average of 60% compared to phrase-based systems."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1609.08144/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":44,"sample":[{"doi":"","year":2016,"title":"G., Steiner, B., Tucker, P., V asudevan, V., W arden, P., Wicke, M., Yu, Y., and Zheng, X","work_id":"4a906750-f28c-420f-ab94-4be981a5cb73","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2015,"title":"Neural machine translation by jointly learning to align and translate","work_id":"cdbe1816-fb6e-4e5b-a76b-bf2ab8eff431","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1988,"title":"Brown, P., Cocke, J., Pietra, S. D., Pietra, V. D., Jelinek, F., Mercer, R., and Roossin, P. A statistical approach to language translation. InProceedings of the 12th Conference on Computational Lingu","work_id":"c9f3c1a1-e17d-4115-9006-a26acfd498d1","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1990,"title":"F., Cocke, J., Pietra, S","work_id":"8cb8dd79-9ad3-4933-9a22-18b29574d8a4","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1993,"title":"Brown, P. F., Pietra, V. J. D., Pietra, S. A. D., and Mercer, R. L. The mathematics of statistical machine translation: Parameter estimation.Comput. Linguist. 19, 2 (June 1993), 263–311","work_id":"dd4f9230-a684-4065-9c21-b5bc9dd315bd","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":44,"snapshot_sha256":"aff6e61d831b44bf7b6732cc387e18d561d3f875eb3d6d2b94780ab6da9504d9","internal_anchors":4},"formal_canon":{"evidence_count":2,"snapshot_sha256":"6705fa0ad9d0d2ef0b9e33476f38147a33a2d7958e51f254f62e2b15b2c8788b"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"4882b53b-1857-42cf-9d4a-e0d4055e262b"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-04T21:27:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Pke4+WeljDpCboMYHFSO4b73okHXwMXxOTTe1VibK22AUkCPICZoU9BMw1Z7+4baM4VHXDxySUxvxA0p1YawCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-26T15:35:55.717285Z"},"content_sha256":"042a3c687a8f0afe99521da74e6b71fde0a762017ebec7fcae10451216e902e5","schema_version":"1.0","event_id":"sha256:042a3c687a8f0afe99521da74e6b71fde0a762017ebec7fcae10451216e902e5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IEDUSXUNSRHHWCLZYQR7MYZ6LQ/bundle.json","state_url":"https://pith.science/pith/IEDUSXUNSRHHWCLZYQR7MYZ6LQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IEDUSXUNSRHHWCLZYQR7MYZ6LQ/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-26T15:35:55Z","links":{"resolver":"https://pith.science/pith/IEDUSXUNSRHHWCLZYQR7MYZ6LQ","bundle":"https://pith.science/pith/IEDUSXUNSRHHWCLZYQR7MYZ6LQ/bundle.json","state":"https://pith.science/pith/IEDUSXUNSRHHWCLZYQR7MYZ6LQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IEDUSXUNSRHHWCLZYQR7MYZ6LQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:IEDUSXUNSRHHWCLZYQR7MYZ6LQ","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":"f8728cf6bc353f04780df8a769aa5b6792264ff8dd0e04d7bfd682bf2a9cfe92","cross_cats_sorted":["cs.AI","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2016-09-26T19:59:55Z","title_canon_sha256":"7e1f30af6bb78f3b01e138dd4c95c0225405b345dc64dcb2de9ce5d5e167c230"},"schema_version":"1.0","source":{"id":"1609.08144","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.08144","created_at":"2026-07-04T21:27:34Z"},{"alias_kind":"arxiv_version","alias_value":"1609.08144v2","created_at":"2026-07-04T21:27:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.08144","created_at":"2026-07-04T21:27:34Z"},{"alias_kind":"pith_short_12","alias_value":"IEDUSXUNSRHH","created_at":"2026-07-04T21:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"IEDUSXUNSRHHWCLZ","created_at":"2026-07-04T21:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"IEDUSXUN","created_at":"2026-07-04T21:27:34Z"}],"graph_snapshots":[{"event_id":"sha256:042a3c687a8f0afe99521da74e6b71fde0a762017ebec7fcae10451216e902e5","target":"graph","created_at":"2026-07-04T21:27:34Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"Using a human side-by-side evaluation on a set of isolated simple sentences, it reduces translation errors by an average of 60% compared to Google's phrase-based production system."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That the measured gains are attributable to the described architectural choices (attention placement, wordpieces, coverage penalty) rather than differences in training data scale or compute, and that results on simple sentences generalize to complex, domain-specific text."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"GNMT deploys 8-layer LSTMs with attention, wordpieces, low-precision inference, and coverage-penalized beam search to match state-of-the-art on WMT'14 En-Fr and En-De while cutting translation errors by 60% in human evaluations."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"GNMT, a deep LSTM neural machine translation system with wordpieces and coverage penalties, reduces translation errors by an average of 60% compared to phrase-based systems."}],"snapshot_sha256":"bc17a0358a1506ab42c63d7038ea35f80b9ae4eef5a72712acaa7fe7cafe4360"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"6705fa0ad9d0d2ef0b9e33476f38147a33a2d7958e51f254f62e2b15b2c8788b"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1609.08144/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Neural Machine Translation (NMT) is an end-to-end learning approach for automated translation, with the potential to overcome many of the weaknesses of conventional phrase-based translation systems. Unfortunately, NMT systems are known to be computationally expensive both in training and in translation inference. Also, most NMT systems have difficulty with rare words. These issues have hindered NMT's use in practical deployments and services, where both accuracy and speed are essential. In this work, we present GNMT, Google's Neural Machine Translation system, which attempts to address many of","authors_text":"Alex Rudnick, Apurva Shah, Cliff Young, George Kurian, Greg Corrado, Hideto Kazawa, Jason Riesa, Jason Smith, Jeff Klingner, Jeffrey Dean, Keith Stevens, Klaus Macherey, {\\L}ukasz Kaiser, Macduff Hughes, Maxim Krikun, Melvin Johnson, Mike Schuster, Mohammad Norouzi, Nishant Patil, Oriol Vinyals, Qin Gao, Quoc V. Le, Stephan Gouws, Taku Kudo, Wei Wang, Wolfgang Macherey, Xiaobing Liu, Yonghui Wu, Yoshikiyo Kato, Yuan Cao, Zhifeng Chen","cross_cats":["cs.AI","cs.LG"],"headline":"GNMT, a deep LSTM neural machine translation system with wordpieces and coverage penalties, reduces translation errors by an average of 60% compared to phrase-based systems.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2016-09-26T19:59:55Z","title":"Google's Neural Machine Translation System: Bridging the Gap between Human and Machine Translation"},"references":{"count":44,"internal_anchors":4,"resolved_work":44,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"G., Steiner, B., Tucker, P., V asudevan, V., W arden, P., Wicke, M., Yu, Y., and Zheng, X","work_id":"4a906750-f28c-420f-ab94-4be981a5cb73","year":2016},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Neural machine translation by jointly learning to align and translate","work_id":"cdbe1816-fb6e-4e5b-a76b-bf2ab8eff431","year":2015},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Brown, P., Cocke, J., Pietra, S. D., Pietra, V. D., Jelinek, F., Mercer, R., and Roossin, P. A statistical approach to language translation. InProceedings of the 12th Conference on Computational Lingu","work_id":"c9f3c1a1-e17d-4115-9006-a26acfd498d1","year":1988},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"F., Cocke, J., Pietra, S","work_id":"8cb8dd79-9ad3-4933-9a22-18b29574d8a4","year":1990},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Brown, P. F., Pietra, V. J. D., Pietra, S. A. D., and Mercer, R. L. The mathematics of statistical machine translation: Parameter estimation.Comput. Linguist. 19, 2 (June 1993), 263–311","work_id":"dd4f9230-a684-4065-9c21-b5bc9dd315bd","year":1993}],"snapshot_sha256":"aff6e61d831b44bf7b6732cc387e18d561d3f875eb3d6d2b94780ab6da9504d9"},"source":{"id":"1609.08144","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-12T15:16:34.439988Z","id":"4882b53b-1857-42cf-9d4a-e0d4055e262b","model_set":{"reader":"grok-4.3"},"one_line_summary":"GNMT deploys 8-layer LSTMs with attention, wordpieces, low-precision inference, and coverage-penalized beam search to match state-of-the-art on WMT'14 En-Fr and En-De while cutting translation errors by 60% in human evaluations.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"GNMT, a deep LSTM neural machine translation system with wordpieces and coverage penalties, reduces translation errors by an average of 60% compared to phrase-based systems.","strongest_claim":"Using a human side-by-side evaluation on a set of isolated simple sentences, it reduces translation errors by an average of 60% compared to Google's phrase-based production system.","weakest_assumption":"That the measured gains are attributable to the described architectural choices (attention placement, wordpieces, coverage penalty) rather than differences in training data scale or compute, and that results on simple sentences generalize to complex, domain-specific text."}},"verdict_id":"4882b53b-1857-42cf-9d4a-e0d4055e262b"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:ce522365643cd27282312ddefb27cbd8181cb4c51ff14c464e75cac365fe2b8f","target":"record","created_at":"2026-07-04T21:27:34Z","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":"f8728cf6bc353f04780df8a769aa5b6792264ff8dd0e04d7bfd682bf2a9cfe92","cross_cats_sorted":["cs.AI","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2016-09-26T19:59:55Z","title_canon_sha256":"7e1f30af6bb78f3b01e138dd4c95c0225405b345dc64dcb2de9ce5d5e167c230"},"schema_version":"1.0","source":{"id":"1609.08144","kind":"arxiv","version":2}},"canonical_sha256":"4107495e8d944e7b0979c423f6633e5c37fd1fe1cfb8fa27e6cc97c6099f2e03","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4107495e8d944e7b0979c423f6633e5c37fd1fe1cfb8fa27e6cc97c6099f2e03","first_computed_at":"2026-07-04T21:27:34.571107Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T21:27:34.571107Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RFTXQOnaSHojP4PC7kEGtQVuitgLs4KM7YVo1VrJKM24itkhJcq9lDTRDolFfpUUXtE2IJWapssYbpsIJ6j2Cw==","signature_status":"signed_v1","signed_at":"2026-07-04T21:27:34.571619Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.08144","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ce522365643cd27282312ddefb27cbd8181cb4c51ff14c464e75cac365fe2b8f","sha256:042a3c687a8f0afe99521da74e6b71fde0a762017ebec7fcae10451216e902e5"],"state_sha256":"381f3d04ebb4ebf7911deabf851dfc1d84d7f497a0fa092adf99be2cbaa969fe"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+kl8orCoyoH16AHRe7F366JCJClcCKePDCCcA0FErsEiaYaX66y5LCPmf80bABLDZu5ZD+GMrYfq7pf3B0otBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-26T15:35:55.720103Z","bundle_sha256":"3b00dc601886df687a0bf0dcab92cd2aa53dba59840c33e1998570cf63ffb52d"}}