{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:ECX7ULFA3Q4M2SHWISMTCAFQ5I","short_pith_number":"pith:ECX7ULFA","canonical_record":{"source":{"id":"1401.1792","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-01-08T19:50:51Z","cross_cats_sorted":[],"title_canon_sha256":"214871ee44ea5fb5279fb9fa8a841dfc9f45669b9512fa93e9ae4f912f186923","abstract_canon_sha256":"1d397cd29bf52c4d0b613ace9d9c9d251e77a76cd33c42b80f67386b51cd7d52"},"schema_version":"1.0"},"canonical_sha256":"20affa2ca0dc38cd48f644993100b0ea333c9ea1a1c39cc6568be69cc8d14c30","source":{"kind":"arxiv","id":"1401.1792","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.1792","created_at":"2026-05-18T03:02:57Z"},{"alias_kind":"arxiv_version","alias_value":"1401.1792v1","created_at":"2026-05-18T03:02:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.1792","created_at":"2026-05-18T03:02:57Z"},{"alias_kind":"pith_short_12","alias_value":"ECX7ULFA3Q4M","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"ECX7ULFA3Q4M2SHW","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"ECX7ULFA","created_at":"2026-05-18T12:28:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:ECX7ULFA3Q4M2SHWISMTCAFQ5I","target":"record","payload":{"canonical_record":{"source":{"id":"1401.1792","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-01-08T19:50:51Z","cross_cats_sorted":[],"title_canon_sha256":"214871ee44ea5fb5279fb9fa8a841dfc9f45669b9512fa93e9ae4f912f186923","abstract_canon_sha256":"1d397cd29bf52c4d0b613ace9d9c9d251e77a76cd33c42b80f67386b51cd7d52"},"schema_version":"1.0"},"canonical_sha256":"20affa2ca0dc38cd48f644993100b0ea333c9ea1a1c39cc6568be69cc8d14c30","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:02:57.806894Z","signature_b64":"YF/nUrwOsLR8i8TzkXBQZ+N4mv3s7KIvwV6sYFoFiuQbZr7AUvSYb9aQSMDzx3jgXMcepBBpzP9PA9+LwZZLCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"20affa2ca0dc38cd48f644993100b0ea333c9ea1a1c39cc6568be69cc8d14c30","last_reissued_at":"2026-05-18T03:02:57.805791Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:02:57.805791Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.1792","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-18T03:02:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fNj/sUORCfcjQyzTswMj/r3lRQrluOPyB8iIig3EuTQiVe4+y36avZqZ46Hcl6nkD+mWjeLYS8eeW2DN0xsdDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T04:26:38.888301Z"},"content_sha256":"d71f9dc6908ec5c4bc6e8efb54a1f9a4f10b2bfce451ee0cb590484dfb853078","schema_version":"1.0","event_id":"sha256:d71f9dc6908ec5c4bc6e8efb54a1f9a4f10b2bfce451ee0cb590484dfb853078"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:ECX7ULFA3Q4M2SHWISMTCAFQ5I","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Primal-dual subgradient methods for minimizing uniformly convex functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Anatoli Iouditski (LJK), Yuri Nesterov (CORE)","submitted_at":"2014-01-08T19:50:51Z","abstract_excerpt":"We discuss non-Euclidean deterministic and stochastic algorithms for optimization problems with strongly and uniformly convex objectives. We provide accuracy bounds for the performance of these algorithms and design methods which are adaptive with respect to the parameters of strong or uniform convexity of the objective: in the case when the total number of iterations $N$ is fixed, their accuracy coincides, up to a logarithmic in $N$ factor with the accuracy of optimal algorithms."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.1792","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-18T03:02:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mxWVCB0KT/Se/Q5jXUWgQTuxtgNqIK3UuzMHEBQsqpydZurTwhzYTMfe0pWNcrS1AO/TiVu23UeMsJJ9fKwnAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T04:26:38.888867Z"},"content_sha256":"a2215891fcc3525d35658986d855f316cff86d2a2ebecb9dd22d6f77f033886c","schema_version":"1.0","event_id":"sha256:a2215891fcc3525d35658986d855f316cff86d2a2ebecb9dd22d6f77f033886c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ECX7ULFA3Q4M2SHWISMTCAFQ5I/bundle.json","state_url":"https://pith.science/pith/ECX7ULFA3Q4M2SHWISMTCAFQ5I/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ECX7ULFA3Q4M2SHWISMTCAFQ5I/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-21T04:26:38Z","links":{"resolver":"https://pith.science/pith/ECX7ULFA3Q4M2SHWISMTCAFQ5I","bundle":"https://pith.science/pith/ECX7ULFA3Q4M2SHWISMTCAFQ5I/bundle.json","state":"https://pith.science/pith/ECX7ULFA3Q4M2SHWISMTCAFQ5I/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ECX7ULFA3Q4M2SHWISMTCAFQ5I/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:ECX7ULFA3Q4M2SHWISMTCAFQ5I","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":"1d397cd29bf52c4d0b613ace9d9c9d251e77a76cd33c42b80f67386b51cd7d52","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-01-08T19:50:51Z","title_canon_sha256":"214871ee44ea5fb5279fb9fa8a841dfc9f45669b9512fa93e9ae4f912f186923"},"schema_version":"1.0","source":{"id":"1401.1792","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.1792","created_at":"2026-05-18T03:02:57Z"},{"alias_kind":"arxiv_version","alias_value":"1401.1792v1","created_at":"2026-05-18T03:02:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.1792","created_at":"2026-05-18T03:02:57Z"},{"alias_kind":"pith_short_12","alias_value":"ECX7ULFA3Q4M","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"ECX7ULFA3Q4M2SHW","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"ECX7ULFA","created_at":"2026-05-18T12:28:25Z"}],"graph_snapshots":[{"event_id":"sha256:a2215891fcc3525d35658986d855f316cff86d2a2ebecb9dd22d6f77f033886c","target":"graph","created_at":"2026-05-18T03:02:57Z","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 discuss non-Euclidean deterministic and stochastic algorithms for optimization problems with strongly and uniformly convex objectives. We provide accuracy bounds for the performance of these algorithms and design methods which are adaptive with respect to the parameters of strong or uniform convexity of the objective: in the case when the total number of iterations $N$ is fixed, their accuracy coincides, up to a logarithmic in $N$ factor with the accuracy of optimal algorithms.","authors_text":"Anatoli Iouditski (LJK), Yuri Nesterov (CORE)","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-01-08T19:50:51Z","title":"Primal-dual subgradient methods for minimizing uniformly convex functions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.1792","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:d71f9dc6908ec5c4bc6e8efb54a1f9a4f10b2bfce451ee0cb590484dfb853078","target":"record","created_at":"2026-05-18T03:02:57Z","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":"1d397cd29bf52c4d0b613ace9d9c9d251e77a76cd33c42b80f67386b51cd7d52","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-01-08T19:50:51Z","title_canon_sha256":"214871ee44ea5fb5279fb9fa8a841dfc9f45669b9512fa93e9ae4f912f186923"},"schema_version":"1.0","source":{"id":"1401.1792","kind":"arxiv","version":1}},"canonical_sha256":"20affa2ca0dc38cd48f644993100b0ea333c9ea1a1c39cc6568be69cc8d14c30","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"20affa2ca0dc38cd48f644993100b0ea333c9ea1a1c39cc6568be69cc8d14c30","first_computed_at":"2026-05-18T03:02:57.805791Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:02:57.805791Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YF/nUrwOsLR8i8TzkXBQZ+N4mv3s7KIvwV6sYFoFiuQbZr7AUvSYb9aQSMDzx3jgXMcepBBpzP9PA9+LwZZLCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:02:57.806894Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.1792","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d71f9dc6908ec5c4bc6e8efb54a1f9a4f10b2bfce451ee0cb590484dfb853078","sha256:a2215891fcc3525d35658986d855f316cff86d2a2ebecb9dd22d6f77f033886c"],"state_sha256":"e5d202f164f1a5e193259ac90ca5e224e5f6bd9d25ae562e1518818eb35c6ee7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VA1RBmo7U4NUngYriRlX/VQM44OY+wY1efx9V+xFBUVqkeXRBQkxfyltElGGAGeghKFhRnA6LXRaRofZb5FwCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-21T04:26:38.894446Z","bundle_sha256":"0cdb33f2593b6237e0ad88478532c951c20bfe4557a5c9abd806bc0b4ecda65a"}}