{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:6PFVRHUMLO4Q5AVDDZA4BV3G3K","short_pith_number":"pith:6PFVRHUM","canonical_record":{"source":{"id":"2212.12384","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2022-12-23T15:01:45Z","cross_cats_sorted":[],"title_canon_sha256":"5f38937522a9fcadaed74d4ba7feefb68dc6ef553e1761a9025da620c91247e4","abstract_canon_sha256":"7335f0c35b0d7b8cb8e9e56c1a3e87da2528a0f4e80d88ab994fd3decb8f01ce"},"schema_version":"1.0"},"canonical_sha256":"f3cb589e8c5bb90e82a31e41c0d766daa3ba8be2eca04b83a1ddee8f4c14ddb6","source":{"kind":"arxiv","id":"2212.12384","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2212.12384","created_at":"2026-07-05T05:28:01Z"},{"alias_kind":"arxiv_version","alias_value":"2212.12384v1","created_at":"2026-07-05T05:28:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2212.12384","created_at":"2026-07-05T05:28:01Z"},{"alias_kind":"pith_short_12","alias_value":"6PFVRHUMLO4Q","created_at":"2026-07-05T05:28:01Z"},{"alias_kind":"pith_short_16","alias_value":"6PFVRHUMLO4Q5AVD","created_at":"2026-07-05T05:28:01Z"},{"alias_kind":"pith_short_8","alias_value":"6PFVRHUM","created_at":"2026-07-05T05:28:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:6PFVRHUMLO4Q5AVDDZA4BV3G3K","target":"record","payload":{"canonical_record":{"source":{"id":"2212.12384","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2022-12-23T15:01:45Z","cross_cats_sorted":[],"title_canon_sha256":"5f38937522a9fcadaed74d4ba7feefb68dc6ef553e1761a9025da620c91247e4","abstract_canon_sha256":"7335f0c35b0d7b8cb8e9e56c1a3e87da2528a0f4e80d88ab994fd3decb8f01ce"},"schema_version":"1.0"},"canonical_sha256":"f3cb589e8c5bb90e82a31e41c0d766daa3ba8be2eca04b83a1ddee8f4c14ddb6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:28:01.741308Z","signature_b64":"1tOZjf5Ja4fMJ7ESxzXQOjxyjI5Byrk05mtqJ++rC4xN0TbRxz7laSjofdrnJCV/6Bn/9n+YsJvfar5DHioOBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f3cb589e8c5bb90e82a31e41c0d766daa3ba8be2eca04b83a1ddee8f4c14ddb6","last_reissued_at":"2026-07-05T05:28:01.740977Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:28:01.740977Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2212.12384","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-07-05T05:28:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tKxcW2dehcYllu47WZiDqFs2BrpNu/hiveRXmThDZdy/Z19g+zEjLLFQpztFRK+wHksRBW1rSJsRE+hpAmvqBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T10:11:09.867820Z"},"content_sha256":"fd305697da1612841618b9066ba8c63efe84134da4e10b35f151a64cd0f7f720","schema_version":"1.0","event_id":"sha256:fd305697da1612841618b9066ba8c63efe84134da4e10b35f151a64cd0f7f720"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:6PFVRHUMLO4Q5AVDDZA4BV3G3K","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Convergence rate analysis of randomized and cyclic coordinate descent for convex optimization through semidefinite programming","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Etienne de Klerk, Hadi Abbaszadehpeivasti, Moslem Zamani","submitted_at":"2022-12-23T15:01:45Z","abstract_excerpt":"In this paper, we study randomized and cyclic coordinate descent for convex unconstrained optimization problems. We improve the known convergence rates in some cases by using the numerical semidefinite programming performance estimation method. As a spin-off we provide a method to analyse the worst-case performance of the Gauss-Seidel iterative method for linear systems where the coefficient matrix is positive semidefinite with a positive diagonal."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2212.12384","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2212.12384/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T05:28:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R6EDi7qutEX5t5/5AsBeLVIbow4nCDhfQwsKEanChZrh+36HiDgCs+aO/iVfhMKp5tM+cY1NNhSF8FRK05eECw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T10:11:09.868366Z"},"content_sha256":"37cb6836f56c22aa1d9df111c84e974937138514f48e10d14d0ab755f4a36fb5","schema_version":"1.0","event_id":"sha256:37cb6836f56c22aa1d9df111c84e974937138514f48e10d14d0ab755f4a36fb5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6PFVRHUMLO4Q5AVDDZA4BV3G3K/bundle.json","state_url":"https://pith.science/pith/6PFVRHUMLO4Q5AVDDZA4BV3G3K/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6PFVRHUMLO4Q5AVDDZA4BV3G3K/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-08-21T10:11:09Z","links":{"resolver":"https://pith.science/pith/6PFVRHUMLO4Q5AVDDZA4BV3G3K","bundle":"https://pith.science/pith/6PFVRHUMLO4Q5AVDDZA4BV3G3K/bundle.json","state":"https://pith.science/pith/6PFVRHUMLO4Q5AVDDZA4BV3G3K/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6PFVRHUMLO4Q5AVDDZA4BV3G3K/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:6PFVRHUMLO4Q5AVDDZA4BV3G3K","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":"7335f0c35b0d7b8cb8e9e56c1a3e87da2528a0f4e80d88ab994fd3decb8f01ce","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2022-12-23T15:01:45Z","title_canon_sha256":"5f38937522a9fcadaed74d4ba7feefb68dc6ef553e1761a9025da620c91247e4"},"schema_version":"1.0","source":{"id":"2212.12384","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2212.12384","created_at":"2026-07-05T05:28:01Z"},{"alias_kind":"arxiv_version","alias_value":"2212.12384v1","created_at":"2026-07-05T05:28:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2212.12384","created_at":"2026-07-05T05:28:01Z"},{"alias_kind":"pith_short_12","alias_value":"6PFVRHUMLO4Q","created_at":"2026-07-05T05:28:01Z"},{"alias_kind":"pith_short_16","alias_value":"6PFVRHUMLO4Q5AVD","created_at":"2026-07-05T05:28:01Z"},{"alias_kind":"pith_short_8","alias_value":"6PFVRHUM","created_at":"2026-07-05T05:28:01Z"}],"graph_snapshots":[{"event_id":"sha256:37cb6836f56c22aa1d9df111c84e974937138514f48e10d14d0ab755f4a36fb5","target":"graph","created_at":"2026-07-05T05:28:01Z","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/2212.12384/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, we study randomized and cyclic coordinate descent for convex unconstrained optimization problems. We improve the known convergence rates in some cases by using the numerical semidefinite programming performance estimation method. As a spin-off we provide a method to analyse the worst-case performance of the Gauss-Seidel iterative method for linear systems where the coefficient matrix is positive semidefinite with a positive diagonal.","authors_text":"Etienne de Klerk, Hadi Abbaszadehpeivasti, Moslem Zamani","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2022-12-23T15:01:45Z","title":"Convergence rate analysis of randomized and cyclic coordinate descent for convex optimization through semidefinite programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2212.12384","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:fd305697da1612841618b9066ba8c63efe84134da4e10b35f151a64cd0f7f720","target":"record","created_at":"2026-07-05T05:28:01Z","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":"7335f0c35b0d7b8cb8e9e56c1a3e87da2528a0f4e80d88ab994fd3decb8f01ce","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2022-12-23T15:01:45Z","title_canon_sha256":"5f38937522a9fcadaed74d4ba7feefb68dc6ef553e1761a9025da620c91247e4"},"schema_version":"1.0","source":{"id":"2212.12384","kind":"arxiv","version":1}},"canonical_sha256":"f3cb589e8c5bb90e82a31e41c0d766daa3ba8be2eca04b83a1ddee8f4c14ddb6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f3cb589e8c5bb90e82a31e41c0d766daa3ba8be2eca04b83a1ddee8f4c14ddb6","first_computed_at":"2026-07-05T05:28:01.740977Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:28:01.740977Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1tOZjf5Ja4fMJ7ESxzXQOjxyjI5Byrk05mtqJ++rC4xN0TbRxz7laSjofdrnJCV/6Bn/9n+YsJvfar5DHioOBg==","signature_status":"signed_v1","signed_at":"2026-07-05T05:28:01.741308Z","signed_message":"canonical_sha256_bytes"},"source_id":"2212.12384","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fd305697da1612841618b9066ba8c63efe84134da4e10b35f151a64cd0f7f720","sha256:37cb6836f56c22aa1d9df111c84e974937138514f48e10d14d0ab755f4a36fb5"],"state_sha256":"d5e0e83e3d414f14c9bff404d9f82413bf4bf5f0d37c572c66290f04151f5b0f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jJuJrA5tJFllRFT1LBR1e7Vl+02MqQnt2ZgVKa3OyS6g/gJ92qEh1IuqwETW/oXdYxlK+zSg/IfSNOuA+9ltBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-21T10:11:09.872909Z","bundle_sha256":"7eb32b6d48fb6069ee4c7373bf24c7f191777516a6e9aa9477c2254d97a0e39b"}}