{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:7IXTMUIKAQNJGIX5DSN27IXDYH","short_pith_number":"pith:7IXTMUIK","canonical_record":{"source":{"id":"1811.11141","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-11-27T18:08:07Z","cross_cats_sorted":[],"title_canon_sha256":"70049322978164c5830c6282134fc3c22c6de38b6ab0ee6dbe95aef51f3dfa45","abstract_canon_sha256":"24fa2767fdff479109e1402723ef33010ede472c362756228b18d1279ff134a5"},"schema_version":"1.0"},"canonical_sha256":"fa2f36510a041a9322fd1c9bafa2e3c1d1d34074891a0d60541c0425b8057c7b","source":{"kind":"arxiv","id":"1811.11141","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.11141","created_at":"2026-05-17T23:59:27Z"},{"alias_kind":"arxiv_version","alias_value":"1811.11141v2","created_at":"2026-05-17T23:59:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.11141","created_at":"2026-05-17T23:59:27Z"},{"alias_kind":"pith_short_12","alias_value":"7IXTMUIKAQNJ","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"7IXTMUIKAQNJGIX5","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"7IXTMUIK","created_at":"2026-05-18T12:32:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:7IXTMUIKAQNJGIX5DSN27IXDYH","target":"record","payload":{"canonical_record":{"source":{"id":"1811.11141","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-11-27T18:08:07Z","cross_cats_sorted":[],"title_canon_sha256":"70049322978164c5830c6282134fc3c22c6de38b6ab0ee6dbe95aef51f3dfa45","abstract_canon_sha256":"24fa2767fdff479109e1402723ef33010ede472c362756228b18d1279ff134a5"},"schema_version":"1.0"},"canonical_sha256":"fa2f36510a041a9322fd1c9bafa2e3c1d1d34074891a0d60541c0425b8057c7b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:27.604531Z","signature_b64":"aqgDMJq3ZG6J30kcSny84voXjG5web2N6/xiPb9HrQAsdDmKq21BCy46PQ4mBV6IUS/poMGL/hETt2d5YrAlDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fa2f36510a041a9322fd1c9bafa2e3c1d1d34074891a0d60541c0425b8057c7b","last_reissued_at":"2026-05-17T23:59:27.603774Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:27.603774Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.11141","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-17T23:59:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wTPf4bsMZOSPgNGKBrJmLrZij10izbHnkV4UF1eBSxbOwzhjANP4hykRo6lSR8ALd5Xz3JsnYllk3uJeIWUjCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T07:55:33.803573Z"},"content_sha256":"52c56c71d3a6142c7f7d01c5026a150b7529afa8af6df6f51430a203e1960b48","schema_version":"1.0","event_id":"sha256:52c56c71d3a6142c7f7d01c5026a150b7529afa8af6df6f51430a203e1960b48"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:7IXTMUIKAQNJGIX5DSN27IXDYH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"MG-WFBP: Efficient Data Communication for Distributed Synchronous SGD Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Bo Li, Shaohuai Shi, Xiaowen Chu","submitted_at":"2018-11-27T18:08:07Z","abstract_excerpt":"Distributed synchronous stochastic gradient descent has been widely used to train deep neural networks on computer clusters. With the increase of computational power, network communications have become one limiting factor on system scalability. In this paper, we observe that many deep neural networks have a large number of layers with only a small amount of data to be communicated. Based on the fact that merging some short communication tasks into a single one may reduce the overall communication time, we formulate an optimization problem to minimize the training iteration time. We develop an "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.11141","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-17T23:59:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Gr+753L6umRtmOCvXLne8uvc5hyKprXOJK6PgjjSWql2ciZYznsFw66sVQlAsbhWHqO9L9D/vYOUIGGULgsVDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T07:55:33.804220Z"},"content_sha256":"3162394a61e6ec3062f83465db29dc2bcb18ca36cce0c7f14fbddde1c9caeba9","schema_version":"1.0","event_id":"sha256:3162394a61e6ec3062f83465db29dc2bcb18ca36cce0c7f14fbddde1c9caeba9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7IXTMUIKAQNJGIX5DSN27IXDYH/bundle.json","state_url":"https://pith.science/pith/7IXTMUIKAQNJGIX5DSN27IXDYH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7IXTMUIKAQNJGIX5DSN27IXDYH/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-25T07:55:33Z","links":{"resolver":"https://pith.science/pith/7IXTMUIKAQNJGIX5DSN27IXDYH","bundle":"https://pith.science/pith/7IXTMUIKAQNJGIX5DSN27IXDYH/bundle.json","state":"https://pith.science/pith/7IXTMUIKAQNJGIX5DSN27IXDYH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7IXTMUIKAQNJGIX5DSN27IXDYH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:7IXTMUIKAQNJGIX5DSN27IXDYH","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":"24fa2767fdff479109e1402723ef33010ede472c362756228b18d1279ff134a5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-11-27T18:08:07Z","title_canon_sha256":"70049322978164c5830c6282134fc3c22c6de38b6ab0ee6dbe95aef51f3dfa45"},"schema_version":"1.0","source":{"id":"1811.11141","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.11141","created_at":"2026-05-17T23:59:27Z"},{"alias_kind":"arxiv_version","alias_value":"1811.11141v2","created_at":"2026-05-17T23:59:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.11141","created_at":"2026-05-17T23:59:27Z"},{"alias_kind":"pith_short_12","alias_value":"7IXTMUIKAQNJ","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"7IXTMUIKAQNJGIX5","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"7IXTMUIK","created_at":"2026-05-18T12:32:11Z"}],"graph_snapshots":[{"event_id":"sha256:3162394a61e6ec3062f83465db29dc2bcb18ca36cce0c7f14fbddde1c9caeba9","target":"graph","created_at":"2026-05-17T23:59:27Z","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":"Distributed synchronous stochastic gradient descent has been widely used to train deep neural networks on computer clusters. With the increase of computational power, network communications have become one limiting factor on system scalability. In this paper, we observe that many deep neural networks have a large number of layers with only a small amount of data to be communicated. Based on the fact that merging some short communication tasks into a single one may reduce the overall communication time, we formulate an optimization problem to minimize the training iteration time. We develop an ","authors_text":"Bo Li, Shaohuai Shi, Xiaowen Chu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-11-27T18:08:07Z","title":"MG-WFBP: Efficient Data Communication for Distributed Synchronous SGD Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.11141","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:52c56c71d3a6142c7f7d01c5026a150b7529afa8af6df6f51430a203e1960b48","target":"record","created_at":"2026-05-17T23:59:27Z","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":"24fa2767fdff479109e1402723ef33010ede472c362756228b18d1279ff134a5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-11-27T18:08:07Z","title_canon_sha256":"70049322978164c5830c6282134fc3c22c6de38b6ab0ee6dbe95aef51f3dfa45"},"schema_version":"1.0","source":{"id":"1811.11141","kind":"arxiv","version":2}},"canonical_sha256":"fa2f36510a041a9322fd1c9bafa2e3c1d1d34074891a0d60541c0425b8057c7b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fa2f36510a041a9322fd1c9bafa2e3c1d1d34074891a0d60541c0425b8057c7b","first_computed_at":"2026-05-17T23:59:27.603774Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:59:27.603774Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aqgDMJq3ZG6J30kcSny84voXjG5web2N6/xiPb9HrQAsdDmKq21BCy46PQ4mBV6IUS/poMGL/hETt2d5YrAlDw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:59:27.604531Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.11141","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:52c56c71d3a6142c7f7d01c5026a150b7529afa8af6df6f51430a203e1960b48","sha256:3162394a61e6ec3062f83465db29dc2bcb18ca36cce0c7f14fbddde1c9caeba9"],"state_sha256":"7c3f5ff5d4edfc9cd801cf2ebecb4e3484c0042a098cb9ebf3ddb14c00700931"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CNIaDNwzaKaYY+6gA9jynUFDeXtD6fVv+82vaAMWk0KziihU3wC1kygWcAfymKTQkGQm1LZQa5/Knv7VI4aKDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T07:55:33.811460Z","bundle_sha256":"f11355f6020bc0bd90452024540291fc3a90503e47fb72e3dd69099b68fd70fe"}}