{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:Z7IWEL4HP6S7UDS6JUZHLDA6ZV","short_pith_number":"pith:Z7IWEL4H","canonical_record":{"source":{"id":"1803.05621","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-03-15T07:38:50Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"cab643e862f9469f8faa17f9d881243a870ea504cd55c3f5fa8c75a486b61790","abstract_canon_sha256":"391a1edae048edd20ead096d4ff38602fead6122340eb184a33cac79bcd3c49b"},"schema_version":"1.0"},"canonical_sha256":"cfd1622f877fa5fa0e5e4d32758c1ecd6c1d5d5c11fac62e64e76a4930c73d56","source":{"kind":"arxiv","id":"1803.05621","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.05621","created_at":"2026-05-18T00:02:18Z"},{"alias_kind":"arxiv_version","alias_value":"1803.05621v2","created_at":"2026-05-18T00:02:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.05621","created_at":"2026-05-18T00:02:18Z"},{"alias_kind":"pith_short_12","alias_value":"Z7IWEL4HP6S7","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"Z7IWEL4HP6S7UDS6","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"Z7IWEL4H","created_at":"2026-05-18T12:33:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:Z7IWEL4HP6S7UDS6JUZHLDA6ZV","target":"record","payload":{"canonical_record":{"source":{"id":"1803.05621","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-03-15T07:38:50Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"cab643e862f9469f8faa17f9d881243a870ea504cd55c3f5fa8c75a486b61790","abstract_canon_sha256":"391a1edae048edd20ead096d4ff38602fead6122340eb184a33cac79bcd3c49b"},"schema_version":"1.0"},"canonical_sha256":"cfd1622f877fa5fa0e5e4d32758c1ecd6c1d5d5c11fac62e64e76a4930c73d56","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:18.136835Z","signature_b64":"kDmyX/v3RB04Os8JWo5M7UJeyWjcfJWV4O0M+scB17sqnNDhcDgpIoUYTj1/XSW+IzuaZCsc+M3WIrlgeKBhDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cfd1622f877fa5fa0e5e4d32758c1ecd6c1d5d5c11fac62e64e76a4930c73d56","last_reissued_at":"2026-05-18T00:02:18.135880Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:18.135880Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.05621","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-18T00:02:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WmloEv12V3Sg9g1UcctW08fKP7wvVodCgeB81t3Lp43wzOOxBw4QAd39y4SinrbAwxGRhOeM1lndT7tarKncDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T13:05:07.320877Z"},"content_sha256":"8e22254438703b5225562b452e788ef0e19deaba54d9163bc410c7957ac5557d","schema_version":"1.0","event_id":"sha256:8e22254438703b5225562b452e788ef0e19deaba54d9163bc410c7957ac5557d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:Z7IWEL4HP6S7UDS6JUZHLDA6ZV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Proximal SCOPE for Distributed Sparse Learning: Better Data Partition Implies Faster Convergence Rate","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Gong-Duo Zhang, Ming-Wei Li, Shen-Yi Zhao, Wu-Jun Li","submitted_at":"2018-03-15T07:38:50Z","abstract_excerpt":"Distributed sparse learning with a cluster of multiple machines has attracted much attention in machine learning, especially for large-scale applications with high-dimensional data. One popular way to implement sparse learning is to use $L_1$ regularization. In this paper, we propose a novel method, called proximal \\mbox{SCOPE}~(\\mbox{pSCOPE}), for distributed sparse learning with $L_1$ regularization. pSCOPE is based on a \\underline{c}ooperative \\underline{a}utonomous \\underline{l}ocal \\underline{l}earning~(\\mbox{CALL}) framework. In the \\mbox{CALL} framework of \\mbox{pSCOPE}, we find that th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.05621","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-18T00:02:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ic788MIBtoexerO+bQerGdyalL1cjXKRHarPUJZ5HWefODXNekVhjiZ1gio4yEBOf0CgYCPIaxEIFswuBeQDDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T13:05:07.321657Z"},"content_sha256":"3961df1dc4db3126d41c8437a4c921adedff9723122961ffd9c3e48c0abc4cd4","schema_version":"1.0","event_id":"sha256:3961df1dc4db3126d41c8437a4c921adedff9723122961ffd9c3e48c0abc4cd4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Z7IWEL4HP6S7UDS6JUZHLDA6ZV/bundle.json","state_url":"https://pith.science/pith/Z7IWEL4HP6S7UDS6JUZHLDA6ZV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Z7IWEL4HP6S7UDS6JUZHLDA6ZV/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-06-10T13:05:07Z","links":{"resolver":"https://pith.science/pith/Z7IWEL4HP6S7UDS6JUZHLDA6ZV","bundle":"https://pith.science/pith/Z7IWEL4HP6S7UDS6JUZHLDA6ZV/bundle.json","state":"https://pith.science/pith/Z7IWEL4HP6S7UDS6JUZHLDA6ZV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Z7IWEL4HP6S7UDS6JUZHLDA6ZV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:Z7IWEL4HP6S7UDS6JUZHLDA6ZV","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":"391a1edae048edd20ead096d4ff38602fead6122340eb184a33cac79bcd3c49b","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-03-15T07:38:50Z","title_canon_sha256":"cab643e862f9469f8faa17f9d881243a870ea504cd55c3f5fa8c75a486b61790"},"schema_version":"1.0","source":{"id":"1803.05621","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.05621","created_at":"2026-05-18T00:02:18Z"},{"alias_kind":"arxiv_version","alias_value":"1803.05621v2","created_at":"2026-05-18T00:02:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.05621","created_at":"2026-05-18T00:02:18Z"},{"alias_kind":"pith_short_12","alias_value":"Z7IWEL4HP6S7","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"Z7IWEL4HP6S7UDS6","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"Z7IWEL4H","created_at":"2026-05-18T12:33:04Z"}],"graph_snapshots":[{"event_id":"sha256:3961df1dc4db3126d41c8437a4c921adedff9723122961ffd9c3e48c0abc4cd4","target":"graph","created_at":"2026-05-18T00:02:18Z","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":"Distributed sparse learning with a cluster of multiple machines has attracted much attention in machine learning, especially for large-scale applications with high-dimensional data. One popular way to implement sparse learning is to use $L_1$ regularization. In this paper, we propose a novel method, called proximal \\mbox{SCOPE}~(\\mbox{pSCOPE}), for distributed sparse learning with $L_1$ regularization. pSCOPE is based on a \\underline{c}ooperative \\underline{a}utonomous \\underline{l}ocal \\underline{l}earning~(\\mbox{CALL}) framework. In the \\mbox{CALL} framework of \\mbox{pSCOPE}, we find that th","authors_text":"Gong-Duo Zhang, Ming-Wei Li, Shen-Yi Zhao, Wu-Jun Li","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-03-15T07:38:50Z","title":"Proximal SCOPE for Distributed Sparse Learning: Better Data Partition Implies Faster Convergence Rate"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.05621","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:8e22254438703b5225562b452e788ef0e19deaba54d9163bc410c7957ac5557d","target":"record","created_at":"2026-05-18T00:02:18Z","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":"391a1edae048edd20ead096d4ff38602fead6122340eb184a33cac79bcd3c49b","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-03-15T07:38:50Z","title_canon_sha256":"cab643e862f9469f8faa17f9d881243a870ea504cd55c3f5fa8c75a486b61790"},"schema_version":"1.0","source":{"id":"1803.05621","kind":"arxiv","version":2}},"canonical_sha256":"cfd1622f877fa5fa0e5e4d32758c1ecd6c1d5d5c11fac62e64e76a4930c73d56","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cfd1622f877fa5fa0e5e4d32758c1ecd6c1d5d5c11fac62e64e76a4930c73d56","first_computed_at":"2026-05-18T00:02:18.135880Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:02:18.135880Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kDmyX/v3RB04Os8JWo5M7UJeyWjcfJWV4O0M+scB17sqnNDhcDgpIoUYTj1/XSW+IzuaZCsc+M3WIrlgeKBhDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:02:18.136835Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.05621","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8e22254438703b5225562b452e788ef0e19deaba54d9163bc410c7957ac5557d","sha256:3961df1dc4db3126d41c8437a4c921adedff9723122961ffd9c3e48c0abc4cd4"],"state_sha256":"2e7f98e28b9ecc00596f9c97347668782a6cfc3f929811a353fba183e11161f9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rISIc0iEFKvRo8yQ+j+oaVXAjS4/5eNZo5wJw8s8VjtRZ4cPe15ZkNUXbmUFpyeBVqiXZOkNDyLC89YD3SENCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T13:05:07.326080Z","bundle_sha256":"a150335ea56584d33c44a914b3329376da44396350fd745a5f61083729e1990b"}}