{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:JYEEXEY6VNRCIQOLWRGIOP5NCY","short_pith_number":"pith:JYEEXEY6","canonical_record":{"source":{"id":"1207.3031","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-07-12T17:38:46Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"b1c28247f72a5c3b8c9f6430149641c057588663a76dcf1b8557727901da028b","abstract_canon_sha256":"b64337e2b69dc827d8dd6bf66c8bedebc27ba9987628a7bfd1c6a9336301d27a"},"schema_version":"1.0"},"canonical_sha256":"4e084b931eab622441cbb44c873fad160f1e7c28446e7ed9d536f6d4953c05a8","source":{"kind":"arxiv","id":"1207.3031","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.3031","created_at":"2026-05-18T03:50:35Z"},{"alias_kind":"arxiv_version","alias_value":"1207.3031v2","created_at":"2026-05-18T03:50:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.3031","created_at":"2026-05-18T03:50:35Z"},{"alias_kind":"pith_short_12","alias_value":"JYEEXEY6VNRC","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"JYEEXEY6VNRCIQOL","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"JYEEXEY6","created_at":"2026-05-18T12:27:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:JYEEXEY6VNRCIQOLWRGIOP5NCY","target":"record","payload":{"canonical_record":{"source":{"id":"1207.3031","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-07-12T17:38:46Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"b1c28247f72a5c3b8c9f6430149641c057588663a76dcf1b8557727901da028b","abstract_canon_sha256":"b64337e2b69dc827d8dd6bf66c8bedebc27ba9987628a7bfd1c6a9336301d27a"},"schema_version":"1.0"},"canonical_sha256":"4e084b931eab622441cbb44c873fad160f1e7c28446e7ed9d536f6d4953c05a8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:50:35.214556Z","signature_b64":"yzyh76byDsYzFAI8zAiReHUq56baEbtX2xRBCUuArSD+Vy8w71/ggvColOhApIskIBRBkcHTvHQMDIm0ueQoDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4e084b931eab622441cbb44c873fad160f1e7c28446e7ed9d536f6d4953c05a8","last_reissued_at":"2026-05-18T03:50:35.213743Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:50:35.213743Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1207.3031","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-18T03:50:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BQ/Zmx8IQSLamfezEqe/BSH0DhnGSnPRxWOtshi1Mx/oaS6jO1EhHD8diuGEQgJt8WfZ6hkDc0pD8SD8xNy/Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T23:11:27.798754Z"},"content_sha256":"eb586c61c487837590063734f68489ee2b8fdbae0fb0a52434dfa736c43475c7","schema_version":"1.0","event_id":"sha256:eb586c61c487837590063734f68489ee2b8fdbae0fb0a52434dfa736c43475c7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:JYEEXEY6VNRCIQOLWRGIOP5NCY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributed Strongly Convex Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.DC","authors_text":"Konstantinos I. Tsianos, Michael G. Rabbat","submitted_at":"2012-07-12T17:38:46Z","abstract_excerpt":"A lot of effort has been invested into characterizing the convergence rates of gradient based algorithms for non-linear convex optimization. Recently, motivated by large datasets and problems in machine learning, the interest has shifted towards distributed optimization. In this work we present a distributed algorithm for strongly convex constrained optimization. Each node in a network of n computers converges to the optimum of a strongly convex, L-Lipchitz continuous, separable objective at a rate O(log (sqrt(n) T) / T) where T is the number of iterations. This rate is achieved in the online "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.3031","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-18T03:50:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q/5rWY7pIuQqSVrCkAX39dU/Nyrief1NgW4/o+sKqpeY9qPWvTSF3q0sfDf0zEiF2J3RaNvPakgpQ1hO5XktCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T23:11:27.799203Z"},"content_sha256":"2573ec9758c1b8b9d341194e8684bfa1dbb45d34bc6e764af6cdd4253901168c","schema_version":"1.0","event_id":"sha256:2573ec9758c1b8b9d341194e8684bfa1dbb45d34bc6e764af6cdd4253901168c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JYEEXEY6VNRCIQOLWRGIOP5NCY/bundle.json","state_url":"https://pith.science/pith/JYEEXEY6VNRCIQOLWRGIOP5NCY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JYEEXEY6VNRCIQOLWRGIOP5NCY/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-30T23:11:27Z","links":{"resolver":"https://pith.science/pith/JYEEXEY6VNRCIQOLWRGIOP5NCY","bundle":"https://pith.science/pith/JYEEXEY6VNRCIQOLWRGIOP5NCY/bundle.json","state":"https://pith.science/pith/JYEEXEY6VNRCIQOLWRGIOP5NCY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JYEEXEY6VNRCIQOLWRGIOP5NCY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:JYEEXEY6VNRCIQOLWRGIOP5NCY","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":"b64337e2b69dc827d8dd6bf66c8bedebc27ba9987628a7bfd1c6a9336301d27a","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-07-12T17:38:46Z","title_canon_sha256":"b1c28247f72a5c3b8c9f6430149641c057588663a76dcf1b8557727901da028b"},"schema_version":"1.0","source":{"id":"1207.3031","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.3031","created_at":"2026-05-18T03:50:35Z"},{"alias_kind":"arxiv_version","alias_value":"1207.3031v2","created_at":"2026-05-18T03:50:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.3031","created_at":"2026-05-18T03:50:35Z"},{"alias_kind":"pith_short_12","alias_value":"JYEEXEY6VNRC","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"JYEEXEY6VNRCIQOL","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"JYEEXEY6","created_at":"2026-05-18T12:27:11Z"}],"graph_snapshots":[{"event_id":"sha256:2573ec9758c1b8b9d341194e8684bfa1dbb45d34bc6e764af6cdd4253901168c","target":"graph","created_at":"2026-05-18T03:50:35Z","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":"A lot of effort has been invested into characterizing the convergence rates of gradient based algorithms for non-linear convex optimization. Recently, motivated by large datasets and problems in machine learning, the interest has shifted towards distributed optimization. In this work we present a distributed algorithm for strongly convex constrained optimization. Each node in a network of n computers converges to the optimum of a strongly convex, L-Lipchitz continuous, separable objective at a rate O(log (sqrt(n) T) / T) where T is the number of iterations. This rate is achieved in the online ","authors_text":"Konstantinos I. Tsianos, Michael G. Rabbat","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-07-12T17:38:46Z","title":"Distributed Strongly Convex Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.3031","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:eb586c61c487837590063734f68489ee2b8fdbae0fb0a52434dfa736c43475c7","target":"record","created_at":"2026-05-18T03:50:35Z","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":"b64337e2b69dc827d8dd6bf66c8bedebc27ba9987628a7bfd1c6a9336301d27a","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-07-12T17:38:46Z","title_canon_sha256":"b1c28247f72a5c3b8c9f6430149641c057588663a76dcf1b8557727901da028b"},"schema_version":"1.0","source":{"id":"1207.3031","kind":"arxiv","version":2}},"canonical_sha256":"4e084b931eab622441cbb44c873fad160f1e7c28446e7ed9d536f6d4953c05a8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4e084b931eab622441cbb44c873fad160f1e7c28446e7ed9d536f6d4953c05a8","first_computed_at":"2026-05-18T03:50:35.213743Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:50:35.213743Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yzyh76byDsYzFAI8zAiReHUq56baEbtX2xRBCUuArSD+Vy8w71/ggvColOhApIskIBRBkcHTvHQMDIm0ueQoDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:50:35.214556Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.3031","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:eb586c61c487837590063734f68489ee2b8fdbae0fb0a52434dfa736c43475c7","sha256:2573ec9758c1b8b9d341194e8684bfa1dbb45d34bc6e764af6cdd4253901168c"],"state_sha256":"bdbae2e0492953c5ffe567a46012a121ab2a0465d137cab6d9ac70f3f334c718"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DXN+wongsKVQ62Or9BeEPdCdgjQYZ4MqlkdbsURLpZfIBISOt2bc7unF9zrCrMV8Ykb2GbNf7Uhxk8n7emxHAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T23:11:27.802503Z","bundle_sha256":"4ac904d278fd68856b23afc2333bcbab48da199cdbc4b5ce15530b4d9cf8148b"}}