{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:ZSHXHSAKCUHHYQNSBT6JNZ4WUM","short_pith_number":"pith:ZSHXHSAK","canonical_record":{"source":{"id":"1701.02301","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-01-09T18:56:56Z","cross_cats_sorted":[],"title_canon_sha256":"1688d6fec2e6bf4b0dc32e8ec4e7237ffbd00c968500f1bc81cad275457b5bca","abstract_canon_sha256":"6d909dea7a8ddcbeca305562d6886c81904e4625fdfc2c2afc6a28167e5ce681"},"schema_version":"1.0"},"canonical_sha256":"cc8f73c80a150e7c41b20cfc96e796a3153f386d0f960865c8f5480d0f7b99e1","source":{"kind":"arxiv","id":"1701.02301","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.02301","created_at":"2026-05-18T00:52:30Z"},{"alias_kind":"arxiv_version","alias_value":"1701.02301v2","created_at":"2026-05-18T00:52:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.02301","created_at":"2026-05-18T00:52:30Z"},{"alias_kind":"pith_short_12","alias_value":"ZSHXHSAKCUHH","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZSHXHSAKCUHHYQNS","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZSHXHSAK","created_at":"2026-05-18T12:31:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:ZSHXHSAKCUHHYQNSBT6JNZ4WUM","target":"record","payload":{"canonical_record":{"source":{"id":"1701.02301","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-01-09T18:56:56Z","cross_cats_sorted":[],"title_canon_sha256":"1688d6fec2e6bf4b0dc32e8ec4e7237ffbd00c968500f1bc81cad275457b5bca","abstract_canon_sha256":"6d909dea7a8ddcbeca305562d6886c81904e4625fdfc2c2afc6a28167e5ce681"},"schema_version":"1.0"},"canonical_sha256":"cc8f73c80a150e7c41b20cfc96e796a3153f386d0f960865c8f5480d0f7b99e1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:30.641562Z","signature_b64":"cYprxqPKK1UkxsBQVLHH7dCHNmqg4CvHqYJ5L0oxtVh4QCSMl8hFVr4qoFlK2A1/BxbI6JuafHp0kYEgLjy+Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cc8f73c80a150e7c41b20cfc96e796a3153f386d0f960865c8f5480d0f7b99e1","last_reissued_at":"2026-05-18T00:52:30.641185Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:30.641185Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1701.02301","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:52:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yec2rDJKNmFTp8b1bnNH8F1R8hLM1jqgrbeIjUuEJPCcxkS7ZM2XS6daTHntUOSM2G2tXlkrsMtsh+64+tYsAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T07:03:55.807181Z"},"content_sha256":"e55ffd156a4fffeecb37b78606a06224b7957be52328fa0875f719f39106e6dd","schema_version":"1.0","event_id":"sha256:e55ffd156a4fffeecb37b78606a06224b7957be52328fa0875f719f39106e6dd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:ZSHXHSAKCUHHYQNSBT6JNZ4WUM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Universal Variance Reduction-Based Catalyst for Nonconvex Low-Rank Matrix Recovery","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Lingxiao Wang, Quanquan Gu, Xiao Zhang","submitted_at":"2017-01-09T18:56:56Z","abstract_excerpt":"We propose a generic framework based on a new stochastic variance-reduced gradient descent algorithm for accelerating nonconvex low-rank matrix recovery. Starting from an appropriate initial estimator, our proposed algorithm performs projected gradient descent based on a novel semi-stochastic gradient specifically designed for low-rank matrix recovery. Based upon the mild restricted strong convexity and smoothness conditions, we derive a projected notion of the restricted Lipschitz continuous gradient property, and prove that our algorithm enjoys linear convergence rate to the unknown low-rank"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.02301","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:52:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OWX0a1B1lq67Z5z8rNG1j8T2wMCM9adOjlus0O8OyFHEf4kXwArwjw/AucKzXtCu8j5Jr+cci+78344qibQ+AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T07:03:55.807542Z"},"content_sha256":"a549c28de5cf6b1ec35e32a9272edea2b7d595783245442fc0780834424e8f04","schema_version":"1.0","event_id":"sha256:a549c28de5cf6b1ec35e32a9272edea2b7d595783245442fc0780834424e8f04"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZSHXHSAKCUHHYQNSBT6JNZ4WUM/bundle.json","state_url":"https://pith.science/pith/ZSHXHSAKCUHHYQNSBT6JNZ4WUM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZSHXHSAKCUHHYQNSBT6JNZ4WUM/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-07-02T07:03:55Z","links":{"resolver":"https://pith.science/pith/ZSHXHSAKCUHHYQNSBT6JNZ4WUM","bundle":"https://pith.science/pith/ZSHXHSAKCUHHYQNSBT6JNZ4WUM/bundle.json","state":"https://pith.science/pith/ZSHXHSAKCUHHYQNSBT6JNZ4WUM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZSHXHSAKCUHHYQNSBT6JNZ4WUM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:ZSHXHSAKCUHHYQNSBT6JNZ4WUM","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":"6d909dea7a8ddcbeca305562d6886c81904e4625fdfc2c2afc6a28167e5ce681","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-01-09T18:56:56Z","title_canon_sha256":"1688d6fec2e6bf4b0dc32e8ec4e7237ffbd00c968500f1bc81cad275457b5bca"},"schema_version":"1.0","source":{"id":"1701.02301","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.02301","created_at":"2026-05-18T00:52:30Z"},{"alias_kind":"arxiv_version","alias_value":"1701.02301v2","created_at":"2026-05-18T00:52:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.02301","created_at":"2026-05-18T00:52:30Z"},{"alias_kind":"pith_short_12","alias_value":"ZSHXHSAKCUHH","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZSHXHSAKCUHHYQNS","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZSHXHSAK","created_at":"2026-05-18T12:31:59Z"}],"graph_snapshots":[{"event_id":"sha256:a549c28de5cf6b1ec35e32a9272edea2b7d595783245442fc0780834424e8f04","target":"graph","created_at":"2026-05-18T00:52:30Z","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 generic framework based on a new stochastic variance-reduced gradient descent algorithm for accelerating nonconvex low-rank matrix recovery. Starting from an appropriate initial estimator, our proposed algorithm performs projected gradient descent based on a novel semi-stochastic gradient specifically designed for low-rank matrix recovery. Based upon the mild restricted strong convexity and smoothness conditions, we derive a projected notion of the restricted Lipschitz continuous gradient property, and prove that our algorithm enjoys linear convergence rate to the unknown low-rank","authors_text":"Lingxiao Wang, Quanquan Gu, Xiao Zhang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-01-09T18:56:56Z","title":"A Universal Variance Reduction-Based Catalyst for Nonconvex Low-Rank Matrix Recovery"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.02301","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:e55ffd156a4fffeecb37b78606a06224b7957be52328fa0875f719f39106e6dd","target":"record","created_at":"2026-05-18T00:52:30Z","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":"6d909dea7a8ddcbeca305562d6886c81904e4625fdfc2c2afc6a28167e5ce681","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-01-09T18:56:56Z","title_canon_sha256":"1688d6fec2e6bf4b0dc32e8ec4e7237ffbd00c968500f1bc81cad275457b5bca"},"schema_version":"1.0","source":{"id":"1701.02301","kind":"arxiv","version":2}},"canonical_sha256":"cc8f73c80a150e7c41b20cfc96e796a3153f386d0f960865c8f5480d0f7b99e1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cc8f73c80a150e7c41b20cfc96e796a3153f386d0f960865c8f5480d0f7b99e1","first_computed_at":"2026-05-18T00:52:30.641185Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:52:30.641185Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cYprxqPKK1UkxsBQVLHH7dCHNmqg4CvHqYJ5L0oxtVh4QCSMl8hFVr4qoFlK2A1/BxbI6JuafHp0kYEgLjy+Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:52:30.641562Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.02301","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e55ffd156a4fffeecb37b78606a06224b7957be52328fa0875f719f39106e6dd","sha256:a549c28de5cf6b1ec35e32a9272edea2b7d595783245442fc0780834424e8f04"],"state_sha256":"b38243526e571e5b26ad88023d604f1b8d356fc631c400363c092f700dfb7285"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9Qj+L51EMtX9xjLkMiICqh5f+9hfVno4m6S3axEP+xxBn/Hdz+Y4W4jObKfRWZLYbucBAzpXlM+i+0MXk1yeDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-02T07:03:55.809615Z","bundle_sha256":"73c3d236b0b8e2e6c1c82d4a8dd691da7d7136a54e3227fd6e9232b24079195e"}}