{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:K5D3623CPPBJDZIXGICD2EWOQ3","short_pith_number":"pith:K5D3623C","schema_version":"1.0","canonical_sha256":"5747bf6b627bc291e51732043d12ce86d447c70507c4e492ec753c8f26c16609","source":{"kind":"arxiv","id":"2605.17731","version":1},"attestation_state":"computed","paper":{"title":"A reflected forward-backward splitting algorithmic framework","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Haowen Zheng, Qiao-Li Dong, Shuangbao Li, Yongyu Fu","submitted_at":"2026-05-18T01:27:51Z","abstract_excerpt":"In this paper, we propose a reflected forward-backward splitting algorithic framework for finding a zero of the sum of finitely many monotone op-erators, including maximally monotone operators, cocoercive operators, and monotone and Lipschitz continuous operators. We provide a unified convergence analysis under mild conditions, eliminating the need to analyze the convergence of each algorithm individually. The heuristic strategies for matrix selections are proposed through a numerical experiment, based on which a new algorithm is derived. A further numerical experiment on the regularized saddl"},"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":"2605.17731","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-05-18T01:27:51Z","cross_cats_sorted":[],"title_canon_sha256":"6597af9ceb0e0b3f992496c94e14223363db4fc734d8a02e9e622edaa38bea07","abstract_canon_sha256":"599d1b79273a2feb50fd229653420f22bf6201af71150e1350a4089703f80267"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:04:55.224127Z","signature_b64":"wvKpk7V10+LgTPvX9z3AL1AliiT4pyE2R4kfnKsBIRxQBgQyUM01l270OlQ+8R8BQtBwN8ZCTPSRPFu/eFTgBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5747bf6b627bc291e51732043d12ce86d447c70507c4e492ec753c8f26c16609","last_reissued_at":"2026-05-20T00:04:55.223354Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:04:55.223354Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A reflected forward-backward splitting algorithmic framework","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Haowen Zheng, Qiao-Li Dong, Shuangbao Li, Yongyu Fu","submitted_at":"2026-05-18T01:27:51Z","abstract_excerpt":"In this paper, we propose a reflected forward-backward splitting algorithic framework for finding a zero of the sum of finitely many monotone op-erators, including maximally monotone operators, cocoercive operators, and monotone and Lipschitz continuous operators. We provide a unified convergence analysis under mild conditions, eliminating the need to analyze the convergence of each algorithm individually. The heuristic strategies for matrix selections are proposed through a numerical experiment, based on which a new algorithm is derived. A further numerical experiment on the regularized saddl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.17731","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/2605.17731/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":"2605.17731","created_at":"2026-05-20T00:04:55.223507+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.17731v1","created_at":"2026-05-20T00:04:55.223507+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.17731","created_at":"2026-05-20T00:04:55.223507+00:00"},{"alias_kind":"pith_short_12","alias_value":"K5D3623CPPBJ","created_at":"2026-05-20T00:04:55.223507+00:00"},{"alias_kind":"pith_short_16","alias_value":"K5D3623CPPBJDZIX","created_at":"2026-05-20T00:04:55.223507+00:00"},{"alias_kind":"pith_short_8","alias_value":"K5D3623C","created_at":"2026-05-20T00:04:55.223507+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/K5D3623CPPBJDZIXGICD2EWOQ3","json":"https://pith.science/pith/K5D3623CPPBJDZIXGICD2EWOQ3.json","graph_json":"https://pith.science/api/pith-number/K5D3623CPPBJDZIXGICD2EWOQ3/graph.json","events_json":"https://pith.science/api/pith-number/K5D3623CPPBJDZIXGICD2EWOQ3/events.json","paper":"https://pith.science/paper/K5D3623C"},"agent_actions":{"view_html":"https://pith.science/pith/K5D3623CPPBJDZIXGICD2EWOQ3","download_json":"https://pith.science/pith/K5D3623CPPBJDZIXGICD2EWOQ3.json","view_paper":"https://pith.science/paper/K5D3623C","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.17731&json=true","fetch_graph":"https://pith.science/api/pith-number/K5D3623CPPBJDZIXGICD2EWOQ3/graph.json","fetch_events":"https://pith.science/api/pith-number/K5D3623CPPBJDZIXGICD2EWOQ3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K5D3623CPPBJDZIXGICD2EWOQ3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K5D3623CPPBJDZIXGICD2EWOQ3/action/storage_attestation","attest_author":"https://pith.science/pith/K5D3623CPPBJDZIXGICD2EWOQ3/action/author_attestation","sign_citation":"https://pith.science/pith/K5D3623CPPBJDZIXGICD2EWOQ3/action/citation_signature","submit_replication":"https://pith.science/pith/K5D3623CPPBJDZIXGICD2EWOQ3/action/replication_record"}},"created_at":"2026-05-20T00:04:55.223507+00:00","updated_at":"2026-05-20T00:04:55.223507+00:00"}