{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:WYRNO4X7NASPNMML77H3HMTVHY","short_pith_number":"pith:WYRNO4X7","schema_version":"1.0","canonical_sha256":"b622d772ff6824f6b18bffcfb3b2753e10346092e5212e7f094ae60391eccf06","source":{"kind":"arxiv","id":"1903.08497","version":1},"attestation_state":"computed","paper":{"title":"Potential-based analyses of first-order methods for constrained and composite optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Courtney Paquette, Stephen Vavasis","submitted_at":"2019-03-20T13:21:26Z","abstract_excerpt":"We propose potential-based analyses for first-order algorithms applied to constrained and composite minimization problems. We first propose ``idealized'' frameworks for algorithms in the strongly and non-strongly convex cases and argue based on a potential that methods following the framework achieve the best possible rate. Then we show that the geometric descent (GD) algorithm by Bubeck et al.\\ as extended to the constrained and composite setting by Chen et al.\\ achieves this rate using the potential-based analysis for the strongly convex case. Next, we extend the GD algorithm to the case of "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1903.08497","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-03-20T13:21:26Z","cross_cats_sorted":[],"title_canon_sha256":"49a8c11d88dce62e228a61da516469dd6a75d50ca310a5253d80cefaa1441c7c","abstract_canon_sha256":"aa1211ed7d2eda7168fa59b7a4a51e070218a0347f131dac635beb7cefdf58b3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:50:47.953957Z","signature_b64":"3He0m8uvEMjny3VekZJemT9VfCTErpUC6BwPm0z2RLBBnj1DSFWs+FRCohsPFRU2pPu+QBLgLZ3CI/x0cRGzBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b622d772ff6824f6b18bffcfb3b2753e10346092e5212e7f094ae60391eccf06","last_reissued_at":"2026-05-17T23:50:47.953258Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:50:47.953258Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Potential-based analyses of first-order methods for constrained and composite optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Courtney Paquette, Stephen Vavasis","submitted_at":"2019-03-20T13:21:26Z","abstract_excerpt":"We propose potential-based analyses for first-order algorithms applied to constrained and composite minimization problems. We first propose ``idealized'' frameworks for algorithms in the strongly and non-strongly convex cases and argue based on a potential that methods following the framework achieve the best possible rate. Then we show that the geometric descent (GD) algorithm by Bubeck et al.\\ as extended to the constrained and composite setting by Chen et al.\\ achieves this rate using the potential-based analysis for the strongly convex case. Next, we extend the GD algorithm to the case of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.08497","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1903.08497","created_at":"2026-05-17T23:50:47.953369+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.08497v1","created_at":"2026-05-17T23:50:47.953369+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.08497","created_at":"2026-05-17T23:50:47.953369+00:00"},{"alias_kind":"pith_short_12","alias_value":"WYRNO4X7NASP","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_16","alias_value":"WYRNO4X7NASPNMML","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_8","alias_value":"WYRNO4X7","created_at":"2026-05-18T12:33:33.725879+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WYRNO4X7NASPNMML77H3HMTVHY","json":"https://pith.science/pith/WYRNO4X7NASPNMML77H3HMTVHY.json","graph_json":"https://pith.science/api/pith-number/WYRNO4X7NASPNMML77H3HMTVHY/graph.json","events_json":"https://pith.science/api/pith-number/WYRNO4X7NASPNMML77H3HMTVHY/events.json","paper":"https://pith.science/paper/WYRNO4X7"},"agent_actions":{"view_html":"https://pith.science/pith/WYRNO4X7NASPNMML77H3HMTVHY","download_json":"https://pith.science/pith/WYRNO4X7NASPNMML77H3HMTVHY.json","view_paper":"https://pith.science/paper/WYRNO4X7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.08497&json=true","fetch_graph":"https://pith.science/api/pith-number/WYRNO4X7NASPNMML77H3HMTVHY/graph.json","fetch_events":"https://pith.science/api/pith-number/WYRNO4X7NASPNMML77H3HMTVHY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WYRNO4X7NASPNMML77H3HMTVHY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WYRNO4X7NASPNMML77H3HMTVHY/action/storage_attestation","attest_author":"https://pith.science/pith/WYRNO4X7NASPNMML77H3HMTVHY/action/author_attestation","sign_citation":"https://pith.science/pith/WYRNO4X7NASPNMML77H3HMTVHY/action/citation_signature","submit_replication":"https://pith.science/pith/WYRNO4X7NASPNMML77H3HMTVHY/action/replication_record"}},"created_at":"2026-05-17T23:50:47.953369+00:00","updated_at":"2026-05-17T23:50:47.953369+00:00"}