{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:XENPVDSD4KQWPHZNXRUZLJDIWN","short_pith_number":"pith:XENPVDSD","canonical_record":{"source":{"id":"2305.12387","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-05-21T07:58:09Z","cross_cats_sorted":[],"title_canon_sha256":"e7749a616e87ce8bfb0afcc87db60d63a45eedd540097b01b3ae6a5de97ada2e","abstract_canon_sha256":"1fb35d47f6c8aba043b8565a0a9b0e4804d6c79b49a89eb53c6efb901582e565"},"schema_version":"1.0"},"canonical_sha256":"b91afa8e43e2a1679f2dbc6995a468b352ca2998d4c21803d18edfb9e9ffd090","source":{"kind":"arxiv","id":"2305.12387","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2305.12387","created_at":"2026-07-05T07:16:41Z"},{"alias_kind":"arxiv_version","alias_value":"2305.12387v2","created_at":"2026-07-05T07:16:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.12387","created_at":"2026-07-05T07:16:41Z"},{"alias_kind":"pith_short_12","alias_value":"XENPVDSD4KQW","created_at":"2026-07-05T07:16:41Z"},{"alias_kind":"pith_short_16","alias_value":"XENPVDSD4KQWPHZN","created_at":"2026-07-05T07:16:41Z"},{"alias_kind":"pith_short_8","alias_value":"XENPVDSD","created_at":"2026-07-05T07:16:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:XENPVDSD4KQWPHZNXRUZLJDIWN","target":"record","payload":{"canonical_record":{"source":{"id":"2305.12387","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-05-21T07:58:09Z","cross_cats_sorted":[],"title_canon_sha256":"e7749a616e87ce8bfb0afcc87db60d63a45eedd540097b01b3ae6a5de97ada2e","abstract_canon_sha256":"1fb35d47f6c8aba043b8565a0a9b0e4804d6c79b49a89eb53c6efb901582e565"},"schema_version":"1.0"},"canonical_sha256":"b91afa8e43e2a1679f2dbc6995a468b352ca2998d4c21803d18edfb9e9ffd090","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:16:41.649182Z","signature_b64":"6TxLwsAUJZzCk98yHtrWmarc9HqBTJE1QLegjdHS+Za/2R0FSLW5MhE8nXPEjqnsQX5e3HaOPU92v4XunQOYBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b91afa8e43e2a1679f2dbc6995a468b352ca2998d4c21803d18edfb9e9ffd090","last_reissued_at":"2026-07-05T07:16:41.648701Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:16:41.648701Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2305.12387","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-05T07:16:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GoEaFtJc07V9wjOYNXjPw5GRmr+Wka51HFs0QLEDNLdwaFmxx+ShLjWdD5fjtCgskodLXAAKzKG1q3AbfyuTDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T17:54:31.251975Z"},"content_sha256":"a2d9131ab3305dd49c9cda13eb50ad148a3762d842227bd339a37eed30e8e240","schema_version":"1.0","event_id":"sha256:a2d9131ab3305dd49c9cda13eb50ad148a3762d842227bd339a37eed30e8e240"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:XENPVDSD4KQWPHZNXRUZLJDIWN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Time Complexities of Parallel Stochastic Optimization Methods Under a Fixed Computation Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alexander Tyurin, Peter Richt\\'arik","submitted_at":"2023-05-21T07:58:09Z","abstract_excerpt":"Parallelization is a popular strategy for improving the performance of iterative algorithms. Optimization methods are no exception: design of efficient parallel optimization methods and tight analysis of their theoretical properties are important research endeavors. While the minimax complexities are well known for sequential optimization methods, the theory of parallel optimization methods is less explored. In this paper, we propose a new protocol that generalizes the classical oracle framework approach. Using this protocol, we establish minimax complexities for parallel optimization methods "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.12387","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2305.12387/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T07:16:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P0GHHwFVaXeVrzC+6jhwSbarRmqi5wKL47zPaxB2rT2rrc5xRBthVRN11khrVOiMalzt9e5jXqnd0QeuQG9KAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T17:54:31.252356Z"},"content_sha256":"75bb4c372719bd3cee7b206cf6d342139c2fc95c54091d3eeb8f6afe7a1b8656","schema_version":"1.0","event_id":"sha256:75bb4c372719bd3cee7b206cf6d342139c2fc95c54091d3eeb8f6afe7a1b8656"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XENPVDSD4KQWPHZNXRUZLJDIWN/bundle.json","state_url":"https://pith.science/pith/XENPVDSD4KQWPHZNXRUZLJDIWN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XENPVDSD4KQWPHZNXRUZLJDIWN/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-08-04T17:54:31Z","links":{"resolver":"https://pith.science/pith/XENPVDSD4KQWPHZNXRUZLJDIWN","bundle":"https://pith.science/pith/XENPVDSD4KQWPHZNXRUZLJDIWN/bundle.json","state":"https://pith.science/pith/XENPVDSD4KQWPHZNXRUZLJDIWN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XENPVDSD4KQWPHZNXRUZLJDIWN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:XENPVDSD4KQWPHZNXRUZLJDIWN","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":"1fb35d47f6c8aba043b8565a0a9b0e4804d6c79b49a89eb53c6efb901582e565","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-05-21T07:58:09Z","title_canon_sha256":"e7749a616e87ce8bfb0afcc87db60d63a45eedd540097b01b3ae6a5de97ada2e"},"schema_version":"1.0","source":{"id":"2305.12387","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2305.12387","created_at":"2026-07-05T07:16:41Z"},{"alias_kind":"arxiv_version","alias_value":"2305.12387v2","created_at":"2026-07-05T07:16:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.12387","created_at":"2026-07-05T07:16:41Z"},{"alias_kind":"pith_short_12","alias_value":"XENPVDSD4KQW","created_at":"2026-07-05T07:16:41Z"},{"alias_kind":"pith_short_16","alias_value":"XENPVDSD4KQWPHZN","created_at":"2026-07-05T07:16:41Z"},{"alias_kind":"pith_short_8","alias_value":"XENPVDSD","created_at":"2026-07-05T07:16:41Z"}],"graph_snapshots":[{"event_id":"sha256:75bb4c372719bd3cee7b206cf6d342139c2fc95c54091d3eeb8f6afe7a1b8656","target":"graph","created_at":"2026-07-05T07:16:41Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2305.12387/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Parallelization is a popular strategy for improving the performance of iterative algorithms. Optimization methods are no exception: design of efficient parallel optimization methods and tight analysis of their theoretical properties are important research endeavors. While the minimax complexities are well known for sequential optimization methods, the theory of parallel optimization methods is less explored. In this paper, we propose a new protocol that generalizes the classical oracle framework approach. Using this protocol, we establish minimax complexities for parallel optimization methods ","authors_text":"Alexander Tyurin, Peter Richt\\'arik","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-05-21T07:58:09Z","title":"Optimal Time Complexities of Parallel Stochastic Optimization Methods Under a Fixed Computation Model"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.12387","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:a2d9131ab3305dd49c9cda13eb50ad148a3762d842227bd339a37eed30e8e240","target":"record","created_at":"2026-07-05T07:16:41Z","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":"1fb35d47f6c8aba043b8565a0a9b0e4804d6c79b49a89eb53c6efb901582e565","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-05-21T07:58:09Z","title_canon_sha256":"e7749a616e87ce8bfb0afcc87db60d63a45eedd540097b01b3ae6a5de97ada2e"},"schema_version":"1.0","source":{"id":"2305.12387","kind":"arxiv","version":2}},"canonical_sha256":"b91afa8e43e2a1679f2dbc6995a468b352ca2998d4c21803d18edfb9e9ffd090","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b91afa8e43e2a1679f2dbc6995a468b352ca2998d4c21803d18edfb9e9ffd090","first_computed_at":"2026-07-05T07:16:41.648701Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:16:41.648701Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6TxLwsAUJZzCk98yHtrWmarc9HqBTJE1QLegjdHS+Za/2R0FSLW5MhE8nXPEjqnsQX5e3HaOPU92v4XunQOYBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T07:16:41.649182Z","signed_message":"canonical_sha256_bytes"},"source_id":"2305.12387","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a2d9131ab3305dd49c9cda13eb50ad148a3762d842227bd339a37eed30e8e240","sha256:75bb4c372719bd3cee7b206cf6d342139c2fc95c54091d3eeb8f6afe7a1b8656"],"state_sha256":"32c8eebe1ce4f255e015fab092a3ad69dc755488b83471b9681bde146a1fe6b6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qDxMXgoEnPScxu7zOtHMxJUaPzv/+Nl6wRJEC0eBKP5LOLPyVkymFd7Ukndbw+ICZ5aS4HhcY1NrcKXIDMotDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T17:54:31.254689Z","bundle_sha256":"8d4b222309bae6437802fdb74b011560446ae01595216817852d59e4526c34b9"}}