{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:LIAYPMJBVZUP53A4YUK4IQPFO7","short_pith_number":"pith:LIAYPMJB","canonical_record":{"source":{"id":"1711.05305","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-11-14T20:19:10Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"0a32d990551a5677ae24dbc80edfc120aa37bbb97a7de05c36cf9f2842ec9296","abstract_canon_sha256":"37efc9c4f3d6c9d1335741039be0d00c3a32e63fb04098030eea7a850b2841c6"},"schema_version":"1.0"},"canonical_sha256":"5a0187b121ae68feec1cc515c441e577c355df846b0dc804ea34d4156f96216d","source":{"kind":"arxiv","id":"1711.05305","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.05305","created_at":"2026-05-18T00:30:33Z"},{"alias_kind":"arxiv_version","alias_value":"1711.05305v1","created_at":"2026-05-18T00:30:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.05305","created_at":"2026-05-18T00:30:33Z"},{"alias_kind":"pith_short_12","alias_value":"LIAYPMJBVZUP","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"LIAYPMJBVZUP53A4","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"LIAYPMJB","created_at":"2026-05-18T12:31:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:LIAYPMJBVZUP53A4YUK4IQPFO7","target":"record","payload":{"canonical_record":{"source":{"id":"1711.05305","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-11-14T20:19:10Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"0a32d990551a5677ae24dbc80edfc120aa37bbb97a7de05c36cf9f2842ec9296","abstract_canon_sha256":"37efc9c4f3d6c9d1335741039be0d00c3a32e63fb04098030eea7a850b2841c6"},"schema_version":"1.0"},"canonical_sha256":"5a0187b121ae68feec1cc515c441e577c355df846b0dc804ea34d4156f96216d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:33.695405Z","signature_b64":"QmKwiVQ/01BAo+ZIW9jibtjMwNu1qgs3/Zwz/bI6OXebRGmsTJWIQPs9n0K1nPX8F0O9N5LExvLsYLxJbRESCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5a0187b121ae68feec1cc515c441e577c355df846b0dc804ea34d4156f96216d","last_reissued_at":"2026-05-18T00:30:33.694792Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:33.694792Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.05305","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-05-18T00:30:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CN8LA1goiZ7WqmklpQEaC5R/PXqvWeSsnBNj1Yu/u6JjRmU03fAaXTTofQVOvHAqwJSyc1F7acZiQyUMuocMAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T05:04:01.027371Z"},"content_sha256":"b5df4e2a20bf2c3e78c120b38a4700ac4797da910a766794a5f34b9d6700ae20","schema_version":"1.0","event_id":"sha256:b5df4e2a20bf2c3e78c120b38a4700ac4797da910a766794a5f34b9d6700ae20"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:LIAYPMJBVZUP53A4YUK4IQPFO7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Accelerated Communication-Efficient Primal-Dual Optimization Framework for Structured Machine Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Chenxin Ma, Frank E. Curtis, Martin Jaggi, Martin Tak\\'a\\v{c}, Nathan Srebro","submitted_at":"2017-11-14T20:19:10Z","abstract_excerpt":"Distributed optimization algorithms are essential for training machine learning models on very large-scale datasets. However, they often suffer from communication bottlenecks. Confronting this issue, a communication-efficient primal-dual coordinate ascent framework (CoCoA) and its improved variant CoCoA+ have been proposed, achieving a convergence rate of $\\mathcal{O}(1/t)$ for solving empirical risk minimization problems with Lipschitz continuous losses. In this paper, an accelerated variant of CoCoA+ is proposed and shown to possess a convergence rate of $\\mathcal{O}(1/t^2)$ in terms of redu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.05305","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":""},"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:30:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U59WbnkMXvpHb9/9hyk7WQwisVI3N3TEa1ZSo0ks57cH+zzBdMJ3QnZYxLGnfhfNSrfGhIJ+nDO1ZR4UFYwDAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T05:04:01.028133Z"},"content_sha256":"caab3ad164f7baae74215a37fbee19d921a99cf1c5d10110f7f9125b6216eb00","schema_version":"1.0","event_id":"sha256:caab3ad164f7baae74215a37fbee19d921a99cf1c5d10110f7f9125b6216eb00"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LIAYPMJBVZUP53A4YUK4IQPFO7/bundle.json","state_url":"https://pith.science/pith/LIAYPMJBVZUP53A4YUK4IQPFO7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LIAYPMJBVZUP53A4YUK4IQPFO7/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-27T05:04:01Z","links":{"resolver":"https://pith.science/pith/LIAYPMJBVZUP53A4YUK4IQPFO7","bundle":"https://pith.science/pith/LIAYPMJBVZUP53A4YUK4IQPFO7/bundle.json","state":"https://pith.science/pith/LIAYPMJBVZUP53A4YUK4IQPFO7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LIAYPMJBVZUP53A4YUK4IQPFO7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:LIAYPMJBVZUP53A4YUK4IQPFO7","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":"37efc9c4f3d6c9d1335741039be0d00c3a32e63fb04098030eea7a850b2841c6","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-11-14T20:19:10Z","title_canon_sha256":"0a32d990551a5677ae24dbc80edfc120aa37bbb97a7de05c36cf9f2842ec9296"},"schema_version":"1.0","source":{"id":"1711.05305","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.05305","created_at":"2026-05-18T00:30:33Z"},{"alias_kind":"arxiv_version","alias_value":"1711.05305v1","created_at":"2026-05-18T00:30:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.05305","created_at":"2026-05-18T00:30:33Z"},{"alias_kind":"pith_short_12","alias_value":"LIAYPMJBVZUP","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"LIAYPMJBVZUP53A4","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"LIAYPMJB","created_at":"2026-05-18T12:31:28Z"}],"graph_snapshots":[{"event_id":"sha256:caab3ad164f7baae74215a37fbee19d921a99cf1c5d10110f7f9125b6216eb00","target":"graph","created_at":"2026-05-18T00:30:33Z","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":"Distributed optimization algorithms are essential for training machine learning models on very large-scale datasets. However, they often suffer from communication bottlenecks. Confronting this issue, a communication-efficient primal-dual coordinate ascent framework (CoCoA) and its improved variant CoCoA+ have been proposed, achieving a convergence rate of $\\mathcal{O}(1/t)$ for solving empirical risk minimization problems with Lipschitz continuous losses. In this paper, an accelerated variant of CoCoA+ is proposed and shown to possess a convergence rate of $\\mathcal{O}(1/t^2)$ in terms of redu","authors_text":"Chenxin Ma, Frank E. Curtis, Martin Jaggi, Martin Tak\\'a\\v{c}, Nathan Srebro","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-11-14T20:19:10Z","title":"An Accelerated Communication-Efficient Primal-Dual Optimization Framework for Structured Machine Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.05305","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:b5df4e2a20bf2c3e78c120b38a4700ac4797da910a766794a5f34b9d6700ae20","target":"record","created_at":"2026-05-18T00:30:33Z","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":"37efc9c4f3d6c9d1335741039be0d00c3a32e63fb04098030eea7a850b2841c6","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-11-14T20:19:10Z","title_canon_sha256":"0a32d990551a5677ae24dbc80edfc120aa37bbb97a7de05c36cf9f2842ec9296"},"schema_version":"1.0","source":{"id":"1711.05305","kind":"arxiv","version":1}},"canonical_sha256":"5a0187b121ae68feec1cc515c441e577c355df846b0dc804ea34d4156f96216d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5a0187b121ae68feec1cc515c441e577c355df846b0dc804ea34d4156f96216d","first_computed_at":"2026-05-18T00:30:33.694792Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:30:33.694792Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QmKwiVQ/01BAo+ZIW9jibtjMwNu1qgs3/Zwz/bI6OXebRGmsTJWIQPs9n0K1nPX8F0O9N5LExvLsYLxJbRESCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:30:33.695405Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.05305","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b5df4e2a20bf2c3e78c120b38a4700ac4797da910a766794a5f34b9d6700ae20","sha256:caab3ad164f7baae74215a37fbee19d921a99cf1c5d10110f7f9125b6216eb00"],"state_sha256":"b26bb2d0c2b93e7c409cf8976bff2296cb7dc7b8203c2e61cf5c3019f01c49e1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EThPifkHPxYrT5oknNXg7nvC9mh/htitT6XLoW0kIxNiOJwDrWI9MvJBmcaLfPQg5VWMOV4CXJNXdNwzfOkVBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T05:04:01.032950Z","bundle_sha256":"be418faa349b3ef3a4c2d12183a3eeb68bb5d0bf697124c4d7a552e73dfe9bf3"}}