{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:TNN7WQHV4K6F23TFZLGUZZCN2H","short_pith_number":"pith:TNN7WQHV","canonical_record":{"source":{"id":"1810.01398","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-02T17:44:44Z","cross_cats_sorted":["cs.AI","cs.CL","stat.ML"],"title_canon_sha256":"17bee04161dd872039bea4424743e10e3fa0a82e6e4d826e9ecc57c264597f9f","abstract_canon_sha256":"06d419a023c589b869ab98b3a11638cd39cdad09a7b8b232d4077608b5d91197"},"schema_version":"1.0"},"canonical_sha256":"9b5bfb40f5e2bc5d6e65cacd4ce44dd1ef1c17bf207af3a4f047f339441d2839","source":{"kind":"arxiv","id":"1810.01398","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.01398","created_at":"2026-05-17T23:56:23Z"},{"alias_kind":"arxiv_version","alias_value":"1810.01398v2","created_at":"2026-05-17T23:56:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.01398","created_at":"2026-05-17T23:56:23Z"},{"alias_kind":"pith_short_12","alias_value":"TNN7WQHV4K6F","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"TNN7WQHV4K6F23TF","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"TNN7WQHV","created_at":"2026-05-18T12:32:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:TNN7WQHV4K6F23TFZLGUZZCN2H","target":"record","payload":{"canonical_record":{"source":{"id":"1810.01398","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-02T17:44:44Z","cross_cats_sorted":["cs.AI","cs.CL","stat.ML"],"title_canon_sha256":"17bee04161dd872039bea4424743e10e3fa0a82e6e4d826e9ecc57c264597f9f","abstract_canon_sha256":"06d419a023c589b869ab98b3a11638cd39cdad09a7b8b232d4077608b5d91197"},"schema_version":"1.0"},"canonical_sha256":"9b5bfb40f5e2bc5d6e65cacd4ce44dd1ef1c17bf207af3a4f047f339441d2839","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:23.067418Z","signature_b64":"leu5y777JR3WEjhkEItbKilRZwWvKY7sqyuQ6GqjsPwALNg3xEOZz2OdhcETnM44rJMneNq76Hhk6HKftWMVCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9b5bfb40f5e2bc5d6e65cacd4ce44dd1ef1c17bf207af3a4f047f339441d2839","last_reissued_at":"2026-05-17T23:56:23.066928Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:23.066928Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.01398","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-05-17T23:56:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/qiTYuqro2Q3H0ZgaTdAhPeXJNFaD/oMQT16/cFmEeHX7Y+a2Xh3fQDBH+JdrSXtqtXziE6uJEFPMTgtACLOBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T13:55:51.566962Z"},"content_sha256":"930dfb5de7ece18828f40b3182718bc134d7c180725c526d483479f92a643646","schema_version":"1.0","event_id":"sha256:930dfb5de7ece18828f40b3182718bc134d7c180725c526d483479f92a643646"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:TNN7WQHV4K6F23TFZLGUZZCN2H","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Completion Distillation for Sequence Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CL","stat.ML"],"primary_cat":"cs.LG","authors_text":"Mohammad Norouzi, Sara Sabour, William Chan","submitted_at":"2018-10-02T17:44:44Z","abstract_excerpt":"We present Optimal Completion Distillation (OCD), a training procedure for optimizing sequence to sequence models based on edit distance. OCD is efficient, has no hyper-parameters of its own, and does not require pretraining or joint optimization with conditional log-likelihood. Given a partial sequence generated by the model, we first identify the set of optimal suffixes that minimize the total edit distance, using an efficient dynamic programming algorithm. Then, for each position of the generated sequence, we use a target distribution that puts equal probability on the first token of all th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.01398","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":""},"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:56:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fDKWbYzCjo64AntrKU9tv9FT++Uxw27dCSZRpQ47qkZhW/d7GQq6VPeqgF+JpU2jy/eSNArPHD8jZgwqaS+fCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T13:55:51.567325Z"},"content_sha256":"9cf9ff50885ac276be4b5486199c90a4f99d7af10e92fb95d8103c3ae454ad74","schema_version":"1.0","event_id":"sha256:9cf9ff50885ac276be4b5486199c90a4f99d7af10e92fb95d8103c3ae454ad74"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TNN7WQHV4K6F23TFZLGUZZCN2H/bundle.json","state_url":"https://pith.science/pith/TNN7WQHV4K6F23TFZLGUZZCN2H/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TNN7WQHV4K6F23TFZLGUZZCN2H/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-04T13:55:51Z","links":{"resolver":"https://pith.science/pith/TNN7WQHV4K6F23TFZLGUZZCN2H","bundle":"https://pith.science/pith/TNN7WQHV4K6F23TFZLGUZZCN2H/bundle.json","state":"https://pith.science/pith/TNN7WQHV4K6F23TFZLGUZZCN2H/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TNN7WQHV4K6F23TFZLGUZZCN2H/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:TNN7WQHV4K6F23TFZLGUZZCN2H","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":"06d419a023c589b869ab98b3a11638cd39cdad09a7b8b232d4077608b5d91197","cross_cats_sorted":["cs.AI","cs.CL","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-02T17:44:44Z","title_canon_sha256":"17bee04161dd872039bea4424743e10e3fa0a82e6e4d826e9ecc57c264597f9f"},"schema_version":"1.0","source":{"id":"1810.01398","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.01398","created_at":"2026-05-17T23:56:23Z"},{"alias_kind":"arxiv_version","alias_value":"1810.01398v2","created_at":"2026-05-17T23:56:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.01398","created_at":"2026-05-17T23:56:23Z"},{"alias_kind":"pith_short_12","alias_value":"TNN7WQHV4K6F","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"TNN7WQHV4K6F23TF","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"TNN7WQHV","created_at":"2026-05-18T12:32:53Z"}],"graph_snapshots":[{"event_id":"sha256:9cf9ff50885ac276be4b5486199c90a4f99d7af10e92fb95d8103c3ae454ad74","target":"graph","created_at":"2026-05-17T23:56:23Z","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":"We present Optimal Completion Distillation (OCD), a training procedure for optimizing sequence to sequence models based on edit distance. OCD is efficient, has no hyper-parameters of its own, and does not require pretraining or joint optimization with conditional log-likelihood. Given a partial sequence generated by the model, we first identify the set of optimal suffixes that minimize the total edit distance, using an efficient dynamic programming algorithm. Then, for each position of the generated sequence, we use a target distribution that puts equal probability on the first token of all th","authors_text":"Mohammad Norouzi, Sara Sabour, William Chan","cross_cats":["cs.AI","cs.CL","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-02T17:44:44Z","title":"Optimal Completion Distillation for Sequence Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.01398","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:930dfb5de7ece18828f40b3182718bc134d7c180725c526d483479f92a643646","target":"record","created_at":"2026-05-17T23:56:23Z","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":"06d419a023c589b869ab98b3a11638cd39cdad09a7b8b232d4077608b5d91197","cross_cats_sorted":["cs.AI","cs.CL","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-02T17:44:44Z","title_canon_sha256":"17bee04161dd872039bea4424743e10e3fa0a82e6e4d826e9ecc57c264597f9f"},"schema_version":"1.0","source":{"id":"1810.01398","kind":"arxiv","version":2}},"canonical_sha256":"9b5bfb40f5e2bc5d6e65cacd4ce44dd1ef1c17bf207af3a4f047f339441d2839","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9b5bfb40f5e2bc5d6e65cacd4ce44dd1ef1c17bf207af3a4f047f339441d2839","first_computed_at":"2026-05-17T23:56:23.066928Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:56:23.066928Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"leu5y777JR3WEjhkEItbKilRZwWvKY7sqyuQ6GqjsPwALNg3xEOZz2OdhcETnM44rJMneNq76Hhk6HKftWMVCQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:56:23.067418Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.01398","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:930dfb5de7ece18828f40b3182718bc134d7c180725c526d483479f92a643646","sha256:9cf9ff50885ac276be4b5486199c90a4f99d7af10e92fb95d8103c3ae454ad74"],"state_sha256":"13c08554aac85bd2a86c29979e11802f8a64dadfdf4105c9ff999995c4055abb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LlMaiPVjOkxgz5gquxiTQy5W8Vjq4s2reOBkL6ZYyW7+r/w3rl4JTw2SNou7HRTxuT8SrN8bQEZt7P3v6zanCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T13:55:51.569567Z","bundle_sha256":"f1c5b0c403aeca67d9e8d09111d7241fe3fa744baf014691dd112ad22b353987"}}