{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:AS7AU37QLBVNE4CP6XTEQODXVE","short_pith_number":"pith:AS7AU37Q","canonical_record":{"source":{"id":"1809.06958","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-09-18T22:51:32Z","cross_cats_sorted":["math.OC","stat.ML"],"title_canon_sha256":"cebbd237f020e85bf400079b3474de009d61449eb5aebf06e2d837f0b1167baf","abstract_canon_sha256":"01aa7734f02bbb1f963053c2cf030c752c256916811480b482d9e8927104130f"},"schema_version":"1.0"},"canonical_sha256":"04be0a6ff0586ad2704ff5e6483877a9080d2885bebbb42c970abaa2d2650b10","source":{"kind":"arxiv","id":"1809.06958","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.06958","created_at":"2026-05-18T00:05:21Z"},{"alias_kind":"arxiv_version","alias_value":"1809.06958v1","created_at":"2026-05-18T00:05:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.06958","created_at":"2026-05-18T00:05:21Z"},{"alias_kind":"pith_short_12","alias_value":"AS7AU37QLBVN","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"AS7AU37QLBVNE4CP","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"AS7AU37Q","created_at":"2026-05-18T12:32:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:AS7AU37QLBVNE4CP6XTEQODXVE","target":"record","payload":{"canonical_record":{"source":{"id":"1809.06958","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-09-18T22:51:32Z","cross_cats_sorted":["math.OC","stat.ML"],"title_canon_sha256":"cebbd237f020e85bf400079b3474de009d61449eb5aebf06e2d837f0b1167baf","abstract_canon_sha256":"01aa7734f02bbb1f963053c2cf030c752c256916811480b482d9e8927104130f"},"schema_version":"1.0"},"canonical_sha256":"04be0a6ff0586ad2704ff5e6483877a9080d2885bebbb42c970abaa2d2650b10","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:21.058511Z","signature_b64":"QVlcJGhSQ1ZJRIbCS8fZM6tru9gvQHG2V7ssOCgkDbtF3aThe3DpRKOb3oXn7NfTfGahYtJAKjP7TOlvFohNDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"04be0a6ff0586ad2704ff5e6483877a9080d2885bebbb42c970abaa2d2650b10","last_reissued_at":"2026-05-18T00:05:21.057941Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:21.057941Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1809.06958","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:05:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cbGCnQ5w8V/ENssOVEZkbzI7iBO3Bs5OLwi6JcY4JyYk+RAcC3GAZ8kDbClPw1KOHEFCzKA1pymPO4ocJk78CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T22:55:56.020669Z"},"content_sha256":"085d8978944a562082ec55ba5b300ad2306311dedc8ec10d86cb64eea1710034","schema_version":"1.0","event_id":"sha256:085d8978944a562082ec55ba5b300ad2306311dedc8ec10d86cb64eea1710034"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:AS7AU37QLBVNE4CP6XTEQODXVE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Graph-Dependent Implicit Regularisation for Distributed Stochastic Subgradient Descent","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Dominic Richards, Patrick Rebeschini","submitted_at":"2018-09-18T22:51:32Z","abstract_excerpt":"We propose graph-dependent implicit regularisation strategies for distributed stochastic subgradient descent (Distributed SGD) for convex problems in multi-agent learning. Under the standard assumptions of convexity, Lipschitz continuity, and smoothness, we establish statistical learning rates that retain, up to logarithmic terms, centralised statistical guarantees through implicit regularisation (step size tuning and early stopping) with appropriate dependence on the graph topology. Our approach avoids the need for explicit regularisation in decentralised learning problems, such as adding con"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.06958","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:05:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sMdwYBcAxWLiUa2T17AtMDliw9YaBK7ZTRV6Q7AX+uXm3YFhzb9hFzxmPEa9st2Tp/U3A7IGklniGdJPRdnWAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T22:55:56.021376Z"},"content_sha256":"610eb8efacb7897d942b9ebf48f9c6ced366655120bfca56715dd9d420aed5f6","schema_version":"1.0","event_id":"sha256:610eb8efacb7897d942b9ebf48f9c6ced366655120bfca56715dd9d420aed5f6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AS7AU37QLBVNE4CP6XTEQODXVE/bundle.json","state_url":"https://pith.science/pith/AS7AU37QLBVNE4CP6XTEQODXVE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AS7AU37QLBVNE4CP6XTEQODXVE/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-28T22:55:56Z","links":{"resolver":"https://pith.science/pith/AS7AU37QLBVNE4CP6XTEQODXVE","bundle":"https://pith.science/pith/AS7AU37QLBVNE4CP6XTEQODXVE/bundle.json","state":"https://pith.science/pith/AS7AU37QLBVNE4CP6XTEQODXVE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AS7AU37QLBVNE4CP6XTEQODXVE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:AS7AU37QLBVNE4CP6XTEQODXVE","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":"01aa7734f02bbb1f963053c2cf030c752c256916811480b482d9e8927104130f","cross_cats_sorted":["math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-09-18T22:51:32Z","title_canon_sha256":"cebbd237f020e85bf400079b3474de009d61449eb5aebf06e2d837f0b1167baf"},"schema_version":"1.0","source":{"id":"1809.06958","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.06958","created_at":"2026-05-18T00:05:21Z"},{"alias_kind":"arxiv_version","alias_value":"1809.06958v1","created_at":"2026-05-18T00:05:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.06958","created_at":"2026-05-18T00:05:21Z"},{"alias_kind":"pith_short_12","alias_value":"AS7AU37QLBVN","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"AS7AU37QLBVNE4CP","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"AS7AU37Q","created_at":"2026-05-18T12:32:13Z"}],"graph_snapshots":[{"event_id":"sha256:610eb8efacb7897d942b9ebf48f9c6ced366655120bfca56715dd9d420aed5f6","target":"graph","created_at":"2026-05-18T00:05: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 propose graph-dependent implicit regularisation strategies for distributed stochastic subgradient descent (Distributed SGD) for convex problems in multi-agent learning. Under the standard assumptions of convexity, Lipschitz continuity, and smoothness, we establish statistical learning rates that retain, up to logarithmic terms, centralised statistical guarantees through implicit regularisation (step size tuning and early stopping) with appropriate dependence on the graph topology. Our approach avoids the need for explicit regularisation in decentralised learning problems, such as adding con","authors_text":"Dominic Richards, Patrick Rebeschini","cross_cats":["math.OC","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-09-18T22:51:32Z","title":"Graph-Dependent Implicit Regularisation for Distributed Stochastic Subgradient Descent"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.06958","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:085d8978944a562082ec55ba5b300ad2306311dedc8ec10d86cb64eea1710034","target":"record","created_at":"2026-05-18T00:05: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":"01aa7734f02bbb1f963053c2cf030c752c256916811480b482d9e8927104130f","cross_cats_sorted":["math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-09-18T22:51:32Z","title_canon_sha256":"cebbd237f020e85bf400079b3474de009d61449eb5aebf06e2d837f0b1167baf"},"schema_version":"1.0","source":{"id":"1809.06958","kind":"arxiv","version":1}},"canonical_sha256":"04be0a6ff0586ad2704ff5e6483877a9080d2885bebbb42c970abaa2d2650b10","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"04be0a6ff0586ad2704ff5e6483877a9080d2885bebbb42c970abaa2d2650b10","first_computed_at":"2026-05-18T00:05:21.057941Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:05:21.057941Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QVlcJGhSQ1ZJRIbCS8fZM6tru9gvQHG2V7ssOCgkDbtF3aThe3DpRKOb3oXn7NfTfGahYtJAKjP7TOlvFohNDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:05:21.058511Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.06958","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:085d8978944a562082ec55ba5b300ad2306311dedc8ec10d86cb64eea1710034","sha256:610eb8efacb7897d942b9ebf48f9c6ced366655120bfca56715dd9d420aed5f6"],"state_sha256":"43eda6179777c0c78b4f7b967116e5ec8f3ec414f3d39ad487d10efee8a5104e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tBS70I0QyUw7Q9ZWyh7XoDmwDi9ICmhiSWngn9pliHCegYTXBgiJUa+9NPXW7INSBhOdAOzMM9J68u9r/a5WDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T22:55:56.025107Z","bundle_sha256":"d403ea1c9cd5ca60b1d993c10db63f8bf86dd53ffeea85b75ee218f4804f277b"}}