{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:PZOQQKRJUXXMOAR3TWKJSEKDRS","short_pith_number":"pith:PZOQQKRJ","canonical_record":{"source":{"id":"1403.6526","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-03-25T22:41:52Z","cross_cats_sorted":[],"title_canon_sha256":"dd62efe4a8c8b13313a710ac2731b5be4aff0804b571925545a2717001ffa10f","abstract_canon_sha256":"4ba64ee1a527e19fe47024aab8dea0b962266dd3e9b348c739f152adb9fd3b75"},"schema_version":"1.0"},"canonical_sha256":"7e5d082a29a5eec7023b9d949911438c86fe73663b7dc2ecd02528fb3a13ff81","source":{"kind":"arxiv","id":"1403.6526","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.6526","created_at":"2026-05-18T01:08:32Z"},{"alias_kind":"arxiv_version","alias_value":"1403.6526v3","created_at":"2026-05-18T01:08:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.6526","created_at":"2026-05-18T01:08:32Z"},{"alias_kind":"pith_short_12","alias_value":"PZOQQKRJUXXM","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"PZOQQKRJUXXMOAR3","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"PZOQQKRJ","created_at":"2026-05-18T12:28:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:PZOQQKRJUXXMOAR3TWKJSEKDRS","target":"record","payload":{"canonical_record":{"source":{"id":"1403.6526","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-03-25T22:41:52Z","cross_cats_sorted":[],"title_canon_sha256":"dd62efe4a8c8b13313a710ac2731b5be4aff0804b571925545a2717001ffa10f","abstract_canon_sha256":"4ba64ee1a527e19fe47024aab8dea0b962266dd3e9b348c739f152adb9fd3b75"},"schema_version":"1.0"},"canonical_sha256":"7e5d082a29a5eec7023b9d949911438c86fe73663b7dc2ecd02528fb3a13ff81","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:08:32.724107Z","signature_b64":"dtbekAxHqtOF0e5DaKj229i8du/eKftqpYV1ym4r2qmOh2DA9j8UDifn6mgX02wz6GMEmYbZhKN+jP2GCxxpCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7e5d082a29a5eec7023b9d949911438c86fe73663b7dc2ecd02528fb3a13ff81","last_reissued_at":"2026-05-18T01:08:32.723570Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:08:32.723570Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1403.6526","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-18T01:08:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vmUosvKi5zETpHes/5vISYW9XN7sfSG8W3foeIhgJH3U8bO6Y2tsuimBFPguFmiKJy9g+5lFE1TIBauowoPLCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T20:28:40.330627Z"},"content_sha256":"c923c17178a01fc9aaae22756fc56aad66c6a5ec3c2dfcc05cd937a9cf7e83ea","schema_version":"1.0","event_id":"sha256:c923c17178a01fc9aaae22756fc56aad66c6a5ec3c2dfcc05cd937a9cf7e83ea"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:PZOQQKRJUXXMOAR3TWKJSEKDRS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Family of Subgradient-Based Methods for Convex Optimization Problems in a Unifying Framework","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Masaru Ito, Mituhiro Fukuda","submitted_at":"2014-03-25T22:41:52Z","abstract_excerpt":"We propose a new family of subgradient- and gradient-based methods which converges with optimal complexity for convex optimization problems whose feasible region is simple enough. This includes cases where the objective function is non-smooth, smooth, have composite/saddle structure, or are given by an inexact oracle model. We unified the way of constructing the subproblems which are necessary to be solved at each iteration of these methods. This permitted us to analyze the convergence of these methods in a unified way compared to previous results which required different approaches for each m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.6526","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-18T01:08:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FRRUeOuI2oZqa8m9yZAxEpZppjUGZKq/8Y/R4r/GfxkMohBhk6/8b7BsWtZNJYtLxN328Ghf0PZSWcwIK7tWAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T20:28:40.330967Z"},"content_sha256":"bb4930cca324d9987ef2b4858b2cfd8f3e29ea497902ac75799769b579fa55b1","schema_version":"1.0","event_id":"sha256:bb4930cca324d9987ef2b4858b2cfd8f3e29ea497902ac75799769b579fa55b1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PZOQQKRJUXXMOAR3TWKJSEKDRS/bundle.json","state_url":"https://pith.science/pith/PZOQQKRJUXXMOAR3TWKJSEKDRS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PZOQQKRJUXXMOAR3TWKJSEKDRS/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-29T20:28:40Z","links":{"resolver":"https://pith.science/pith/PZOQQKRJUXXMOAR3TWKJSEKDRS","bundle":"https://pith.science/pith/PZOQQKRJUXXMOAR3TWKJSEKDRS/bundle.json","state":"https://pith.science/pith/PZOQQKRJUXXMOAR3TWKJSEKDRS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PZOQQKRJUXXMOAR3TWKJSEKDRS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:PZOQQKRJUXXMOAR3TWKJSEKDRS","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":"4ba64ee1a527e19fe47024aab8dea0b962266dd3e9b348c739f152adb9fd3b75","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-03-25T22:41:52Z","title_canon_sha256":"dd62efe4a8c8b13313a710ac2731b5be4aff0804b571925545a2717001ffa10f"},"schema_version":"1.0","source":{"id":"1403.6526","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.6526","created_at":"2026-05-18T01:08:32Z"},{"alias_kind":"arxiv_version","alias_value":"1403.6526v3","created_at":"2026-05-18T01:08:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.6526","created_at":"2026-05-18T01:08:32Z"},{"alias_kind":"pith_short_12","alias_value":"PZOQQKRJUXXM","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"PZOQQKRJUXXMOAR3","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"PZOQQKRJ","created_at":"2026-05-18T12:28:43Z"}],"graph_snapshots":[{"event_id":"sha256:bb4930cca324d9987ef2b4858b2cfd8f3e29ea497902ac75799769b579fa55b1","target":"graph","created_at":"2026-05-18T01:08:32Z","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 propose a new family of subgradient- and gradient-based methods which converges with optimal complexity for convex optimization problems whose feasible region is simple enough. This includes cases where the objective function is non-smooth, smooth, have composite/saddle structure, or are given by an inexact oracle model. We unified the way of constructing the subproblems which are necessary to be solved at each iteration of these methods. This permitted us to analyze the convergence of these methods in a unified way compared to previous results which required different approaches for each m","authors_text":"Masaru Ito, Mituhiro Fukuda","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-03-25T22:41:52Z","title":"A Family of Subgradient-Based Methods for Convex Optimization Problems in a Unifying Framework"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.6526","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:c923c17178a01fc9aaae22756fc56aad66c6a5ec3c2dfcc05cd937a9cf7e83ea","target":"record","created_at":"2026-05-18T01:08:32Z","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":"4ba64ee1a527e19fe47024aab8dea0b962266dd3e9b348c739f152adb9fd3b75","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-03-25T22:41:52Z","title_canon_sha256":"dd62efe4a8c8b13313a710ac2731b5be4aff0804b571925545a2717001ffa10f"},"schema_version":"1.0","source":{"id":"1403.6526","kind":"arxiv","version":3}},"canonical_sha256":"7e5d082a29a5eec7023b9d949911438c86fe73663b7dc2ecd02528fb3a13ff81","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7e5d082a29a5eec7023b9d949911438c86fe73663b7dc2ecd02528fb3a13ff81","first_computed_at":"2026-05-18T01:08:32.723570Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:08:32.723570Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dtbekAxHqtOF0e5DaKj229i8du/eKftqpYV1ym4r2qmOh2DA9j8UDifn6mgX02wz6GMEmYbZhKN+jP2GCxxpCA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:08:32.724107Z","signed_message":"canonical_sha256_bytes"},"source_id":"1403.6526","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c923c17178a01fc9aaae22756fc56aad66c6a5ec3c2dfcc05cd937a9cf7e83ea","sha256:bb4930cca324d9987ef2b4858b2cfd8f3e29ea497902ac75799769b579fa55b1"],"state_sha256":"7096622c80080cbaeff353bb992a046abb6835d692c5b3b18a42f1475d4f9e28"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6Ib6WO81q9xrJcotNGaJbl7sqzzrPXw+lbND7Hft6nhV2V7KRWPzLxd1AFu381BwBVDc1ih3cYUi/IvI/P+yCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T20:28:40.333023Z","bundle_sha256":"4b97f969e1a2953f0379a6019fc95b7991d3af8c8f4d1f28e66119411d8d105d"}}