{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:2JIJQM3J3GXY3EDHZ5FBXON32F","short_pith_number":"pith:2JIJQM3J","canonical_record":{"source":{"id":"1811.01903","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-11-05T18:32:06Z","cross_cats_sorted":["cs.DS","cs.LG","stat.ML"],"title_canon_sha256":"765330b350b3a7f65996e6a4f36adced3bfcafd505207eed6ba0aace3cef9262","abstract_canon_sha256":"a4ffda686e5996f777f508139ac0d4177832130b3b41aa340625b2060df95485"},"schema_version":"1.0"},"canonical_sha256":"d250983369d9af8d9067cf4a1bb9bbd166521712a97ef56beff20aa6751610e0","source":{"kind":"arxiv","id":"1811.01903","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.01903","created_at":"2026-05-17T23:42:53Z"},{"alias_kind":"arxiv_version","alias_value":"1811.01903v3","created_at":"2026-05-17T23:42:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.01903","created_at":"2026-05-17T23:42:53Z"},{"alias_kind":"pith_short_12","alias_value":"2JIJQM3J3GXY","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"2JIJQM3J3GXY3EDH","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"2JIJQM3J","created_at":"2026-05-18T12:32:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:2JIJQM3J3GXY3EDHZ5FBXON32F","target":"record","payload":{"canonical_record":{"source":{"id":"1811.01903","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-11-05T18:32:06Z","cross_cats_sorted":["cs.DS","cs.LG","stat.ML"],"title_canon_sha256":"765330b350b3a7f65996e6a4f36adced3bfcafd505207eed6ba0aace3cef9262","abstract_canon_sha256":"a4ffda686e5996f777f508139ac0d4177832130b3b41aa340625b2060df95485"},"schema_version":"1.0"},"canonical_sha256":"d250983369d9af8d9067cf4a1bb9bbd166521712a97ef56beff20aa6751610e0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:53.638463Z","signature_b64":"5wutxcqNe/li0pKxKchhAnoHByeOI8NNAu4P5aX3YpjPwHyOMAS5LvxZ4tf0b7xDD9KrzG0bfPHT+x60izmTBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d250983369d9af8d9067cf4a1bb9bbd166521712a97ef56beff20aa6751610e0","last_reissued_at":"2026-05-17T23:42:53.637672Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:53.637672Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.01903","source_version":3,"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:42:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c63fVSHgdSPtrtqY/HB0YH8nSjRCP+gXC/ZFDFGMg7cxkgd8sDgqIXEtMV0P6WLkEk+DewD1WKMkuP6g1bHUCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T10:35:33.697773Z"},"content_sha256":"0b99337f456544b4ef8f51027e72ca1533e205982be4d9a8385b1eb957fde8b3","schema_version":"1.0","event_id":"sha256:0b99337f456544b4ef8f51027e72ca1533e205982be4d9a8385b1eb957fde8b3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:2JIJQM3J3GXY3EDHZ5FBXON32F","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Lower Bounds for Parallel and Randomized Convex Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.LG","stat.ML"],"primary_cat":"math.OC","authors_text":"Crist\\'obal Guzm\\'an, Jelena Diakonikolas","submitted_at":"2018-11-05T18:32:06Z","abstract_excerpt":"We study the question of whether parallelization in the exploration of the feasible set can be used to speed up convex optimization, in the local oracle model of computation. We show that the answer is negative for both deterministic and randomized algorithms applied to essentially any of the interesting geometries and nonsmooth, weakly-smooth, or smooth objective functions. In particular, we show that it is not possible to obtain a polylogarithmic (in the sequential complexity of the problem) number of parallel rounds with a polynomial (in the dimension) number of queries per round. In the ma"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.01903","kind":"arxiv","version":3},"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:42:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Kc7iT1OYI4h0195M2Yo+VH8YEZ4tF6MSA83tRcHiq7mCOv4JQwEd4oPZo7rAZ7/4xh2Jb1At5mHAotWZJ+uBCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T10:35:33.698260Z"},"content_sha256":"063e89f10fe5fe11877e5842d28deccc0791cda853f844f18e3eb50ca92ccaec","schema_version":"1.0","event_id":"sha256:063e89f10fe5fe11877e5842d28deccc0791cda853f844f18e3eb50ca92ccaec"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2JIJQM3J3GXY3EDHZ5FBXON32F/bundle.json","state_url":"https://pith.science/pith/2JIJQM3J3GXY3EDHZ5FBXON32F/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2JIJQM3J3GXY3EDHZ5FBXON32F/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-27T10:35:33Z","links":{"resolver":"https://pith.science/pith/2JIJQM3J3GXY3EDHZ5FBXON32F","bundle":"https://pith.science/pith/2JIJQM3J3GXY3EDHZ5FBXON32F/bundle.json","state":"https://pith.science/pith/2JIJQM3J3GXY3EDHZ5FBXON32F/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2JIJQM3J3GXY3EDHZ5FBXON32F/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:2JIJQM3J3GXY3EDHZ5FBXON32F","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":"a4ffda686e5996f777f508139ac0d4177832130b3b41aa340625b2060df95485","cross_cats_sorted":["cs.DS","cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-11-05T18:32:06Z","title_canon_sha256":"765330b350b3a7f65996e6a4f36adced3bfcafd505207eed6ba0aace3cef9262"},"schema_version":"1.0","source":{"id":"1811.01903","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.01903","created_at":"2026-05-17T23:42:53Z"},{"alias_kind":"arxiv_version","alias_value":"1811.01903v3","created_at":"2026-05-17T23:42:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.01903","created_at":"2026-05-17T23:42:53Z"},{"alias_kind":"pith_short_12","alias_value":"2JIJQM3J3GXY","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"2JIJQM3J3GXY3EDH","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"2JIJQM3J","created_at":"2026-05-18T12:32:02Z"}],"graph_snapshots":[{"event_id":"sha256:063e89f10fe5fe11877e5842d28deccc0791cda853f844f18e3eb50ca92ccaec","target":"graph","created_at":"2026-05-17T23:42:53Z","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 study the question of whether parallelization in the exploration of the feasible set can be used to speed up convex optimization, in the local oracle model of computation. We show that the answer is negative for both deterministic and randomized algorithms applied to essentially any of the interesting geometries and nonsmooth, weakly-smooth, or smooth objective functions. In particular, we show that it is not possible to obtain a polylogarithmic (in the sequential complexity of the problem) number of parallel rounds with a polynomial (in the dimension) number of queries per round. In the ma","authors_text":"Crist\\'obal Guzm\\'an, Jelena Diakonikolas","cross_cats":["cs.DS","cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-11-05T18:32:06Z","title":"Lower Bounds for Parallel and Randomized Convex Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.01903","kind":"arxiv","version":3},"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:0b99337f456544b4ef8f51027e72ca1533e205982be4d9a8385b1eb957fde8b3","target":"record","created_at":"2026-05-17T23:42:53Z","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":"a4ffda686e5996f777f508139ac0d4177832130b3b41aa340625b2060df95485","cross_cats_sorted":["cs.DS","cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-11-05T18:32:06Z","title_canon_sha256":"765330b350b3a7f65996e6a4f36adced3bfcafd505207eed6ba0aace3cef9262"},"schema_version":"1.0","source":{"id":"1811.01903","kind":"arxiv","version":3}},"canonical_sha256":"d250983369d9af8d9067cf4a1bb9bbd166521712a97ef56beff20aa6751610e0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d250983369d9af8d9067cf4a1bb9bbd166521712a97ef56beff20aa6751610e0","first_computed_at":"2026-05-17T23:42:53.637672Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:42:53.637672Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5wutxcqNe/li0pKxKchhAnoHByeOI8NNAu4P5aX3YpjPwHyOMAS5LvxZ4tf0b7xDD9KrzG0bfPHT+x60izmTBg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:42:53.638463Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.01903","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0b99337f456544b4ef8f51027e72ca1533e205982be4d9a8385b1eb957fde8b3","sha256:063e89f10fe5fe11877e5842d28deccc0791cda853f844f18e3eb50ca92ccaec"],"state_sha256":"5954d23e38e98b6cd4f3daec4dfddfa61b6c48eff66cf20b5d3a4cd32a1e8d10"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KkPk9m5QFRHVjBAxA1FLSW0ofakaC8Ocs8DhphVYlcGxFyg+uxzNtZOhnj073fsKi3b5tB4zQD+LmfdiCSNfCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T10:35:33.701898Z","bundle_sha256":"2b0fffedcc27f1b87cb30be3e5955799836140b83275a82721c92621ceab107a"}}