{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:4LYDI4LGNRJJDRZAQTQZJ3QLQM","short_pith_number":"pith:4LYDI4LG","canonical_record":{"source":{"id":"1901.08924","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-01-25T15:27:36Z","cross_cats_sorted":[],"title_canon_sha256":"849802dbe919af503130640382e25244bdd184ff067ee730b3b3f353e9eee91a","abstract_canon_sha256":"dd1f6545946593977967dea71215dbbb37089e81664204c6a0a223c0d184625b"},"schema_version":"1.0"},"canonical_sha256":"e2f03471666c5291c72084e194ee0b8315bd13efa0a34a0333159e7d297adcf8","source":{"kind":"arxiv","id":"1901.08924","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.08924","created_at":"2026-05-17T23:52:26Z"},{"alias_kind":"arxiv_version","alias_value":"1901.08924v2","created_at":"2026-05-17T23:52:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.08924","created_at":"2026-05-17T23:52:26Z"},{"alias_kind":"pith_short_12","alias_value":"4LYDI4LGNRJJ","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"4LYDI4LGNRJJDRZA","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"4LYDI4LG","created_at":"2026-05-18T12:33:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:4LYDI4LGNRJJDRZAQTQZJ3QLQM","target":"record","payload":{"canonical_record":{"source":{"id":"1901.08924","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-01-25T15:27:36Z","cross_cats_sorted":[],"title_canon_sha256":"849802dbe919af503130640382e25244bdd184ff067ee730b3b3f353e9eee91a","abstract_canon_sha256":"dd1f6545946593977967dea71215dbbb37089e81664204c6a0a223c0d184625b"},"schema_version":"1.0"},"canonical_sha256":"e2f03471666c5291c72084e194ee0b8315bd13efa0a34a0333159e7d297adcf8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:26.795543Z","signature_b64":"JATK4nek29b0iDlCFeJbUCziTxyPKWk1NOA0UDB1gGbi9u+MSPp3R2f6Uy+J6pffAlkh9HT7Mbrp4+VJDi59AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e2f03471666c5291c72084e194ee0b8315bd13efa0a34a0333159e7d297adcf8","last_reissued_at":"2026-05-17T23:52:26.794952Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:26.794952Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1901.08924","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:52:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xFMPepJsXlGjOI5hK5rRxEXSPeO/C9Z6mAzE09VgEaUG0Yt/KnN+2w12caMlgNquhtYPc4dx5tcqzHIB0JCBCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T14:52:42.385046Z"},"content_sha256":"25f870112f31f1649e67b54c0f12b6a893823d4d36c7989a54be430d0ab2828a","schema_version":"1.0","event_id":"sha256:25f870112f31f1649e67b54c0f12b6a893823d4d36c7989a54be430d0ab2828a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:4LYDI4LGNRJJDRZAQTQZJ3QLQM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Exploring Fast and Communication-Efficient Algorithms in Large-scale Distributed Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jiaxiang Wu, Junzhou Huang, Yue Yu","submitted_at":"2019-01-25T15:27:36Z","abstract_excerpt":"The communication overhead has become a significant bottleneck in data-parallel network with the increasing of model size and data samples. In this work, we propose a new algorithm LPC-SVRG with quantized gradients and its acceleration ALPC-SVRG to effectively reduce the communication complexity while maintaining the same convergence as the unquantized algorithms. Specifically, we formulate the heuristic gradient clipping technique within the quantization scheme and show that unbiased quantization methods in related works [3, 33, 38] are special cases of ours. We introduce double sampling in t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.08924","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:52:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WB2kHsGHLhrWnZAocGkKlKBcFgxLSEIYAnUqWk6eIHIRW3tV7+Sf68Dd1+5wMiRKb7zNC/8ZgpVzHhSjEeJmBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T14:52:42.385954Z"},"content_sha256":"2a70be84c11dff2b55fd1782143192d6dd1b028e1a408719350359374f629d37","schema_version":"1.0","event_id":"sha256:2a70be84c11dff2b55fd1782143192d6dd1b028e1a408719350359374f629d37"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4LYDI4LGNRJJDRZAQTQZJ3QLQM/bundle.json","state_url":"https://pith.science/pith/4LYDI4LGNRJJDRZAQTQZJ3QLQM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4LYDI4LGNRJJDRZAQTQZJ3QLQM/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-31T14:52:42Z","links":{"resolver":"https://pith.science/pith/4LYDI4LGNRJJDRZAQTQZJ3QLQM","bundle":"https://pith.science/pith/4LYDI4LGNRJJDRZAQTQZJ3QLQM/bundle.json","state":"https://pith.science/pith/4LYDI4LGNRJJDRZAQTQZJ3QLQM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4LYDI4LGNRJJDRZAQTQZJ3QLQM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:4LYDI4LGNRJJDRZAQTQZJ3QLQM","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":"dd1f6545946593977967dea71215dbbb37089e81664204c6a0a223c0d184625b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-01-25T15:27:36Z","title_canon_sha256":"849802dbe919af503130640382e25244bdd184ff067ee730b3b3f353e9eee91a"},"schema_version":"1.0","source":{"id":"1901.08924","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.08924","created_at":"2026-05-17T23:52:26Z"},{"alias_kind":"arxiv_version","alias_value":"1901.08924v2","created_at":"2026-05-17T23:52:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.08924","created_at":"2026-05-17T23:52:26Z"},{"alias_kind":"pith_short_12","alias_value":"4LYDI4LGNRJJ","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"4LYDI4LGNRJJDRZA","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"4LYDI4LG","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:2a70be84c11dff2b55fd1782143192d6dd1b028e1a408719350359374f629d37","target":"graph","created_at":"2026-05-17T23:52:26Z","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":"The communication overhead has become a significant bottleneck in data-parallel network with the increasing of model size and data samples. In this work, we propose a new algorithm LPC-SVRG with quantized gradients and its acceleration ALPC-SVRG to effectively reduce the communication complexity while maintaining the same convergence as the unquantized algorithms. Specifically, we formulate the heuristic gradient clipping technique within the quantization scheme and show that unbiased quantization methods in related works [3, 33, 38] are special cases of ours. We introduce double sampling in t","authors_text":"Jiaxiang Wu, Junzhou Huang, Yue Yu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-01-25T15:27:36Z","title":"Exploring Fast and Communication-Efficient Algorithms in Large-scale Distributed Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.08924","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:25f870112f31f1649e67b54c0f12b6a893823d4d36c7989a54be430d0ab2828a","target":"record","created_at":"2026-05-17T23:52:26Z","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":"dd1f6545946593977967dea71215dbbb37089e81664204c6a0a223c0d184625b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-01-25T15:27:36Z","title_canon_sha256":"849802dbe919af503130640382e25244bdd184ff067ee730b3b3f353e9eee91a"},"schema_version":"1.0","source":{"id":"1901.08924","kind":"arxiv","version":2}},"canonical_sha256":"e2f03471666c5291c72084e194ee0b8315bd13efa0a34a0333159e7d297adcf8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e2f03471666c5291c72084e194ee0b8315bd13efa0a34a0333159e7d297adcf8","first_computed_at":"2026-05-17T23:52:26.794952Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:52:26.794952Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JATK4nek29b0iDlCFeJbUCziTxyPKWk1NOA0UDB1gGbi9u+MSPp3R2f6Uy+J6pffAlkh9HT7Mbrp4+VJDi59AA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:52:26.795543Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.08924","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:25f870112f31f1649e67b54c0f12b6a893823d4d36c7989a54be430d0ab2828a","sha256:2a70be84c11dff2b55fd1782143192d6dd1b028e1a408719350359374f629d37"],"state_sha256":"1b560d9d8be11207a0f59d14239a34136b2a3cc3bdc0cf61443331a47d902a8c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fJfLSzTdrNkaQNLloMv9+bfglKXfZmg5RwO4yNBv/MYl3nY93LJkFS70XBxpaXrQ/gdsjlQUm54fnu9qWCf/DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T14:52:42.391040Z","bundle_sha256":"daacd9db6da808a97554b819283f0035556f501d352a8494162d1c3df1d796f7"}}