{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:IXR4BFZGCEZISEL4EKDE73D536","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":"b38308cbe3ab702d3ce9f4af56e7d3c53de2d49701ffe3c97ec43082e2103322","cross_cats_sorted":["stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-11-08T09:55:00Z","title_canon_sha256":"decb78f094dbf39d54da8a2d5167f4506fdfc03f0aaf92f14d744a489fd1abbe"},"schema_version":"1.0","source":{"id":"1611.02456","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.02456","created_at":"2026-05-18T00:49:37Z"},{"alias_kind":"arxiv_version","alias_value":"1611.02456v2","created_at":"2026-05-18T00:49:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.02456","created_at":"2026-05-18T00:49:37Z"},{"alias_kind":"pith_short_12","alias_value":"IXR4BFZGCEZI","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"IXR4BFZGCEZISEL4","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"IXR4BFZG","created_at":"2026-05-18T12:30:22Z"}],"graph_snapshots":[{"event_id":"sha256:edceeaf0bfc25a1a1b36d576a001156383072493755c06f6b9e30f4239156699","target":"graph","created_at":"2026-05-18T00:49:37Z","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":"Many problems reduce to the fixed-point problem of solving $x=T(x)$. To this problem, we apply the coordinate-update algorithms, which update only one or a few components of $x$ at each step. When each update is cheap, these algorithms are faster than the full fixed-point iteration (which updates all the components).\n  In this paper, we focus on the coordinate-update algorithms based on the cyclic selection rules, where the ordering of coordinates in each cycle is arbitrary. These algorithms are fast, but their convergence is unknown in the fixed-point setting.\n  When $T$ is a nonexpansive ope","authors_text":"Tianyu Wu, Wotao Yin, Yat Tin Chow","cross_cats":["stat.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-11-08T09:55:00Z","title":"Cyclic Coordinate Update Algorithms for Fixed-Point Problems: Analysis and Applications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.02456","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:56acbdcaa4fc1e032823f21107438ee8e1930f9982009c7caddd5d378ee14ae0","target":"record","created_at":"2026-05-18T00:49:37Z","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":"b38308cbe3ab702d3ce9f4af56e7d3c53de2d49701ffe3c97ec43082e2103322","cross_cats_sorted":["stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-11-08T09:55:00Z","title_canon_sha256":"decb78f094dbf39d54da8a2d5167f4506fdfc03f0aaf92f14d744a489fd1abbe"},"schema_version":"1.0","source":{"id":"1611.02456","kind":"arxiv","version":2}},"canonical_sha256":"45e3c09726113289117c22864fec7ddf82dcf64aacbe0a74dcd723e8edb008a0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"45e3c09726113289117c22864fec7ddf82dcf64aacbe0a74dcd723e8edb008a0","first_computed_at":"2026-05-18T00:49:37.804599Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:49:37.804599Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UKIPwAhNU0shw+gXv6VAYHqZ33zwHn32QL3U1yAGE7grh1kMJccu1lRZUosfxPHnanBqMklmtJisP68KXg0qAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:49:37.805289Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.02456","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:56acbdcaa4fc1e032823f21107438ee8e1930f9982009c7caddd5d378ee14ae0","sha256:edceeaf0bfc25a1a1b36d576a001156383072493755c06f6b9e30f4239156699"],"state_sha256":"cc037265667135d61b91cb6e4e2a46ecf35dd6d8107338da537bb4587f186038"}