{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:VBJJJF7EXHAFBAIKHGHXXICVF2","short_pith_number":"pith:VBJJJF7E","canonical_record":{"source":{"id":"2307.11134","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2023-07-20T16:27:12Z","cross_cats_sorted":[],"title_canon_sha256":"5d826d7c3974fe5c43451a9b247570cc8169a2a316fd110cb2d256a3941b76a4","abstract_canon_sha256":"895d5bf324f782c65c33b5d802a982a616e25714b5172cc9333df60c6f898509"},"schema_version":"1.0"},"canonical_sha256":"a8529497e4b9c050810a398f7ba0552e8953daf8bcf80f630236de216e586826","source":{"kind":"arxiv","id":"2307.11134","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2307.11134","created_at":"2026-07-05T06:33:23Z"},{"alias_kind":"arxiv_version","alias_value":"2307.11134v1","created_at":"2026-07-05T06:33:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.11134","created_at":"2026-07-05T06:33:23Z"},{"alias_kind":"pith_short_12","alias_value":"VBJJJF7EXHAF","created_at":"2026-07-05T06:33:23Z"},{"alias_kind":"pith_short_16","alias_value":"VBJJJF7EXHAFBAIK","created_at":"2026-07-05T06:33:23Z"},{"alias_kind":"pith_short_8","alias_value":"VBJJJF7E","created_at":"2026-07-05T06:33:23Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:VBJJJF7EXHAFBAIKHGHXXICVF2","target":"record","payload":{"canonical_record":{"source":{"id":"2307.11134","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2023-07-20T16:27:12Z","cross_cats_sorted":[],"title_canon_sha256":"5d826d7c3974fe5c43451a9b247570cc8169a2a316fd110cb2d256a3941b76a4","abstract_canon_sha256":"895d5bf324f782c65c33b5d802a982a616e25714b5172cc9333df60c6f898509"},"schema_version":"1.0"},"canonical_sha256":"a8529497e4b9c050810a398f7ba0552e8953daf8bcf80f630236de216e586826","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:33:23.988535Z","signature_b64":"FCtOER2c96VLiAcq7zu0qqUQcIlbS341Yq8MJoCMpzhc+nlj2nx4pq+kzFqVUZPwpOpY0dpqKq4VCCLZUqhdCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a8529497e4b9c050810a398f7ba0552e8953daf8bcf80f630236de216e586826","last_reissued_at":"2026-07-05T06:33:23.988105Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:33:23.988105Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2307.11134","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-07-05T06:33:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Eq2kDfK6MUC83DUC/m7gbi//eqmEGa8uVdJDajp5KptHZU6WM5pQfrCvg/5skWR4IAzFHBkNbbivOxnc6O6fCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T07:06:09.439097Z"},"content_sha256":"98d6c24265b1b2f8a48e03e8b02ff1888962dcda4dcb6752286b5a9cc02d33be","schema_version":"1.0","event_id":"sha256:98d6c24265b1b2f8a48e03e8b02ff1888962dcda4dcb6752286b5a9cc02d33be"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:VBJJJF7EXHAFBAIKHGHXXICVF2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Exact convergence rate of the last iterate in subgradient methods","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Fran\\c{c}ois Glineur, Moslem Zamani","submitted_at":"2023-07-20T16:27:12Z","abstract_excerpt":"We study the convergence of the last iterate in subgradient methods applied to the minimization of a nonsmooth convex function with bounded subgradients.\n  We first introduce a proof technique that generalizes the standard analysis of subgradient methods. It is based on tracking the distance between the current iterate and a different reference point at each iteration. Using this technique, we obtain the exact worst-case convergence rate for the objective accuracy of the last iterate of the projected subgradient method with either constant step sizes or constant step lengths. Tightness is show"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.11134","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2307.11134/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T06:33:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Qw2IwEbQHCtR870AZFn4GAco2gIQTYt6NG6t3fzvXMtQ3/v5xTbCxHuTqmCjifumbQzwnwhAGzc5qfJqHawbCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T07:06:09.439604Z"},"content_sha256":"bf6df93b498b6b555199c85c544445a8765b41933e6fff1ce64ee038cf76a969","schema_version":"1.0","event_id":"sha256:bf6df93b498b6b555199c85c544445a8765b41933e6fff1ce64ee038cf76a969"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VBJJJF7EXHAFBAIKHGHXXICVF2/bundle.json","state_url":"https://pith.science/pith/VBJJJF7EXHAFBAIKHGHXXICVF2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VBJJJF7EXHAFBAIKHGHXXICVF2/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-05T07:06:09Z","links":{"resolver":"https://pith.science/pith/VBJJJF7EXHAFBAIKHGHXXICVF2","bundle":"https://pith.science/pith/VBJJJF7EXHAFBAIKHGHXXICVF2/bundle.json","state":"https://pith.science/pith/VBJJJF7EXHAFBAIKHGHXXICVF2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VBJJJF7EXHAFBAIKHGHXXICVF2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:VBJJJF7EXHAFBAIKHGHXXICVF2","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":"895d5bf324f782c65c33b5d802a982a616e25714b5172cc9333df60c6f898509","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2023-07-20T16:27:12Z","title_canon_sha256":"5d826d7c3974fe5c43451a9b247570cc8169a2a316fd110cb2d256a3941b76a4"},"schema_version":"1.0","source":{"id":"2307.11134","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2307.11134","created_at":"2026-07-05T06:33:23Z"},{"alias_kind":"arxiv_version","alias_value":"2307.11134v1","created_at":"2026-07-05T06:33:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.11134","created_at":"2026-07-05T06:33:23Z"},{"alias_kind":"pith_short_12","alias_value":"VBJJJF7EXHAF","created_at":"2026-07-05T06:33:23Z"},{"alias_kind":"pith_short_16","alias_value":"VBJJJF7EXHAFBAIK","created_at":"2026-07-05T06:33:23Z"},{"alias_kind":"pith_short_8","alias_value":"VBJJJF7E","created_at":"2026-07-05T06:33:23Z"}],"graph_snapshots":[{"event_id":"sha256:bf6df93b498b6b555199c85c544445a8765b41933e6fff1ce64ee038cf76a969","target":"graph","created_at":"2026-07-05T06:33:23Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2307.11134/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study the convergence of the last iterate in subgradient methods applied to the minimization of a nonsmooth convex function with bounded subgradients.\n  We first introduce a proof technique that generalizes the standard analysis of subgradient methods. It is based on tracking the distance between the current iterate and a different reference point at each iteration. Using this technique, we obtain the exact worst-case convergence rate for the objective accuracy of the last iterate of the projected subgradient method with either constant step sizes or constant step lengths. Tightness is show","authors_text":"Fran\\c{c}ois Glineur, Moslem Zamani","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2023-07-20T16:27:12Z","title":"Exact convergence rate of the last iterate in subgradient methods"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.11134","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:98d6c24265b1b2f8a48e03e8b02ff1888962dcda4dcb6752286b5a9cc02d33be","target":"record","created_at":"2026-07-05T06:33:23Z","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":"895d5bf324f782c65c33b5d802a982a616e25714b5172cc9333df60c6f898509","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2023-07-20T16:27:12Z","title_canon_sha256":"5d826d7c3974fe5c43451a9b247570cc8169a2a316fd110cb2d256a3941b76a4"},"schema_version":"1.0","source":{"id":"2307.11134","kind":"arxiv","version":1}},"canonical_sha256":"a8529497e4b9c050810a398f7ba0552e8953daf8bcf80f630236de216e586826","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a8529497e4b9c050810a398f7ba0552e8953daf8bcf80f630236de216e586826","first_computed_at":"2026-07-05T06:33:23.988105Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:33:23.988105Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FCtOER2c96VLiAcq7zu0qqUQcIlbS341Yq8MJoCMpzhc+nlj2nx4pq+kzFqVUZPwpOpY0dpqKq4VCCLZUqhdCA==","signature_status":"signed_v1","signed_at":"2026-07-05T06:33:23.988535Z","signed_message":"canonical_sha256_bytes"},"source_id":"2307.11134","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:98d6c24265b1b2f8a48e03e8b02ff1888962dcda4dcb6752286b5a9cc02d33be","sha256:bf6df93b498b6b555199c85c544445a8765b41933e6fff1ce64ee038cf76a969"],"state_sha256":"0d0fa23f40a3cd309232f7f4701cb5a570c0be08f8f7ae312f22ce52acbc1afd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GgiofBpawnF0nAeBTI9b21xtDgUjFkS/uAiQmCOuSiDU6rVkQGyKyek/bP93HDegr8MUTBJiJvSUhAu8doQtBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T07:06:09.444295Z","bundle_sha256":"020da515f55e1082083170c84cccfdf91d0694e08b0166b3f0d4678493a9ec61"}}