{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:Q7AM2SWYXFRB7PG37PEOFM2K2P","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":"2e08ee90a3cec03cc87342896a1fc5ef5955c0b57ea7abfd077c5f8ad7c12923","cross_cats_sorted":["math.NA","stat.CO","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-12-16T20:15:09Z","title_canon_sha256":"f25c71ea8e7d31de32d633476363be4ab44f4a79aa823206982dc58365394dad"},"schema_version":"1.0","source":{"id":"1612.05614","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.05614","created_at":"2026-05-18T00:52:33Z"},{"alias_kind":"arxiv_version","alias_value":"1612.05614v2","created_at":"2026-05-18T00:52:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.05614","created_at":"2026-05-18T00:52:33Z"},{"alias_kind":"pith_short_12","alias_value":"Q7AM2SWYXFRB","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"Q7AM2SWYXFRB7PG3","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"Q7AM2SWY","created_at":"2026-05-18T12:30:39Z"}],"graph_snapshots":[{"event_id":"sha256:eeb6786a5115f1c909ffabd3a544cf51d717cd5c3529538ba101351ee12800a6","target":"graph","created_at":"2026-05-18T00:52:33Z","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":"The classical multi-set split feasibility problem seeks a point in the intersection of finitely many closed convex domain constraints, whose image under a linear mapping also lies in the intersection of finitely many closed convex range constraints. Split feasibility generalizes important inverse problems including convex feasibility, linear complementarity, and regression with constraint sets. When a feasible point does not exist, solution methods that proceed by minimizing a proximity function can be used to obtain optimal approximate solutions to the problem. We present an extension of the ","authors_text":"Eric C. Chi, Jason Xu, Kenneth Lange, Meng Yang","cross_cats":["math.NA","stat.CO","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-12-16T20:15:09Z","title":"An MM Algorithm for Split Feasibility Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.05614","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:4c168533d061f9412ec614ebc170d19913aa5b9cf79099687fd03ec44d456ca0","target":"record","created_at":"2026-05-18T00:52:33Z","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":"2e08ee90a3cec03cc87342896a1fc5ef5955c0b57ea7abfd077c5f8ad7c12923","cross_cats_sorted":["math.NA","stat.CO","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-12-16T20:15:09Z","title_canon_sha256":"f25c71ea8e7d31de32d633476363be4ab44f4a79aa823206982dc58365394dad"},"schema_version":"1.0","source":{"id":"1612.05614","kind":"arxiv","version":2}},"canonical_sha256":"87c0cd4ad8b9621fbcdbfbc8e2b34ad3fbfa6ca0d1ee2f135390422dbb0aa679","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"87c0cd4ad8b9621fbcdbfbc8e2b34ad3fbfa6ca0d1ee2f135390422dbb0aa679","first_computed_at":"2026-05-18T00:52:33.805030Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:52:33.805030Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ToQ62KvXUZqqpcAgsiOaiTYKy3aPBObA9b6CCUM9L2GLFg2B97Iuk5eZLx97WJ9gMbgMk3aaHMmVouFwhCdwDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:52:33.805555Z","signed_message":"canonical_sha256_bytes"},"source_id":"1612.05614","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4c168533d061f9412ec614ebc170d19913aa5b9cf79099687fd03ec44d456ca0","sha256:eeb6786a5115f1c909ffabd3a544cf51d717cd5c3529538ba101351ee12800a6"],"state_sha256":"2e9a3eefa4704247f0f49030a820f1c851bc9a2b8872d355adcd2a7bac96653e"}