{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:24O3DH6735H752XA667JONSEEK","short_pith_number":"pith:24O3DH67","canonical_record":{"source":{"id":"1611.04255","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-11-14T05:59:58Z","cross_cats_sorted":[],"title_canon_sha256":"98e085d533772e7937c7f6219a043034f9cea983ae02073bfadedbe6c5da6364","abstract_canon_sha256":"3bf99d321e5198caedf5f8ea309fb59438685f73537dd34925b1633146cbfa8b"},"schema_version":"1.0"},"canonical_sha256":"d71db19fdfdf4ffeeae0f7be97364422b2fb462f0e78a2946201cb8da9e953c4","source":{"kind":"arxiv","id":"1611.04255","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.04255","created_at":"2026-05-18T00:46:20Z"},{"alias_kind":"arxiv_version","alias_value":"1611.04255v2","created_at":"2026-05-18T00:46:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.04255","created_at":"2026-05-18T00:46:20Z"},{"alias_kind":"pith_short_12","alias_value":"24O3DH6735H7","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"24O3DH6735H752XA","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"24O3DH67","created_at":"2026-05-18T12:29:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:24O3DH6735H752XA667JONSEEK","target":"record","payload":{"canonical_record":{"source":{"id":"1611.04255","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-11-14T05:59:58Z","cross_cats_sorted":[],"title_canon_sha256":"98e085d533772e7937c7f6219a043034f9cea983ae02073bfadedbe6c5da6364","abstract_canon_sha256":"3bf99d321e5198caedf5f8ea309fb59438685f73537dd34925b1633146cbfa8b"},"schema_version":"1.0"},"canonical_sha256":"d71db19fdfdf4ffeeae0f7be97364422b2fb462f0e78a2946201cb8da9e953c4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:20.577837Z","signature_b64":"vROrj5299aoEN/qaAgBlBJ/zi/4tBAlJ+EFwt3HUdWdNh1Wd69QaI5eP0ofxBW/M75wtRDfaAjFr61BR45EuDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d71db19fdfdf4ffeeae0f7be97364422b2fb462f0e78a2946201cb8da9e953c4","last_reissued_at":"2026-05-18T00:46:20.577382Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:20.577382Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.04255","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:46:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WBEpRv9sw23sPM1EEb08Rklo/cxtVNGygav4LEN1evsKE6DSbfSuY5d4UZDWQKhyB7LNBA5Ud+soRtH609p0BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T08:30:43.370800Z"},"content_sha256":"e924d51c9c7bdd3ef679348853b1aa1c31b3d6cb33dc98b830664398db713420","schema_version":"1.0","event_id":"sha256:e924d51c9c7bdd3ef679348853b1aa1c31b3d6cb33dc98b830664398db713420"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:24O3DH6735H752XA667JONSEEK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Communications in Training Large Scale Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"George Bosilca, Linnan Wang, Richard Vuduc, Wei Wu, Zenglin Xu","submitted_at":"2016-11-14T05:59:58Z","abstract_excerpt":"We consider the problem of how to reduce the cost of communication that is required for the parallel training of a neural network. The state-of-the-art method, Bulk Synchronous Parallel Stochastic Gradient Descent (BSP-SGD), requires many collective communication operations, like broadcasts of parameters or reductions for sub-gradient aggregations, which for large messages quickly dominates overall execution time and limits parallel scalability. To address this problem, we develop a new technique for collective operations, referred to as Linear Pipelining (LP). It is tuned to the message sizes"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.04255","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:46:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R/wMRcycq8OooPCyAc1ivRlETwB0sSjOWDezuJQIIPRd4EohiiGAN/rtkn8QuFqFC9rj1qsTEiKdHnD28Vv1AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T08:30:43.371347Z"},"content_sha256":"3b97fe6aca078f5e35cfe418e95cc9437a3a34a42c4b6fbc0d1bff31f38df07d","schema_version":"1.0","event_id":"sha256:3b97fe6aca078f5e35cfe418e95cc9437a3a34a42c4b6fbc0d1bff31f38df07d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/24O3DH6735H752XA667JONSEEK/bundle.json","state_url":"https://pith.science/pith/24O3DH6735H752XA667JONSEEK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/24O3DH6735H752XA667JONSEEK/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-27T08:30:43Z","links":{"resolver":"https://pith.science/pith/24O3DH6735H752XA667JONSEEK","bundle":"https://pith.science/pith/24O3DH6735H752XA667JONSEEK/bundle.json","state":"https://pith.science/pith/24O3DH6735H752XA667JONSEEK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/24O3DH6735H752XA667JONSEEK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:24O3DH6735H752XA667JONSEEK","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":"3bf99d321e5198caedf5f8ea309fb59438685f73537dd34925b1633146cbfa8b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-11-14T05:59:58Z","title_canon_sha256":"98e085d533772e7937c7f6219a043034f9cea983ae02073bfadedbe6c5da6364"},"schema_version":"1.0","source":{"id":"1611.04255","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.04255","created_at":"2026-05-18T00:46:20Z"},{"alias_kind":"arxiv_version","alias_value":"1611.04255v2","created_at":"2026-05-18T00:46:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.04255","created_at":"2026-05-18T00:46:20Z"},{"alias_kind":"pith_short_12","alias_value":"24O3DH6735H7","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"24O3DH6735H752XA","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"24O3DH67","created_at":"2026-05-18T12:29:52Z"}],"graph_snapshots":[{"event_id":"sha256:3b97fe6aca078f5e35cfe418e95cc9437a3a34a42c4b6fbc0d1bff31f38df07d","target":"graph","created_at":"2026-05-18T00:46:20Z","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 consider the problem of how to reduce the cost of communication that is required for the parallel training of a neural network. The state-of-the-art method, Bulk Synchronous Parallel Stochastic Gradient Descent (BSP-SGD), requires many collective communication operations, like broadcasts of parameters or reductions for sub-gradient aggregations, which for large messages quickly dominates overall execution time and limits parallel scalability. To address this problem, we develop a new technique for collective operations, referred to as Linear Pipelining (LP). It is tuned to the message sizes","authors_text":"George Bosilca, Linnan Wang, Richard Vuduc, Wei Wu, Zenglin Xu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-11-14T05:59:58Z","title":"Efficient Communications in Training Large Scale Neural Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.04255","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:e924d51c9c7bdd3ef679348853b1aa1c31b3d6cb33dc98b830664398db713420","target":"record","created_at":"2026-05-18T00:46:20Z","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":"3bf99d321e5198caedf5f8ea309fb59438685f73537dd34925b1633146cbfa8b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-11-14T05:59:58Z","title_canon_sha256":"98e085d533772e7937c7f6219a043034f9cea983ae02073bfadedbe6c5da6364"},"schema_version":"1.0","source":{"id":"1611.04255","kind":"arxiv","version":2}},"canonical_sha256":"d71db19fdfdf4ffeeae0f7be97364422b2fb462f0e78a2946201cb8da9e953c4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d71db19fdfdf4ffeeae0f7be97364422b2fb462f0e78a2946201cb8da9e953c4","first_computed_at":"2026-05-18T00:46:20.577382Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:46:20.577382Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vROrj5299aoEN/qaAgBlBJ/zi/4tBAlJ+EFwt3HUdWdNh1Wd69QaI5eP0ofxBW/M75wtRDfaAjFr61BR45EuDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:46:20.577837Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.04255","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e924d51c9c7bdd3ef679348853b1aa1c31b3d6cb33dc98b830664398db713420","sha256:3b97fe6aca078f5e35cfe418e95cc9437a3a34a42c4b6fbc0d1bff31f38df07d"],"state_sha256":"2b485d10433b40c0fc2c0d507ad5c62ae25060c67f174d8c22cae4f40721d9b9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B6+NiIXE5uMV7Yq5xuEW21xKTAuSLd5GjTE7z/p4FCKir0Edl5YkZrSNi5kbVAh9lCFWV3aUwU2XA8+rnSlYAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T08:30:43.373644Z","bundle_sha256":"226b93c5144f1edef55b05d493ca3d484e284b4e41c81de7f4a4fe6606576ceb"}}