{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:CJI7KRLFTNH5DV3UNEXLB67SO6","short_pith_number":"pith:CJI7KRLF","canonical_record":{"source":{"id":"1905.13727","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-31T17:25:13Z","cross_cats_sorted":["cs.DC","math.OC","stat.ML"],"title_canon_sha256":"998352f2986262bb27ceb88b73a16f022bfc819de75f050f238ac93312c9e387","abstract_canon_sha256":"0cc9ee2e38246638c073324650e5e8132dce0a930e4ce031bc56363bba82f4f2"},"schema_version":"1.0"},"canonical_sha256":"1251f545659b4fd1d774692eb0fbf277895da7d28b7ef2cad0ea793f17080ade","source":{"kind":"arxiv","id":"1905.13727","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.13727","created_at":"2026-07-05T00:41:29Z"},{"alias_kind":"arxiv_version","alias_value":"1905.13727v3","created_at":"2026-07-05T00:41:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.13727","created_at":"2026-07-05T00:41:29Z"},{"alias_kind":"pith_short_12","alias_value":"CJI7KRLFTNH5","created_at":"2026-07-05T00:41:29Z"},{"alias_kind":"pith_short_16","alias_value":"CJI7KRLFTNH5DV3U","created_at":"2026-07-05T00:41:29Z"},{"alias_kind":"pith_short_8","alias_value":"CJI7KRLF","created_at":"2026-07-05T00:41:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:CJI7KRLFTNH5DV3UNEXLB67SO6","target":"record","payload":{"canonical_record":{"source":{"id":"1905.13727","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-31T17:25:13Z","cross_cats_sorted":["cs.DC","math.OC","stat.ML"],"title_canon_sha256":"998352f2986262bb27ceb88b73a16f022bfc819de75f050f238ac93312c9e387","abstract_canon_sha256":"0cc9ee2e38246638c073324650e5e8132dce0a930e4ce031bc56363bba82f4f2"},"schema_version":"1.0"},"canonical_sha256":"1251f545659b4fd1d774692eb0fbf277895da7d28b7ef2cad0ea793f17080ade","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:41:29.613704Z","signature_b64":"sIPqgiO8eYqz6fALdrPpcQS2eW7rKUxmIpt5of1GjwZjYQboLeAxKPod2K2myScNyRQa4gNGpdT0yCd4V2deDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1251f545659b4fd1d774692eb0fbf277895da7d28b7ef2cad0ea793f17080ade","last_reissued_at":"2026-07-05T00:41:29.613096Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:41:29.613096Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.13727","source_version":3,"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-07-05T00:41:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yAu5HjCEWjpj3H5VEylVrzX7/9NsHyEspDB3lQc3WMdzM5v3HyHHH3gQKLf8xQkcQhhocWP/20xdBtki1XCLDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-14T12:47:40.843557Z"},"content_sha256":"9680db949611932b4ba5067582081f4fdd65985209ebb95e90baf5d990413cb9","schema_version":"1.0","event_id":"sha256:9680db949611932b4ba5067582081f4fdd65985209ebb95e90baf5d990413cb9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:CJI7KRLFTNH5DV3UNEXLB67SO6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"PowerSGD: Practical Low-Rank Gradient Compression for Distributed Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Martin Jaggi, Sai Praneeth Karimireddy, Thijs Vogels","submitted_at":"2019-05-31T17:25:13Z","abstract_excerpt":"We study gradient compression methods to alleviate the communication bottleneck in data-parallel distributed optimization. Despite the significant attention received, current compression schemes either do not scale well or fail to achieve the target test accuracy. We propose a new low-rank gradient compressor based on power iteration that can i) compress gradients rapidly, ii) efficiently aggregate the compressed gradients using all-reduce, and iii) achieve test performance on par with SGD. The proposed algorithm is the only method evaluated that achieves consistent wall-clock speedups when be"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.13727","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1905.13727/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T00:41:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vr7W6SMp7uK1GGiUgspxlY+pgRjin+iLKHbY8TZlspW3AKCpU/X4wvhtHTfusoGsQRSgegynxckwIDxYoFWaBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-14T12:47:40.843924Z"},"content_sha256":"f6bd11df66a2104fa8d9c9c82a47e17f51b8daa29424ce18272b2f30fcf24c52","schema_version":"1.0","event_id":"sha256:f6bd11df66a2104fa8d9c9c82a47e17f51b8daa29424ce18272b2f30fcf24c52"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CJI7KRLFTNH5DV3UNEXLB67SO6/bundle.json","state_url":"https://pith.science/pith/CJI7KRLFTNH5DV3UNEXLB67SO6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CJI7KRLFTNH5DV3UNEXLB67SO6/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-07-14T12:47:40Z","links":{"resolver":"https://pith.science/pith/CJI7KRLFTNH5DV3UNEXLB67SO6","bundle":"https://pith.science/pith/CJI7KRLFTNH5DV3UNEXLB67SO6/bundle.json","state":"https://pith.science/pith/CJI7KRLFTNH5DV3UNEXLB67SO6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CJI7KRLFTNH5DV3UNEXLB67SO6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:CJI7KRLFTNH5DV3UNEXLB67SO6","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":"0cc9ee2e38246638c073324650e5e8132dce0a930e4ce031bc56363bba82f4f2","cross_cats_sorted":["cs.DC","math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-31T17:25:13Z","title_canon_sha256":"998352f2986262bb27ceb88b73a16f022bfc819de75f050f238ac93312c9e387"},"schema_version":"1.0","source":{"id":"1905.13727","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.13727","created_at":"2026-07-05T00:41:29Z"},{"alias_kind":"arxiv_version","alias_value":"1905.13727v3","created_at":"2026-07-05T00:41:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.13727","created_at":"2026-07-05T00:41:29Z"},{"alias_kind":"pith_short_12","alias_value":"CJI7KRLFTNH5","created_at":"2026-07-05T00:41:29Z"},{"alias_kind":"pith_short_16","alias_value":"CJI7KRLFTNH5DV3U","created_at":"2026-07-05T00:41:29Z"},{"alias_kind":"pith_short_8","alias_value":"CJI7KRLF","created_at":"2026-07-05T00:41:29Z"}],"graph_snapshots":[{"event_id":"sha256:f6bd11df66a2104fa8d9c9c82a47e17f51b8daa29424ce18272b2f30fcf24c52","target":"graph","created_at":"2026-07-05T00:41:29Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1905.13727/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study gradient compression methods to alleviate the communication bottleneck in data-parallel distributed optimization. Despite the significant attention received, current compression schemes either do not scale well or fail to achieve the target test accuracy. We propose a new low-rank gradient compressor based on power iteration that can i) compress gradients rapidly, ii) efficiently aggregate the compressed gradients using all-reduce, and iii) achieve test performance on par with SGD. The proposed algorithm is the only method evaluated that achieves consistent wall-clock speedups when be","authors_text":"Martin Jaggi, Sai Praneeth Karimireddy, Thijs Vogels","cross_cats":["cs.DC","math.OC","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-31T17:25:13Z","title":"PowerSGD: Practical Low-Rank Gradient Compression for Distributed Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.13727","kind":"arxiv","version":3},"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:9680db949611932b4ba5067582081f4fdd65985209ebb95e90baf5d990413cb9","target":"record","created_at":"2026-07-05T00:41:29Z","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":"0cc9ee2e38246638c073324650e5e8132dce0a930e4ce031bc56363bba82f4f2","cross_cats_sorted":["cs.DC","math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-31T17:25:13Z","title_canon_sha256":"998352f2986262bb27ceb88b73a16f022bfc819de75f050f238ac93312c9e387"},"schema_version":"1.0","source":{"id":"1905.13727","kind":"arxiv","version":3}},"canonical_sha256":"1251f545659b4fd1d774692eb0fbf277895da7d28b7ef2cad0ea793f17080ade","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1251f545659b4fd1d774692eb0fbf277895da7d28b7ef2cad0ea793f17080ade","first_computed_at":"2026-07-05T00:41:29.613096Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:41:29.613096Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sIPqgiO8eYqz6fALdrPpcQS2eW7rKUxmIpt5of1GjwZjYQboLeAxKPod2K2myScNyRQa4gNGpdT0yCd4V2deDw==","signature_status":"signed_v1","signed_at":"2026-07-05T00:41:29.613704Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.13727","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9680db949611932b4ba5067582081f4fdd65985209ebb95e90baf5d990413cb9","sha256:f6bd11df66a2104fa8d9c9c82a47e17f51b8daa29424ce18272b2f30fcf24c52"],"state_sha256":"2bf30e76de054984475e0e91259364c8efbc8c10c79054ec9dd0e003ebb7fcd1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jcEJCF6C6dVLWKxCaTpJOo2PU8ayyFX/nFeNTjHULd531BLYkPV/1PFjnyYXNNwVbXRBYgvAaf/A7dXu8gx+Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-14T12:47:40.846059Z","bundle_sha256":"1ef7640aa998fe9c513a6889ed050e6ab1c03b140a4c7444fc5ccd3a53221705"}}