{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:74TGGGVUEVTMPRMWRFAXQG2334","short_pith_number":"pith:74TGGGVU","canonical_record":{"source":{"id":"1605.07991","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-05-25T18:15:43Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"ff3fa546c6dffc16b1188c7a703004983572dca8208641f71616ccb4d1af990f","abstract_canon_sha256":"1fdbb5d729d3f90fc7722c590136565ad4f74bc860987c5efe1d7adce676a18f"},"schema_version":"1.0"},"canonical_sha256":"ff26631ab42566c7c5968941781b5bdf11bb32a2bcdaac9f18d68a75302714d3","source":{"kind":"arxiv","id":"1605.07991","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.07991","created_at":"2026-05-18T01:13:38Z"},{"alias_kind":"arxiv_version","alias_value":"1605.07991v1","created_at":"2026-05-18T01:13:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.07991","created_at":"2026-05-18T01:13:38Z"},{"alias_kind":"pith_short_12","alias_value":"74TGGGVUEVTM","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"74TGGGVUEVTMPRMW","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"74TGGGVU","created_at":"2026-05-18T12:30:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:74TGGGVUEVTMPRMWRFAXQG2334","target":"record","payload":{"canonical_record":{"source":{"id":"1605.07991","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-05-25T18:15:43Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"ff3fa546c6dffc16b1188c7a703004983572dca8208641f71616ccb4d1af990f","abstract_canon_sha256":"1fdbb5d729d3f90fc7722c590136565ad4f74bc860987c5efe1d7adce676a18f"},"schema_version":"1.0"},"canonical_sha256":"ff26631ab42566c7c5968941781b5bdf11bb32a2bcdaac9f18d68a75302714d3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:13:38.612735Z","signature_b64":"qhxytvFx9VT5B48jXdqaU+vEdSHq/P7T/68627/fR/Xa+ObmppSs7b6k0N+nzspM5cem9aoRZN+uw2Ed80KIDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ff26631ab42566c7c5968941781b5bdf11bb32a2bcdaac9f18d68a75302714d3","last_reissued_at":"2026-05-18T01:13:38.611838Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:13:38.611838Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.07991","source_version":1,"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-18T01:13:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lKanwaRC7Y3TdB1ZG+DnllNMYa2/HFlHocD/dKGa1Tzy6wsc/lsjtfm5/4/FrWWA9wSxt9Lc+hAZpw+HEt9MBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T02:11:36.286938Z"},"content_sha256":"f00e47d2d8a31be4e29b8cba8f6bf6f631f7e938a430285eeb7e843d7f5391f2","schema_version":"1.0","event_id":"sha256:f00e47d2d8a31be4e29b8cba8f6bf6f631f7e938a430285eeb7e843d7f5391f2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:74TGGGVUEVTMPRMWRFAXQG2334","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Distributed Learning with Sparsity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Jialei Wang, Mladen Kolar, Nathan Srebro, Tong Zhang","submitted_at":"2016-05-25T18:15:43Z","abstract_excerpt":"We propose a novel, efficient approach for distributed sparse learning in high-dimensions, where observations are randomly partitioned across machines. Computationally, at each round our method only requires the master machine to solve a shifted ell_1 regularized M-estimation problem, and other workers to compute the gradient. In respect of communication, the proposed approach provably matches the estimation error bound of centralized methods within constant rounds of communications (ignoring logarithmic factors). We conduct extensive experiments on both simulated and real world datasets, and "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.07991","kind":"arxiv","version":1},"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-18T01:13:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZUIZ8wMczy33qYmO86x/5l/jIWCgDlbVUxBLT9k4B7qUd68ZbOH9tgBhszZeesOBpNc/KPxcHWSp53q/z/ZPCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T02:11:36.287333Z"},"content_sha256":"05d8d32dd7dfb92771daad1a93556cf640f921dd6de9b308357a42f5d5425dc7","schema_version":"1.0","event_id":"sha256:05d8d32dd7dfb92771daad1a93556cf640f921dd6de9b308357a42f5d5425dc7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/74TGGGVUEVTMPRMWRFAXQG2334/bundle.json","state_url":"https://pith.science/pith/74TGGGVUEVTMPRMWRFAXQG2334/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/74TGGGVUEVTMPRMWRFAXQG2334/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-27T02:11:36Z","links":{"resolver":"https://pith.science/pith/74TGGGVUEVTMPRMWRFAXQG2334","bundle":"https://pith.science/pith/74TGGGVUEVTMPRMWRFAXQG2334/bundle.json","state":"https://pith.science/pith/74TGGGVUEVTMPRMWRFAXQG2334/state.json","well_known_bundle":"https://pith.science/.well-known/pith/74TGGGVUEVTMPRMWRFAXQG2334/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:74TGGGVUEVTMPRMWRFAXQG2334","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":"1fdbb5d729d3f90fc7722c590136565ad4f74bc860987c5efe1d7adce676a18f","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-05-25T18:15:43Z","title_canon_sha256":"ff3fa546c6dffc16b1188c7a703004983572dca8208641f71616ccb4d1af990f"},"schema_version":"1.0","source":{"id":"1605.07991","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.07991","created_at":"2026-05-18T01:13:38Z"},{"alias_kind":"arxiv_version","alias_value":"1605.07991v1","created_at":"2026-05-18T01:13:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.07991","created_at":"2026-05-18T01:13:38Z"},{"alias_kind":"pith_short_12","alias_value":"74TGGGVUEVTM","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"74TGGGVUEVTMPRMW","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"74TGGGVU","created_at":"2026-05-18T12:30:04Z"}],"graph_snapshots":[{"event_id":"sha256:05d8d32dd7dfb92771daad1a93556cf640f921dd6de9b308357a42f5d5425dc7","target":"graph","created_at":"2026-05-18T01:13:38Z","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 novel, efficient approach for distributed sparse learning in high-dimensions, where observations are randomly partitioned across machines. Computationally, at each round our method only requires the master machine to solve a shifted ell_1 regularized M-estimation problem, and other workers to compute the gradient. In respect of communication, the proposed approach provably matches the estimation error bound of centralized methods within constant rounds of communications (ignoring logarithmic factors). We conduct extensive experiments on both simulated and real world datasets, and ","authors_text":"Jialei Wang, Mladen Kolar, Nathan Srebro, Tong Zhang","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-05-25T18:15:43Z","title":"Efficient Distributed Learning with Sparsity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.07991","kind":"arxiv","version":1},"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:f00e47d2d8a31be4e29b8cba8f6bf6f631f7e938a430285eeb7e843d7f5391f2","target":"record","created_at":"2026-05-18T01:13:38Z","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":"1fdbb5d729d3f90fc7722c590136565ad4f74bc860987c5efe1d7adce676a18f","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-05-25T18:15:43Z","title_canon_sha256":"ff3fa546c6dffc16b1188c7a703004983572dca8208641f71616ccb4d1af990f"},"schema_version":"1.0","source":{"id":"1605.07991","kind":"arxiv","version":1}},"canonical_sha256":"ff26631ab42566c7c5968941781b5bdf11bb32a2bcdaac9f18d68a75302714d3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ff26631ab42566c7c5968941781b5bdf11bb32a2bcdaac9f18d68a75302714d3","first_computed_at":"2026-05-18T01:13:38.611838Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:13:38.611838Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qhxytvFx9VT5B48jXdqaU+vEdSHq/P7T/68627/fR/Xa+ObmppSs7b6k0N+nzspM5cem9aoRZN+uw2Ed80KIDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:13:38.612735Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.07991","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f00e47d2d8a31be4e29b8cba8f6bf6f631f7e938a430285eeb7e843d7f5391f2","sha256:05d8d32dd7dfb92771daad1a93556cf640f921dd6de9b308357a42f5d5425dc7"],"state_sha256":"089137945c784049d3c9a86885461a05c46db754e4192bd9620b4a3985ffc21d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BRSHkKfAxcMJH/JIuEYceqNgnuh5Z1pjeqxLO1g3ERozfA4eaUBHv0XdjeUMOK9XswdSHJu9C+wqzjXjKCCgAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T02:11:36.290210Z","bundle_sha256":"9f599c3d13412209b725d4d98473fe3ae524693fe0556a6620e39a463fca9d8c"}}