{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:YTZYDLGDKSIHO4CSKTGWXIRSQR","short_pith_number":"pith:YTZYDLGD","canonical_record":{"source":{"id":"1902.11259","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-02-28T18:05:12Z","cross_cats_sorted":["cs.DC","stat.ML"],"title_canon_sha256":"604c30e0e4d5a2f26fafa13073df395e06892fa3695f5a253007767a38b1999c","abstract_canon_sha256":"337e77ba5c1e6ad12d6c028e26713a634c8e636b85803f7ab66e33a29e3b56d0"},"schema_version":"1.0"},"canonical_sha256":"c4f381acc3549077705254cd6ba2328448632108898a53cf04bd1a2ef870e552","source":{"kind":"arxiv","id":"1902.11259","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.11259","created_at":"2026-05-17T23:51:04Z"},{"alias_kind":"arxiv_version","alias_value":"1902.11259v2","created_at":"2026-05-17T23:51:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.11259","created_at":"2026-05-17T23:51:04Z"},{"alias_kind":"pith_short_12","alias_value":"YTZYDLGDKSIH","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"YTZYDLGDKSIHO4CS","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"YTZYDLGD","created_at":"2026-05-18T12:33:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:YTZYDLGDKSIHO4CSKTGWXIRSQR","target":"record","payload":{"canonical_record":{"source":{"id":"1902.11259","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-02-28T18:05:12Z","cross_cats_sorted":["cs.DC","stat.ML"],"title_canon_sha256":"604c30e0e4d5a2f26fafa13073df395e06892fa3695f5a253007767a38b1999c","abstract_canon_sha256":"337e77ba5c1e6ad12d6c028e26713a634c8e636b85803f7ab66e33a29e3b56d0"},"schema_version":"1.0"},"canonical_sha256":"c4f381acc3549077705254cd6ba2328448632108898a53cf04bd1a2ef870e552","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:04.899746Z","signature_b64":"LMiCk9DUHpIOTMqCSjNQcbAj7bkBUN6tZBY78Ya4S+XKmqu7/IsShQYkp4sRkaLDqgQ8DoBodTEtF4Z4ElN/Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c4f381acc3549077705254cd6ba2328448632108898a53cf04bd1a2ef870e552","last_reissued_at":"2026-05-17T23:51:04.899149Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:04.899149Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1902.11259","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:51:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eP549I2v8Mp7ycpXj9J+bVtDpWeSrIym5sNhIlXK7tcnUhxMvULpAsVZCOZF1TW5iTznY2WgrwnJPeSHO4ggCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T04:39:44.733835Z"},"content_sha256":"e92fedd7638043d04b8921af5bb101ae16139c5a3cca2c3a1538425d5c20258f","schema_version":"1.0","event_id":"sha256:e92fedd7638043d04b8921af5bb101ae16139c5a3cca2c3a1538425d5c20258f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:YTZYDLGDKSIHO4CSKTGWXIRSQR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributed Learning with Sublinear Communication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Christopher De Sa, Dylan J. Foster, Jayadev Acharya, Karthik Sridharan","submitted_at":"2019-02-28T18:05:12Z","abstract_excerpt":"In distributed statistical learning, $N$ samples are split across $m$ machines and a learner wishes to use minimal communication to learn as well as if the examples were on a single machine. This model has received substantial interest in machine learning due to its scalability and potential for parallel speedup. However, in high-dimensional settings, where the number examples is smaller than the number of features (\"dimension\"), the speedup afforded by distributed learning may be overshadowed by the cost of communicating a single example. This paper investigates the following question: When i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.11259","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:51:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9Q3++e8awUMsDurA73Xcvp2RT659G28E8XQX8DQjYs5DnBN2k1uqvjsAhTABC7tZ4s3F8hsaST4aE7XgYTtECg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T04:39:44.735056Z"},"content_sha256":"ccb59f93dbd3cfd16c106a25f64de26588f5ce4e548153083d5d111680ae6b46","schema_version":"1.0","event_id":"sha256:ccb59f93dbd3cfd16c106a25f64de26588f5ce4e548153083d5d111680ae6b46"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YTZYDLGDKSIHO4CSKTGWXIRSQR/bundle.json","state_url":"https://pith.science/pith/YTZYDLGDKSIHO4CSKTGWXIRSQR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YTZYDLGDKSIHO4CSKTGWXIRSQR/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-08-16T04:39:44Z","links":{"resolver":"https://pith.science/pith/YTZYDLGDKSIHO4CSKTGWXIRSQR","bundle":"https://pith.science/pith/YTZYDLGDKSIHO4CSKTGWXIRSQR/bundle.json","state":"https://pith.science/pith/YTZYDLGDKSIHO4CSKTGWXIRSQR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YTZYDLGDKSIHO4CSKTGWXIRSQR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:YTZYDLGDKSIHO4CSKTGWXIRSQR","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":"337e77ba5c1e6ad12d6c028e26713a634c8e636b85803f7ab66e33a29e3b56d0","cross_cats_sorted":["cs.DC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-02-28T18:05:12Z","title_canon_sha256":"604c30e0e4d5a2f26fafa13073df395e06892fa3695f5a253007767a38b1999c"},"schema_version":"1.0","source":{"id":"1902.11259","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.11259","created_at":"2026-05-17T23:51:04Z"},{"alias_kind":"arxiv_version","alias_value":"1902.11259v2","created_at":"2026-05-17T23:51:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.11259","created_at":"2026-05-17T23:51:04Z"},{"alias_kind":"pith_short_12","alias_value":"YTZYDLGDKSIH","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"YTZYDLGDKSIHO4CS","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"YTZYDLGD","created_at":"2026-05-18T12:33:33Z"}],"graph_snapshots":[{"event_id":"sha256:ccb59f93dbd3cfd16c106a25f64de26588f5ce4e548153083d5d111680ae6b46","target":"graph","created_at":"2026-05-17T23:51:04Z","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":"In distributed statistical learning, $N$ samples are split across $m$ machines and a learner wishes to use minimal communication to learn as well as if the examples were on a single machine. This model has received substantial interest in machine learning due to its scalability and potential for parallel speedup. However, in high-dimensional settings, where the number examples is smaller than the number of features (\"dimension\"), the speedup afforded by distributed learning may be overshadowed by the cost of communicating a single example. This paper investigates the following question: When i","authors_text":"Christopher De Sa, Dylan J. Foster, Jayadev Acharya, Karthik Sridharan","cross_cats":["cs.DC","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-02-28T18:05:12Z","title":"Distributed Learning with Sublinear Communication"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.11259","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:e92fedd7638043d04b8921af5bb101ae16139c5a3cca2c3a1538425d5c20258f","target":"record","created_at":"2026-05-17T23:51:04Z","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":"337e77ba5c1e6ad12d6c028e26713a634c8e636b85803f7ab66e33a29e3b56d0","cross_cats_sorted":["cs.DC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-02-28T18:05:12Z","title_canon_sha256":"604c30e0e4d5a2f26fafa13073df395e06892fa3695f5a253007767a38b1999c"},"schema_version":"1.0","source":{"id":"1902.11259","kind":"arxiv","version":2}},"canonical_sha256":"c4f381acc3549077705254cd6ba2328448632108898a53cf04bd1a2ef870e552","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c4f381acc3549077705254cd6ba2328448632108898a53cf04bd1a2ef870e552","first_computed_at":"2026-05-17T23:51:04.899149Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:51:04.899149Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LMiCk9DUHpIOTMqCSjNQcbAj7bkBUN6tZBY78Ya4S+XKmqu7/IsShQYkp4sRkaLDqgQ8DoBodTEtF4Z4ElN/Ag==","signature_status":"signed_v1","signed_at":"2026-05-17T23:51:04.899746Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.11259","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e92fedd7638043d04b8921af5bb101ae16139c5a3cca2c3a1538425d5c20258f","sha256:ccb59f93dbd3cfd16c106a25f64de26588f5ce4e548153083d5d111680ae6b46"],"state_sha256":"aee0b9f2ff7824a5221ffbfb74905be9e34a43e6f955aa855d2e40c814dffef8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5hwP3+VMhBeHqRe/POf4U0viqTV9VGhvY4xBFXTcYysLNHdEndg3rMkrIc+DvncP3wOdPCnBAlOJ4yTt67fSDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T04:39:44.744052Z","bundle_sha256":"60dfbfc709540339f665d4f82fe393de5e3fe7e8e430c36a56308c32a893c751"}}