{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:AQ6YM27SPKSNQ3MNYOMWIC2WV4","short_pith_number":"pith:AQ6YM27S","canonical_record":{"source":{"id":"2407.16159","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-07-23T03:57:32Z","cross_cats_sorted":[],"title_canon_sha256":"5d536a490b85b899bb1c90328937a5b06de5d046f0fa140d5431fc6f2071fe02","abstract_canon_sha256":"cb7b7029aceee8208691e9b1e393b572fbe24126fb34596503d0f3a4e8d809d4"},"schema_version":"1.0"},"canonical_sha256":"043d866bf27aa4d86d8dc399640b56af1c2699dc45b7084575c79af63a0ca9d9","source":{"kind":"arxiv","id":"2407.16159","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2407.16159","created_at":"2026-07-05T09:02:23Z"},{"alias_kind":"arxiv_version","alias_value":"2407.16159v2","created_at":"2026-07-05T09:02:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.16159","created_at":"2026-07-05T09:02:23Z"},{"alias_kind":"pith_short_12","alias_value":"AQ6YM27SPKSN","created_at":"2026-07-05T09:02:23Z"},{"alias_kind":"pith_short_16","alias_value":"AQ6YM27SPKSNQ3MN","created_at":"2026-07-05T09:02:23Z"},{"alias_kind":"pith_short_8","alias_value":"AQ6YM27S","created_at":"2026-07-05T09:02:23Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:AQ6YM27SPKSNQ3MNYOMWIC2WV4","target":"record","payload":{"canonical_record":{"source":{"id":"2407.16159","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-07-23T03:57:32Z","cross_cats_sorted":[],"title_canon_sha256":"5d536a490b85b899bb1c90328937a5b06de5d046f0fa140d5431fc6f2071fe02","abstract_canon_sha256":"cb7b7029aceee8208691e9b1e393b572fbe24126fb34596503d0f3a4e8d809d4"},"schema_version":"1.0"},"canonical_sha256":"043d866bf27aa4d86d8dc399640b56af1c2699dc45b7084575c79af63a0ca9d9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:02:23.390753Z","signature_b64":"Ee+/3xi29JO95G5P/K5keVlLWQDd0L5umgD5KLgx9csuiC5v8mGABBCWQxkitzGhSpYshHdo+WXkaNSJI2ieDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"043d866bf27aa4d86d8dc399640b56af1c2699dc45b7084575c79af63a0ca9d9","last_reissued_at":"2026-07-05T09:02:23.390254Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:02:23.390254Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2407.16159","source_version":2,"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-05T09:02:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9W1OXPFXPxogVTdLlpzr9WOa65EuN9zFN41baiRaNt8aSh5PVy4Fc9NZguY+sKTko5Wwtpz3zgRV4/Ew4aZBCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T08:45:30.890106Z"},"content_sha256":"5b047087b40c35fe552d5e08be7a5e214fa77fc14dfadc4937fe412dd92264dc","schema_version":"1.0","event_id":"sha256:5b047087b40c35fe552d5e08be7a5e214fa77fc14dfadc4937fe412dd92264dc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:AQ6YM27SPKSNQ3MNYOMWIC2WV4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Design of Resolvent Splitting Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Peter Barkley, Robert L Bassett","submitted_at":"2024-07-23T03:57:32Z","abstract_excerpt":"In this paper, we introduce a novel semidefinite programming framework for designing custom frugal resolvent splitting algorithms which find a zero in the sum of n monotone operators. This framework features a number of design choices which facilitate creating resolvent splitting algorithms with specific communication structure. We illustrate these design choices using a variety of constraint sets and objective functions, as well as the use of a mixed-integer SDP to minimize time per iteration or required number of communications between the resolvents which define the splitting. Using the Per"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.16159","kind":"arxiv","version":2},"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/2407.16159/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-05T09:02:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dE30sPWy4JvFZ3iT/QjnUxr31vcNd6btgUDeb9tarWZGlPbqlAK3ZyLwzxYySOM4l56tRperLPTDzhkihk7sAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T08:45:30.890648Z"},"content_sha256":"07758599e27c49a4651d2afc94c324c76aee5ca5bb95536f17ce4a4fbddfcb6c","schema_version":"1.0","event_id":"sha256:07758599e27c49a4651d2afc94c324c76aee5ca5bb95536f17ce4a4fbddfcb6c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AQ6YM27SPKSNQ3MNYOMWIC2WV4/bundle.json","state_url":"https://pith.science/pith/AQ6YM27SPKSNQ3MNYOMWIC2WV4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AQ6YM27SPKSNQ3MNYOMWIC2WV4/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-18T08:45:30Z","links":{"resolver":"https://pith.science/pith/AQ6YM27SPKSNQ3MNYOMWIC2WV4","bundle":"https://pith.science/pith/AQ6YM27SPKSNQ3MNYOMWIC2WV4/bundle.json","state":"https://pith.science/pith/AQ6YM27SPKSNQ3MNYOMWIC2WV4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AQ6YM27SPKSNQ3MNYOMWIC2WV4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:AQ6YM27SPKSNQ3MNYOMWIC2WV4","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":"cb7b7029aceee8208691e9b1e393b572fbe24126fb34596503d0f3a4e8d809d4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-07-23T03:57:32Z","title_canon_sha256":"5d536a490b85b899bb1c90328937a5b06de5d046f0fa140d5431fc6f2071fe02"},"schema_version":"1.0","source":{"id":"2407.16159","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2407.16159","created_at":"2026-07-05T09:02:23Z"},{"alias_kind":"arxiv_version","alias_value":"2407.16159v2","created_at":"2026-07-05T09:02:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.16159","created_at":"2026-07-05T09:02:23Z"},{"alias_kind":"pith_short_12","alias_value":"AQ6YM27SPKSN","created_at":"2026-07-05T09:02:23Z"},{"alias_kind":"pith_short_16","alias_value":"AQ6YM27SPKSNQ3MN","created_at":"2026-07-05T09:02:23Z"},{"alias_kind":"pith_short_8","alias_value":"AQ6YM27S","created_at":"2026-07-05T09:02:23Z"}],"graph_snapshots":[{"event_id":"sha256:07758599e27c49a4651d2afc94c324c76aee5ca5bb95536f17ce4a4fbddfcb6c","target":"graph","created_at":"2026-07-05T09:02:23Z","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/2407.16159/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, we introduce a novel semidefinite programming framework for designing custom frugal resolvent splitting algorithms which find a zero in the sum of n monotone operators. This framework features a number of design choices which facilitate creating resolvent splitting algorithms with specific communication structure. We illustrate these design choices using a variety of constraint sets and objective functions, as well as the use of a mixed-integer SDP to minimize time per iteration or required number of communications between the resolvents which define the splitting. Using the Per","authors_text":"Peter Barkley, Robert L Bassett","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-07-23T03:57:32Z","title":"Optimal Design of Resolvent Splitting Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.16159","kind":"arxiv","version":2},"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:5b047087b40c35fe552d5e08be7a5e214fa77fc14dfadc4937fe412dd92264dc","target":"record","created_at":"2026-07-05T09:02:23Z","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":"cb7b7029aceee8208691e9b1e393b572fbe24126fb34596503d0f3a4e8d809d4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-07-23T03:57:32Z","title_canon_sha256":"5d536a490b85b899bb1c90328937a5b06de5d046f0fa140d5431fc6f2071fe02"},"schema_version":"1.0","source":{"id":"2407.16159","kind":"arxiv","version":2}},"canonical_sha256":"043d866bf27aa4d86d8dc399640b56af1c2699dc45b7084575c79af63a0ca9d9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"043d866bf27aa4d86d8dc399640b56af1c2699dc45b7084575c79af63a0ca9d9","first_computed_at":"2026-07-05T09:02:23.390254Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:02:23.390254Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ee+/3xi29JO95G5P/K5keVlLWQDd0L5umgD5KLgx9csuiC5v8mGABBCWQxkitzGhSpYshHdo+WXkaNSJI2ieDA==","signature_status":"signed_v1","signed_at":"2026-07-05T09:02:23.390753Z","signed_message":"canonical_sha256_bytes"},"source_id":"2407.16159","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5b047087b40c35fe552d5e08be7a5e214fa77fc14dfadc4937fe412dd92264dc","sha256:07758599e27c49a4651d2afc94c324c76aee5ca5bb95536f17ce4a4fbddfcb6c"],"state_sha256":"3cee8467765baf4110cdb986efa0146305bbf50b6659883ad4827d000754978a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ckcHCjbSmlODDxClL7ub+ZLBQBXC50VQhkElNNg1eOnAjtU65B1kB0bJn4CGRZy6kLwamUOJuQfiTy7SEWVDDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-18T08:45:30.898017Z","bundle_sha256":"47aa62697a345bba5bfb5d909433cfb7cf06a783693732feef8e6a3beef8618e"}}