{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:FLCDJZ333XT6SJSBUO4QN5FTFA","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":"10b052df0c60d76ffd6c03a5695bd63d9f65eaa806dfbfe6af42ae2b5ef3a0cf","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-04-15T15:53:10Z","title_canon_sha256":"c491756914cdce54df0406df98ff48ddd2aee0640dd94b9cc8c13ee06dc94964"},"schema_version":"1.0","source":{"id":"2504.11313","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2504.11313","created_at":"2026-07-05T10:49:32Z"},{"alias_kind":"arxiv_version","alias_value":"2504.11313v1","created_at":"2026-07-05T10:49:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.11313","created_at":"2026-07-05T10:49:32Z"},{"alias_kind":"pith_short_12","alias_value":"FLCDJZ333XT6","created_at":"2026-07-05T10:49:32Z"},{"alias_kind":"pith_short_16","alias_value":"FLCDJZ333XT6SJSB","created_at":"2026-07-05T10:49:32Z"},{"alias_kind":"pith_short_8","alias_value":"FLCDJZ33","created_at":"2026-07-05T10:49:32Z"}],"graph_snapshots":[{"event_id":"sha256:cc700dabc9b4127f7e0571734b9bd69c5c9d4abc2dca80ba3358a5605be01a6d","target":"graph","created_at":"2026-07-05T10:49:32Z","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.11313/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Feasibility problem aims to find a common point of two or more closed (convex) sets whose intersection is nonempty. In the literature, projection based algorithms are widely adopted to solve the problem, such as the method of alternating projection (MAP), and Douglas--Rachford splitting method (DR). The performance of the methods are governed by the geometric properties of the underlying sets. For example, the fixed-point sequence of the Douglas--Rachford splitting method exhibits a spiraling behavior when solving the feasibility problem of two subspaces, leading to a slow convergence speed an","authors_text":"Jingwei Liang, Yuting Shen","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-04-15T15:53:10Z","title":"A Composed Alternating Relaxed Projection Algorithm for Feasibility Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.11313","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:418ea93ba6f79202e490a0f6d8b26aa3490a06019f2a7d3d32c535639382cfbf","target":"record","created_at":"2026-07-05T10:49:32Z","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":"10b052df0c60d76ffd6c03a5695bd63d9f65eaa806dfbfe6af42ae2b5ef3a0cf","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-04-15T15:53:10Z","title_canon_sha256":"c491756914cdce54df0406df98ff48ddd2aee0640dd94b9cc8c13ee06dc94964"},"schema_version":"1.0","source":{"id":"2504.11313","kind":"arxiv","version":1}},"canonical_sha256":"2ac434e77bdde7e92641a3b906f4b32812728c00631c2dbabe9e95c6bc98b2c4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2ac434e77bdde7e92641a3b906f4b32812728c00631c2dbabe9e95c6bc98b2c4","first_computed_at":"2026-07-05T10:49:32.088260Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:49:32.088260Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tpzACWGnHIBsiJ8OhghztcdY1isC3wP/oivsszSaz5Z3BrTc1Llb8iMG36BmMDYKKFx93zw6VGx6UODXOnGEBA==","signature_status":"signed_v1","signed_at":"2026-07-05T10:49:32.088692Z","signed_message":"canonical_sha256_bytes"},"source_id":"2504.11313","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:418ea93ba6f79202e490a0f6d8b26aa3490a06019f2a7d3d32c535639382cfbf","sha256:cc700dabc9b4127f7e0571734b9bd69c5c9d4abc2dca80ba3358a5605be01a6d"],"state_sha256":"30132dfbf559f700b0e3bb19ed6529535fcc0af9b3b84546c4f1e5018ae58947"}