{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:JWYZKSKVAQPKDKH5RSTWUTIRSP","short_pith_number":"pith:JWYZKSKV","schema_version":"1.0","canonical_sha256":"4db1954955041ea1a8fd8ca76a4d1193dfbe33d8e9b68e078f07cffdee5c714b","source":{"kind":"arxiv","id":"2501.10051","version":1},"attestation_state":"computed","paper":{"title":"A Family of Controllable Momentum Coefficients for Forward-Backward Accelerated Algorithms","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.NA","math.NA","stat.ML"],"primary_cat":"math.OC","authors_text":"Bin Shi, Mingwei Fu","submitted_at":"2025-01-17T09:15:18Z","abstract_excerpt":"Nesterov's accelerated gradient method (NAG) marks a pivotal advancement in gradient-based optimization, achieving faster convergence compared to the vanilla gradient descent method for convex functions. However, its algorithmic complexity when applied to strongly convex functions remains unknown, as noted in the comprehensive review by Chambolle and Pock [2016]. This issue, aside from the critical step size, was addressed by Li et al. [2024b], with the monotonic case further explored by Fu and Shi [2024]. In this paper, we introduce a family of controllable momentum coefficients for forward-b"},"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":"2501.10051","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.OC","submitted_at":"2025-01-17T09:15:18Z","cross_cats_sorted":["cs.NA","math.NA","stat.ML"],"title_canon_sha256":"cfcf01fdef786212d91948b194cb9b709b96970f87c6827b48ecaf466bd3d274","abstract_canon_sha256":"0d495904d317f4a37f4102f8d65be59d85a2ddbcf45dce00de0d481bdc6f62d5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:02:20.652165Z","signature_b64":"DQ6+zqWRz1+vzD0nJycp1G/XOIx2OUBIqthGK4HU4yVYTeTQOxfwhbG/tgjZT89KM/UhG8/Ex0TQ9aAXg58sBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4db1954955041ea1a8fd8ca76a4d1193dfbe33d8e9b68e078f07cffdee5c714b","last_reissued_at":"2026-07-05T10:02:20.651677Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:02:20.651677Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Family of Controllable Momentum Coefficients for Forward-Backward Accelerated Algorithms","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.NA","math.NA","stat.ML"],"primary_cat":"math.OC","authors_text":"Bin Shi, Mingwei Fu","submitted_at":"2025-01-17T09:15:18Z","abstract_excerpt":"Nesterov's accelerated gradient method (NAG) marks a pivotal advancement in gradient-based optimization, achieving faster convergence compared to the vanilla gradient descent method for convex functions. However, its algorithmic complexity when applied to strongly convex functions remains unknown, as noted in the comprehensive review by Chambolle and Pock [2016]. This issue, aside from the critical step size, was addressed by Li et al. [2024b], with the monotonic case further explored by Fu and Shi [2024]. In this paper, we introduce a family of controllable momentum coefficients for forward-b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.10051","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/2501.10051/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2501.10051","created_at":"2026-07-05T10:02:20.651743+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.10051v1","created_at":"2026-07-05T10:02:20.651743+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.10051","created_at":"2026-07-05T10:02:20.651743+00:00"},{"alias_kind":"pith_short_12","alias_value":"JWYZKSKVAQPK","created_at":"2026-07-05T10:02:20.651743+00:00"},{"alias_kind":"pith_short_16","alias_value":"JWYZKSKVAQPKDKH5","created_at":"2026-07-05T10:02:20.651743+00:00"},{"alias_kind":"pith_short_8","alias_value":"JWYZKSKV","created_at":"2026-07-05T10:02:20.651743+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.29206","citing_title":"Modern Theory of Gradient-Based Optimization","ref_index":14,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JWYZKSKVAQPKDKH5RSTWUTIRSP","json":"https://pith.science/pith/JWYZKSKVAQPKDKH5RSTWUTIRSP.json","graph_json":"https://pith.science/api/pith-number/JWYZKSKVAQPKDKH5RSTWUTIRSP/graph.json","events_json":"https://pith.science/api/pith-number/JWYZKSKVAQPKDKH5RSTWUTIRSP/events.json","paper":"https://pith.science/paper/JWYZKSKV"},"agent_actions":{"view_html":"https://pith.science/pith/JWYZKSKVAQPKDKH5RSTWUTIRSP","download_json":"https://pith.science/pith/JWYZKSKVAQPKDKH5RSTWUTIRSP.json","view_paper":"https://pith.science/paper/JWYZKSKV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.10051&json=true","fetch_graph":"https://pith.science/api/pith-number/JWYZKSKVAQPKDKH5RSTWUTIRSP/graph.json","fetch_events":"https://pith.science/api/pith-number/JWYZKSKVAQPKDKH5RSTWUTIRSP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JWYZKSKVAQPKDKH5RSTWUTIRSP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JWYZKSKVAQPKDKH5RSTWUTIRSP/action/storage_attestation","attest_author":"https://pith.science/pith/JWYZKSKVAQPKDKH5RSTWUTIRSP/action/author_attestation","sign_citation":"https://pith.science/pith/JWYZKSKVAQPKDKH5RSTWUTIRSP/action/citation_signature","submit_replication":"https://pith.science/pith/JWYZKSKVAQPKDKH5RSTWUTIRSP/action/replication_record"}},"created_at":"2026-07-05T10:02:20.651743+00:00","updated_at":"2026-07-05T10:02:20.651743+00:00"}