{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:5WVJZRM76OUQIV2OL6L532H5JH","short_pith_number":"pith:5WVJZRM7","canonical_record":{"source":{"id":"1604.07130","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-04-25T05:01:05Z","cross_cats_sorted":["cs.CC","math.NA"],"title_canon_sha256":"573713b84fc544048056f33abefbad0803d125f8153fa77f73c0615b68b002e4","abstract_canon_sha256":"7262392220f982021469a6c66d5215315a4172565c0a5284dd2248acfe984505"},"schema_version":"1.0"},"canonical_sha256":"edaa9cc59ff3a904574e5f97dde8fd49f0c6cf7ec294bbf23de83ac5d8c7db14","source":{"kind":"arxiv","id":"1604.07130","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.07130","created_at":"2026-05-18T00:08:24Z"},{"alias_kind":"arxiv_version","alias_value":"1604.07130v2","created_at":"2026-05-18T00:08:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.07130","created_at":"2026-05-18T00:08:24Z"},{"alias_kind":"pith_short_12","alias_value":"5WVJZRM76OUQ","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"5WVJZRM76OUQIV2O","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"5WVJZRM7","created_at":"2026-05-18T12:30:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:5WVJZRM76OUQIV2OL6L532H5JH","target":"record","payload":{"canonical_record":{"source":{"id":"1604.07130","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-04-25T05:01:05Z","cross_cats_sorted":["cs.CC","math.NA"],"title_canon_sha256":"573713b84fc544048056f33abefbad0803d125f8153fa77f73c0615b68b002e4","abstract_canon_sha256":"7262392220f982021469a6c66d5215315a4172565c0a5284dd2248acfe984505"},"schema_version":"1.0"},"canonical_sha256":"edaa9cc59ff3a904574e5f97dde8fd49f0c6cf7ec294bbf23de83ac5d8c7db14","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:08:24.037846Z","signature_b64":"vCapMOmM3yxuMvBQYPV5PGDTVgeNAoXNL4KlbTrNtFy/0ykxvMWbrfbeAcY9WW9BTFrWFdE6BA3fUgR5gAldBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"edaa9cc59ff3a904574e5f97dde8fd49f0c6cf7ec294bbf23de83ac5d8c7db14","last_reissued_at":"2026-05-18T00:08:24.037195Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:08:24.037195Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1604.07130","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-18T00:08:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O796WnXXS8BOwMp/GVKLENdyTbcZMTqQmQ0D4oucUKZA4c0RCqu9GVRLQk+HkbGoQEJqGzF5GFxmGDhY+8xcDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T05:26:53.631487Z"},"content_sha256":"af126ffae185b98b2976444db55e74b760a301e8e1300996ab2a4ccac8c80879","schema_version":"1.0","event_id":"sha256:af126ffae185b98b2976444db55e74b760a301e8e1300996ab2a4ccac8c80879"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:5WVJZRM76OUQIV2OL6L532H5JH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Worst-case Complexity of Cyclic Coordinate Descent: $O(n^2)$ Gap with Randomized Version","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","math.NA"],"primary_cat":"math.OC","authors_text":"Ruoyu Sun, Yinyu Ye","submitted_at":"2016-04-25T05:01:05Z","abstract_excerpt":"This paper concerns the worst-case complexity of cyclic coordinate descent (C-CD) for minimizing a convex quadratic function, which is equivalent to Gauss-Seidel method and can be transformed to Kaczmarz method and projection onto convex sets (POCS). We observe that the known provable complexity of C-CD can be $O(n^2)$ times slower than randomized coordinate descent (R-CD), but no example was rigorously proven to exhibit such a large gap. In this paper we show that the gap indeed exists. We prove that there exists an example for which C-CD takes at least $O(n^4 \\kappa_{\\text{CD}} \\log\\frac{1}{"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.07130","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-18T00:08:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BsyN2MmL9nHnvxQ53yWf6wSVfLMRmyPJux4kuQEVP5UQyIUyQTHIBXuWfRf9ilhAZG2UYMsgzyZE+GyRATH9BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T05:26:53.631870Z"},"content_sha256":"5b8496b7b130cfe9545eff52a0f08e8d333157d17353f7e6cf4fe5316adbadde","schema_version":"1.0","event_id":"sha256:5b8496b7b130cfe9545eff52a0f08e8d333157d17353f7e6cf4fe5316adbadde"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5WVJZRM76OUQIV2OL6L532H5JH/bundle.json","state_url":"https://pith.science/pith/5WVJZRM76OUQIV2OL6L532H5JH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5WVJZRM76OUQIV2OL6L532H5JH/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-05-30T05:26:53Z","links":{"resolver":"https://pith.science/pith/5WVJZRM76OUQIV2OL6L532H5JH","bundle":"https://pith.science/pith/5WVJZRM76OUQIV2OL6L532H5JH/bundle.json","state":"https://pith.science/pith/5WVJZRM76OUQIV2OL6L532H5JH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5WVJZRM76OUQIV2OL6L532H5JH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:5WVJZRM76OUQIV2OL6L532H5JH","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":"7262392220f982021469a6c66d5215315a4172565c0a5284dd2248acfe984505","cross_cats_sorted":["cs.CC","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-04-25T05:01:05Z","title_canon_sha256":"573713b84fc544048056f33abefbad0803d125f8153fa77f73c0615b68b002e4"},"schema_version":"1.0","source":{"id":"1604.07130","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.07130","created_at":"2026-05-18T00:08:24Z"},{"alias_kind":"arxiv_version","alias_value":"1604.07130v2","created_at":"2026-05-18T00:08:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.07130","created_at":"2026-05-18T00:08:24Z"},{"alias_kind":"pith_short_12","alias_value":"5WVJZRM76OUQ","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"5WVJZRM76OUQIV2O","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"5WVJZRM7","created_at":"2026-05-18T12:30:01Z"}],"graph_snapshots":[{"event_id":"sha256:5b8496b7b130cfe9545eff52a0f08e8d333157d17353f7e6cf4fe5316adbadde","target":"graph","created_at":"2026-05-18T00:08:24Z","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":"This paper concerns the worst-case complexity of cyclic coordinate descent (C-CD) for minimizing a convex quadratic function, which is equivalent to Gauss-Seidel method and can be transformed to Kaczmarz method and projection onto convex sets (POCS). We observe that the known provable complexity of C-CD can be $O(n^2)$ times slower than randomized coordinate descent (R-CD), but no example was rigorously proven to exhibit such a large gap. In this paper we show that the gap indeed exists. We prove that there exists an example for which C-CD takes at least $O(n^4 \\kappa_{\\text{CD}} \\log\\frac{1}{","authors_text":"Ruoyu Sun, Yinyu Ye","cross_cats":["cs.CC","math.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-04-25T05:01:05Z","title":"Worst-case Complexity of Cyclic Coordinate Descent: $O(n^2)$ Gap with Randomized Version"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.07130","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:af126ffae185b98b2976444db55e74b760a301e8e1300996ab2a4ccac8c80879","target":"record","created_at":"2026-05-18T00:08:24Z","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":"7262392220f982021469a6c66d5215315a4172565c0a5284dd2248acfe984505","cross_cats_sorted":["cs.CC","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-04-25T05:01:05Z","title_canon_sha256":"573713b84fc544048056f33abefbad0803d125f8153fa77f73c0615b68b002e4"},"schema_version":"1.0","source":{"id":"1604.07130","kind":"arxiv","version":2}},"canonical_sha256":"edaa9cc59ff3a904574e5f97dde8fd49f0c6cf7ec294bbf23de83ac5d8c7db14","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"edaa9cc59ff3a904574e5f97dde8fd49f0c6cf7ec294bbf23de83ac5d8c7db14","first_computed_at":"2026-05-18T00:08:24.037195Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:08:24.037195Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vCapMOmM3yxuMvBQYPV5PGDTVgeNAoXNL4KlbTrNtFy/0ykxvMWbrfbeAcY9WW9BTFrWFdE6BA3fUgR5gAldBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:08:24.037846Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.07130","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:af126ffae185b98b2976444db55e74b760a301e8e1300996ab2a4ccac8c80879","sha256:5b8496b7b130cfe9545eff52a0f08e8d333157d17353f7e6cf4fe5316adbadde"],"state_sha256":"2118609d0f6a9e3f3ed5af3d4633976625283b6bbe053d3de0df4428454a5f47"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"baWkA4j0XVaInbxNgYGarmwzHRB+kmfvVkKbntuq89nL0/GsiPQumsiE/T6PwIquf6+VZOPsixmCPllNNaBgDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T05:26:53.634114Z","bundle_sha256":"684fa184a413355815d103483d7fb5d88126176fb17586bd3659d24f44eb128e"}}