{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:VSVHFWFPN53VIJREUGB7Q7VEMA","short_pith_number":"pith:VSVHFWFP","canonical_record":{"source":{"id":"2002.02706","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-02-07T10:46:52Z","cross_cats_sorted":[],"title_canon_sha256":"d721f4b40d941f84b9169ee9a765b8344def5473b821a35108bb4aaf7c4ed57d","abstract_canon_sha256":"5663feeada637e2100725dff88aef242658ab10d169b9aaef4031e8323630432"},"schema_version":"1.0"},"canonical_sha256":"acaa72d8af6f77542624a183f87ea460305efa1494c93e211baa529abf28cc33","source":{"kind":"arxiv","id":"2002.02706","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2002.02706","created_at":"2026-07-05T04:03:43Z"},{"alias_kind":"arxiv_version","alias_value":"2002.02706v4","created_at":"2026-07-05T04:03:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2002.02706","created_at":"2026-07-05T04:03:43Z"},{"alias_kind":"pith_short_12","alias_value":"VSVHFWFPN53V","created_at":"2026-07-05T04:03:43Z"},{"alias_kind":"pith_short_16","alias_value":"VSVHFWFPN53VIJRE","created_at":"2026-07-05T04:03:43Z"},{"alias_kind":"pith_short_8","alias_value":"VSVHFWFP","created_at":"2026-07-05T04:03:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:VSVHFWFPN53VIJREUGB7Q7VEMA","target":"record","payload":{"canonical_record":{"source":{"id":"2002.02706","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-02-07T10:46:52Z","cross_cats_sorted":[],"title_canon_sha256":"d721f4b40d941f84b9169ee9a765b8344def5473b821a35108bb4aaf7c4ed57d","abstract_canon_sha256":"5663feeada637e2100725dff88aef242658ab10d169b9aaef4031e8323630432"},"schema_version":"1.0"},"canonical_sha256":"acaa72d8af6f77542624a183f87ea460305efa1494c93e211baa529abf28cc33","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:03:43.111185Z","signature_b64":"DJyC6X6QOWcWPVWUITcrlUGSkg3jWPRUIN4ehsnIIyazyvVRSCx43ZQNfgvTAUrg8KOMqAQJaGaMAbdXcPIPAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"acaa72d8af6f77542624a183f87ea460305efa1494c93e211baa529abf28cc33","last_reissued_at":"2026-07-05T04:03:43.110785Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:03:43.110785Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2002.02706","source_version":4,"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-05T04:03:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g0XtlG8DO+NjkXLCax7x8xJlJxy6gD1hoF6ua/C4bGna5Ysc9mlVzL0FSuwNujTFztdWAJeESB+ZscO61wEIAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T06:25:06.845598Z"},"content_sha256":"a5748e76b8fa69257cd10baab6b74789b4787e0e26835570247ac6726ee344f5","schema_version":"1.0","event_id":"sha256:a5748e76b8fa69257cd10baab6b74789b4787e0e26835570247ac6726ee344f5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:VSVHFWFPN53VIJREUGB7Q7VEMA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Oracle Complexity Separation in Convex Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alexander Gasnikov, Alexander Tyurin, Anastasiya Ivanova, Darina Dvinskikh, Dmitry Pasechnyuk, Evgeniya Vorontsova, Pavel Dvurechensky","submitted_at":"2020-02-07T10:46:52Z","abstract_excerpt":"Many convex optimization problems have structured objective function written as a sum of functions with different types of oracles (full gradient, coordinate derivative, stochastic gradient) and different evaluation complexity of these oracles. In the strongly convex case these functions also have different condition numbers, which eventually define the iteration complexity of first-order methods and the number of oracle calls required to achieve given accuracy. Motivated by the desire to call more expensive oracle less number of times, in this paper we consider minimization of a sum of two fu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2002.02706","kind":"arxiv","version":4},"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/2002.02706/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-05T04:03:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Dd7wjUBDGKu7Fi/4eOuF5RAuw6HYNnVjVdsyQaubo0o3HOAb7u1A7Ut1PVSYWfljrGB5ynwzY4zHxPe4u2sVDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T06:25:06.846140Z"},"content_sha256":"0251d3df8a331261847db0294dbe45975c0c6f0d190f9aacb7fd69822bf3e80a","schema_version":"1.0","event_id":"sha256:0251d3df8a331261847db0294dbe45975c0c6f0d190f9aacb7fd69822bf3e80a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VSVHFWFPN53VIJREUGB7Q7VEMA/bundle.json","state_url":"https://pith.science/pith/VSVHFWFPN53VIJREUGB7Q7VEMA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VSVHFWFPN53VIJREUGB7Q7VEMA/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-19T06:25:06Z","links":{"resolver":"https://pith.science/pith/VSVHFWFPN53VIJREUGB7Q7VEMA","bundle":"https://pith.science/pith/VSVHFWFPN53VIJREUGB7Q7VEMA/bundle.json","state":"https://pith.science/pith/VSVHFWFPN53VIJREUGB7Q7VEMA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VSVHFWFPN53VIJREUGB7Q7VEMA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:VSVHFWFPN53VIJREUGB7Q7VEMA","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":"5663feeada637e2100725dff88aef242658ab10d169b9aaef4031e8323630432","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-02-07T10:46:52Z","title_canon_sha256":"d721f4b40d941f84b9169ee9a765b8344def5473b821a35108bb4aaf7c4ed57d"},"schema_version":"1.0","source":{"id":"2002.02706","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2002.02706","created_at":"2026-07-05T04:03:43Z"},{"alias_kind":"arxiv_version","alias_value":"2002.02706v4","created_at":"2026-07-05T04:03:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2002.02706","created_at":"2026-07-05T04:03:43Z"},{"alias_kind":"pith_short_12","alias_value":"VSVHFWFPN53V","created_at":"2026-07-05T04:03:43Z"},{"alias_kind":"pith_short_16","alias_value":"VSVHFWFPN53VIJRE","created_at":"2026-07-05T04:03:43Z"},{"alias_kind":"pith_short_8","alias_value":"VSVHFWFP","created_at":"2026-07-05T04:03:43Z"}],"graph_snapshots":[{"event_id":"sha256:0251d3df8a331261847db0294dbe45975c0c6f0d190f9aacb7fd69822bf3e80a","target":"graph","created_at":"2026-07-05T04:03:43Z","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/2002.02706/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Many convex optimization problems have structured objective function written as a sum of functions with different types of oracles (full gradient, coordinate derivative, stochastic gradient) and different evaluation complexity of these oracles. In the strongly convex case these functions also have different condition numbers, which eventually define the iteration complexity of first-order methods and the number of oracle calls required to achieve given accuracy. Motivated by the desire to call more expensive oracle less number of times, in this paper we consider minimization of a sum of two fu","authors_text":"Alexander Gasnikov, Alexander Tyurin, Anastasiya Ivanova, Darina Dvinskikh, Dmitry Pasechnyuk, Evgeniya Vorontsova, Pavel Dvurechensky","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-02-07T10:46:52Z","title":"Oracle Complexity Separation in Convex Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2002.02706","kind":"arxiv","version":4},"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:a5748e76b8fa69257cd10baab6b74789b4787e0e26835570247ac6726ee344f5","target":"record","created_at":"2026-07-05T04:03:43Z","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":"5663feeada637e2100725dff88aef242658ab10d169b9aaef4031e8323630432","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-02-07T10:46:52Z","title_canon_sha256":"d721f4b40d941f84b9169ee9a765b8344def5473b821a35108bb4aaf7c4ed57d"},"schema_version":"1.0","source":{"id":"2002.02706","kind":"arxiv","version":4}},"canonical_sha256":"acaa72d8af6f77542624a183f87ea460305efa1494c93e211baa529abf28cc33","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"acaa72d8af6f77542624a183f87ea460305efa1494c93e211baa529abf28cc33","first_computed_at":"2026-07-05T04:03:43.110785Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:03:43.110785Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DJyC6X6QOWcWPVWUITcrlUGSkg3jWPRUIN4ehsnIIyazyvVRSCx43ZQNfgvTAUrg8KOMqAQJaGaMAbdXcPIPAA==","signature_status":"signed_v1","signed_at":"2026-07-05T04:03:43.111185Z","signed_message":"canonical_sha256_bytes"},"source_id":"2002.02706","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a5748e76b8fa69257cd10baab6b74789b4787e0e26835570247ac6726ee344f5","sha256:0251d3df8a331261847db0294dbe45975c0c6f0d190f9aacb7fd69822bf3e80a"],"state_sha256":"6d1b72c30618d085379426d216f1c864ed06b6a2ddcf75fbd20f0f51a4f4a637"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3TIgb49BZHespHZO7ZPN3P7F4bIwjwO7kFeyOUDRSU1JiY3M/kaxnOfhgM8ajmJ/HKbrOHN+zrmMHXDZIBBbAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-19T06:25:06.851866Z","bundle_sha256":"d47f4e7f6f6975adb34463b965a8f9f4f852fa4bc429d90896060193a0370e37"}}