{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:EZ43IF45D35V5XSZNBY2H6TOKF","short_pith_number":"pith:EZ43IF45","canonical_record":{"source":{"id":"1810.07766","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-10-17T20:13:05Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"8e45e5e6282ee03c7ef04ac93d7f2efb570038dfd16df5dc78d20da3a863e84b","abstract_canon_sha256":"947d9f73a859753bc6a9de67eb43217f047084b8016751d7f5bcc1b9934abf10"},"schema_version":"1.0"},"canonical_sha256":"2679b4179d1efb5ede596871a3fa6e514ef9d917391526dd1156944aaaa2cc24","source":{"kind":"arxiv","id":"1810.07766","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.07766","created_at":"2026-05-17T23:46:03Z"},{"alias_kind":"arxiv_version","alias_value":"1810.07766v4","created_at":"2026-05-17T23:46:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.07766","created_at":"2026-05-17T23:46:03Z"},{"alias_kind":"pith_short_12","alias_value":"EZ43IF45D35V","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"EZ43IF45D35V5XSZ","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"EZ43IF45","created_at":"2026-05-18T12:32:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:EZ43IF45D35V5XSZNBY2H6TOKF","target":"record","payload":{"canonical_record":{"source":{"id":"1810.07766","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-10-17T20:13:05Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"8e45e5e6282ee03c7ef04ac93d7f2efb570038dfd16df5dc78d20da3a863e84b","abstract_canon_sha256":"947d9f73a859753bc6a9de67eb43217f047084b8016751d7f5bcc1b9934abf10"},"schema_version":"1.0"},"canonical_sha256":"2679b4179d1efb5ede596871a3fa6e514ef9d917391526dd1156944aaaa2cc24","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:03.926454Z","signature_b64":"7TC+aMPhx0/xVT7yISSWS6SOSXXiHYjuzZB0+O7abp3/xmtcuPrYIoTctQmwtNWQCiwr1fDyaD+FLe1/UwMaDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2679b4179d1efb5ede596871a3fa6e514ef9d917391526dd1156944aaaa2cc24","last_reissued_at":"2026-05-17T23:46:03.925662Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:03.925662Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.07766","source_version":4,"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-17T23:46:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2q6cEoi1/YuUyUQsjQajdtUw1QWVGGDdkjJURu1ARvOcwm8JAw0WVgB1Bhw0snbJ1Ti8xQMoqhOlZ3xBLgmvDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T03:42:20.451017Z"},"content_sha256":"563e9e89f328cf91ca21d3c2c1fc5b95e182b6a5cd8d121242e12ebdd345169d","schema_version":"1.0","event_id":"sha256:563e9e89f328cf91ca21d3c2c1fc5b95e182b6a5cd8d121242e12ebdd345169d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:EZ43IF45D35V5XSZNBY2H6TOKF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributed Learning over Unreliable Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DC","authors_text":"Ankit Singla, Cedric Renggli, Ce Zhang, Chen Yu, Dan Alistarh, Hanlin Tang, Ji Liu, Simon Kassing","submitted_at":"2018-10-17T20:13:05Z","abstract_excerpt":"Most of today's distributed machine learning systems assume {\\em reliable networks}: whenever two machines exchange information (e.g., gradients or models), the network should guarantee the delivery of the message. At the same time, recent work exhibits the impressive tolerance of machine learning algorithms to errors or noise arising from relaxed communication or synchronization. In this paper, we connect these two trends, and consider the following question: {\\em Can we design machine learning systems that are tolerant to network unreliability during training?} With this motivation, we focus"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.07766","kind":"arxiv","version":4},"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-17T23:46:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wacjxJcOtWzv8wsgiKTMOgLkNqDPu2x+ahx3B6NHxIQVG8CBDMM0PMy6lv6weg2FcNCAMQNtj0S5YOViIaxJAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T03:42:20.451716Z"},"content_sha256":"cddb99ced0d336f5e7415237531a543cf0ea21995230a5ac15a07db901f40372","schema_version":"1.0","event_id":"sha256:cddb99ced0d336f5e7415237531a543cf0ea21995230a5ac15a07db901f40372"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EZ43IF45D35V5XSZNBY2H6TOKF/bundle.json","state_url":"https://pith.science/pith/EZ43IF45D35V5XSZNBY2H6TOKF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EZ43IF45D35V5XSZNBY2H6TOKF/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-09T03:42:20Z","links":{"resolver":"https://pith.science/pith/EZ43IF45D35V5XSZNBY2H6TOKF","bundle":"https://pith.science/pith/EZ43IF45D35V5XSZNBY2H6TOKF/bundle.json","state":"https://pith.science/pith/EZ43IF45D35V5XSZNBY2H6TOKF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EZ43IF45D35V5XSZNBY2H6TOKF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:EZ43IF45D35V5XSZNBY2H6TOKF","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":"947d9f73a859753bc6a9de67eb43217f047084b8016751d7f5bcc1b9934abf10","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-10-17T20:13:05Z","title_canon_sha256":"8e45e5e6282ee03c7ef04ac93d7f2efb570038dfd16df5dc78d20da3a863e84b"},"schema_version":"1.0","source":{"id":"1810.07766","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.07766","created_at":"2026-05-17T23:46:03Z"},{"alias_kind":"arxiv_version","alias_value":"1810.07766v4","created_at":"2026-05-17T23:46:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.07766","created_at":"2026-05-17T23:46:03Z"},{"alias_kind":"pith_short_12","alias_value":"EZ43IF45D35V","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"EZ43IF45D35V5XSZ","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"EZ43IF45","created_at":"2026-05-18T12:32:22Z"}],"graph_snapshots":[{"event_id":"sha256:cddb99ced0d336f5e7415237531a543cf0ea21995230a5ac15a07db901f40372","target":"graph","created_at":"2026-05-17T23:46:03Z","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":"Most of today's distributed machine learning systems assume {\\em reliable networks}: whenever two machines exchange information (e.g., gradients or models), the network should guarantee the delivery of the message. At the same time, recent work exhibits the impressive tolerance of machine learning algorithms to errors or noise arising from relaxed communication or synchronization. In this paper, we connect these two trends, and consider the following question: {\\em Can we design machine learning systems that are tolerant to network unreliability during training?} With this motivation, we focus","authors_text":"Ankit Singla, Cedric Renggli, Ce Zhang, Chen Yu, Dan Alistarh, Hanlin Tang, Ji Liu, Simon Kassing","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-10-17T20:13:05Z","title":"Distributed Learning over Unreliable Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.07766","kind":"arxiv","version":4},"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:563e9e89f328cf91ca21d3c2c1fc5b95e182b6a5cd8d121242e12ebdd345169d","target":"record","created_at":"2026-05-17T23:46:03Z","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":"947d9f73a859753bc6a9de67eb43217f047084b8016751d7f5bcc1b9934abf10","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-10-17T20:13:05Z","title_canon_sha256":"8e45e5e6282ee03c7ef04ac93d7f2efb570038dfd16df5dc78d20da3a863e84b"},"schema_version":"1.0","source":{"id":"1810.07766","kind":"arxiv","version":4}},"canonical_sha256":"2679b4179d1efb5ede596871a3fa6e514ef9d917391526dd1156944aaaa2cc24","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2679b4179d1efb5ede596871a3fa6e514ef9d917391526dd1156944aaaa2cc24","first_computed_at":"2026-05-17T23:46:03.925662Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:46:03.925662Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7TC+aMPhx0/xVT7yISSWS6SOSXXiHYjuzZB0+O7abp3/xmtcuPrYIoTctQmwtNWQCiwr1fDyaD+FLe1/UwMaDg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:46:03.926454Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.07766","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:563e9e89f328cf91ca21d3c2c1fc5b95e182b6a5cd8d121242e12ebdd345169d","sha256:cddb99ced0d336f5e7415237531a543cf0ea21995230a5ac15a07db901f40372"],"state_sha256":"291ce4f23187f00d70b2cfbca6770b5517307c28f4d991ed3dfb0d16b37a01ba"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h1/nFtDkIiUeJtQV8Ux8MYetywJzpvV76nyt+2Zzl8qVAuFLTeqaS4RD/d+RBzVLGLMGHmnJRZz01BduLi+wDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T03:42:20.455583Z","bundle_sha256":"b7b1d6b6170c99ba8852819a0f98685c808283495ec8f3c5a960654b61b6229c"}}