{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:JEU2GNVKSR7RYGADLUHYGQKEX4","short_pith_number":"pith:JEU2GNVK","canonical_record":{"source":{"id":"1810.09270","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2018-10-19T17:22:30Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"56543508487bdb0a43774898b7b9fc613e882b1aa86979f1900135c600826ebb","abstract_canon_sha256":"78e37ae1ca7b53eb336ed6df0ecd52ee9be6267d5eaea8636452dc471577706f"},"schema_version":"1.0"},"canonical_sha256":"4929a336aa947f1c18035d0f834144bf1d9166110a76d1c7ce29db2409d199bb","source":{"kind":"arxiv","id":"1810.09270","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.09270","created_at":"2026-05-18T00:02:40Z"},{"alias_kind":"arxiv_version","alias_value":"1810.09270v1","created_at":"2026-05-18T00:02:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.09270","created_at":"2026-05-18T00:02:40Z"},{"alias_kind":"pith_short_12","alias_value":"JEU2GNVKSR7R","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"JEU2GNVKSR7RYGAD","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"JEU2GNVK","created_at":"2026-05-18T12:32:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:JEU2GNVKSR7RYGADLUHYGQKEX4","target":"record","payload":{"canonical_record":{"source":{"id":"1810.09270","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2018-10-19T17:22:30Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"56543508487bdb0a43774898b7b9fc613e882b1aa86979f1900135c600826ebb","abstract_canon_sha256":"78e37ae1ca7b53eb336ed6df0ecd52ee9be6267d5eaea8636452dc471577706f"},"schema_version":"1.0"},"canonical_sha256":"4929a336aa947f1c18035d0f834144bf1d9166110a76d1c7ce29db2409d199bb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:40.663014Z","signature_b64":"NHvSlM/UnLFcZDhnQw4qHSqzvxs6lRdH5qz0n4QTcFUri0mg1P6Pk/xwmev/QjKUWd7k222GMuwA9WBsH6UMAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4929a336aa947f1c18035d0f834144bf1d9166110a76d1c7ce29db2409d199bb","last_reissued_at":"2026-05-18T00:02:40.662270Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:40.662270Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.09270","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:02:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1eHTZGakdM9dqyHnbYVqtpOou9QxaxHIVJ2wvA1Sv8Q6swsU7n6miwQSa797J0OPvNe4W97+SCichX9jZlwrCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T06:20:06.428956Z"},"content_sha256":"b54078d84ed8dab6add82e5d8df21a54f5d953bca91c707033b497bd7ab5b974","schema_version":"1.0","event_id":"sha256:b54078d84ed8dab6add82e5d8df21a54f5d953bca91c707033b497bd7ab5b974"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:JEU2GNVKSR7RYGADLUHYGQKEX4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Model Parallel Proximal Stochastic Gradient Algorithm for Partially Asynchronous Systems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Di Niu, Rui Zhu","submitted_at":"2018-10-19T17:22:30Z","abstract_excerpt":"Large models are prevalent in modern machine learning scenarios, including deep learning, recommender systems, etc., which can have millions or even billions of parameters. Parallel algorithms have become an essential solution technique to many large-scale machine learning jobs. In this paper, we propose a model parallel proximal stochastic gradient algorithm, AsyB-ProxSGD, to deal with large models using model parallel blockwise updates while in the meantime handling a large amount of training data using proximal stochastic gradient descent (ProxSGD). In our algorithm, worker nodes communicat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.09270","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:02:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z5cT3oJict5A5TZZXluVpYVZ/oi6kJoHIUS5NQFxjc3g9BihUIkSSX1a1FPoXOKiL/69o4IwkwYC408S+TygDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T06:20:06.429626Z"},"content_sha256":"b722c6d575314f94ae5f6017636451a0e5b7ab8daae360601d5a5eadc4007a8d","schema_version":"1.0","event_id":"sha256:b722c6d575314f94ae5f6017636451a0e5b7ab8daae360601d5a5eadc4007a8d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JEU2GNVKSR7RYGADLUHYGQKEX4/bundle.json","state_url":"https://pith.science/pith/JEU2GNVKSR7RYGADLUHYGQKEX4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JEU2GNVKSR7RYGADLUHYGQKEX4/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-24T06:20:06Z","links":{"resolver":"https://pith.science/pith/JEU2GNVKSR7RYGADLUHYGQKEX4","bundle":"https://pith.science/pith/JEU2GNVKSR7RYGADLUHYGQKEX4/bundle.json","state":"https://pith.science/pith/JEU2GNVKSR7RYGADLUHYGQKEX4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JEU2GNVKSR7RYGADLUHYGQKEX4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:JEU2GNVKSR7RYGADLUHYGQKEX4","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":"78e37ae1ca7b53eb336ed6df0ecd52ee9be6267d5eaea8636452dc471577706f","cross_cats_sorted":["stat.ML"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2018-10-19T17:22:30Z","title_canon_sha256":"56543508487bdb0a43774898b7b9fc613e882b1aa86979f1900135c600826ebb"},"schema_version":"1.0","source":{"id":"1810.09270","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.09270","created_at":"2026-05-18T00:02:40Z"},{"alias_kind":"arxiv_version","alias_value":"1810.09270v1","created_at":"2026-05-18T00:02:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.09270","created_at":"2026-05-18T00:02:40Z"},{"alias_kind":"pith_short_12","alias_value":"JEU2GNVKSR7R","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"JEU2GNVKSR7RYGAD","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"JEU2GNVK","created_at":"2026-05-18T12:32:31Z"}],"graph_snapshots":[{"event_id":"sha256:b722c6d575314f94ae5f6017636451a0e5b7ab8daae360601d5a5eadc4007a8d","target":"graph","created_at":"2026-05-18T00:02:40Z","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":"Large models are prevalent in modern machine learning scenarios, including deep learning, recommender systems, etc., which can have millions or even billions of parameters. Parallel algorithms have become an essential solution technique to many large-scale machine learning jobs. In this paper, we propose a model parallel proximal stochastic gradient algorithm, AsyB-ProxSGD, to deal with large models using model parallel blockwise updates while in the meantime handling a large amount of training data using proximal stochastic gradient descent (ProxSGD). In our algorithm, worker nodes communicat","authors_text":"Di Niu, Rui Zhu","cross_cats":["stat.ML"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2018-10-19T17:22:30Z","title":"A Model Parallel Proximal Stochastic Gradient Algorithm for Partially Asynchronous Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.09270","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:b54078d84ed8dab6add82e5d8df21a54f5d953bca91c707033b497bd7ab5b974","target":"record","created_at":"2026-05-18T00:02:40Z","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":"78e37ae1ca7b53eb336ed6df0ecd52ee9be6267d5eaea8636452dc471577706f","cross_cats_sorted":["stat.ML"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2018-10-19T17:22:30Z","title_canon_sha256":"56543508487bdb0a43774898b7b9fc613e882b1aa86979f1900135c600826ebb"},"schema_version":"1.0","source":{"id":"1810.09270","kind":"arxiv","version":1}},"canonical_sha256":"4929a336aa947f1c18035d0f834144bf1d9166110a76d1c7ce29db2409d199bb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4929a336aa947f1c18035d0f834144bf1d9166110a76d1c7ce29db2409d199bb","first_computed_at":"2026-05-18T00:02:40.662270Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:02:40.662270Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NHvSlM/UnLFcZDhnQw4qHSqzvxs6lRdH5qz0n4QTcFUri0mg1P6Pk/xwmev/QjKUWd7k222GMuwA9WBsH6UMAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:02:40.663014Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.09270","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b54078d84ed8dab6add82e5d8df21a54f5d953bca91c707033b497bd7ab5b974","sha256:b722c6d575314f94ae5f6017636451a0e5b7ab8daae360601d5a5eadc4007a8d"],"state_sha256":"de823bc6c64a8efdf3b895ddbeb4fd4ab3f7c94d1d1f388a81121061f189ce8d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TXYgDVWVrPFcKJZyWmCVCDDD92lrVxmP604X0Te9hz3pcX5YeeLZk3iEgCQdnAmtLb2mzQVxzRAgBGQ0quuxCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T06:20:06.433136Z","bundle_sha256":"a38c926b19f4dda2bcfa5250234c8aef39ac7853dfc254a44ff103d7e38b8ce0"}}