{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:HHKTBFXT6OH7LAHWO56K4YATPX","short_pith_number":"pith:HHKTBFXT","canonical_record":{"source":{"id":"1112.2972","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-12-13T17:33:27Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"157498e92f16f2c343dc37a9f37b293dc234151d0f1d1f9e0fa5a2b92cd91607","abstract_canon_sha256":"4d739c87fba44a663e654d8c87613b51e670c8f11e920e0bd8c7d2145c85a427"},"schema_version":"1.0"},"canonical_sha256":"39d53096f3f38ff580f6777cae60137dc7c602efe6169dbb21cf4d54e313c9ab","source":{"kind":"arxiv","id":"1112.2972","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.2972","created_at":"2026-05-18T02:54:21Z"},{"alias_kind":"arxiv_version","alias_value":"1112.2972v4","created_at":"2026-05-18T02:54:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.2972","created_at":"2026-05-18T02:54:21Z"},{"alias_kind":"pith_short_12","alias_value":"HHKTBFXT6OH7","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_16","alias_value":"HHKTBFXT6OH7LAHW","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_8","alias_value":"HHKTBFXT","created_at":"2026-05-18T12:26:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:HHKTBFXT6OH7LAHWO56K4YATPX","target":"record","payload":{"canonical_record":{"source":{"id":"1112.2972","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-12-13T17:33:27Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"157498e92f16f2c343dc37a9f37b293dc234151d0f1d1f9e0fa5a2b92cd91607","abstract_canon_sha256":"4d739c87fba44a663e654d8c87613b51e670c8f11e920e0bd8c7d2145c85a427"},"schema_version":"1.0"},"canonical_sha256":"39d53096f3f38ff580f6777cae60137dc7c602efe6169dbb21cf4d54e313c9ab","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:54:21.839168Z","signature_b64":"E8R4nAemDs5axbUguFqkza+KrnvARQP6quO46SjgeUkU7noyUaiz/o+6tOKrFzXs2o984qkwNqvfJsHu5fvFCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"39d53096f3f38ff580f6777cae60137dc7c602efe6169dbb21cf4d54e313c9ab","last_reissued_at":"2026-05-18T02:54:21.838777Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:54:21.838777Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1112.2972","source_version":4,"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:54:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eLGP3n1i5Gas/AJWHLbTUmJ2BYgub4jR7nYLfKpSggP2KogOn8RBkH/Vo3a1vhNPSUxZnCna9hPDu2awG1/HBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T05:51:47.454604Z"},"content_sha256":"d5e56c0b2a54a9e50a7a028aac9c8727a38da72e24875233dca4fe533655b350","schema_version":"1.0","event_id":"sha256:d5e56c0b2a54a9e50a7a028aac9c8727a38da72e24875233dca4fe533655b350"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:HHKTBFXT6OH7LAHWO56K4YATPX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast Distributed Gradient Methods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Dusan Jakovetic, Joao Xavier, Jose M. F. Moura","submitted_at":"2011-12-13T17:33:27Z","abstract_excerpt":"We study distributed optimization problems when $N$ nodes minimize the sum of their individual costs subject to a common vector variable. The costs are convex, have Lipschitz continuous gradient (with constant $L$), and bounded gradient. We propose two fast distributed gradient algorithms based on the centralized Nesterov gradient algorithm and establish their convergence rates in terms of the per-node communications $\\mathcal{K}$ and the per-node gradient evaluations $k$. Our first method, Distributed Nesterov Gradient, achieves rates $O\\left({\\log \\mathcal{K}}/{\\mathcal{K}}\\right)$ and $O\\le"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.2972","kind":"arxiv","version":4},"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:54:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4Efko+K7lNMVKTRIRKMRUoecQUC4msSi+GJti2Apk3MzGnQ8Z6QzVnWzbzK6e9maGdGPmJlAYQK8HiW+AGpQBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T05:51:47.455232Z"},"content_sha256":"bbda534627396fcce9dabec20d625928ba2dd56795ff66f4650338885d551923","schema_version":"1.0","event_id":"sha256:bbda534627396fcce9dabec20d625928ba2dd56795ff66f4650338885d551923"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HHKTBFXT6OH7LAHWO56K4YATPX/bundle.json","state_url":"https://pith.science/pith/HHKTBFXT6OH7LAHWO56K4YATPX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HHKTBFXT6OH7LAHWO56K4YATPX/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-25T05:51:47Z","links":{"resolver":"https://pith.science/pith/HHKTBFXT6OH7LAHWO56K4YATPX","bundle":"https://pith.science/pith/HHKTBFXT6OH7LAHWO56K4YATPX/bundle.json","state":"https://pith.science/pith/HHKTBFXT6OH7LAHWO56K4YATPX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HHKTBFXT6OH7LAHWO56K4YATPX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:HHKTBFXT6OH7LAHWO56K4YATPX","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":"4d739c87fba44a663e654d8c87613b51e670c8f11e920e0bd8c7d2145c85a427","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-12-13T17:33:27Z","title_canon_sha256":"157498e92f16f2c343dc37a9f37b293dc234151d0f1d1f9e0fa5a2b92cd91607"},"schema_version":"1.0","source":{"id":"1112.2972","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.2972","created_at":"2026-05-18T02:54:21Z"},{"alias_kind":"arxiv_version","alias_value":"1112.2972v4","created_at":"2026-05-18T02:54:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.2972","created_at":"2026-05-18T02:54:21Z"},{"alias_kind":"pith_short_12","alias_value":"HHKTBFXT6OH7","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_16","alias_value":"HHKTBFXT6OH7LAHW","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_8","alias_value":"HHKTBFXT","created_at":"2026-05-18T12:26:30Z"}],"graph_snapshots":[{"event_id":"sha256:bbda534627396fcce9dabec20d625928ba2dd56795ff66f4650338885d551923","target":"graph","created_at":"2026-05-18T02:54:21Z","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":"We study distributed optimization problems when $N$ nodes minimize the sum of their individual costs subject to a common vector variable. The costs are convex, have Lipschitz continuous gradient (with constant $L$), and bounded gradient. We propose two fast distributed gradient algorithms based on the centralized Nesterov gradient algorithm and establish their convergence rates in terms of the per-node communications $\\mathcal{K}$ and the per-node gradient evaluations $k$. Our first method, Distributed Nesterov Gradient, achieves rates $O\\left({\\log \\mathcal{K}}/{\\mathcal{K}}\\right)$ and $O\\le","authors_text":"Dusan Jakovetic, Joao Xavier, Jose M. F. Moura","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-12-13T17:33:27Z","title":"Fast Distributed Gradient Methods"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.2972","kind":"arxiv","version":4},"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:d5e56c0b2a54a9e50a7a028aac9c8727a38da72e24875233dca4fe533655b350","target":"record","created_at":"2026-05-18T02:54:21Z","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":"4d739c87fba44a663e654d8c87613b51e670c8f11e920e0bd8c7d2145c85a427","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-12-13T17:33:27Z","title_canon_sha256":"157498e92f16f2c343dc37a9f37b293dc234151d0f1d1f9e0fa5a2b92cd91607"},"schema_version":"1.0","source":{"id":"1112.2972","kind":"arxiv","version":4}},"canonical_sha256":"39d53096f3f38ff580f6777cae60137dc7c602efe6169dbb21cf4d54e313c9ab","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"39d53096f3f38ff580f6777cae60137dc7c602efe6169dbb21cf4d54e313c9ab","first_computed_at":"2026-05-18T02:54:21.838777Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:54:21.838777Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"E8R4nAemDs5axbUguFqkza+KrnvARQP6quO46SjgeUkU7noyUaiz/o+6tOKrFzXs2o984qkwNqvfJsHu5fvFCA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:54:21.839168Z","signed_message":"canonical_sha256_bytes"},"source_id":"1112.2972","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d5e56c0b2a54a9e50a7a028aac9c8727a38da72e24875233dca4fe533655b350","sha256:bbda534627396fcce9dabec20d625928ba2dd56795ff66f4650338885d551923"],"state_sha256":"1f6bc021c818a199f9836290db76416e6fb433de072ffd590204bac53bd7208c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XVnCYi649Ggx3ZIHJ4a9Fvykg9Z/Q/+x03birPDYsEWoWkIv6E1HN0jeV+4g383wmWU2kf71L+m7F33YcDQTCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T05:51:47.463008Z","bundle_sha256":"690af4909989b9225b2eb4ac1a65bbff76291fe478feef16fa2a316eecc7486d"}}