{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:2G563JAFGFHE5EAYTSTXDDPX5Z","short_pith_number":"pith:2G563JAF","canonical_record":{"source":{"id":"1803.04209","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-03-12T11:51:38Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"269a1da64d18874c4700eecd9a259aae0583421a6d12f916714b3e2823966d27","abstract_canon_sha256":"ed812cf7c4ea5ce1d975c89cff69e5dfa91c005b51ce892e1e072b006039023a"},"schema_version":"1.0"},"canonical_sha256":"d1bbeda405314e4e90189ca7718df7ee4e80021cdd68d0f9bbccba4bc1bb5817","source":{"kind":"arxiv","id":"1803.04209","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.04209","created_at":"2026-05-18T00:21:19Z"},{"alias_kind":"arxiv_version","alias_value":"1803.04209v1","created_at":"2026-05-18T00:21:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.04209","created_at":"2026-05-18T00:21:19Z"},{"alias_kind":"pith_short_12","alias_value":"2G563JAFGFHE","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"2G563JAFGFHE5EAY","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"2G563JAF","created_at":"2026-05-18T12:32:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:2G563JAFGFHE5EAYTSTXDDPX5Z","target":"record","payload":{"canonical_record":{"source":{"id":"1803.04209","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-03-12T11:51:38Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"269a1da64d18874c4700eecd9a259aae0583421a6d12f916714b3e2823966d27","abstract_canon_sha256":"ed812cf7c4ea5ce1d975c89cff69e5dfa91c005b51ce892e1e072b006039023a"},"schema_version":"1.0"},"canonical_sha256":"d1bbeda405314e4e90189ca7718df7ee4e80021cdd68d0f9bbccba4bc1bb5817","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:21:19.155946Z","signature_b64":"78HM59lJlQ7K6aarwMTbBOMScuWJFr8bdwZ9akMle/a/YW+Xp8dKKlDfZbBB+2RSz0ppFng5IEX+4WokraqGCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d1bbeda405314e4e90189ca7718df7ee4e80021cdd68d0f9bbccba4bc1bb5817","last_reissued_at":"2026-05-18T00:21:19.155502Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:21:19.155502Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.04209","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:21:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MEDCmAMCCsItmuzTzQtd5Gz9rf4n25i1mcxYpFQfajwmSIHspldN28bKxlr+TsviRMB3MnNoz6KyABxjRkmeAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T19:18:44.288355Z"},"content_sha256":"3e5c8ba2641b5f756f4d6fe1464c67e036e4861cb806017cdf9cda3c6605ec67","schema_version":"1.0","event_id":"sha256:3e5c8ba2641b5f756f4d6fe1464c67e036e4861cb806017cdf9cda3c6605ec67"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:2G563JAFGFHE5EAYTSTXDDPX5Z","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"High Throughput Synchronous Distributed Stochastic Gradient Descent","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.DC","authors_text":"Frank Wood, Michael Teng","submitted_at":"2018-03-12T11:51:38Z","abstract_excerpt":"We introduce a new, high-throughput, synchronous, distributed, data-parallel, stochastic-gradient-descent learning algorithm. This algorithm uses amortized inference in a compute-cluster-specific, deep, generative, dynamical model to perform joint posterior predictive inference of the mini-batch gradient computation times of all worker-nodes in a parallel computing cluster. We show that a synchronous parameter server can, by utilizing such a model, choose an optimal cutoff time beyond which mini-batch gradient messages from slow workers are ignored that maximizes overall mini-batch gradient co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.04209","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:21:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VFg4EAxlKtnbFlNZ/ADtOmFQ5zt+B91N5JEpWs2j8YueVCpwRgwaRLyo4dpcs/WhYew2HtKGdgkykj67isu+Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T19:18:44.289025Z"},"content_sha256":"9aae07141558f54ef77e1d814ac0f9771732487bd246669469e2b7b6e73ed9f4","schema_version":"1.0","event_id":"sha256:9aae07141558f54ef77e1d814ac0f9771732487bd246669469e2b7b6e73ed9f4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2G563JAFGFHE5EAYTSTXDDPX5Z/bundle.json","state_url":"https://pith.science/pith/2G563JAFGFHE5EAYTSTXDDPX5Z/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2G563JAFGFHE5EAYTSTXDDPX5Z/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-27T19:18:44Z","links":{"resolver":"https://pith.science/pith/2G563JAFGFHE5EAYTSTXDDPX5Z","bundle":"https://pith.science/pith/2G563JAFGFHE5EAYTSTXDDPX5Z/bundle.json","state":"https://pith.science/pith/2G563JAFGFHE5EAYTSTXDDPX5Z/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2G563JAFGFHE5EAYTSTXDDPX5Z/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:2G563JAFGFHE5EAYTSTXDDPX5Z","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":"ed812cf7c4ea5ce1d975c89cff69e5dfa91c005b51ce892e1e072b006039023a","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-03-12T11:51:38Z","title_canon_sha256":"269a1da64d18874c4700eecd9a259aae0583421a6d12f916714b3e2823966d27"},"schema_version":"1.0","source":{"id":"1803.04209","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.04209","created_at":"2026-05-18T00:21:19Z"},{"alias_kind":"arxiv_version","alias_value":"1803.04209v1","created_at":"2026-05-18T00:21:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.04209","created_at":"2026-05-18T00:21:19Z"},{"alias_kind":"pith_short_12","alias_value":"2G563JAFGFHE","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"2G563JAFGFHE5EAY","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"2G563JAF","created_at":"2026-05-18T12:32:02Z"}],"graph_snapshots":[{"event_id":"sha256:9aae07141558f54ef77e1d814ac0f9771732487bd246669469e2b7b6e73ed9f4","target":"graph","created_at":"2026-05-18T00:21:19Z","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 introduce a new, high-throughput, synchronous, distributed, data-parallel, stochastic-gradient-descent learning algorithm. This algorithm uses amortized inference in a compute-cluster-specific, deep, generative, dynamical model to perform joint posterior predictive inference of the mini-batch gradient computation times of all worker-nodes in a parallel computing cluster. We show that a synchronous parameter server can, by utilizing such a model, choose an optimal cutoff time beyond which mini-batch gradient messages from slow workers are ignored that maximizes overall mini-batch gradient co","authors_text":"Frank Wood, Michael Teng","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-03-12T11:51:38Z","title":"High Throughput Synchronous Distributed Stochastic Gradient Descent"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.04209","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:3e5c8ba2641b5f756f4d6fe1464c67e036e4861cb806017cdf9cda3c6605ec67","target":"record","created_at":"2026-05-18T00:21:19Z","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":"ed812cf7c4ea5ce1d975c89cff69e5dfa91c005b51ce892e1e072b006039023a","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-03-12T11:51:38Z","title_canon_sha256":"269a1da64d18874c4700eecd9a259aae0583421a6d12f916714b3e2823966d27"},"schema_version":"1.0","source":{"id":"1803.04209","kind":"arxiv","version":1}},"canonical_sha256":"d1bbeda405314e4e90189ca7718df7ee4e80021cdd68d0f9bbccba4bc1bb5817","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d1bbeda405314e4e90189ca7718df7ee4e80021cdd68d0f9bbccba4bc1bb5817","first_computed_at":"2026-05-18T00:21:19.155502Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:21:19.155502Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"78HM59lJlQ7K6aarwMTbBOMScuWJFr8bdwZ9akMle/a/YW+Xp8dKKlDfZbBB+2RSz0ppFng5IEX+4WokraqGCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:21:19.155946Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.04209","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3e5c8ba2641b5f756f4d6fe1464c67e036e4861cb806017cdf9cda3c6605ec67","sha256:9aae07141558f54ef77e1d814ac0f9771732487bd246669469e2b7b6e73ed9f4"],"state_sha256":"252c210ba66562f7eae6bf180363991563be7d26b44e7d82bbbfb28ff09b24f6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tn7jtWgOHNvNL1BxC8v8sn1ddgc1ehpejb9fs4xQoJlImNGKsZvJSffAjMgjPkRRhL5/HojC8qbOLKi9+XrcDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T19:18:44.292104Z","bundle_sha256":"4a4ad3b94618b7806f1cdc86bd155733b519fa390167eee837834c9a805972c5"}}