{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:MDSU56DXNUNAPVAHRDYOAJIIYY","short_pith_number":"pith:MDSU56DX","canonical_record":{"source":{"id":"1407.7573","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-07-28T21:15:26Z","cross_cats_sorted":[],"title_canon_sha256":"a16856cad21a5ec7ea6af38dae7dd419517c6980030e26fea82b708a983f9a0b","abstract_canon_sha256":"6bf7364044f9e8467b4926a292009121c79db60c48538d96d9e093baf401f720"},"schema_version":"1.0"},"canonical_sha256":"60e54ef8776d1a07d40788f0e02508c61710e18e20f5822659d28842b7d0ad44","source":{"kind":"arxiv","id":"1407.7573","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.7573","created_at":"2026-05-18T02:16:39Z"},{"alias_kind":"arxiv_version","alias_value":"1407.7573v3","created_at":"2026-05-18T02:16:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.7573","created_at":"2026-05-18T02:16:39Z"},{"alias_kind":"pith_short_12","alias_value":"MDSU56DXNUNA","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"MDSU56DXNUNAPVAH","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"MDSU56DX","created_at":"2026-05-18T12:28:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:MDSU56DXNUNAPVAHRDYOAJIIYY","target":"record","payload":{"canonical_record":{"source":{"id":"1407.7573","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-07-28T21:15:26Z","cross_cats_sorted":[],"title_canon_sha256":"a16856cad21a5ec7ea6af38dae7dd419517c6980030e26fea82b708a983f9a0b","abstract_canon_sha256":"6bf7364044f9e8467b4926a292009121c79db60c48538d96d9e093baf401f720"},"schema_version":"1.0"},"canonical_sha256":"60e54ef8776d1a07d40788f0e02508c61710e18e20f5822659d28842b7d0ad44","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:16:39.296348Z","signature_b64":"RGJuGvzayRRYn6/GVhmPLfyp6BM2Mfw70TIB9RBjfo6Dngd1RvGHdo3JYCyOu2iP/YSPjqfvS2XyRnjU6wF7Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"60e54ef8776d1a07d40788f0e02508c61710e18e20f5822659d28842b7d0ad44","last_reissued_at":"2026-05-18T02:16:39.295614Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:16:39.295614Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1407.7573","source_version":3,"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-18T02:16:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z203Y/WpEcQSxtcWChcITB2TzJSOLAdRl3GAVggIVL5tykeRvIrsdfAcJAofwVChKSnPRIhaLYlecSLmmlFMDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T07:58:44.126250Z"},"content_sha256":"8d09190f1157a3a1a60f97d52ab4a24557f4c7a35328cfb80c414b9e60914246","schema_version":"1.0","event_id":"sha256:8d09190f1157a3a1a60f97d52ab4a24557f4c7a35328cfb80c414b9e60914246"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:MDSU56DXNUNAPVAHRDYOAJIIYY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Robust Block Coordinate Descent","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Kimon Fountoulakis, Rachael Tappenden","submitted_at":"2014-07-28T21:15:26Z","abstract_excerpt":"In this paper we present a novel randomized block coordinate descent method for the minimization of a convex composite objective function. The method uses (approximate) partial second-order (curvature) information, so that the algorithm performance is more robust when applied to highly nonseparable or ill conditioned problems. We call the method Robust Coordinate Descent (RCD). At each iteration of RCD, a block of coordinates is sampled randomly, a quadratic model is formed about that block and the model is minimized approximately/inexactly to determine the search direction. An inexpensive lin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.7573","kind":"arxiv","version":3},"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-18T02:16:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0WQC5SWv7gGABjmlLSFoW5T0o2p4G9DUTTAkPhXndBxe99knzO/gVlLhKXBa6iWiNYAu3c/kMW9z+FkPkv6aDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T07:58:44.126716Z"},"content_sha256":"890d5f4c9bb07ce95332f6aff75fc75a4484f54e769af1da3dfd279d589b431b","schema_version":"1.0","event_id":"sha256:890d5f4c9bb07ce95332f6aff75fc75a4484f54e769af1da3dfd279d589b431b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MDSU56DXNUNAPVAHRDYOAJIIYY/bundle.json","state_url":"https://pith.science/pith/MDSU56DXNUNAPVAHRDYOAJIIYY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MDSU56DXNUNAPVAHRDYOAJIIYY/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-24T07:58:44Z","links":{"resolver":"https://pith.science/pith/MDSU56DXNUNAPVAHRDYOAJIIYY","bundle":"https://pith.science/pith/MDSU56DXNUNAPVAHRDYOAJIIYY/bundle.json","state":"https://pith.science/pith/MDSU56DXNUNAPVAHRDYOAJIIYY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MDSU56DXNUNAPVAHRDYOAJIIYY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:MDSU56DXNUNAPVAHRDYOAJIIYY","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":"6bf7364044f9e8467b4926a292009121c79db60c48538d96d9e093baf401f720","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-07-28T21:15:26Z","title_canon_sha256":"a16856cad21a5ec7ea6af38dae7dd419517c6980030e26fea82b708a983f9a0b"},"schema_version":"1.0","source":{"id":"1407.7573","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.7573","created_at":"2026-05-18T02:16:39Z"},{"alias_kind":"arxiv_version","alias_value":"1407.7573v3","created_at":"2026-05-18T02:16:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.7573","created_at":"2026-05-18T02:16:39Z"},{"alias_kind":"pith_short_12","alias_value":"MDSU56DXNUNA","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"MDSU56DXNUNAPVAH","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"MDSU56DX","created_at":"2026-05-18T12:28:38Z"}],"graph_snapshots":[{"event_id":"sha256:890d5f4c9bb07ce95332f6aff75fc75a4484f54e769af1da3dfd279d589b431b","target":"graph","created_at":"2026-05-18T02:16:39Z","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":"In this paper we present a novel randomized block coordinate descent method for the minimization of a convex composite objective function. The method uses (approximate) partial second-order (curvature) information, so that the algorithm performance is more robust when applied to highly nonseparable or ill conditioned problems. We call the method Robust Coordinate Descent (RCD). At each iteration of RCD, a block of coordinates is sampled randomly, a quadratic model is formed about that block and the model is minimized approximately/inexactly to determine the search direction. An inexpensive lin","authors_text":"Kimon Fountoulakis, Rachael Tappenden","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-07-28T21:15:26Z","title":"Robust Block Coordinate Descent"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.7573","kind":"arxiv","version":3},"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:8d09190f1157a3a1a60f97d52ab4a24557f4c7a35328cfb80c414b9e60914246","target":"record","created_at":"2026-05-18T02:16:39Z","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":"6bf7364044f9e8467b4926a292009121c79db60c48538d96d9e093baf401f720","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-07-28T21:15:26Z","title_canon_sha256":"a16856cad21a5ec7ea6af38dae7dd419517c6980030e26fea82b708a983f9a0b"},"schema_version":"1.0","source":{"id":"1407.7573","kind":"arxiv","version":3}},"canonical_sha256":"60e54ef8776d1a07d40788f0e02508c61710e18e20f5822659d28842b7d0ad44","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"60e54ef8776d1a07d40788f0e02508c61710e18e20f5822659d28842b7d0ad44","first_computed_at":"2026-05-18T02:16:39.295614Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:16:39.295614Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RGJuGvzayRRYn6/GVhmPLfyp6BM2Mfw70TIB9RBjfo6Dngd1RvGHdo3JYCyOu2iP/YSPjqfvS2XyRnjU6wF7Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:16:39.296348Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.7573","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8d09190f1157a3a1a60f97d52ab4a24557f4c7a35328cfb80c414b9e60914246","sha256:890d5f4c9bb07ce95332f6aff75fc75a4484f54e769af1da3dfd279d589b431b"],"state_sha256":"83eb580fa442cf8ba46e9cbd026c3653a661e5b1094402bc2dd64f27964dc304"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9TByoG3A2KaaoJskqAghHDGSVtXtynh5vZK9AQaRK9Mcc1odvAmPxQVai+ITshTI4l/1SiuO14lF4fHGQ1ybCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T07:58:44.130552Z","bundle_sha256":"0bdbc8523ff1e3b17c5e57d64320b7a30c173073940fcfc8b1e99c432e3edc0c"}}