{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:5OS7HCU56P4XAXLJEHAFEHSWZK","short_pith_number":"pith:5OS7HCU5","canonical_record":{"source":{"id":"1511.01664","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-11-05T09:24:13Z","cross_cats_sorted":[],"title_canon_sha256":"9b52d094e7fbd6760a489150c82395f73dd48bea700ff8034d40e3a21c85f98a","abstract_canon_sha256":"4a7ad835f0b95f44e94d9eb9805d9a02520052f9cca62edb96cf37063e93539a"},"schema_version":"1.0"},"canonical_sha256":"eba5f38a9df3f9705d6921c0521e56caab6a8b84b3999b484de8d7c72159a9ab","source":{"kind":"arxiv","id":"1511.01664","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.01664","created_at":"2026-05-18T01:25:11Z"},{"alias_kind":"arxiv_version","alias_value":"1511.01664v2","created_at":"2026-05-18T01:25:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.01664","created_at":"2026-05-18T01:25:11Z"},{"alias_kind":"pith_short_12","alias_value":"5OS7HCU56P4X","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"5OS7HCU56P4XAXLJ","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"5OS7HCU5","created_at":"2026-05-18T12:29:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:5OS7HCU56P4XAXLJEHAFEHSWZK","target":"record","payload":{"canonical_record":{"source":{"id":"1511.01664","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-11-05T09:24:13Z","cross_cats_sorted":[],"title_canon_sha256":"9b52d094e7fbd6760a489150c82395f73dd48bea700ff8034d40e3a21c85f98a","abstract_canon_sha256":"4a7ad835f0b95f44e94d9eb9805d9a02520052f9cca62edb96cf37063e93539a"},"schema_version":"1.0"},"canonical_sha256":"eba5f38a9df3f9705d6921c0521e56caab6a8b84b3999b484de8d7c72159a9ab","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:25:11.150818Z","signature_b64":"Sj7YMSpcCGx7VPiRgKcgbvDq6HEP+Rxt0V5ul4YvY41tp6WPCbbxuxNvyEzhsDVLyA0Tws7fItMDaUnlzL54Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eba5f38a9df3f9705d6921c0521e56caab6a8b84b3999b484de8d7c72159a9ab","last_reissued_at":"2026-05-18T01:25:11.150254Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:25:11.150254Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1511.01664","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-18T01:25:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J75uOFIBpi9ge5KvJWcXKIJIjMwJKxTMhQh/nr/E8TqgrP1QUePLtL4oDpR4WPTKp4VH46VGRyG1FLTeXudmCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T15:19:48.071789Z"},"content_sha256":"f05ba4adf276c74d4a9e4cdf7c9c2c7b73b0190f69d17c1df22b70a6f16251aa","schema_version":"1.0","event_id":"sha256:f05ba4adf276c74d4a9e4cdf7c9c2c7b73b0190f69d17c1df22b70a6f16251aa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:5OS7HCU56P4XAXLJEHAFEHSWZK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Stochastic Proximal Gradient Descent for Nuclear Norm Regularization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Lijun Zhang, Rong Jin, Tianbao Yang, Zhi-Hua Zhou","submitted_at":"2015-11-05T09:24:13Z","abstract_excerpt":"In this paper, we utilize stochastic optimization to reduce the space complexity of convex composite optimization with a nuclear norm regularizer, where the variable is a matrix of size $m \\times n$. By constructing a low-rank estimate of the gradient, we propose an iterative algorithm based on stochastic proximal gradient descent (SPGD), and take the last iterate of SPGD as the final solution. The main advantage of the proposed algorithm is that its space complexity is $O(m+n)$, in contrast, most of previous algorithms have a $O(mn)$ space complexity. Theoretical analysis shows that it achiev"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.01664","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-18T01:25:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"35AaDXB/RlREH2qRqktYnqi0urdhFj7AeWokCEzHEcMI30l1MTTlcwwUwYfuPBK+C/PFUmTmu5JBzm1RfxVAAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T15:19:48.072133Z"},"content_sha256":"1587211ea329aad1dc1b80c14958f5ce4f3ed946e2dd80888c94ee8d33db210e","schema_version":"1.0","event_id":"sha256:1587211ea329aad1dc1b80c14958f5ce4f3ed946e2dd80888c94ee8d33db210e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5OS7HCU56P4XAXLJEHAFEHSWZK/bundle.json","state_url":"https://pith.science/pith/5OS7HCU56P4XAXLJEHAFEHSWZK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5OS7HCU56P4XAXLJEHAFEHSWZK/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-26T15:19:48Z","links":{"resolver":"https://pith.science/pith/5OS7HCU56P4XAXLJEHAFEHSWZK","bundle":"https://pith.science/pith/5OS7HCU56P4XAXLJEHAFEHSWZK/bundle.json","state":"https://pith.science/pith/5OS7HCU56P4XAXLJEHAFEHSWZK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5OS7HCU56P4XAXLJEHAFEHSWZK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:5OS7HCU56P4XAXLJEHAFEHSWZK","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":"4a7ad835f0b95f44e94d9eb9805d9a02520052f9cca62edb96cf37063e93539a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-11-05T09:24:13Z","title_canon_sha256":"9b52d094e7fbd6760a489150c82395f73dd48bea700ff8034d40e3a21c85f98a"},"schema_version":"1.0","source":{"id":"1511.01664","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.01664","created_at":"2026-05-18T01:25:11Z"},{"alias_kind":"arxiv_version","alias_value":"1511.01664v2","created_at":"2026-05-18T01:25:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.01664","created_at":"2026-05-18T01:25:11Z"},{"alias_kind":"pith_short_12","alias_value":"5OS7HCU56P4X","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"5OS7HCU56P4XAXLJ","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"5OS7HCU5","created_at":"2026-05-18T12:29:05Z"}],"graph_snapshots":[{"event_id":"sha256:1587211ea329aad1dc1b80c14958f5ce4f3ed946e2dd80888c94ee8d33db210e","target":"graph","created_at":"2026-05-18T01:25:11Z","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":"In this paper, we utilize stochastic optimization to reduce the space complexity of convex composite optimization with a nuclear norm regularizer, where the variable is a matrix of size $m \\times n$. By constructing a low-rank estimate of the gradient, we propose an iterative algorithm based on stochastic proximal gradient descent (SPGD), and take the last iterate of SPGD as the final solution. The main advantage of the proposed algorithm is that its space complexity is $O(m+n)$, in contrast, most of previous algorithms have a $O(mn)$ space complexity. Theoretical analysis shows that it achiev","authors_text":"Lijun Zhang, Rong Jin, Tianbao Yang, Zhi-Hua Zhou","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-11-05T09:24:13Z","title":"Stochastic Proximal Gradient Descent for Nuclear Norm Regularization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.01664","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:f05ba4adf276c74d4a9e4cdf7c9c2c7b73b0190f69d17c1df22b70a6f16251aa","target":"record","created_at":"2026-05-18T01:25:11Z","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":"4a7ad835f0b95f44e94d9eb9805d9a02520052f9cca62edb96cf37063e93539a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-11-05T09:24:13Z","title_canon_sha256":"9b52d094e7fbd6760a489150c82395f73dd48bea700ff8034d40e3a21c85f98a"},"schema_version":"1.0","source":{"id":"1511.01664","kind":"arxiv","version":2}},"canonical_sha256":"eba5f38a9df3f9705d6921c0521e56caab6a8b84b3999b484de8d7c72159a9ab","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"eba5f38a9df3f9705d6921c0521e56caab6a8b84b3999b484de8d7c72159a9ab","first_computed_at":"2026-05-18T01:25:11.150254Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:25:11.150254Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Sj7YMSpcCGx7VPiRgKcgbvDq6HEP+Rxt0V5ul4YvY41tp6WPCbbxuxNvyEzhsDVLyA0Tws7fItMDaUnlzL54Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:25:11.150818Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.01664","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f05ba4adf276c74d4a9e4cdf7c9c2c7b73b0190f69d17c1df22b70a6f16251aa","sha256:1587211ea329aad1dc1b80c14958f5ce4f3ed946e2dd80888c94ee8d33db210e"],"state_sha256":"64583c3e3d88d931a92f575429dacc1982a1bd2e207fbdd6f9e3df5d2ec84a36"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5ohqfhT80np2AwnEyVvqU/G3txc58JuPCIqRZB5Q9XN4RFhsn9hhbqTxe/7v3EojPnDfEn7lRUPctqxGBzPLCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T15:19:48.074335Z","bundle_sha256":"3fbe5bc3cb80f6c51353167b8617eb4478fd7f7a23c5fd2056e3572aad0905a6"}}