{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:PLJMGJHQWMCQ4WQPYUQ6ENVAP5","short_pith_number":"pith:PLJMGJHQ","schema_version":"1.0","canonical_sha256":"7ad2c324f0b3050e5a0fc521e236a07f5c238f962f649516a1aa103b3b73641b","source":{"kind":"arxiv","id":"1602.00133","version":5},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1602.00133","created_at":"2026-05-18T00:55:25.324014+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.00133v5","created_at":"2026-05-18T00:55:25.324014+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.00133","created_at":"2026-05-18T00:55:25.324014+00:00"},{"alias_kind":"pith_short_12","alias_value":"PLJMGJHQWMCQ","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_16","alias_value":"PLJMGJHQWMCQ4WQP","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_8","alias_value":"PLJMGJHQ","created_at":"2026-05-18T12:30:39.010887+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PLJMGJHQWMCQ4WQPYUQ6ENVAP5","json":"https://pith.science/pith/PLJMGJHQWMCQ4WQPYUQ6ENVAP5.json","graph_json":"https://pith.science/api/pith-number/PLJMGJHQWMCQ4WQPYUQ6ENVAP5/graph.json","events_json":"https://pith.science/api/pith-number/PLJMGJHQWMCQ4WQPYUQ6ENVAP5/events.json","paper":"https://pith.science/paper/PLJMGJHQ"},"agent_actions":{"view_html":"https://pith.science/pith/PLJMGJHQWMCQ4WQPYUQ6ENVAP5","download_json":"https://pith.science/pith/PLJMGJHQWMCQ4WQPYUQ6ENVAP5.json","view_paper":"https://pith.science/paper/PLJMGJHQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.00133&json=true","fetch_graph":"https://pith.science/api/pith-number/PLJMGJHQWMCQ4WQPYUQ6ENVAP5/graph.json","fetch_events":"https://pith.science/api/pith-number/PLJMGJHQWMCQ4WQPYUQ6ENVAP5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PLJMGJHQWMCQ4WQPYUQ6ENVAP5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PLJMGJHQWMCQ4WQPYUQ6ENVAP5/action/storage_attestation","attest_author":"https://pith.science/pith/PLJMGJHQWMCQ4WQPYUQ6ENVAP5/action/author_attestation","sign_citation":"https://pith.science/pith/PLJMGJHQWMCQ4WQPYUQ6ENVAP5/action/citation_signature","submit_replication":"https://pith.science/pith/PLJMGJHQWMCQ4WQPYUQ6ENVAP5/action/replication_record"}},"created_at":"2026-05-18T00:55:25.324014+00:00","updated_at":"2026-05-18T00:55:25.324014+00:00"}