{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:LNHA45KBT24MF2PVMEOZRDCSPP","short_pith_number":"pith:LNHA45KB","canonical_record":{"source":{"id":"1711.07724","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-21T11:29:44Z","cross_cats_sorted":[],"title_canon_sha256":"612318d0edf45cab1ae295602d8e256f7c2a18351ef5cee04f2871f5ab074149","abstract_canon_sha256":"a6e156d51837e9b8d0e6838f7da82b0ad880bb986f26ab8d5ce62d2818f906f5"},"schema_version":"1.0"},"canonical_sha256":"5b4e0e75419eb8c2e9f5611d988c527bd9f8cfade4f06a1298d842c7b6fa55d1","source":{"kind":"arxiv","id":"1711.07724","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.07724","created_at":"2026-05-18T00:27:56Z"},{"alias_kind":"arxiv_version","alias_value":"1711.07724v2","created_at":"2026-05-18T00:27:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.07724","created_at":"2026-05-18T00:27:56Z"},{"alias_kind":"pith_short_12","alias_value":"LNHA45KBT24M","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"LNHA45KBT24MF2PV","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"LNHA45KB","created_at":"2026-05-18T12:31:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:LNHA45KBT24MF2PVMEOZRDCSPP","target":"record","payload":{"canonical_record":{"source":{"id":"1711.07724","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-21T11:29:44Z","cross_cats_sorted":[],"title_canon_sha256":"612318d0edf45cab1ae295602d8e256f7c2a18351ef5cee04f2871f5ab074149","abstract_canon_sha256":"a6e156d51837e9b8d0e6838f7da82b0ad880bb986f26ab8d5ce62d2818f906f5"},"schema_version":"1.0"},"canonical_sha256":"5b4e0e75419eb8c2e9f5611d988c527bd9f8cfade4f06a1298d842c7b6fa55d1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:27:56.769630Z","signature_b64":"H700oZjikLAq44V0NJknsKEBsfZ5MhYMXh49JcbgaIhAn6i2IPpVN+l4rE32EENsYlmri4hKxrlzha7lv8VUAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5b4e0e75419eb8c2e9f5611d988c527bd9f8cfade4f06a1298d842c7b6fa55d1","last_reissued_at":"2026-05-18T00:27:56.769012Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:27:56.769012Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.07724","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-18T00:27:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5krBDNFuQKGtu18yIwQhMg1x5mzEUfMesRwnjLB16QE8Ym2alBAiVP+vl8d7+vzf9JzbYmn/85nldI4GXMoRAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T15:35:33.068119Z"},"content_sha256":"905d1d2ffddad07b98adfb8d4aeaaaad291c15383a2895f5151966cd9a04a684","schema_version":"1.0","event_id":"sha256:905d1d2ffddad07b98adfb8d4aeaaaad291c15383a2895f5151966cd9a04a684"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:LNHA45KBT24MF2PVMEOZRDCSPP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Using stochastic computation graphs formalism for optimization of sequence-to-sequence model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Eugene Golikov, Maksim Kretov, Vlad Zhukov","submitted_at":"2017-11-21T11:29:44Z","abstract_excerpt":"Variety of machine learning problems can be formulated as an optimization task for some (surrogate) loss function. Calculation of loss function can be viewed in terms of stochastic computation graphs (SCG). We use this formalism to analyze a problem of optimization of famous sequence-to-sequence model with attention and propose reformulation of the task. Examples are given for machine translation (MT). Our work provides a unified view on different optimization approaches for sequence-to-sequence models and could help researchers in developing new network architectures with embedded stochastic "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.07724","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-18T00:27:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lSpA/ngSILc/XYXGVfPzxv9ltdOjMyr7Igrd/KBwdLV9dE9w0U1+HSz+xD7TavAMHx2vsaBsTsetWF6IitQxAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T15:35:33.068468Z"},"content_sha256":"afa92af4ef9022c55d9dbfbd39df5024f940793fa04ad1c0cfb34540fcc05acd","schema_version":"1.0","event_id":"sha256:afa92af4ef9022c55d9dbfbd39df5024f940793fa04ad1c0cfb34540fcc05acd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LNHA45KBT24MF2PVMEOZRDCSPP/bundle.json","state_url":"https://pith.science/pith/LNHA45KBT24MF2PVMEOZRDCSPP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LNHA45KBT24MF2PVMEOZRDCSPP/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-30T15:35:33Z","links":{"resolver":"https://pith.science/pith/LNHA45KBT24MF2PVMEOZRDCSPP","bundle":"https://pith.science/pith/LNHA45KBT24MF2PVMEOZRDCSPP/bundle.json","state":"https://pith.science/pith/LNHA45KBT24MF2PVMEOZRDCSPP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LNHA45KBT24MF2PVMEOZRDCSPP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:LNHA45KBT24MF2PVMEOZRDCSPP","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":"a6e156d51837e9b8d0e6838f7da82b0ad880bb986f26ab8d5ce62d2818f906f5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-21T11:29:44Z","title_canon_sha256":"612318d0edf45cab1ae295602d8e256f7c2a18351ef5cee04f2871f5ab074149"},"schema_version":"1.0","source":{"id":"1711.07724","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.07724","created_at":"2026-05-18T00:27:56Z"},{"alias_kind":"arxiv_version","alias_value":"1711.07724v2","created_at":"2026-05-18T00:27:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.07724","created_at":"2026-05-18T00:27:56Z"},{"alias_kind":"pith_short_12","alias_value":"LNHA45KBT24M","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"LNHA45KBT24MF2PV","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"LNHA45KB","created_at":"2026-05-18T12:31:28Z"}],"graph_snapshots":[{"event_id":"sha256:afa92af4ef9022c55d9dbfbd39df5024f940793fa04ad1c0cfb34540fcc05acd","target":"graph","created_at":"2026-05-18T00:27:56Z","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":"Variety of machine learning problems can be formulated as an optimization task for some (surrogate) loss function. Calculation of loss function can be viewed in terms of stochastic computation graphs (SCG). We use this formalism to analyze a problem of optimization of famous sequence-to-sequence model with attention and propose reformulation of the task. Examples are given for machine translation (MT). Our work provides a unified view on different optimization approaches for sequence-to-sequence models and could help researchers in developing new network architectures with embedded stochastic ","authors_text":"Eugene Golikov, Maksim Kretov, Vlad Zhukov","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-21T11:29:44Z","title":"Using stochastic computation graphs formalism for optimization of sequence-to-sequence model"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.07724","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:905d1d2ffddad07b98adfb8d4aeaaaad291c15383a2895f5151966cd9a04a684","target":"record","created_at":"2026-05-18T00:27:56Z","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":"a6e156d51837e9b8d0e6838f7da82b0ad880bb986f26ab8d5ce62d2818f906f5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-21T11:29:44Z","title_canon_sha256":"612318d0edf45cab1ae295602d8e256f7c2a18351ef5cee04f2871f5ab074149"},"schema_version":"1.0","source":{"id":"1711.07724","kind":"arxiv","version":2}},"canonical_sha256":"5b4e0e75419eb8c2e9f5611d988c527bd9f8cfade4f06a1298d842c7b6fa55d1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5b4e0e75419eb8c2e9f5611d988c527bd9f8cfade4f06a1298d842c7b6fa55d1","first_computed_at":"2026-05-18T00:27:56.769012Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:27:56.769012Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"H700oZjikLAq44V0NJknsKEBsfZ5MhYMXh49JcbgaIhAn6i2IPpVN+l4rE32EENsYlmri4hKxrlzha7lv8VUAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:27:56.769630Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.07724","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:905d1d2ffddad07b98adfb8d4aeaaaad291c15383a2895f5151966cd9a04a684","sha256:afa92af4ef9022c55d9dbfbd39df5024f940793fa04ad1c0cfb34540fcc05acd"],"state_sha256":"ab2edd14b42fa256a3ca07f45d0bf5b618d9f26f421a7eed3604660a376ee3c4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aLV1CGO6lvju+/mKaqyrSxlOmzmimJWR7ZtEkS9v7cUc/uzF+Vu0TWYu7UGgxbroz+WelON48QCoAXweVOgxAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T15:35:33.070289Z","bundle_sha256":"ba99dbf57a385ca92122bdad24eade98b690a46d6d671c153dc490248d38cfe0"}}