{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:PC3IZQG33XGNLWIXUAYUGMYEEH","short_pith_number":"pith:PC3IZQG3","canonical_record":{"source":{"id":"1701.01830","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-01-07T13:51:35Z","cross_cats_sorted":[],"title_canon_sha256":"3b4fd01eaefaa91d06c31975edb20fb4a68fd76b4d7ebf9b74531d7a63f4036e","abstract_canon_sha256":"5a9c5812194b322bf78a1b27d1636d2868b584c6c8e6a8c4801bded0f13efe62"},"schema_version":"1.0"},"canonical_sha256":"78b68cc0dbddccd5d917a03143330421f64f7f974f635079755672ff0dc55952","source":{"kind":"arxiv","id":"1701.01830","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.01830","created_at":"2026-05-18T00:52:33Z"},{"alias_kind":"arxiv_version","alias_value":"1701.01830v2","created_at":"2026-05-18T00:52:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.01830","created_at":"2026-05-18T00:52:33Z"},{"alias_kind":"pith_short_12","alias_value":"PC3IZQG33XGN","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"PC3IZQG33XGNLWIX","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"PC3IZQG3","created_at":"2026-05-18T12:31:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:PC3IZQG33XGNLWIXUAYUGMYEEH","target":"record","payload":{"canonical_record":{"source":{"id":"1701.01830","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-01-07T13:51:35Z","cross_cats_sorted":[],"title_canon_sha256":"3b4fd01eaefaa91d06c31975edb20fb4a68fd76b4d7ebf9b74531d7a63f4036e","abstract_canon_sha256":"5a9c5812194b322bf78a1b27d1636d2868b584c6c8e6a8c4801bded0f13efe62"},"schema_version":"1.0"},"canonical_sha256":"78b68cc0dbddccd5d917a03143330421f64f7f974f635079755672ff0dc55952","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:33.740751Z","signature_b64":"BMOZfdN9v4RzO94f08IwfrRGI6YIMq5VS4ifTAhd+BUrwn6q94jq5GEMVrvv6cfLFjh5qCLDkCL0D82/TteACg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"78b68cc0dbddccd5d917a03143330421f64f7f974f635079755672ff0dc55952","last_reissued_at":"2026-05-18T00:52:33.740259Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:33.740259Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1701.01830","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:52:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZD7w2esfd/GX/Xft8IqbPBOANG27gUryV44U8ZDXTmMdr78m95IlrtH3gRVBojmju+CoUytxVO1X+EGe9xWHDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T07:19:00.661848Z"},"content_sha256":"bbffce8390f73167dfaee89e342660c823b5a7d53a967fce73681806a191f2a8","schema_version":"1.0","event_id":"sha256:bbffce8390f73167dfaee89e342660c823b5a7d53a967fce73681806a191f2a8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:PC3IZQG33XGNLWIXUAYUGMYEEH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Parallel algorithms and probability of large deviation for stochastic optimization problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alexander Gasnikov, Anastasia Lagunovskaya, Pavel Dvurechensky","submitted_at":"2017-01-07T13:51:35Z","abstract_excerpt":"We consider convex stochastic optimization problems under different assumptions on the properties of available stochastic subgradient. It is known that, if the value of the objective function is available, one can obtain, in parallel, several independent approximate solutions in terms of the objective residual expectation. Then, choosing the solution with the minimum function value, one can control the probability of large deviation of the objective residual. On the contrary, in this short paper, we address the situation, when the value of the objective function is unavailable or is too expens"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.01830","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:52:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RdiBcazjWvsqIgoiKf9jhLDZCOs8QvI6xz50q8cxKkS8DkqSTeJhEU92OhlFgEri7w2/F1L3mUeDsab9H0YVDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T07:19:00.662191Z"},"content_sha256":"e0e09e4135a57456110487025cda52073b5d589776da7c8bfd2b267dd0b7f109","schema_version":"1.0","event_id":"sha256:e0e09e4135a57456110487025cda52073b5d589776da7c8bfd2b267dd0b7f109"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PC3IZQG33XGNLWIXUAYUGMYEEH/bundle.json","state_url":"https://pith.science/pith/PC3IZQG33XGNLWIXUAYUGMYEEH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PC3IZQG33XGNLWIXUAYUGMYEEH/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-20T07:19:00Z","links":{"resolver":"https://pith.science/pith/PC3IZQG33XGNLWIXUAYUGMYEEH","bundle":"https://pith.science/pith/PC3IZQG33XGNLWIXUAYUGMYEEH/bundle.json","state":"https://pith.science/pith/PC3IZQG33XGNLWIXUAYUGMYEEH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PC3IZQG33XGNLWIXUAYUGMYEEH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:PC3IZQG33XGNLWIXUAYUGMYEEH","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":"5a9c5812194b322bf78a1b27d1636d2868b584c6c8e6a8c4801bded0f13efe62","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-01-07T13:51:35Z","title_canon_sha256":"3b4fd01eaefaa91d06c31975edb20fb4a68fd76b4d7ebf9b74531d7a63f4036e"},"schema_version":"1.0","source":{"id":"1701.01830","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.01830","created_at":"2026-05-18T00:52:33Z"},{"alias_kind":"arxiv_version","alias_value":"1701.01830v2","created_at":"2026-05-18T00:52:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.01830","created_at":"2026-05-18T00:52:33Z"},{"alias_kind":"pith_short_12","alias_value":"PC3IZQG33XGN","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"PC3IZQG33XGNLWIX","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"PC3IZQG3","created_at":"2026-05-18T12:31:37Z"}],"graph_snapshots":[{"event_id":"sha256:e0e09e4135a57456110487025cda52073b5d589776da7c8bfd2b267dd0b7f109","target":"graph","created_at":"2026-05-18T00:52:33Z","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 consider convex stochastic optimization problems under different assumptions on the properties of available stochastic subgradient. It is known that, if the value of the objective function is available, one can obtain, in parallel, several independent approximate solutions in terms of the objective residual expectation. Then, choosing the solution with the minimum function value, one can control the probability of large deviation of the objective residual. On the contrary, in this short paper, we address the situation, when the value of the objective function is unavailable or is too expens","authors_text":"Alexander Gasnikov, Anastasia Lagunovskaya, Pavel Dvurechensky","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-01-07T13:51:35Z","title":"Parallel algorithms and probability of large deviation for stochastic optimization problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.01830","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:bbffce8390f73167dfaee89e342660c823b5a7d53a967fce73681806a191f2a8","target":"record","created_at":"2026-05-18T00:52:33Z","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":"5a9c5812194b322bf78a1b27d1636d2868b584c6c8e6a8c4801bded0f13efe62","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-01-07T13:51:35Z","title_canon_sha256":"3b4fd01eaefaa91d06c31975edb20fb4a68fd76b4d7ebf9b74531d7a63f4036e"},"schema_version":"1.0","source":{"id":"1701.01830","kind":"arxiv","version":2}},"canonical_sha256":"78b68cc0dbddccd5d917a03143330421f64f7f974f635079755672ff0dc55952","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"78b68cc0dbddccd5d917a03143330421f64f7f974f635079755672ff0dc55952","first_computed_at":"2026-05-18T00:52:33.740259Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:52:33.740259Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BMOZfdN9v4RzO94f08IwfrRGI6YIMq5VS4ifTAhd+BUrwn6q94jq5GEMVrvv6cfLFjh5qCLDkCL0D82/TteACg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:52:33.740751Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.01830","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bbffce8390f73167dfaee89e342660c823b5a7d53a967fce73681806a191f2a8","sha256:e0e09e4135a57456110487025cda52073b5d589776da7c8bfd2b267dd0b7f109"],"state_sha256":"6da5455807baade12d36c376914514d6ad6dac170b437721c0ef65609daef728"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NFhD5yrefCKIzyjiR31qZ/aoZXrEe1lB8yxHtKBoV4NO+w8SgOU1alLLpm7RTbzZuNCr7Q25Cw6H0JxcCyxDAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T07:19:00.664138Z","bundle_sha256":"34ae5edb0660cb4d2e4f7541ce1ebb0cfe6448ef7de5a291c67620268e7cace0"}}