{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:XSKJ6IMWBNCPEFTSBNY6NS74EF","short_pith_number":"pith:XSKJ6IMW","canonical_record":{"source":{"id":"1702.06269","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-02-21T05:19:23Z","cross_cats_sorted":[],"title_canon_sha256":"05afe54460aa3fbf13841136bef076cd03f4644815240cd65d80df45a4213c4a","abstract_canon_sha256":"934875051a8c7b5bb568a9249def702d2b6c0b544bd3c825f2388d551462fedc"},"schema_version":"1.0"},"canonical_sha256":"bc949f21960b44f216720b71e6cbfc215475b6c251eb7eb944ed3fa3febbc0b4","source":{"kind":"arxiv","id":"1702.06269","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.06269","created_at":"2026-05-18T00:42:43Z"},{"alias_kind":"arxiv_version","alias_value":"1702.06269v2","created_at":"2026-05-18T00:42:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.06269","created_at":"2026-05-18T00:42:43Z"},{"alias_kind":"pith_short_12","alias_value":"XSKJ6IMWBNCP","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"XSKJ6IMWBNCPEFTS","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"XSKJ6IMW","created_at":"2026-05-18T12:31:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:XSKJ6IMWBNCPEFTSBNY6NS74EF","target":"record","payload":{"canonical_record":{"source":{"id":"1702.06269","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-02-21T05:19:23Z","cross_cats_sorted":[],"title_canon_sha256":"05afe54460aa3fbf13841136bef076cd03f4644815240cd65d80df45a4213c4a","abstract_canon_sha256":"934875051a8c7b5bb568a9249def702d2b6c0b544bd3c825f2388d551462fedc"},"schema_version":"1.0"},"canonical_sha256":"bc949f21960b44f216720b71e6cbfc215475b6c251eb7eb944ed3fa3febbc0b4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:43.901907Z","signature_b64":"ek16pl1T9R49A+/wsNgGz7133vijonVWF5kf8iC/hNMK7Ptuew+b+DiMB4eU+YHifk7XyAj/drMSJzuwj0PiBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bc949f21960b44f216720b71e6cbfc215475b6c251eb7eb944ed3fa3febbc0b4","last_reissued_at":"2026-05-18T00:42:43.901307Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:43.901307Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1702.06269","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:42:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"92UBIoQ2xoUbtQUPqDaDVzpgWv36atimMvtSa2i6ljPk0nG1rz4MYFOL7ytaWcYRtFiazzi8u50PoOZ6Ff+vCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T12:54:11.845617Z"},"content_sha256":"0fb6fa83026710b1f04b73a2d6c7d10691befc5a0e557a82e66df141d1ab569d","schema_version":"1.0","event_id":"sha256:0fb6fa83026710b1f04b73a2d6c7d10691befc5a0e557a82e66df141d1ab569d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:XSKJ6IMWBNCPEFTSBNY6NS74EF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Memory and Communication Efficient Distributed Stochastic Optimization with Minibatch-Prox","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Jialei Wang, Nathan Srebro, Weiran Wang","submitted_at":"2017-02-21T05:19:23Z","abstract_excerpt":"We present and analyze an approach for distributed stochastic optimization which is statistically optimal and achieves near-linear speedups (up to logarithmic factors). Our approach allows a communication-memory tradeoff, with either logarithmic communication but linear memory, or polynomial communication and a corresponding polynomial reduction in required memory. This communication-memory tradeoff is achieved through minibatch-prox iterations (minibatch passive-aggressive updates), where a subproblem on a minibatch is solved at each iteration. We provide a novel analysis for such a minibatch"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.06269","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:42:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T13OjndhPqNkGqwHlL+aLfoBz/RC18nxu5PoBTfYZjE3yGzqb0rU/X7cigedc5z79nOury9ZS2MYiFmLAmCWDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T12:54:11.846263Z"},"content_sha256":"bb093eeb103d57868d8e5aa2a78e75ed3bf9f34c9b55ca66bc403278c54984f9","schema_version":"1.0","event_id":"sha256:bb093eeb103d57868d8e5aa2a78e75ed3bf9f34c9b55ca66bc403278c54984f9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XSKJ6IMWBNCPEFTSBNY6NS74EF/bundle.json","state_url":"https://pith.science/pith/XSKJ6IMWBNCPEFTSBNY6NS74EF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XSKJ6IMWBNCPEFTSBNY6NS74EF/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-30T12:54:11Z","links":{"resolver":"https://pith.science/pith/XSKJ6IMWBNCPEFTSBNY6NS74EF","bundle":"https://pith.science/pith/XSKJ6IMWBNCPEFTSBNY6NS74EF/bundle.json","state":"https://pith.science/pith/XSKJ6IMWBNCPEFTSBNY6NS74EF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XSKJ6IMWBNCPEFTSBNY6NS74EF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:XSKJ6IMWBNCPEFTSBNY6NS74EF","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":"934875051a8c7b5bb568a9249def702d2b6c0b544bd3c825f2388d551462fedc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-02-21T05:19:23Z","title_canon_sha256":"05afe54460aa3fbf13841136bef076cd03f4644815240cd65d80df45a4213c4a"},"schema_version":"1.0","source":{"id":"1702.06269","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.06269","created_at":"2026-05-18T00:42:43Z"},{"alias_kind":"arxiv_version","alias_value":"1702.06269v2","created_at":"2026-05-18T00:42:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.06269","created_at":"2026-05-18T00:42:43Z"},{"alias_kind":"pith_short_12","alias_value":"XSKJ6IMWBNCP","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"XSKJ6IMWBNCPEFTS","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"XSKJ6IMW","created_at":"2026-05-18T12:31:56Z"}],"graph_snapshots":[{"event_id":"sha256:bb093eeb103d57868d8e5aa2a78e75ed3bf9f34c9b55ca66bc403278c54984f9","target":"graph","created_at":"2026-05-18T00:42:43Z","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 present and analyze an approach for distributed stochastic optimization which is statistically optimal and achieves near-linear speedups (up to logarithmic factors). Our approach allows a communication-memory tradeoff, with either logarithmic communication but linear memory, or polynomial communication and a corresponding polynomial reduction in required memory. This communication-memory tradeoff is achieved through minibatch-prox iterations (minibatch passive-aggressive updates), where a subproblem on a minibatch is solved at each iteration. We provide a novel analysis for such a minibatch","authors_text":"Jialei Wang, Nathan Srebro, Weiran Wang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-02-21T05:19:23Z","title":"Memory and Communication Efficient Distributed Stochastic Optimization with Minibatch-Prox"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.06269","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:0fb6fa83026710b1f04b73a2d6c7d10691befc5a0e557a82e66df141d1ab569d","target":"record","created_at":"2026-05-18T00:42:43Z","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":"934875051a8c7b5bb568a9249def702d2b6c0b544bd3c825f2388d551462fedc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-02-21T05:19:23Z","title_canon_sha256":"05afe54460aa3fbf13841136bef076cd03f4644815240cd65d80df45a4213c4a"},"schema_version":"1.0","source":{"id":"1702.06269","kind":"arxiv","version":2}},"canonical_sha256":"bc949f21960b44f216720b71e6cbfc215475b6c251eb7eb944ed3fa3febbc0b4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bc949f21960b44f216720b71e6cbfc215475b6c251eb7eb944ed3fa3febbc0b4","first_computed_at":"2026-05-18T00:42:43.901307Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:42:43.901307Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ek16pl1T9R49A+/wsNgGz7133vijonVWF5kf8iC/hNMK7Ptuew+b+DiMB4eU+YHifk7XyAj/drMSJzuwj0PiBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:42:43.901907Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.06269","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0fb6fa83026710b1f04b73a2d6c7d10691befc5a0e557a82e66df141d1ab569d","sha256:bb093eeb103d57868d8e5aa2a78e75ed3bf9f34c9b55ca66bc403278c54984f9"],"state_sha256":"0d59acfef486233c4d09f3b4d1f103647ddc9c4519cd6230fc170019cf150a38"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IqX2vu53ygddHCjb0VsMJOEtkfPDHRHGJ5OfzJg6ghHdS4ZPhLRXkSHcgcIQ2yfwfAYz56NHL8x52RcXQgtjDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T12:54:11.850674Z","bundle_sha256":"c4acd493f2bbafdd3c813221104a04b4801d5e6ca07370750794ecc8fce7833f"}}