{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:5BRX623K2EQ3LRSZWSIIWJSVHP","short_pith_number":"pith:5BRX623K","canonical_record":{"source":{"id":"1907.02707","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2019-07-05T07:33:05Z","cross_cats_sorted":["math.OC","stat.TH"],"title_canon_sha256":"d943523932b32fc92693b2c0d7fa04c91d556d807cde30929e96ecff1dc75281","abstract_canon_sha256":"2ee7fdf92234a85874625ce1d193d49ae53074ad7513f016fe62604bbba23de1"},"schema_version":"1.0"},"canonical_sha256":"e8637f6b6ad121b5c659b4908b26553bebdc490423cf83e9b5970d9610e8f2d2","source":{"kind":"arxiv","id":"1907.02707","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.02707","created_at":"2026-05-17T23:41:23Z"},{"alias_kind":"arxiv_version","alias_value":"1907.02707v1","created_at":"2026-05-17T23:41:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.02707","created_at":"2026-05-17T23:41:23Z"},{"alias_kind":"pith_short_12","alias_value":"5BRX623K2EQ3","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"5BRX623K2EQ3LRSZ","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"5BRX623K","created_at":"2026-05-18T12:33:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:5BRX623K2EQ3LRSZWSIIWJSVHP","target":"record","payload":{"canonical_record":{"source":{"id":"1907.02707","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2019-07-05T07:33:05Z","cross_cats_sorted":["math.OC","stat.TH"],"title_canon_sha256":"d943523932b32fc92693b2c0d7fa04c91d556d807cde30929e96ecff1dc75281","abstract_canon_sha256":"2ee7fdf92234a85874625ce1d193d49ae53074ad7513f016fe62604bbba23de1"},"schema_version":"1.0"},"canonical_sha256":"e8637f6b6ad121b5c659b4908b26553bebdc490423cf83e9b5970d9610e8f2d2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:23.427806Z","signature_b64":"u77SOGPxZwl+CvqVBFD9wCsLvFYTptQAjoUGMCJbnYQaDyP5F/abCjIufmqN0WNaFFSQwda/2+vT6cD/35rvDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e8637f6b6ad121b5c659b4908b26553bebdc490423cf83e9b5970d9610e8f2d2","last_reissued_at":"2026-05-17T23:41:23.426892Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:23.426892Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.02707","source_version":1,"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:41:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pPMawLfKbq64kdelLBrog9nJ+nPBOo/earIoSPzmR0uPvFNEwNfInXKJ9Kh/AbRvejXoVucL/U82HpfTcVwVAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T19:14:29.349003Z"},"content_sha256":"cab3830c6003b5fb8b3686c0688cc16cef4def9984b78fd286fb61abcbae5ced","schema_version":"1.0","event_id":"sha256:cab3830c6003b5fb8b3686c0688cc16cef4def9984b78fd286fb61abcbae5ced"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:5BRX623K2EQ3LRSZWSIIWJSVHP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Algorithms of Robust Stochastic Optimization Based on Mirror Descent Method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","stat.TH"],"primary_cat":"math.ST","authors_text":"Alexander Nazin, Alexandre Tsybakov, Anatoli Juditsky (LJK), Arkadi Nemirovsky","submitted_at":"2019-07-05T07:33:05Z","abstract_excerpt":"We propose an approach to construction of robust non-Euclidean iterative algorithms for convex composite stochastic optimization based on truncation of stochastic gradients. For such algorithms, we establish sub-Gaussian confidence bounds under weak assumptions about the tails of the noise distribution in convex and strongly convex settings. Robust estimates of the accuracy of general stochastic algorithms are also proposed."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.02707","kind":"arxiv","version":1},"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:41:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ks2GpkSExIvU0Flyef5UgeZ/lzQdkTdFRTzTNk5zv6njmn4johotDEoKXy1KnQA7CF+0BrqU14ELAIL2TbiSBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T19:14:29.349689Z"},"content_sha256":"53ca6429c105e4fa3a88bcbbf6b19d6da55e1e4bb8c44fab75bf09c6e6704143","schema_version":"1.0","event_id":"sha256:53ca6429c105e4fa3a88bcbbf6b19d6da55e1e4bb8c44fab75bf09c6e6704143"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5BRX623K2EQ3LRSZWSIIWJSVHP/bundle.json","state_url":"https://pith.science/pith/5BRX623K2EQ3LRSZWSIIWJSVHP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5BRX623K2EQ3LRSZWSIIWJSVHP/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-05-25T19:14:29Z","links":{"resolver":"https://pith.science/pith/5BRX623K2EQ3LRSZWSIIWJSVHP","bundle":"https://pith.science/pith/5BRX623K2EQ3LRSZWSIIWJSVHP/bundle.json","state":"https://pith.science/pith/5BRX623K2EQ3LRSZWSIIWJSVHP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5BRX623K2EQ3LRSZWSIIWJSVHP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:5BRX623K2EQ3LRSZWSIIWJSVHP","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":"2ee7fdf92234a85874625ce1d193d49ae53074ad7513f016fe62604bbba23de1","cross_cats_sorted":["math.OC","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2019-07-05T07:33:05Z","title_canon_sha256":"d943523932b32fc92693b2c0d7fa04c91d556d807cde30929e96ecff1dc75281"},"schema_version":"1.0","source":{"id":"1907.02707","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.02707","created_at":"2026-05-17T23:41:23Z"},{"alias_kind":"arxiv_version","alias_value":"1907.02707v1","created_at":"2026-05-17T23:41:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.02707","created_at":"2026-05-17T23:41:23Z"},{"alias_kind":"pith_short_12","alias_value":"5BRX623K2EQ3","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"5BRX623K2EQ3LRSZ","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"5BRX623K","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:53ca6429c105e4fa3a88bcbbf6b19d6da55e1e4bb8c44fab75bf09c6e6704143","target":"graph","created_at":"2026-05-17T23:41: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 propose an approach to construction of robust non-Euclidean iterative algorithms for convex composite stochastic optimization based on truncation of stochastic gradients. For such algorithms, we establish sub-Gaussian confidence bounds under weak assumptions about the tails of the noise distribution in convex and strongly convex settings. Robust estimates of the accuracy of general stochastic algorithms are also proposed.","authors_text":"Alexander Nazin, Alexandre Tsybakov, Anatoli Juditsky (LJK), Arkadi Nemirovsky","cross_cats":["math.OC","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2019-07-05T07:33:05Z","title":"Algorithms of Robust Stochastic Optimization Based on Mirror Descent Method"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.02707","kind":"arxiv","version":1},"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:cab3830c6003b5fb8b3686c0688cc16cef4def9984b78fd286fb61abcbae5ced","target":"record","created_at":"2026-05-17T23:41: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":"2ee7fdf92234a85874625ce1d193d49ae53074ad7513f016fe62604bbba23de1","cross_cats_sorted":["math.OC","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2019-07-05T07:33:05Z","title_canon_sha256":"d943523932b32fc92693b2c0d7fa04c91d556d807cde30929e96ecff1dc75281"},"schema_version":"1.0","source":{"id":"1907.02707","kind":"arxiv","version":1}},"canonical_sha256":"e8637f6b6ad121b5c659b4908b26553bebdc490423cf83e9b5970d9610e8f2d2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e8637f6b6ad121b5c659b4908b26553bebdc490423cf83e9b5970d9610e8f2d2","first_computed_at":"2026-05-17T23:41:23.426892Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:41:23.426892Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"u77SOGPxZwl+CvqVBFD9wCsLvFYTptQAjoUGMCJbnYQaDyP5F/abCjIufmqN0WNaFFSQwda/2+vT6cD/35rvDw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:41:23.427806Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.02707","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cab3830c6003b5fb8b3686c0688cc16cef4def9984b78fd286fb61abcbae5ced","sha256:53ca6429c105e4fa3a88bcbbf6b19d6da55e1e4bb8c44fab75bf09c6e6704143"],"state_sha256":"f5141cae2c293ac6feac7efb18bee95f36cb2835323ac58055c84129d8047453"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HC0RmfHeWkGQRinqOLsrBOjAg2D3/OGsJOV2w1vJcIPs+BA08VYAL5/vmrm3q7Fo7ORcv7v1y31X1I016YSwAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T19:14:29.353457Z","bundle_sha256":"815b94e92f1cb095d06bf68c7156ed23fb9404f1ceaa14de9d1c2b7ef06ad366"}}