{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:DYZAJHEZCV623QOXZI4EYTLOZL","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":"785602ce9ad846ba5df48adc92a9b4367ca528f73ab512b7375f75e592d7a69d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-01-07T11:42:19Z","title_canon_sha256":"ebbbad8a1a2bb9e59188850edd68e8c84a840bd076300e81758c27e83f3faa2a"},"schema_version":"1.0","source":{"id":"1501.01451","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.01451","created_at":"2026-05-18T02:29:54Z"},{"alias_kind":"arxiv_version","alias_value":"1501.01451v1","created_at":"2026-05-18T02:29:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.01451","created_at":"2026-05-18T02:29:54Z"},{"alias_kind":"pith_short_12","alias_value":"DYZAJHEZCV62","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"DYZAJHEZCV623QOX","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"DYZAJHEZ","created_at":"2026-05-18T12:29:17Z"}],"graph_snapshots":[{"event_id":"sha256:c684e3bed3bb06da8769534a21deb5543857dd4ec2a2cf83769ddebbaa93fb91","target":"graph","created_at":"2026-05-18T02:29:54Z","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":"This paper shows that the optimal subgradient algorithm, OSGA, proposed in \\cite{NeuO} can be used for solving structured large-scale convex constrained optimization problems. Only first-order information is required, and the optimal complexity bounds for both smooth and nonsmooth problems are attained. More specifically, we consider two classes of problems: (i) a convex objective with a simple closed convex domain, where the orthogonal projection on this feasible domain is efficiently available; (ii) a convex objective with a simple convex functional constraint. If we equip OSGA with an appro","authors_text":"Arnold Neumaier, Masoud Ahookhosh","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-01-07T11:42:19Z","title":"An optimal subgradient algorithm for large-scale convex optimization in simple domains"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.01451","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:a30a23bb96005abd344dbb45a93c233327025359d06fc4995dc2393f1ce9838b","target":"record","created_at":"2026-05-18T02:29:54Z","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":"785602ce9ad846ba5df48adc92a9b4367ca528f73ab512b7375f75e592d7a69d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-01-07T11:42:19Z","title_canon_sha256":"ebbbad8a1a2bb9e59188850edd68e8c84a840bd076300e81758c27e83f3faa2a"},"schema_version":"1.0","source":{"id":"1501.01451","kind":"arxiv","version":1}},"canonical_sha256":"1e32049c99157dadc1d7ca384c4d6ecad2a264dc28853adebfdbe5b43e455056","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1e32049c99157dadc1d7ca384c4d6ecad2a264dc28853adebfdbe5b43e455056","first_computed_at":"2026-05-18T02:29:54.195210Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:29:54.195210Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3DpqSwdKGuSjniGgkZn/TAAXCmCgjZwd9ghBrEDflskZ7ISHmr2WFRdhftpDntmhPyj4889a5iKrleaaHNRoBw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:29:54.195673Z","signed_message":"canonical_sha256_bytes"},"source_id":"1501.01451","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a30a23bb96005abd344dbb45a93c233327025359d06fc4995dc2393f1ce9838b","sha256:c684e3bed3bb06da8769534a21deb5543857dd4ec2a2cf83769ddebbaa93fb91"],"state_sha256":"ea03361476a654a02009342e662dfcdf0719d29bfa0bfbcf277d9321bf748bab"}