{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:LGRFSPZSILRNYI7CLV5V6QGLCM","short_pith_number":"pith:LGRFSPZS","canonical_record":{"source":{"id":"1604.01866","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-04-07T03:56:00Z","cross_cats_sorted":[],"title_canon_sha256":"733e17ee60dfb81ec01a42a46cd54dbff03a9707b1470e0a1ce324af774a21e4","abstract_canon_sha256":"164b3e85e446d7a4f6a9a2a53892f36e30091aa0c15c492a78181c7a3fc4f90a"},"schema_version":"1.0"},"canonical_sha256":"59a2593f3242e2dc23e25d7b5f40cb13181b2044b21d3150b1f1b6ec9f609533","source":{"kind":"arxiv","id":"1604.01866","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.01866","created_at":"2026-05-18T01:17:31Z"},{"alias_kind":"arxiv_version","alias_value":"1604.01866v1","created_at":"2026-05-18T01:17:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.01866","created_at":"2026-05-18T01:17:31Z"},{"alias_kind":"pith_short_12","alias_value":"LGRFSPZSILRN","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"LGRFSPZSILRNYI7C","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"LGRFSPZS","created_at":"2026-05-18T12:30:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:LGRFSPZSILRNYI7CLV5V6QGLCM","target":"record","payload":{"canonical_record":{"source":{"id":"1604.01866","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-04-07T03:56:00Z","cross_cats_sorted":[],"title_canon_sha256":"733e17ee60dfb81ec01a42a46cd54dbff03a9707b1470e0a1ce324af774a21e4","abstract_canon_sha256":"164b3e85e446d7a4f6a9a2a53892f36e30091aa0c15c492a78181c7a3fc4f90a"},"schema_version":"1.0"},"canonical_sha256":"59a2593f3242e2dc23e25d7b5f40cb13181b2044b21d3150b1f1b6ec9f609533","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:17:31.900977Z","signature_b64":"LcAt1J/Uuo1+LHEGQ1xV/VIDHxLohGqSTOsnCLpRb5lKpi9JfNpM9i8HTeNfoSYJaKj/GzaKHjBj3KT1N0zOBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"59a2593f3242e2dc23e25d7b5f40cb13181b2044b21d3150b1f1b6ec9f609533","last_reissued_at":"2026-05-18T01:17:31.900399Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:17:31.900399Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1604.01866","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-05-18T01:17:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D3qsVgYPmd5uX+OzpKX29G+VMQjHUjZ2BMQ7DnC5dTg4bMkz/Qym2kVI/IwbZOXVp+RZBzoOsUD7UkS5bKQPBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T13:35:42.720367Z"},"content_sha256":"38a979e7b8111389e4ddb776dd42dff7aa76eba6b08983ee861cac1038ace39f","schema_version":"1.0","event_id":"sha256:38a979e7b8111389e4ddb776dd42dff7aa76eba6b08983ee861cac1038ace39f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:LGRFSPZSILRNYI7CLV5V6QGLCM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A hybrid method for solving systems of operator inclusion problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"R. D\\'iaz Mill\\'an","submitted_at":"2016-04-07T03:56:00Z","abstract_excerpt":"In this paper, we propose an algorithm combining the forward-backward splitting method and the alternative projection method for solving the system of splitting inclusion problem. We want to find a point in the interception of a finite number of sets that we don't know, the solution of each component of the system. The algorithm consists of approximate the sets involved in the problem by separates halfspaces which are a known strategy. By finding these halfspaces in each iteration we use only one inclusion problem of the system. The iterations consist of two parts, the first contains an explic"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.01866","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":""},"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:17:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F8lnAUibMqN3E7/NKztMU7NUoA22S5JQ8QE3mVi8XBeFIZ7+yfdTyJ+aaxGmDU129hfSWwzwn8iTEREBVIjaDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T13:35:42.720712Z"},"content_sha256":"0a7ba08c8e30b782e714963200541767da7bdd4c5e7790fe47135b742ecd32ef","schema_version":"1.0","event_id":"sha256:0a7ba08c8e30b782e714963200541767da7bdd4c5e7790fe47135b742ecd32ef"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LGRFSPZSILRNYI7CLV5V6QGLCM/bundle.json","state_url":"https://pith.science/pith/LGRFSPZSILRNYI7CLV5V6QGLCM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LGRFSPZSILRNYI7CLV5V6QGLCM/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-26T13:35:42Z","links":{"resolver":"https://pith.science/pith/LGRFSPZSILRNYI7CLV5V6QGLCM","bundle":"https://pith.science/pith/LGRFSPZSILRNYI7CLV5V6QGLCM/bundle.json","state":"https://pith.science/pith/LGRFSPZSILRNYI7CLV5V6QGLCM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LGRFSPZSILRNYI7CLV5V6QGLCM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:LGRFSPZSILRNYI7CLV5V6QGLCM","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":"164b3e85e446d7a4f6a9a2a53892f36e30091aa0c15c492a78181c7a3fc4f90a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-04-07T03:56:00Z","title_canon_sha256":"733e17ee60dfb81ec01a42a46cd54dbff03a9707b1470e0a1ce324af774a21e4"},"schema_version":"1.0","source":{"id":"1604.01866","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.01866","created_at":"2026-05-18T01:17:31Z"},{"alias_kind":"arxiv_version","alias_value":"1604.01866v1","created_at":"2026-05-18T01:17:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.01866","created_at":"2026-05-18T01:17:31Z"},{"alias_kind":"pith_short_12","alias_value":"LGRFSPZSILRN","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"LGRFSPZSILRNYI7C","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"LGRFSPZS","created_at":"2026-05-18T12:30:29Z"}],"graph_snapshots":[{"event_id":"sha256:0a7ba08c8e30b782e714963200541767da7bdd4c5e7790fe47135b742ecd32ef","target":"graph","created_at":"2026-05-18T01:17:31Z","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":"In this paper, we propose an algorithm combining the forward-backward splitting method and the alternative projection method for solving the system of splitting inclusion problem. We want to find a point in the interception of a finite number of sets that we don't know, the solution of each component of the system. The algorithm consists of approximate the sets involved in the problem by separates halfspaces which are a known strategy. By finding these halfspaces in each iteration we use only one inclusion problem of the system. The iterations consist of two parts, the first contains an explic","authors_text":"R. D\\'iaz Mill\\'an","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-04-07T03:56:00Z","title":"A hybrid method for solving systems of operator inclusion problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.01866","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:38a979e7b8111389e4ddb776dd42dff7aa76eba6b08983ee861cac1038ace39f","target":"record","created_at":"2026-05-18T01:17:31Z","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":"164b3e85e446d7a4f6a9a2a53892f36e30091aa0c15c492a78181c7a3fc4f90a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-04-07T03:56:00Z","title_canon_sha256":"733e17ee60dfb81ec01a42a46cd54dbff03a9707b1470e0a1ce324af774a21e4"},"schema_version":"1.0","source":{"id":"1604.01866","kind":"arxiv","version":1}},"canonical_sha256":"59a2593f3242e2dc23e25d7b5f40cb13181b2044b21d3150b1f1b6ec9f609533","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"59a2593f3242e2dc23e25d7b5f40cb13181b2044b21d3150b1f1b6ec9f609533","first_computed_at":"2026-05-18T01:17:31.900399Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:17:31.900399Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LcAt1J/Uuo1+LHEGQ1xV/VIDHxLohGqSTOsnCLpRb5lKpi9JfNpM9i8HTeNfoSYJaKj/GzaKHjBj3KT1N0zOBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:17:31.900977Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.01866","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:38a979e7b8111389e4ddb776dd42dff7aa76eba6b08983ee861cac1038ace39f","sha256:0a7ba08c8e30b782e714963200541767da7bdd4c5e7790fe47135b742ecd32ef"],"state_sha256":"7e3141835f3dc0d6ce83f72815d2d4001e344ddb0e9751d87f3f04efa8dd6f6c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4uYDpdqBwFGME7QB0DLyMz4rJNkJsbYumaORzgP9YVq/qo8OROiCz/JVk++hqRPi36EcBxR8LwxYMZ7RT/aJBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T13:35:42.722624Z","bundle_sha256":"841e4c91b46e187cb0b336a281d0bb525b89f541e509562b3299cb12ecba3d42"}}