{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:R6KOJO225IVMBLAPEPCOXTLPXV","short_pith_number":"pith:R6KOJO22","schema_version":"1.0","canonical_sha256":"8f94e4bb5aea2ac0ac0f23c4ebcd6fbd68d8048a4e080aae76dea9bd857f3ad9","source":{"kind":"arxiv","id":"2504.10999","version":1},"attestation_state":"computed","paper":{"title":"Splitting the Forward-Backward Algorithm: A Full Characterization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Anton {\\AA}kerman, Emanuele Naldi, Enis Chenchene, Pontus Giselsson","submitted_at":"2025-04-15T09:15:58Z","abstract_excerpt":"We study frugal splitting algorithms with minimal lifting for solving monotone inclusion problems involving sums of maximal monotone and cocoercive operators. Building on a foundational result by Ryu, we fully characterize all methods that use only individual resolvent evaluations, direct evaluations of cocoercive operators, and minimal memory resources while ensuring convergence via averaged fixed-point iterations. We show that all such methods are captured by a unified framework, which includes known schemes and enables new ones with promising features. Systematic numerical experiments lead "},"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":"2504.10999","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-04-15T09:15:58Z","cross_cats_sorted":[],"title_canon_sha256":"a422098f54ae944013c178b082f97a8c1b1c3fddba6692c24e4a0278e03481fe","abstract_canon_sha256":"b3e1f98466f8f7f29d2b369d763b09e43ae09315742227fcab90702763841091"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:49:27.586941Z","signature_b64":"/8OXt3LHuvVP6veIM1/XDWb0UGZa5Q46hkxFB1PSxQRdFMufJI+pMhQ8rfSsIVUf369n7IcYnoZ78yrinecIDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8f94e4bb5aea2ac0ac0f23c4ebcd6fbd68d8048a4e080aae76dea9bd857f3ad9","last_reissued_at":"2026-07-05T10:49:27.586464Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:49:27.586464Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Splitting the Forward-Backward Algorithm: A Full Characterization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Anton {\\AA}kerman, Emanuele Naldi, Enis Chenchene, Pontus Giselsson","submitted_at":"2025-04-15T09:15:58Z","abstract_excerpt":"We study frugal splitting algorithms with minimal lifting for solving monotone inclusion problems involving sums of maximal monotone and cocoercive operators. Building on a foundational result by Ryu, we fully characterize all methods that use only individual resolvent evaluations, direct evaluations of cocoercive operators, and minimal memory resources while ensuring convergence via averaged fixed-point iterations. We show that all such methods are captured by a unified framework, which includes known schemes and enables new ones with promising features. Systematic numerical experiments lead "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.10999","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/2504.10999/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":"2504.10999","created_at":"2026-07-05T10:49:27.586524+00:00"},{"alias_kind":"arxiv_version","alias_value":"2504.10999v1","created_at":"2026-07-05T10:49:27.586524+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.10999","created_at":"2026-07-05T10:49:27.586524+00:00"},{"alias_kind":"pith_short_12","alias_value":"R6KOJO225IVM","created_at":"2026-07-05T10:49:27.586524+00:00"},{"alias_kind":"pith_short_16","alias_value":"R6KOJO225IVMBLAP","created_at":"2026-07-05T10:49:27.586524+00:00"},{"alias_kind":"pith_short_8","alias_value":"R6KOJO22","created_at":"2026-07-05T10:49:27.586524+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":5,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.28010","citing_title":"A primal-dual splitting algorithm for monotone inclusions with applications","ref_index":27,"is_internal_anchor":false},{"citing_arxiv_id":"2504.14987","citing_title":"A general approach to distributed operator splitting","ref_index":1,"is_internal_anchor":false},{"citing_arxiv_id":"2605.17731","citing_title":"A reflected forward-backward splitting algorithmic framework","ref_index":1,"is_internal_anchor":false},{"citing_arxiv_id":"2512.10366","citing_title":"Primal-dual splitting for structured composite monotone inclusions with or without cocoercivity","ref_index":1,"is_internal_anchor":false},{"citing_arxiv_id":"2605.11929","citing_title":"Convergence of zeroth-order proximal point algorithms in the high-temperature regime","ref_index":66,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/R6KOJO225IVMBLAPEPCOXTLPXV","json":"https://pith.science/pith/R6KOJO225IVMBLAPEPCOXTLPXV.json","graph_json":"https://pith.science/api/pith-number/R6KOJO225IVMBLAPEPCOXTLPXV/graph.json","events_json":"https://pith.science/api/pith-number/R6KOJO225IVMBLAPEPCOXTLPXV/events.json","paper":"https://pith.science/paper/R6KOJO22"},"agent_actions":{"view_html":"https://pith.science/pith/R6KOJO225IVMBLAPEPCOXTLPXV","download_json":"https://pith.science/pith/R6KOJO225IVMBLAPEPCOXTLPXV.json","view_paper":"https://pith.science/paper/R6KOJO22","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2504.10999&json=true","fetch_graph":"https://pith.science/api/pith-number/R6KOJO225IVMBLAPEPCOXTLPXV/graph.json","fetch_events":"https://pith.science/api/pith-number/R6KOJO225IVMBLAPEPCOXTLPXV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/R6KOJO225IVMBLAPEPCOXTLPXV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/R6KOJO225IVMBLAPEPCOXTLPXV/action/storage_attestation","attest_author":"https://pith.science/pith/R6KOJO225IVMBLAPEPCOXTLPXV/action/author_attestation","sign_citation":"https://pith.science/pith/R6KOJO225IVMBLAPEPCOXTLPXV/action/citation_signature","submit_replication":"https://pith.science/pith/R6KOJO225IVMBLAPEPCOXTLPXV/action/replication_record"}},"created_at":"2026-07-05T10:49:27.586524+00:00","updated_at":"2026-07-05T10:49:27.586524+00:00"}