{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:3VBB4UZBKNNDR5EFSGJLHLZYOM","short_pith_number":"pith:3VBB4UZB","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"},"canonical_sha256":"dd421e5321535a38f4859192b3af387315ff0feb2734ae035870b408e685b338","source":{"kind":"arxiv","id":"1310.7063","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.7063","created_at":"2026-05-18T01:02:31Z"},{"alias_kind":"arxiv_version","alias_value":"1310.7063v3","created_at":"2026-05-18T01:02:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.7063","created_at":"2026-05-18T01:02:31Z"},{"alias_kind":"pith_short_12","alias_value":"3VBB4UZBKNND","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"3VBB4UZBKNNDR5EF","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"3VBB4UZB","created_at":"2026-05-18T12:27:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:3VBB4UZBKNNDR5EFSGJLHLZYOM","target":"record","payload":{"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"},"canonical_sha256":"dd421e5321535a38f4859192b3af387315ff0feb2734ae035870b408e685b338","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"},"source_kind":"arxiv","source_id":"1310.7063","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-18T01:02:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vNHjYimKf+Evp0g97jBrhqV4EDqS2YIQEnbGM6ZmbdvA7KP0I8mrLyWQM25KwUST2Wdn17ooHBiMHKbNRs8vCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T20:56:47.820040Z"},"content_sha256":"c39c64a85f258702430aca17035043f7de5234bbb242fec4eb850dc1674750b1","schema_version":"1.0","event_id":"sha256:c39c64a85f258702430aca17035043f7de5234bbb242fec4eb850dc1674750b1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:3VBB4UZBKNNDR5EFSGJLHLZYOM","target":"graph","payload":{"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"},"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-18T01:02:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"btUXH8hYgJSxGXOVaGNIMLe6F9A7bKdxQ03CtCGmALr3y4R/K3ezAK+ftKpiHClDoU1KNofs8ZTVJczeh0KJBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T20:56:47.820432Z"},"content_sha256":"466630d6775cd468ba277fabc1a8979db7e8ae49e5eb71e53bfff19b770252da","schema_version":"1.0","event_id":"sha256:466630d6775cd468ba277fabc1a8979db7e8ae49e5eb71e53bfff19b770252da"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3VBB4UZBKNNDR5EFSGJLHLZYOM/bundle.json","state_url":"https://pith.science/pith/3VBB4UZBKNNDR5EFSGJLHLZYOM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3VBB4UZBKNNDR5EFSGJLHLZYOM/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-30T20:56:47Z","links":{"resolver":"https://pith.science/pith/3VBB4UZBKNNDR5EFSGJLHLZYOM","bundle":"https://pith.science/pith/3VBB4UZBKNNDR5EFSGJLHLZYOM/bundle.json","state":"https://pith.science/pith/3VBB4UZBKNNDR5EFSGJLHLZYOM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3VBB4UZBKNNDR5EFSGJLHLZYOM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:3VBB4UZBKNNDR5EFSGJLHLZYOM","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":"199483e7bf411860fd0415d1fa23d81b51373346a88ee0fbc3289cf4c6b622d9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-10-26T03:30:46Z","title_canon_sha256":"1bc998b3c1daf209195657861f6c931bcb47c1801da5e3eac15fed03d9a3eeaf"},"schema_version":"1.0","source":{"id":"1310.7063","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.7063","created_at":"2026-05-18T01:02:31Z"},{"alias_kind":"arxiv_version","alias_value":"1310.7063v3","created_at":"2026-05-18T01:02:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.7063","created_at":"2026-05-18T01:02:31Z"},{"alias_kind":"pith_short_12","alias_value":"3VBB4UZBKNND","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"3VBB4UZBKNNDR5EF","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"3VBB4UZB","created_at":"2026-05-18T12:27:32Z"}],"graph_snapshots":[{"event_id":"sha256:466630d6775cd468ba277fabc1a8979db7e8ae49e5eb71e53bfff19b770252da","target":"graph","created_at":"2026-05-18T01:02:31Z","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":"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","authors_text":"Kun Yuan, Qing Ling, Wotao Yin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-10-26T03:30:46Z","title":"On the Convergence of Decentralized Gradient Descent"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.7063","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:c39c64a85f258702430aca17035043f7de5234bbb242fec4eb850dc1674750b1","target":"record","created_at":"2026-05-18T01:02:31Z","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":"199483e7bf411860fd0415d1fa23d81b51373346a88ee0fbc3289cf4c6b622d9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-10-26T03:30:46Z","title_canon_sha256":"1bc998b3c1daf209195657861f6c931bcb47c1801da5e3eac15fed03d9a3eeaf"},"schema_version":"1.0","source":{"id":"1310.7063","kind":"arxiv","version":3}},"canonical_sha256":"dd421e5321535a38f4859192b3af387315ff0feb2734ae035870b408e685b338","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dd421e5321535a38f4859192b3af387315ff0feb2734ae035870b408e685b338","first_computed_at":"2026-05-18T01:02:31.276562Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:02:31.276562Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"T9vu42dGCquwN5uH2jHhZ/oxWg/asaGHDjxQGRPPEizVjTVsmHsDzdqftyV6lszLcc9FdfBGh8NNErlh475wDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:02:31.277188Z","signed_message":"canonical_sha256_bytes"},"source_id":"1310.7063","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c39c64a85f258702430aca17035043f7de5234bbb242fec4eb850dc1674750b1","sha256:466630d6775cd468ba277fabc1a8979db7e8ae49e5eb71e53bfff19b770252da"],"state_sha256":"8a49d9916e8b6c0c51414ac04bec8bc597b37036f9d70eea252b4574c4323ce6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lNFq/NoXGF6lypncUtxu/VOG9D7ufIhiV0vEeHenjzCP/Fk8bgKuN/pjsxYwJ0EA+jec2xe4bNQYUeEg52jTCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T20:56:47.822951Z","bundle_sha256":"726f95cadd9eef4fcd86efc93a51c64a8f2ce096692e87650cbf8cfce5e9bde7"}}