{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:X3AW36NP75SBBK3JEF3RP6M6VN","short_pith_number":"pith:X3AW36NP","canonical_record":{"source":{"id":"1711.01850","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-11-06T12:14:06Z","cross_cats_sorted":[],"title_canon_sha256":"4ff4fcf7cb72935d2bd5eb2020375fe67a2ddace397577ac4d4585de7af0795e","abstract_canon_sha256":"cfca58cd5615cbccc480ecfb3f1f4982f52ef70213a8af57f07b8e37e01c3633"},"schema_version":"1.0"},"canonical_sha256":"bec16df9afff6410ab69217717f99eab70690be46714fe931e3c622794abff45","source":{"kind":"arxiv","id":"1711.01850","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.01850","created_at":"2026-05-18T00:17:47Z"},{"alias_kind":"arxiv_version","alias_value":"1711.01850v3","created_at":"2026-05-18T00:17:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.01850","created_at":"2026-05-18T00:17:47Z"},{"alias_kind":"pith_short_12","alias_value":"X3AW36NP75SB","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"X3AW36NP75SBBK3J","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"X3AW36NP","created_at":"2026-05-18T12:31:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:X3AW36NP75SBBK3JEF3RP6M6VN","target":"record","payload":{"canonical_record":{"source":{"id":"1711.01850","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-11-06T12:14:06Z","cross_cats_sorted":[],"title_canon_sha256":"4ff4fcf7cb72935d2bd5eb2020375fe67a2ddace397577ac4d4585de7af0795e","abstract_canon_sha256":"cfca58cd5615cbccc480ecfb3f1f4982f52ef70213a8af57f07b8e37e01c3633"},"schema_version":"1.0"},"canonical_sha256":"bec16df9afff6410ab69217717f99eab70690be46714fe931e3c622794abff45","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:47.378011Z","signature_b64":"xZGUPrR3kMXBeqOWm7O+5fac/SjTSi4f4p20KBGHBD8FhpoEo5qcVgWz9RNumwM+Br2AERmFQWde3krcg6T6Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bec16df9afff6410ab69217717f99eab70690be46714fe931e3c622794abff45","last_reissued_at":"2026-05-18T00:17:47.377377Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:47.377377Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.01850","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-18T00:17:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"29ic1IsPlX9PLtDnYoxDj3jNdiwFVilfgQ+k/fz4z3WSML0uumzQGbyS26OgSfkTQ+5/DbOQ1DecOVDXdvS0AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T19:48:35.054615Z"},"content_sha256":"12ec81d7926d2bf6c269ce45e543ed34d3516d51830bd30f45d06b06e25c0606","schema_version":"1.0","event_id":"sha256:12ec81d7926d2bf6c269ce45e543ed34d3516d51830bd30f45d06b06e25c0606"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:X3AW36NP75SBBK3JEF3RP6M6VN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A universal modification of the linear coupling method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alexander Gasnikov, Alexander Gornov, Anton Anikin, Sergey Guminov","submitted_at":"2017-11-06T12:14:06Z","abstract_excerpt":"In the late sixties, N. Shor and B. Polyak independently proposed optimal first-order methods for non-smooth convex optimization problems. In 1982 A. Nemirovski proposed optimal first-order methods for smooth convex optimization problems, which utilized auxiliary line search. In 1985 A. Nemirovski and Yu. Nesterov proposed a parametric family of optimal first-order methods for convex optimization problems with intermediate smoothness. In 2013 Yu. Nesterov proposed a universal gradient method which combined all the good properties of the previous methods, except the possibility of using auxilia"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.01850","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-18T00:17:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"47WAi4/TC+Z3wNRnnx6wnu5fZarZOS4VBYtTS1C0+ZowI2ePcRvJxrj1UaAaJ/mX5i06Dgy8h3zuqobk1uHHAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T19:48:35.054975Z"},"content_sha256":"145811252820be089b5e3ec3e98b7fcfcd9d7a8b57f1c19120c162e60959c477","schema_version":"1.0","event_id":"sha256:145811252820be089b5e3ec3e98b7fcfcd9d7a8b57f1c19120c162e60959c477"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/X3AW36NP75SBBK3JEF3RP6M6VN/bundle.json","state_url":"https://pith.science/pith/X3AW36NP75SBBK3JEF3RP6M6VN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/X3AW36NP75SBBK3JEF3RP6M6VN/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-30T19:48:35Z","links":{"resolver":"https://pith.science/pith/X3AW36NP75SBBK3JEF3RP6M6VN","bundle":"https://pith.science/pith/X3AW36NP75SBBK3JEF3RP6M6VN/bundle.json","state":"https://pith.science/pith/X3AW36NP75SBBK3JEF3RP6M6VN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/X3AW36NP75SBBK3JEF3RP6M6VN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:X3AW36NP75SBBK3JEF3RP6M6VN","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":"cfca58cd5615cbccc480ecfb3f1f4982f52ef70213a8af57f07b8e37e01c3633","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-11-06T12:14:06Z","title_canon_sha256":"4ff4fcf7cb72935d2bd5eb2020375fe67a2ddace397577ac4d4585de7af0795e"},"schema_version":"1.0","source":{"id":"1711.01850","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.01850","created_at":"2026-05-18T00:17:47Z"},{"alias_kind":"arxiv_version","alias_value":"1711.01850v3","created_at":"2026-05-18T00:17:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.01850","created_at":"2026-05-18T00:17:47Z"},{"alias_kind":"pith_short_12","alias_value":"X3AW36NP75SB","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"X3AW36NP75SBBK3J","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"X3AW36NP","created_at":"2026-05-18T12:31:53Z"}],"graph_snapshots":[{"event_id":"sha256:145811252820be089b5e3ec3e98b7fcfcd9d7a8b57f1c19120c162e60959c477","target":"graph","created_at":"2026-05-18T00:17:47Z","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":"In the late sixties, N. Shor and B. Polyak independently proposed optimal first-order methods for non-smooth convex optimization problems. In 1982 A. Nemirovski proposed optimal first-order methods for smooth convex optimization problems, which utilized auxiliary line search. In 1985 A. Nemirovski and Yu. Nesterov proposed a parametric family of optimal first-order methods for convex optimization problems with intermediate smoothness. In 2013 Yu. Nesterov proposed a universal gradient method which combined all the good properties of the previous methods, except the possibility of using auxilia","authors_text":"Alexander Gasnikov, Alexander Gornov, Anton Anikin, Sergey Guminov","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-11-06T12:14:06Z","title":"A universal modification of the linear coupling method"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.01850","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:12ec81d7926d2bf6c269ce45e543ed34d3516d51830bd30f45d06b06e25c0606","target":"record","created_at":"2026-05-18T00:17:47Z","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":"cfca58cd5615cbccc480ecfb3f1f4982f52ef70213a8af57f07b8e37e01c3633","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-11-06T12:14:06Z","title_canon_sha256":"4ff4fcf7cb72935d2bd5eb2020375fe67a2ddace397577ac4d4585de7af0795e"},"schema_version":"1.0","source":{"id":"1711.01850","kind":"arxiv","version":3}},"canonical_sha256":"bec16df9afff6410ab69217717f99eab70690be46714fe931e3c622794abff45","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bec16df9afff6410ab69217717f99eab70690be46714fe931e3c622794abff45","first_computed_at":"2026-05-18T00:17:47.377377Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:17:47.377377Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xZGUPrR3kMXBeqOWm7O+5fac/SjTSi4f4p20KBGHBD8FhpoEo5qcVgWz9RNumwM+Br2AERmFQWde3krcg6T6Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:17:47.378011Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.01850","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:12ec81d7926d2bf6c269ce45e543ed34d3516d51830bd30f45d06b06e25c0606","sha256:145811252820be089b5e3ec3e98b7fcfcd9d7a8b57f1c19120c162e60959c477"],"state_sha256":"9fb12c49c06183a6ebb1f7d70170d76343b0d39e5f13ec1806d6ee8fd069a038"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sXS6lPhk2muSHvaHU9tlRxQcrkYNAMbMJCGXx3ujipG6X33A/aStszad51hIcpnwEa8Xtm5SoWzcPzykDSPYDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T19:48:35.057469Z","bundle_sha256":"5d37c1ef5fb00cf2794a0f18258172edd1da3454f0c09c6ab8623780789af7e8"}}