{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:R6KOJO225IVMBLAPEPCOXTLPXV","short_pith_number":"pith:R6KOJO22","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"},"canonical_sha256":"8f94e4bb5aea2ac0ac0f23c4ebcd6fbd68d8048a4e080aae76dea9bd857f3ad9","source":{"kind":"arxiv","id":"2504.10999","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2504.10999","created_at":"2026-07-05T10:49:27Z"},{"alias_kind":"arxiv_version","alias_value":"2504.10999v1","created_at":"2026-07-05T10:49:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.10999","created_at":"2026-07-05T10:49:27Z"},{"alias_kind":"pith_short_12","alias_value":"R6KOJO225IVM","created_at":"2026-07-05T10:49:27Z"},{"alias_kind":"pith_short_16","alias_value":"R6KOJO225IVMBLAP","created_at":"2026-07-05T10:49:27Z"},{"alias_kind":"pith_short_8","alias_value":"R6KOJO22","created_at":"2026-07-05T10:49:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:R6KOJO225IVMBLAPEPCOXTLPXV","target":"record","payload":{"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"},"canonical_sha256":"8f94e4bb5aea2ac0ac0f23c4ebcd6fbd68d8048a4e080aae76dea9bd857f3ad9","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"},"source_kind":"arxiv","source_id":"2504.10999","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-05T10:49:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P0BmaZ+b4/hCUO5o+XQj4XmoPNxzDt5Xdf6aD/Ena2LX/1iANfWnSK6el62ChBjy3gV43lv9UjVuqMC5ZrAiCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T19:36:17.209561Z"},"content_sha256":"c2372247b92abb0a68f34bb0a0282c6eca5d275cae88d639438b9717b39d9286","schema_version":"1.0","event_id":"sha256:c2372247b92abb0a68f34bb0a0282c6eca5d275cae88d639438b9717b39d9286"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:R6KOJO225IVMBLAPEPCOXTLPXV","target":"graph","payload":{"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"},"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-05T10:49:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2IoVGwe1KXvHPWKpJTNMUWsFgH2lOaNi18UfCfyDh0Z8TC85sD4lLpwAfRuPfLqZG6it+UhGsmlWldf2v+nrBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T19:36:17.210064Z"},"content_sha256":"a02e4bd33b71dd7914aa3df556ee7da6380a898c888541288b0b9295365db040","schema_version":"1.0","event_id":"sha256:a02e4bd33b71dd7914aa3df556ee7da6380a898c888541288b0b9295365db040"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/R6KOJO225IVMBLAPEPCOXTLPXV/bundle.json","state_url":"https://pith.science/pith/R6KOJO225IVMBLAPEPCOXTLPXV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/R6KOJO225IVMBLAPEPCOXTLPXV/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-08T19:36:17Z","links":{"resolver":"https://pith.science/pith/R6KOJO225IVMBLAPEPCOXTLPXV","bundle":"https://pith.science/pith/R6KOJO225IVMBLAPEPCOXTLPXV/bundle.json","state":"https://pith.science/pith/R6KOJO225IVMBLAPEPCOXTLPXV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/R6KOJO225IVMBLAPEPCOXTLPXV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:R6KOJO225IVMBLAPEPCOXTLPXV","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":"b3e1f98466f8f7f29d2b369d763b09e43ae09315742227fcab90702763841091","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-04-15T09:15:58Z","title_canon_sha256":"a422098f54ae944013c178b082f97a8c1b1c3fddba6692c24e4a0278e03481fe"},"schema_version":"1.0","source":{"id":"2504.10999","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2504.10999","created_at":"2026-07-05T10:49:27Z"},{"alias_kind":"arxiv_version","alias_value":"2504.10999v1","created_at":"2026-07-05T10:49:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.10999","created_at":"2026-07-05T10:49:27Z"},{"alias_kind":"pith_short_12","alias_value":"R6KOJO225IVM","created_at":"2026-07-05T10:49:27Z"},{"alias_kind":"pith_short_16","alias_value":"R6KOJO225IVMBLAP","created_at":"2026-07-05T10:49:27Z"},{"alias_kind":"pith_short_8","alias_value":"R6KOJO22","created_at":"2026-07-05T10:49:27Z"}],"graph_snapshots":[{"event_id":"sha256:a02e4bd33b71dd7914aa3df556ee7da6380a898c888541288b0b9295365db040","target":"graph","created_at":"2026-07-05T10:49:27Z","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/2504.10999/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 ","authors_text":"Anton {\\AA}kerman, Emanuele Naldi, Enis Chenchene, Pontus Giselsson","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-04-15T09:15:58Z","title":"Splitting the Forward-Backward Algorithm: A Full Characterization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.10999","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:c2372247b92abb0a68f34bb0a0282c6eca5d275cae88d639438b9717b39d9286","target":"record","created_at":"2026-07-05T10:49:27Z","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":"b3e1f98466f8f7f29d2b369d763b09e43ae09315742227fcab90702763841091","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-04-15T09:15:58Z","title_canon_sha256":"a422098f54ae944013c178b082f97a8c1b1c3fddba6692c24e4a0278e03481fe"},"schema_version":"1.0","source":{"id":"2504.10999","kind":"arxiv","version":1}},"canonical_sha256":"8f94e4bb5aea2ac0ac0f23c4ebcd6fbd68d8048a4e080aae76dea9bd857f3ad9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8f94e4bb5aea2ac0ac0f23c4ebcd6fbd68d8048a4e080aae76dea9bd857f3ad9","first_computed_at":"2026-07-05T10:49:27.586464Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:49:27.586464Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/8OXt3LHuvVP6veIM1/XDWb0UGZa5Q46hkxFB1PSxQRdFMufJI+pMhQ8rfSsIVUf369n7IcYnoZ78yrinecIDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T10:49:27.586941Z","signed_message":"canonical_sha256_bytes"},"source_id":"2504.10999","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c2372247b92abb0a68f34bb0a0282c6eca5d275cae88d639438b9717b39d9286","sha256:a02e4bd33b71dd7914aa3df556ee7da6380a898c888541288b0b9295365db040"],"state_sha256":"d59020bf92c00b983469604f4b95c0fb00dabd856146c181482d9ab71ef786b3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2bLyqtWjMTQyi0pijkCKrFRPpaHsrGuDXFGZuKAYzBboR9n3WSaYi5AhX36yMXgdKBvIxeZ9F3skeUcB8kzgBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T19:36:17.214890Z","bundle_sha256":"d5242f0c8b15e97f438ff5c6251ce65f36c321492f7604908ed1eab286392e3c"}}