{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:GXOPZNFYFSKKNCL2Z3Z2BF7HFN","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":"20efb3567d2006e9f0eba88bb34e170dd72532f84c3790f21e839a0615d61f19","cross_cats_sorted":["cs.LG","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-09-02T06:02:38Z","title_canon_sha256":"837965bd064c2c7108142970bb314fa1f3ed42e80586ce30af1fcf19cd4cec2f"},"schema_version":"1.0","source":{"id":"1709.00537","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.00537","created_at":"2026-05-18T00:35:40Z"},{"alias_kind":"arxiv_version","alias_value":"1709.00537v2","created_at":"2026-05-18T00:35:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.00537","created_at":"2026-05-18T00:35:40Z"},{"alias_kind":"pith_short_12","alias_value":"GXOPZNFYFSKK","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"GXOPZNFYFSKKNCL2","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"GXOPZNFY","created_at":"2026-05-18T12:31:18Z"}],"graph_snapshots":[{"event_id":"sha256:25049eeb0251246e24c80e54da33edc00d51fdadeb431c0ce95c2987cad47b4b","target":"graph","created_at":"2026-05-18T00:35: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":"We propose a communicationally and computationally efficient algorithm for high-dimensional distributed sparse learning. At each iteration, local machines compute the gradient on local data and the master machine solves one shifted $l_1$ regularized minimization problem. The communication cost is reduced from constant times of the dimension number for the state-of-the-art algorithm to constant times of the sparsity number via Two-way Truncation procedure. Theoretically, we prove that the estimation error of the proposed algorithm decreases exponentially and matches that of the centralized meth","authors_text":"Jarvis Haupt, Jineng Ren","cross_cats":["cs.LG","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-09-02T06:02:38Z","title":"Communication-efficient Algorithm for Distributed Sparse Learning via Two-way Truncation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.00537","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:ded7ef94c60846492e23f228953ec3ffb6babe2196e05568741fbbad983e6b3e","target":"record","created_at":"2026-05-18T00:35: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":"20efb3567d2006e9f0eba88bb34e170dd72532f84c3790f21e839a0615d61f19","cross_cats_sorted":["cs.LG","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-09-02T06:02:38Z","title_canon_sha256":"837965bd064c2c7108142970bb314fa1f3ed42e80586ce30af1fcf19cd4cec2f"},"schema_version":"1.0","source":{"id":"1709.00537","kind":"arxiv","version":2}},"canonical_sha256":"35dcfcb4b82c94a6897acef3a097e72b57fcdce4b0444655a0fe2ecd0078d629","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"35dcfcb4b82c94a6897acef3a097e72b57fcdce4b0444655a0fe2ecd0078d629","first_computed_at":"2026-05-18T00:35:40.673384Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:35:40.673384Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"G/O//OzHu7Sscwz2U0PPlvKPRiObikKRPPIH4bOqOGLymNEvgd3nu0hswGjeEgTwW3s6PaHE0nRbQuKE5IOeAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:35:40.673899Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.00537","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ded7ef94c60846492e23f228953ec3ffb6babe2196e05568741fbbad983e6b3e","sha256:25049eeb0251246e24c80e54da33edc00d51fdadeb431c0ce95c2987cad47b4b"],"state_sha256":"7aa730d69d54efbc3fefba014b06b0b10102b99ff5e9fa471f0a37528d632184"}