{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:XIPPQVHS7EIKFK6R4SS5GZPWAL","short_pith_number":"pith:XIPPQVHS","canonical_record":{"source":{"id":"1807.03210","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-07-09T15:01:51Z","cross_cats_sorted":["cs.AI","cs.DC","stat.ML"],"title_canon_sha256":"4455bb57d29f42bf9b0d205880a49bed28f25b195e3d28143a9666cfcb5d8751","abstract_canon_sha256":"3e58786dcaf8d93b1ce09612b2d306772b1c2071ecad62d42374a49614924dd2"},"schema_version":"1.0"},"canonical_sha256":"ba1ef854f2f910a2abd1e4a5d365f602e3be5784afcac8b0d0c0ee0d819982d9","source":{"kind":"arxiv","id":"1807.03210","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.03210","created_at":"2026-05-18T00:00:52Z"},{"alias_kind":"arxiv_version","alias_value":"1807.03210v2","created_at":"2026-05-18T00:00:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.03210","created_at":"2026-05-18T00:00:52Z"},{"alias_kind":"pith_short_12","alias_value":"XIPPQVHS7EIK","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"XIPPQVHS7EIKFK6R","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"XIPPQVHS","created_at":"2026-05-18T12:33:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:XIPPQVHS7EIKFK6R4SS5GZPWAL","target":"record","payload":{"canonical_record":{"source":{"id":"1807.03210","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-07-09T15:01:51Z","cross_cats_sorted":["cs.AI","cs.DC","stat.ML"],"title_canon_sha256":"4455bb57d29f42bf9b0d205880a49bed28f25b195e3d28143a9666cfcb5d8751","abstract_canon_sha256":"3e58786dcaf8d93b1ce09612b2d306772b1c2071ecad62d42374a49614924dd2"},"schema_version":"1.0"},"canonical_sha256":"ba1ef854f2f910a2abd1e4a5d365f602e3be5784afcac8b0d0c0ee0d819982d9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:52.347973Z","signature_b64":"tlyufJV2TmELFnJ5srjHFSnz39AlpuHM6OPIhEyabr5/X7p9LkZfv/aQSbHs/SNYDAXqqaQ7UCqKbGhR2umMBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ba1ef854f2f910a2abd1e4a5d365f602e3be5784afcac8b0d0c0ee0d819982d9","last_reissued_at":"2026-05-18T00:00:52.347346Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:52.347346Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1807.03210","source_version":2,"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:00:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lGOhNLJVgHqM/czhpB/4JeD6sxbZaO21EIeJ3hz36gLHv7SIqTpDeG6VTQT1+4pfn7BFodkKMWnJy3gnjp1uBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T18:31:04.309403Z"},"content_sha256":"bd5b3602a02558693c408dd4ea876a642a738a74f1fb2737acaf11e506f14fc6","schema_version":"1.0","event_id":"sha256:bd5b3602a02558693c408dd4ea876a642a738a74f1fb2737acaf11e506f14fc6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:XIPPQVHS7EIKFK6R4SS5GZPWAL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Decentralized Deep Learning by Dynamic Model Averaging","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.DC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Fabian H\\\"uger, Joachim Sicking, Linara Adilova, Michael Kamp, Peter Schlicht, Stefan Wrobel, Tim Wirtz","submitted_at":"2018-07-09T15:01:51Z","abstract_excerpt":"We propose an efficient protocol for decentralized training of deep neural networks from distributed data sources. The proposed protocol allows to handle different phases of model training equally well and to quickly adapt to concept drifts. This leads to a reduction of communication by an order of magnitude compared to periodically communicating state-of-the-art approaches. Moreover, we derive a communication bound that scales well with the hardness of the serialized learning problem. The reduction in communication comes at almost no cost, as the predictive performance remains virtually uncha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.03210","kind":"arxiv","version":2},"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:00:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bJ2g+pNWTW1JTL6Fl3lgo4Hy8xwM4jcLYigEEbdG7ipSFFeY7mE4xlED7sObcN6Y9mWRsddrWTCXXgw7UgfrAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T18:31:04.310120Z"},"content_sha256":"b31a1ba313dffe7c5c5d67284d03f49469dbc73209463d470724801234c1a88b","schema_version":"1.0","event_id":"sha256:b31a1ba313dffe7c5c5d67284d03f49469dbc73209463d470724801234c1a88b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XIPPQVHS7EIKFK6R4SS5GZPWAL/bundle.json","state_url":"https://pith.science/pith/XIPPQVHS7EIKFK6R4SS5GZPWAL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XIPPQVHS7EIKFK6R4SS5GZPWAL/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-07T18:31:04Z","links":{"resolver":"https://pith.science/pith/XIPPQVHS7EIKFK6R4SS5GZPWAL","bundle":"https://pith.science/pith/XIPPQVHS7EIKFK6R4SS5GZPWAL/bundle.json","state":"https://pith.science/pith/XIPPQVHS7EIKFK6R4SS5GZPWAL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XIPPQVHS7EIKFK6R4SS5GZPWAL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:XIPPQVHS7EIKFK6R4SS5GZPWAL","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":"3e58786dcaf8d93b1ce09612b2d306772b1c2071ecad62d42374a49614924dd2","cross_cats_sorted":["cs.AI","cs.DC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-07-09T15:01:51Z","title_canon_sha256":"4455bb57d29f42bf9b0d205880a49bed28f25b195e3d28143a9666cfcb5d8751"},"schema_version":"1.0","source":{"id":"1807.03210","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.03210","created_at":"2026-05-18T00:00:52Z"},{"alias_kind":"arxiv_version","alias_value":"1807.03210v2","created_at":"2026-05-18T00:00:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.03210","created_at":"2026-05-18T00:00:52Z"},{"alias_kind":"pith_short_12","alias_value":"XIPPQVHS7EIK","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"XIPPQVHS7EIKFK6R","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"XIPPQVHS","created_at":"2026-05-18T12:33:01Z"}],"graph_snapshots":[{"event_id":"sha256:b31a1ba313dffe7c5c5d67284d03f49469dbc73209463d470724801234c1a88b","target":"graph","created_at":"2026-05-18T00:00:52Z","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 an efficient protocol for decentralized training of deep neural networks from distributed data sources. The proposed protocol allows to handle different phases of model training equally well and to quickly adapt to concept drifts. This leads to a reduction of communication by an order of magnitude compared to periodically communicating state-of-the-art approaches. Moreover, we derive a communication bound that scales well with the hardness of the serialized learning problem. The reduction in communication comes at almost no cost, as the predictive performance remains virtually uncha","authors_text":"Fabian H\\\"uger, Joachim Sicking, Linara Adilova, Michael Kamp, Peter Schlicht, Stefan Wrobel, Tim Wirtz","cross_cats":["cs.AI","cs.DC","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-07-09T15:01:51Z","title":"Efficient Decentralized Deep Learning by Dynamic Model Averaging"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.03210","kind":"arxiv","version":2},"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:bd5b3602a02558693c408dd4ea876a642a738a74f1fb2737acaf11e506f14fc6","target":"record","created_at":"2026-05-18T00:00:52Z","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":"3e58786dcaf8d93b1ce09612b2d306772b1c2071ecad62d42374a49614924dd2","cross_cats_sorted":["cs.AI","cs.DC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-07-09T15:01:51Z","title_canon_sha256":"4455bb57d29f42bf9b0d205880a49bed28f25b195e3d28143a9666cfcb5d8751"},"schema_version":"1.0","source":{"id":"1807.03210","kind":"arxiv","version":2}},"canonical_sha256":"ba1ef854f2f910a2abd1e4a5d365f602e3be5784afcac8b0d0c0ee0d819982d9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ba1ef854f2f910a2abd1e4a5d365f602e3be5784afcac8b0d0c0ee0d819982d9","first_computed_at":"2026-05-18T00:00:52.347346Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:00:52.347346Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tlyufJV2TmELFnJ5srjHFSnz39AlpuHM6OPIhEyabr5/X7p9LkZfv/aQSbHs/SNYDAXqqaQ7UCqKbGhR2umMBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:00:52.347973Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.03210","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bd5b3602a02558693c408dd4ea876a642a738a74f1fb2737acaf11e506f14fc6","sha256:b31a1ba313dffe7c5c5d67284d03f49469dbc73209463d470724801234c1a88b"],"state_sha256":"3968d15fe2a7b9ebad88551a635be9a744ca39a9fef8f6a59af92fb1fdaddfce"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HZh4XzTXYchr2FoQN6xqnOOB5MF+4acVp6EUiak2D5AL5j7wphwJA8b+trXMPFNORp8QfE9RAk4qkMHMuL0hBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T18:31:04.313944Z","bundle_sha256":"112d8a6e81399714114c646747f916afb2c784b4225384eed809dce7eec8d7ba"}}