{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:PLJMGJHQWMCQ4WQPYUQ6ENVAP5","short_pith_number":"pith:PLJMGJHQ","canonical_record":{"source":{"id":"1602.00133","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-01-30T16:11:53Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"1539bc4c93cf648ab1aa5896f19254ffd7ebf810e0c060965da1791a726cfd13","abstract_canon_sha256":"6e57ac6d7b5a72601fd08482303ca19ed54f2fc1c7327ba750783ccd7e04e0f9"},"schema_version":"1.0"},"canonical_sha256":"7ad2c324f0b3050e5a0fc521e236a07f5c238f962f649516a1aa103b3b73641b","source":{"kind":"arxiv","id":"1602.00133","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.00133","created_at":"2026-05-18T00:55:25Z"},{"alias_kind":"arxiv_version","alias_value":"1602.00133v5","created_at":"2026-05-18T00:55:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.00133","created_at":"2026-05-18T00:55:25Z"},{"alias_kind":"pith_short_12","alias_value":"PLJMGJHQWMCQ","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"PLJMGJHQWMCQ4WQP","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"PLJMGJHQ","created_at":"2026-05-18T12:30:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:PLJMGJHQWMCQ4WQPYUQ6ENVAP5","target":"record","payload":{"canonical_record":{"source":{"id":"1602.00133","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-01-30T16:11:53Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"1539bc4c93cf648ab1aa5896f19254ffd7ebf810e0c060965da1791a726cfd13","abstract_canon_sha256":"6e57ac6d7b5a72601fd08482303ca19ed54f2fc1c7327ba750783ccd7e04e0f9"},"schema_version":"1.0"},"canonical_sha256":"7ad2c324f0b3050e5a0fc521e236a07f5c238f962f649516a1aa103b3b73641b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:55:25.324483Z","signature_b64":"kgjWkpUHfCKUJZUcogVHbvSdLgmF6egkkLnUFE1hFmdSxxwIYwECZ/Rs0JGgIbfam1QvAImBoXW0xoCDZs7eCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7ad2c324f0b3050e5a0fc521e236a07f5c238f962f649516a1aa103b3b73641b","last_reissued_at":"2026-05-18T00:55:25.323919Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:55:25.323919Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.00133","source_version":5,"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:55:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v5hvqcmea0pdFYh5N7CQ/1wFUPzOGzCGz+4a/c066c3DJYI4o1CbWdfj05p4mVoh7JHBKssz9TcjOkCnBH6lDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T00:29:23.338662Z"},"content_sha256":"2241dafa2655a80f25574004445ab161f71fec03e64f0a57649d81513cf04b2e","schema_version":"1.0","event_id":"sha256:2241dafa2655a80f25574004445ab161f71fec03e64f0a57649d81513cf04b2e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:PLJMGJHQWMCQ4WQPYUQ6ENVAP5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"SCOPE: Scalable Composite Optimization for Learning on Spark","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Peng Gao, Ru Xiang, Shen-Yi Zhao, Wu-Jun Li, Ying-Hao Shi","submitted_at":"2016-01-30T16:11:53Z","abstract_excerpt":"Many machine learning models, such as logistic regression~(LR) and support vector machine~(SVM), can be formulated as composite optimization problems. Recently, many distributed stochastic optimization~(DSO) methods have been proposed to solve the large-scale composite optimization problems, which have shown better performance than traditional batch methods. However, most of these DSO methods are not scalable enough. In this paper, we propose a novel DSO method, called \\underline{s}calable \\underline{c}omposite \\underline{op}timization for l\\underline{e}arning~({SCOPE}), and implement it on th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.00133","kind":"arxiv","version":5},"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:55:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p5n6cPr8KVhBY76x5yynI5rWJhgxSqmioi8obe3WMCQeBHMzhFn4pyotGJ+bRdiPaH8+KNhOOJHq5LEoJHz4CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T00:29:23.339011Z"},"content_sha256":"bbd65a11ffa9ca137f3582460dee420d005d286592cfa9ae414f9d2972376aa0","schema_version":"1.0","event_id":"sha256:bbd65a11ffa9ca137f3582460dee420d005d286592cfa9ae414f9d2972376aa0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PLJMGJHQWMCQ4WQPYUQ6ENVAP5/bundle.json","state_url":"https://pith.science/pith/PLJMGJHQWMCQ4WQPYUQ6ENVAP5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PLJMGJHQWMCQ4WQPYUQ6ENVAP5/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-09T00:29:23Z","links":{"resolver":"https://pith.science/pith/PLJMGJHQWMCQ4WQPYUQ6ENVAP5","bundle":"https://pith.science/pith/PLJMGJHQWMCQ4WQPYUQ6ENVAP5/bundle.json","state":"https://pith.science/pith/PLJMGJHQWMCQ4WQPYUQ6ENVAP5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PLJMGJHQWMCQ4WQPYUQ6ENVAP5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:PLJMGJHQWMCQ4WQPYUQ6ENVAP5","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":"6e57ac6d7b5a72601fd08482303ca19ed54f2fc1c7327ba750783ccd7e04e0f9","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-01-30T16:11:53Z","title_canon_sha256":"1539bc4c93cf648ab1aa5896f19254ffd7ebf810e0c060965da1791a726cfd13"},"schema_version":"1.0","source":{"id":"1602.00133","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.00133","created_at":"2026-05-18T00:55:25Z"},{"alias_kind":"arxiv_version","alias_value":"1602.00133v5","created_at":"2026-05-18T00:55:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.00133","created_at":"2026-05-18T00:55:25Z"},{"alias_kind":"pith_short_12","alias_value":"PLJMGJHQWMCQ","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"PLJMGJHQWMCQ4WQP","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"PLJMGJHQ","created_at":"2026-05-18T12:30:39Z"}],"graph_snapshots":[{"event_id":"sha256:bbd65a11ffa9ca137f3582460dee420d005d286592cfa9ae414f9d2972376aa0","target":"graph","created_at":"2026-05-18T00:55:25Z","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":"Many machine learning models, such as logistic regression~(LR) and support vector machine~(SVM), can be formulated as composite optimization problems. Recently, many distributed stochastic optimization~(DSO) methods have been proposed to solve the large-scale composite optimization problems, which have shown better performance than traditional batch methods. However, most of these DSO methods are not scalable enough. In this paper, we propose a novel DSO method, called \\underline{s}calable \\underline{c}omposite \\underline{op}timization for l\\underline{e}arning~({SCOPE}), and implement it on th","authors_text":"Peng Gao, Ru Xiang, Shen-Yi Zhao, Wu-Jun Li, Ying-Hao Shi","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-01-30T16:11:53Z","title":"SCOPE: Scalable Composite Optimization for Learning on Spark"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.00133","kind":"arxiv","version":5},"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:2241dafa2655a80f25574004445ab161f71fec03e64f0a57649d81513cf04b2e","target":"record","created_at":"2026-05-18T00:55:25Z","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":"6e57ac6d7b5a72601fd08482303ca19ed54f2fc1c7327ba750783ccd7e04e0f9","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-01-30T16:11:53Z","title_canon_sha256":"1539bc4c93cf648ab1aa5896f19254ffd7ebf810e0c060965da1791a726cfd13"},"schema_version":"1.0","source":{"id":"1602.00133","kind":"arxiv","version":5}},"canonical_sha256":"7ad2c324f0b3050e5a0fc521e236a07f5c238f962f649516a1aa103b3b73641b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7ad2c324f0b3050e5a0fc521e236a07f5c238f962f649516a1aa103b3b73641b","first_computed_at":"2026-05-18T00:55:25.323919Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:55:25.323919Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kgjWkpUHfCKUJZUcogVHbvSdLgmF6egkkLnUFE1hFmdSxxwIYwECZ/Rs0JGgIbfam1QvAImBoXW0xoCDZs7eCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:55:25.324483Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.00133","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2241dafa2655a80f25574004445ab161f71fec03e64f0a57649d81513cf04b2e","sha256:bbd65a11ffa9ca137f3582460dee420d005d286592cfa9ae414f9d2972376aa0"],"state_sha256":"b32dc5b8838cca7ef80d79097b9e02037092172b17b9c7312d6700dbb3597430"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"78GIBqmBqWWYU1PeZJmut4rSejLvXThxz8vZr7ibUNaJR1cDMqqRf65NZFGs6+Vw+XFaZL0Czcqmg2Q8S6GjAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T00:29:23.340936Z","bundle_sha256":"303feac3f728a7161a26adbd7d700d645cb92e1cd8670bb24a77d31bdd602083"}}