{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:KYENZNX7X4OUYXTCTEFTPHSAD6","short_pith_number":"pith:KYENZNX7","canonical_record":{"source":{"id":"1805.09969","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-05-25T03:49:33Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"8946de7ca02e2085b7829748201d7a55420bdeba343a874867a738326196f996","abstract_canon_sha256":"e05bcdaf4720535762a3eafce57b0e03ddf1b24fcb5bc958a9fdbb61114b9006"},"schema_version":"1.0"},"canonical_sha256":"5608dcb6ffbf1d4c5e62990b379e401fa9539386ba062165a1d19571f37fb9b0","source":{"kind":"arxiv","id":"1805.09969","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.09969","created_at":"2026-05-18T00:14:58Z"},{"alias_kind":"arxiv_version","alias_value":"1805.09969v1","created_at":"2026-05-18T00:14:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.09969","created_at":"2026-05-18T00:14:58Z"},{"alias_kind":"pith_short_12","alias_value":"KYENZNX7X4OU","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"KYENZNX7X4OUYXTC","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"KYENZNX7","created_at":"2026-05-18T12:32:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:KYENZNX7X4OUYXTCTEFTPHSAD6","target":"record","payload":{"canonical_record":{"source":{"id":"1805.09969","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-05-25T03:49:33Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"8946de7ca02e2085b7829748201d7a55420bdeba343a874867a738326196f996","abstract_canon_sha256":"e05bcdaf4720535762a3eafce57b0e03ddf1b24fcb5bc958a9fdbb61114b9006"},"schema_version":"1.0"},"canonical_sha256":"5608dcb6ffbf1d4c5e62990b379e401fa9539386ba062165a1d19571f37fb9b0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:58.636624Z","signature_b64":"5qnXxE7tpa2jZQUlCtx4oeH85kNHWteWgCI3NgLL1KIX2ie7+uYBeDP4xcCbBtna0d9JZDZzqY4kRsQuuWDlAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5608dcb6ffbf1d4c5e62990b379e401fa9539386ba062165a1d19571f37fb9b0","last_reissued_at":"2026-05-18T00:14:58.636039Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:58.636039Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.09969","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:14:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pgdUqzGFMGl7l/ulnivFspwI9QAkogxp//wr2tCoAsvIWE6vdjrWh+3KDNceqaXj2deJnbUeGuUjINnOZ4daDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T08:17:45.721803Z"},"content_sha256":"c8421b8318f8686ef300fb879ea2a30cbd72e6ea39bdc2740cfe1209e99fa859","schema_version":"1.0","event_id":"sha256:c8421b8318f8686ef300fb879ea2a30cbd72e6ea39bdc2740cfe1209e99fa859"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:KYENZNX7X4OUYXTCTEFTPHSAD6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Towards More Efficient Stochastic Decentralized Learning: Faster Convergence and Sparse Communication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Aryan Mokhtari, Hui Qian, Peilin Zhao, Tengfei Zhou, Zebang Shen","submitted_at":"2018-05-25T03:49:33Z","abstract_excerpt":"Recently, the decentralized optimization problem is attracting growing attention. Most existing methods are deterministic with high per-iteration cost and have a convergence rate quadratically depending on the problem condition number. Besides, the dense communication is necessary to ensure the convergence even if the dataset is sparse. In this paper, we generalize the decentralized optimization problem to a monotone operator root finding problem, and propose a stochastic algorithm named DSBA that (i) converges geometrically with a rate linearly depending on the problem condition number, and ("},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.09969","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:14:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9NtVIU+zP8tyQHWfoRGQIixoi9ak+cAxeXvLqH3S8g9VZbiqvUSFA4+vodsmDBmnrjBJphB4h8mT0cXp6MkVAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T08:17:45.722153Z"},"content_sha256":"9b42d04552bc41295a77c4aeac746eb05908a00797512a8663a8c10bd197fff8","schema_version":"1.0","event_id":"sha256:9b42d04552bc41295a77c4aeac746eb05908a00797512a8663a8c10bd197fff8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KYENZNX7X4OUYXTCTEFTPHSAD6/bundle.json","state_url":"https://pith.science/pith/KYENZNX7X4OUYXTCTEFTPHSAD6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KYENZNX7X4OUYXTCTEFTPHSAD6/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-06-01T08:17:45Z","links":{"resolver":"https://pith.science/pith/KYENZNX7X4OUYXTCTEFTPHSAD6","bundle":"https://pith.science/pith/KYENZNX7X4OUYXTCTEFTPHSAD6/bundle.json","state":"https://pith.science/pith/KYENZNX7X4OUYXTCTEFTPHSAD6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KYENZNX7X4OUYXTCTEFTPHSAD6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:KYENZNX7X4OUYXTCTEFTPHSAD6","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":"e05bcdaf4720535762a3eafce57b0e03ddf1b24fcb5bc958a9fdbb61114b9006","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-05-25T03:49:33Z","title_canon_sha256":"8946de7ca02e2085b7829748201d7a55420bdeba343a874867a738326196f996"},"schema_version":"1.0","source":{"id":"1805.09969","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.09969","created_at":"2026-05-18T00:14:58Z"},{"alias_kind":"arxiv_version","alias_value":"1805.09969v1","created_at":"2026-05-18T00:14:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.09969","created_at":"2026-05-18T00:14:58Z"},{"alias_kind":"pith_short_12","alias_value":"KYENZNX7X4OU","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"KYENZNX7X4OUYXTC","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"KYENZNX7","created_at":"2026-05-18T12:32:33Z"}],"graph_snapshots":[{"event_id":"sha256:9b42d04552bc41295a77c4aeac746eb05908a00797512a8663a8c10bd197fff8","target":"graph","created_at":"2026-05-18T00:14:58Z","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":"Recently, the decentralized optimization problem is attracting growing attention. Most existing methods are deterministic with high per-iteration cost and have a convergence rate quadratically depending on the problem condition number. Besides, the dense communication is necessary to ensure the convergence even if the dataset is sparse. In this paper, we generalize the decentralized optimization problem to a monotone operator root finding problem, and propose a stochastic algorithm named DSBA that (i) converges geometrically with a rate linearly depending on the problem condition number, and (","authors_text":"Aryan Mokhtari, Hui Qian, Peilin Zhao, Tengfei Zhou, Zebang Shen","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-05-25T03:49:33Z","title":"Towards More Efficient Stochastic Decentralized Learning: Faster Convergence and Sparse Communication"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.09969","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:c8421b8318f8686ef300fb879ea2a30cbd72e6ea39bdc2740cfe1209e99fa859","target":"record","created_at":"2026-05-18T00:14:58Z","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":"e05bcdaf4720535762a3eafce57b0e03ddf1b24fcb5bc958a9fdbb61114b9006","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-05-25T03:49:33Z","title_canon_sha256":"8946de7ca02e2085b7829748201d7a55420bdeba343a874867a738326196f996"},"schema_version":"1.0","source":{"id":"1805.09969","kind":"arxiv","version":1}},"canonical_sha256":"5608dcb6ffbf1d4c5e62990b379e401fa9539386ba062165a1d19571f37fb9b0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5608dcb6ffbf1d4c5e62990b379e401fa9539386ba062165a1d19571f37fb9b0","first_computed_at":"2026-05-18T00:14:58.636039Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:14:58.636039Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5qnXxE7tpa2jZQUlCtx4oeH85kNHWteWgCI3NgLL1KIX2ie7+uYBeDP4xcCbBtna0d9JZDZzqY4kRsQuuWDlAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:14:58.636624Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.09969","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c8421b8318f8686ef300fb879ea2a30cbd72e6ea39bdc2740cfe1209e99fa859","sha256:9b42d04552bc41295a77c4aeac746eb05908a00797512a8663a8c10bd197fff8"],"state_sha256":"14d509c0754fe8fb402dffc840bd708b8c2a1b40d5350c262e281dae67b3993a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5LnYbaqYDrbZbe3EWIL+ugy5xmyHnf2lbm7sWh3OmxkNVpSwX6S0o7nf5g8PPlRdyd66Uw7JiX26wxs9orO2DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T08:17:45.724186Z","bundle_sha256":"cc5fb575643d590b5ae7fad41d0e56d25186d5fa0533072ea352a3f30f8beb6e"}}