{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:O4YUXTM73KAYD4Q3ENPZYYBGP5","short_pith_number":"pith:O4YUXTM7","canonical_record":{"source":{"id":"1507.03291","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-07-12T23:23:00Z","cross_cats_sorted":[],"title_canon_sha256":"e5a28ce5542d50eba77e8c4117d203606484ae1b272ef6696f888d995cd4dec9","abstract_canon_sha256":"c7535d41c5cb96f869b5815adab8d4cd9fd6be40384748cc325e328065636090"},"schema_version":"1.0"},"canonical_sha256":"77314bcd9fda8181f21b235f9c60267f651dfe0a8898e2e21edff2d583503b3d","source":{"kind":"arxiv","id":"1507.03291","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.03291","created_at":"2026-05-18T01:25:55Z"},{"alias_kind":"arxiv_version","alias_value":"1507.03291v2","created_at":"2026-05-18T01:25:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.03291","created_at":"2026-05-18T01:25:55Z"},{"alias_kind":"pith_short_12","alias_value":"O4YUXTM73KAY","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"O4YUXTM73KAYD4Q3","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"O4YUXTM7","created_at":"2026-05-18T12:29:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:O4YUXTM73KAYD4Q3ENPZYYBGP5","target":"record","payload":{"canonical_record":{"source":{"id":"1507.03291","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-07-12T23:23:00Z","cross_cats_sorted":[],"title_canon_sha256":"e5a28ce5542d50eba77e8c4117d203606484ae1b272ef6696f888d995cd4dec9","abstract_canon_sha256":"c7535d41c5cb96f869b5815adab8d4cd9fd6be40384748cc325e328065636090"},"schema_version":"1.0"},"canonical_sha256":"77314bcd9fda8181f21b235f9c60267f651dfe0a8898e2e21edff2d583503b3d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:25:55.128155Z","signature_b64":"Xam6S2qoNN0qbKjtcych8BA3xgVtCMU0XJa3dT59J4G6YWcSKCdqjuE17t9ECDq1oZAvzxtHygwgFpEA4RCbCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"77314bcd9fda8181f21b235f9c60267f651dfe0a8898e2e21edff2d583503b3d","last_reissued_at":"2026-05-18T01:25:55.126481Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:25:55.126481Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1507.03291","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-05-18T01:25:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PvV/bcfOiGYzhnRbVNZfLJ/kBr6WZ7GZWkDdgs+xCaCVQOO5sgLhLTK6+LbVs9uAJNAlQ1+oUyJ0+wLP5byXCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T16:01:07.846063Z"},"content_sha256":"097ec60d1dd12655448ffe557c03b97228e1726bc359100e9a1ca89ea8283894","schema_version":"1.0","event_id":"sha256:097ec60d1dd12655448ffe557c03b97228e1726bc359100e9a1ca89ea8283894"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:O4YUXTM73KAYD4Q3ENPZYYBGP5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Asynchronous Block-Iterative Primal-Dual Decomposition Methods for Monotone Inclusions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jonathan Eckstein, Patrick L. Combettes","submitted_at":"2015-07-12T23:23:00Z","abstract_excerpt":"We propose new primal-dual decomposition algorithms for solving systems of inclusions involving sums of linearly composed maximally monotone operators. The principal innovation in these algorithms is that they are block-iterative in the sense that, at each iteration, only a subset of the monotone operators needs to be processed, as opposed to all operators as in established methods. Deterministic strategies are used to select the blocks of operators activated at each iteration. In addition, we allow for operator processing \"lags\", permitting asynchronous implementation. The decomposition phase"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.03291","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":""},"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-05-18T01:25:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"545jr0rjcf84zD0EcdWa9cCylOVN6AomP/UiAAIu08VL0lhaJ17FdoCkjCliasnuAmC/yH3C4JaJSVcuTNlWCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T16:01:07.846706Z"},"content_sha256":"945b0831745a731fbd124a7df1d9d02249eef24a1465f08791b79e2c60065e02","schema_version":"1.0","event_id":"sha256:945b0831745a731fbd124a7df1d9d02249eef24a1465f08791b79e2c60065e02"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/O4YUXTM73KAYD4Q3ENPZYYBGP5/bundle.json","state_url":"https://pith.science/pith/O4YUXTM73KAYD4Q3ENPZYYBGP5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/O4YUXTM73KAYD4Q3ENPZYYBGP5/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-06-06T16:01:07Z","links":{"resolver":"https://pith.science/pith/O4YUXTM73KAYD4Q3ENPZYYBGP5","bundle":"https://pith.science/pith/O4YUXTM73KAYD4Q3ENPZYYBGP5/bundle.json","state":"https://pith.science/pith/O4YUXTM73KAYD4Q3ENPZYYBGP5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/O4YUXTM73KAYD4Q3ENPZYYBGP5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:O4YUXTM73KAYD4Q3ENPZYYBGP5","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":"c7535d41c5cb96f869b5815adab8d4cd9fd6be40384748cc325e328065636090","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-07-12T23:23:00Z","title_canon_sha256":"e5a28ce5542d50eba77e8c4117d203606484ae1b272ef6696f888d995cd4dec9"},"schema_version":"1.0","source":{"id":"1507.03291","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.03291","created_at":"2026-05-18T01:25:55Z"},{"alias_kind":"arxiv_version","alias_value":"1507.03291v2","created_at":"2026-05-18T01:25:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.03291","created_at":"2026-05-18T01:25:55Z"},{"alias_kind":"pith_short_12","alias_value":"O4YUXTM73KAY","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"O4YUXTM73KAYD4Q3","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"O4YUXTM7","created_at":"2026-05-18T12:29:34Z"}],"graph_snapshots":[{"event_id":"sha256:945b0831745a731fbd124a7df1d9d02249eef24a1465f08791b79e2c60065e02","target":"graph","created_at":"2026-05-18T01:25:55Z","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"},"paper":{"abstract_excerpt":"We propose new primal-dual decomposition algorithms for solving systems of inclusions involving sums of linearly composed maximally monotone operators. The principal innovation in these algorithms is that they are block-iterative in the sense that, at each iteration, only a subset of the monotone operators needs to be processed, as opposed to all operators as in established methods. Deterministic strategies are used to select the blocks of operators activated at each iteration. In addition, we allow for operator processing \"lags\", permitting asynchronous implementation. The decomposition phase","authors_text":"Jonathan Eckstein, Patrick L. Combettes","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-07-12T23:23:00Z","title":"Asynchronous Block-Iterative Primal-Dual Decomposition Methods for Monotone Inclusions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.03291","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:097ec60d1dd12655448ffe557c03b97228e1726bc359100e9a1ca89ea8283894","target":"record","created_at":"2026-05-18T01:25:55Z","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":"c7535d41c5cb96f869b5815adab8d4cd9fd6be40384748cc325e328065636090","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-07-12T23:23:00Z","title_canon_sha256":"e5a28ce5542d50eba77e8c4117d203606484ae1b272ef6696f888d995cd4dec9"},"schema_version":"1.0","source":{"id":"1507.03291","kind":"arxiv","version":2}},"canonical_sha256":"77314bcd9fda8181f21b235f9c60267f651dfe0a8898e2e21edff2d583503b3d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"77314bcd9fda8181f21b235f9c60267f651dfe0a8898e2e21edff2d583503b3d","first_computed_at":"2026-05-18T01:25:55.126481Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:25:55.126481Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Xam6S2qoNN0qbKjtcych8BA3xgVtCMU0XJa3dT59J4G6YWcSKCdqjuE17t9ECDq1oZAvzxtHygwgFpEA4RCbCw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:25:55.128155Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.03291","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:097ec60d1dd12655448ffe557c03b97228e1726bc359100e9a1ca89ea8283894","sha256:945b0831745a731fbd124a7df1d9d02249eef24a1465f08791b79e2c60065e02"],"state_sha256":"0223d3352779dfec572773629e837f75db914e75567c48f651796ab74b9d6d8c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PaqKFEELsi3aRuSNX1Ow+SUjvR15cOOfquPJ1pZZtuyB6mKErykpP02+armPOz35R9iN+8XAbSjQfrVDFypgBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T16:01:07.849641Z","bundle_sha256":"a1a1dd3a77be258a05e1352b468eeff5bc6e6b0e840c6fe70bce879e52c03c94"}}