{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:RICU4LGNQKVFO3IVXF3S64CARO","short_pith_number":"pith:RICU4LGN","canonical_record":{"source":{"id":"1705.01073","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-05-02T16:59:21Z","cross_cats_sorted":[],"title_canon_sha256":"3ceb69ad3cff644197c2ca368d1abfe71022dea80f3de66fd9c7dac4c2903411","abstract_canon_sha256":"7e5cb359d5aec41ebb014225561a6d60fd33d9678c91b728e5fd4dd22807e1aa"},"schema_version":"1.0"},"canonical_sha256":"8a054e2ccd82aa576d15b9772f70408baaa660e70fe9c5a18dd3c021bb4fac7d","source":{"kind":"arxiv","id":"1705.01073","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.01073","created_at":"2026-05-18T00:45:09Z"},{"alias_kind":"arxiv_version","alias_value":"1705.01073v1","created_at":"2026-05-18T00:45:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.01073","created_at":"2026-05-18T00:45:09Z"},{"alias_kind":"pith_short_12","alias_value":"RICU4LGNQKVF","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"RICU4LGNQKVFO3IV","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"RICU4LGN","created_at":"2026-05-18T12:31:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:RICU4LGNQKVFO3IVXF3S64CARO","target":"record","payload":{"canonical_record":{"source":{"id":"1705.01073","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-05-02T16:59:21Z","cross_cats_sorted":[],"title_canon_sha256":"3ceb69ad3cff644197c2ca368d1abfe71022dea80f3de66fd9c7dac4c2903411","abstract_canon_sha256":"7e5cb359d5aec41ebb014225561a6d60fd33d9678c91b728e5fd4dd22807e1aa"},"schema_version":"1.0"},"canonical_sha256":"8a054e2ccd82aa576d15b9772f70408baaa660e70fe9c5a18dd3c021bb4fac7d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:09.007084Z","signature_b64":"OsBd8vyLL5zyHHVNCvyTMkfWitR6Oa+ovKCLHaeHkTiwV4AA+ae1L85EkgHBgpQpq3wq1yrRRtdZKVAKtKy5Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8a054e2ccd82aa576d15b9772f70408baaa660e70fe9c5a18dd3c021bb4fac7d","last_reissued_at":"2026-05-18T00:45:09.006466Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:09.006466Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.01073","source_version":1,"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:45:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YpJZNojTIrATJcakxhIQfupov80inc6SZGRVVgW17E84QgkkDZ2CJXDTxWCnZ1/rO6C5pwBWMdrFSPVPjZ8lBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T07:00:58.845714Z"},"content_sha256":"28a47da00b1e4675ce0743d536b25e526858adedb1cd7e9bf4ed3b042f06065b","schema_version":"1.0","event_id":"sha256:28a47da00b1e4675ce0743d536b25e526858adedb1cd7e9bf4ed3b042f06065b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:RICU4LGNQKVFO3IVXF3S64CARO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Algorithms of Inertial Mirror Descent in Convex Problems of Stochastic Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alexander Nazin","submitted_at":"2017-05-02T16:59:21Z","abstract_excerpt":"The goal is to modify the known method of mirror descent (MD), proposed by A.S. Nemirovsky and D.B. Yudin in 1979. The paper shows the idea of a new, so-called inertial MD method with the example of a deterministic optimization problem in continuous time. In particular, in the Euclidean case, the heavy ball method by B.T. Polyak is realized. It is noted that the new method does not use additional averaging. A discrete algorithm of inertial MD is described. The theorem on the upper bound on the error in the objective function is proved."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.01073","kind":"arxiv","version":1},"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:45:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hMJI7MtZLJWFUNNXN6xof4hkt3e/cgmQ6JVNxwO7F5VjyiND68LYtUOf19VIHxrK7ZuW5O2xUEcNUd2/Xh1+BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T07:00:58.846362Z"},"content_sha256":"c96018f53ac62adccad4212bd3b8a18ac9302f378c7a5aee3d6f10fab9284a8d","schema_version":"1.0","event_id":"sha256:c96018f53ac62adccad4212bd3b8a18ac9302f378c7a5aee3d6f10fab9284a8d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RICU4LGNQKVFO3IVXF3S64CARO/bundle.json","state_url":"https://pith.science/pith/RICU4LGNQKVFO3IVXF3S64CARO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RICU4LGNQKVFO3IVXF3S64CARO/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-07T07:00:58Z","links":{"resolver":"https://pith.science/pith/RICU4LGNQKVFO3IVXF3S64CARO","bundle":"https://pith.science/pith/RICU4LGNQKVFO3IVXF3S64CARO/bundle.json","state":"https://pith.science/pith/RICU4LGNQKVFO3IVXF3S64CARO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RICU4LGNQKVFO3IVXF3S64CARO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:RICU4LGNQKVFO3IVXF3S64CARO","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":"7e5cb359d5aec41ebb014225561a6d60fd33d9678c91b728e5fd4dd22807e1aa","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-05-02T16:59:21Z","title_canon_sha256":"3ceb69ad3cff644197c2ca368d1abfe71022dea80f3de66fd9c7dac4c2903411"},"schema_version":"1.0","source":{"id":"1705.01073","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.01073","created_at":"2026-05-18T00:45:09Z"},{"alias_kind":"arxiv_version","alias_value":"1705.01073v1","created_at":"2026-05-18T00:45:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.01073","created_at":"2026-05-18T00:45:09Z"},{"alias_kind":"pith_short_12","alias_value":"RICU4LGNQKVF","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"RICU4LGNQKVFO3IV","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"RICU4LGN","created_at":"2026-05-18T12:31:39Z"}],"graph_snapshots":[{"event_id":"sha256:c96018f53ac62adccad4212bd3b8a18ac9302f378c7a5aee3d6f10fab9284a8d","target":"graph","created_at":"2026-05-18T00:45:09Z","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":"The goal is to modify the known method of mirror descent (MD), proposed by A.S. Nemirovsky and D.B. Yudin in 1979. The paper shows the idea of a new, so-called inertial MD method with the example of a deterministic optimization problem in continuous time. In particular, in the Euclidean case, the heavy ball method by B.T. Polyak is realized. It is noted that the new method does not use additional averaging. A discrete algorithm of inertial MD is described. The theorem on the upper bound on the error in the objective function is proved.","authors_text":"Alexander Nazin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-05-02T16:59:21Z","title":"Algorithms of Inertial Mirror Descent in Convex Problems of Stochastic Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.01073","kind":"arxiv","version":1},"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:28a47da00b1e4675ce0743d536b25e526858adedb1cd7e9bf4ed3b042f06065b","target":"record","created_at":"2026-05-18T00:45:09Z","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":"7e5cb359d5aec41ebb014225561a6d60fd33d9678c91b728e5fd4dd22807e1aa","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-05-02T16:59:21Z","title_canon_sha256":"3ceb69ad3cff644197c2ca368d1abfe71022dea80f3de66fd9c7dac4c2903411"},"schema_version":"1.0","source":{"id":"1705.01073","kind":"arxiv","version":1}},"canonical_sha256":"8a054e2ccd82aa576d15b9772f70408baaa660e70fe9c5a18dd3c021bb4fac7d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8a054e2ccd82aa576d15b9772f70408baaa660e70fe9c5a18dd3c021bb4fac7d","first_computed_at":"2026-05-18T00:45:09.006466Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:45:09.006466Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OsBd8vyLL5zyHHVNCvyTMkfWitR6Oa+ovKCLHaeHkTiwV4AA+ae1L85EkgHBgpQpq3wq1yrRRtdZKVAKtKy5Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:45:09.007084Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.01073","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:28a47da00b1e4675ce0743d536b25e526858adedb1cd7e9bf4ed3b042f06065b","sha256:c96018f53ac62adccad4212bd3b8a18ac9302f378c7a5aee3d6f10fab9284a8d"],"state_sha256":"721e6730fc5a8d0cf4a9346175679d65ca86b2ec1071cc1c68a17f11828d0328"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/+riZ3+ZS8QzWFgiQvWt7it2raUWXXBi70MGyS/TVRYWdu0r9Goyol+FSk+iSafb6MKjf0aufy0QXVhop9ZfDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T07:00:58.849854Z","bundle_sha256":"a0e960e613596ca6e9558c64d2ec87e464651d2165ecb2630a1f64ff3d2fddd2"}}