{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:3VBB4UZBKNNDR5EFSGJLHLZYOM","short_pith_number":"pith:3VBB4UZB","schema_version":"1.0","canonical_sha256":"dd421e5321535a38f4859192b3af387315ff0feb2734ae035870b408e685b338","source":{"kind":"arxiv","id":"1310.7063","version":3},"attestation_state":"computed","paper":{"title":"On the Convergence of Decentralized Gradient Descent","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Kun Yuan, Qing Ling, Wotao Yin","submitted_at":"2013-10-26T03:30:46Z","abstract_excerpt":"Consider the consensus problem of minimizing $f(x)=\\sum_{i=1}^n f_i(x)$ where each $f_i$ is only known to one individual agent $i$ out of a connected network of $n$ agents. All the agents shall collaboratively solve this problem and obtain the solution subject to data exchanges restricted to between neighboring agents. Such algorithms avoid the need of a fusion center, offer better network load balance, and improve data privacy. We study the decentralized gradient descent method in which each agent $i$ updates its variable $x_{(i)}$, which is a local approximate to the unknown variable $x$, by"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1310.7063","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-10-26T03:30:46Z","cross_cats_sorted":[],"title_canon_sha256":"1bc998b3c1daf209195657861f6c931bcb47c1801da5e3eac15fed03d9a3eeaf","abstract_canon_sha256":"199483e7bf411860fd0415d1fa23d81b51373346a88ee0fbc3289cf4c6b622d9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:02:31.277188Z","signature_b64":"T9vu42dGCquwN5uH2jHhZ/oxWg/asaGHDjxQGRPPEizVjTVsmHsDzdqftyV6lszLcc9FdfBGh8NNErlh475wDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dd421e5321535a38f4859192b3af387315ff0feb2734ae035870b408e685b338","last_reissued_at":"2026-05-18T01:02:31.276562Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:02:31.276562Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Convergence of Decentralized Gradient Descent","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Kun Yuan, Qing Ling, Wotao Yin","submitted_at":"2013-10-26T03:30:46Z","abstract_excerpt":"Consider the consensus problem of minimizing $f(x)=\\sum_{i=1}^n f_i(x)$ where each $f_i$ is only known to one individual agent $i$ out of a connected network of $n$ agents. All the agents shall collaboratively solve this problem and obtain the solution subject to data exchanges restricted to between neighboring agents. Such algorithms avoid the need of a fusion center, offer better network load balance, and improve data privacy. We study the decentralized gradient descent method in which each agent $i$ updates its variable $x_{(i)}$, which is a local approximate to the unknown variable $x$, by"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.7063","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1310.7063","created_at":"2026-05-18T01:02:31.276651+00:00"},{"alias_kind":"arxiv_version","alias_value":"1310.7063v3","created_at":"2026-05-18T01:02:31.276651+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.7063","created_at":"2026-05-18T01:02:31.276651+00:00"},{"alias_kind":"pith_short_12","alias_value":"3VBB4UZBKNND","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_16","alias_value":"3VBB4UZBKNNDR5EF","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_8","alias_value":"3VBB4UZB","created_at":"2026-05-18T12:27:32.513160+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3VBB4UZBKNNDR5EFSGJLHLZYOM","json":"https://pith.science/pith/3VBB4UZBKNNDR5EFSGJLHLZYOM.json","graph_json":"https://pith.science/api/pith-number/3VBB4UZBKNNDR5EFSGJLHLZYOM/graph.json","events_json":"https://pith.science/api/pith-number/3VBB4UZBKNNDR5EFSGJLHLZYOM/events.json","paper":"https://pith.science/paper/3VBB4UZB"},"agent_actions":{"view_html":"https://pith.science/pith/3VBB4UZBKNNDR5EFSGJLHLZYOM","download_json":"https://pith.science/pith/3VBB4UZBKNNDR5EFSGJLHLZYOM.json","view_paper":"https://pith.science/paper/3VBB4UZB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1310.7063&json=true","fetch_graph":"https://pith.science/api/pith-number/3VBB4UZBKNNDR5EFSGJLHLZYOM/graph.json","fetch_events":"https://pith.science/api/pith-number/3VBB4UZBKNNDR5EFSGJLHLZYOM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3VBB4UZBKNNDR5EFSGJLHLZYOM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3VBB4UZBKNNDR5EFSGJLHLZYOM/action/storage_attestation","attest_author":"https://pith.science/pith/3VBB4UZBKNNDR5EFSGJLHLZYOM/action/author_attestation","sign_citation":"https://pith.science/pith/3VBB4UZBKNNDR5EFSGJLHLZYOM/action/citation_signature","submit_replication":"https://pith.science/pith/3VBB4UZBKNNDR5EFSGJLHLZYOM/action/replication_record"}},"created_at":"2026-05-18T01:02:31.276651+00:00","updated_at":"2026-05-18T01:02:31.276651+00:00"}