{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:P25KA4X336PCBQ672DRCNBMLZJ","short_pith_number":"pith:P25KA4X3","canonical_record":{"source":{"id":"1704.00708","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-04-03T17:49:02Z","cross_cats_sorted":["math.OC","stat.ML"],"title_canon_sha256":"aacb20c1995f06bdaca476725172643bf18a93d2176224c3d7fe00ea52cb6000","abstract_canon_sha256":"f7781292140e962ec79cafc1e9e2618dd054e856966ffb18ba45bab767eaacee"},"schema_version":"1.0"},"canonical_sha256":"7ebaa072fbdf9e20c3dfd0e226858bca765a3ae0d9b84f0acb08da8407669e6c","source":{"kind":"arxiv","id":"1704.00708","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.00708","created_at":"2026-05-18T00:47:21Z"},{"alias_kind":"arxiv_version","alias_value":"1704.00708v1","created_at":"2026-05-18T00:47:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.00708","created_at":"2026-05-18T00:47:21Z"},{"alias_kind":"pith_short_12","alias_value":"P25KA4X336PC","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"P25KA4X336PCBQ67","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"P25KA4X3","created_at":"2026-05-18T12:31:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:P25KA4X336PCBQ672DRCNBMLZJ","target":"record","payload":{"canonical_record":{"source":{"id":"1704.00708","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-04-03T17:49:02Z","cross_cats_sorted":["math.OC","stat.ML"],"title_canon_sha256":"aacb20c1995f06bdaca476725172643bf18a93d2176224c3d7fe00ea52cb6000","abstract_canon_sha256":"f7781292140e962ec79cafc1e9e2618dd054e856966ffb18ba45bab767eaacee"},"schema_version":"1.0"},"canonical_sha256":"7ebaa072fbdf9e20c3dfd0e226858bca765a3ae0d9b84f0acb08da8407669e6c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:47:21.536625Z","signature_b64":"ZQcnhBuVSjvtJypLa6y+BRZb5fh1OecfKADSyJ9eOysZlFYuJZr1gBJHV3k0l4czioQe3qJola1ib+to900eCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7ebaa072fbdf9e20c3dfd0e226858bca765a3ae0d9b84f0acb08da8407669e6c","last_reissued_at":"2026-05-18T00:47:21.535953Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:47:21.535953Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1704.00708","source_version":1,"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:47:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rzL5nynEBXzXGVkcxNad291euph4/TxOfnEIZ6UQD7poG5MTKeND+gNSQZBpqBkj2avy2sNRUDwTGzw/GpOfAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T20:01:39.182355Z"},"content_sha256":"117e0034accbceeb0748e63efc940bda2bea99ab4c6be8147b34c97424c9b0a3","schema_version":"1.0","event_id":"sha256:117e0034accbceeb0748e63efc940bda2bea99ab4c6be8147b34c97424c9b0a3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:P25KA4X336PCBQ672DRCNBMLZJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"No Spurious Local Minima in Nonconvex Low Rank Problems: A Unified Geometric Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Chi Jin, Rong Ge, Yi Zheng","submitted_at":"2017-04-03T17:49:02Z","abstract_excerpt":"In this paper we develop a new framework that captures the common landscape underlying the common non-convex low-rank matrix problems including matrix sensing, matrix completion and robust PCA. In particular, we show for all above problems (including asymmetric cases): 1) all local minima are also globally optimal; 2) no high-order saddle points exists. These results explain why simple algorithms such as stochastic gradient descent have global converge, and efficiently optimize these non-convex objective functions in practice. Our framework connects and simplifies the existing analyses on opti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.00708","kind":"arxiv","version":1},"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:47:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a+CFLXGi7XscNd/EVQ35zozcxNWu63NA2f0Qha+qMhHp0kF5aUPaoFiZgFAwv3I4jK0Q7nnU4r7+MXTUYt50Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T20:01:39.183486Z"},"content_sha256":"025a96275b65c7e07132201b2cc07eb3554c4e222484f5c9e1690cfdb90add3d","schema_version":"1.0","event_id":"sha256:025a96275b65c7e07132201b2cc07eb3554c4e222484f5c9e1690cfdb90add3d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/P25KA4X336PCBQ672DRCNBMLZJ/bundle.json","state_url":"https://pith.science/pith/P25KA4X336PCBQ672DRCNBMLZJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/P25KA4X336PCBQ672DRCNBMLZJ/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-28T20:01:39Z","links":{"resolver":"https://pith.science/pith/P25KA4X336PCBQ672DRCNBMLZJ","bundle":"https://pith.science/pith/P25KA4X336PCBQ672DRCNBMLZJ/bundle.json","state":"https://pith.science/pith/P25KA4X336PCBQ672DRCNBMLZJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/P25KA4X336PCBQ672DRCNBMLZJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:P25KA4X336PCBQ672DRCNBMLZJ","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":"f7781292140e962ec79cafc1e9e2618dd054e856966ffb18ba45bab767eaacee","cross_cats_sorted":["math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-04-03T17:49:02Z","title_canon_sha256":"aacb20c1995f06bdaca476725172643bf18a93d2176224c3d7fe00ea52cb6000"},"schema_version":"1.0","source":{"id":"1704.00708","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.00708","created_at":"2026-05-18T00:47:21Z"},{"alias_kind":"arxiv_version","alias_value":"1704.00708v1","created_at":"2026-05-18T00:47:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.00708","created_at":"2026-05-18T00:47:21Z"},{"alias_kind":"pith_short_12","alias_value":"P25KA4X336PC","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"P25KA4X336PCBQ67","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"P25KA4X3","created_at":"2026-05-18T12:31:37Z"}],"graph_snapshots":[{"event_id":"sha256:025a96275b65c7e07132201b2cc07eb3554c4e222484f5c9e1690cfdb90add3d","target":"graph","created_at":"2026-05-18T00:47:21Z","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 develop a new framework that captures the common landscape underlying the common non-convex low-rank matrix problems including matrix sensing, matrix completion and robust PCA. In particular, we show for all above problems (including asymmetric cases): 1) all local minima are also globally optimal; 2) no high-order saddle points exists. These results explain why simple algorithms such as stochastic gradient descent have global converge, and efficiently optimize these non-convex objective functions in practice. Our framework connects and simplifies the existing analyses on opti","authors_text":"Chi Jin, Rong Ge, Yi Zheng","cross_cats":["math.OC","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-04-03T17:49:02Z","title":"No Spurious Local Minima in Nonconvex Low Rank Problems: A Unified Geometric Analysis"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.00708","kind":"arxiv","version":1},"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:117e0034accbceeb0748e63efc940bda2bea99ab4c6be8147b34c97424c9b0a3","target":"record","created_at":"2026-05-18T00:47:21Z","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":"f7781292140e962ec79cafc1e9e2618dd054e856966ffb18ba45bab767eaacee","cross_cats_sorted":["math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-04-03T17:49:02Z","title_canon_sha256":"aacb20c1995f06bdaca476725172643bf18a93d2176224c3d7fe00ea52cb6000"},"schema_version":"1.0","source":{"id":"1704.00708","kind":"arxiv","version":1}},"canonical_sha256":"7ebaa072fbdf9e20c3dfd0e226858bca765a3ae0d9b84f0acb08da8407669e6c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7ebaa072fbdf9e20c3dfd0e226858bca765a3ae0d9b84f0acb08da8407669e6c","first_computed_at":"2026-05-18T00:47:21.535953Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:47:21.535953Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZQcnhBuVSjvtJypLa6y+BRZb5fh1OecfKADSyJ9eOysZlFYuJZr1gBJHV3k0l4czioQe3qJola1ib+to900eCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:47:21.536625Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.00708","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:117e0034accbceeb0748e63efc940bda2bea99ab4c6be8147b34c97424c9b0a3","sha256:025a96275b65c7e07132201b2cc07eb3554c4e222484f5c9e1690cfdb90add3d"],"state_sha256":"f692a6ae49ecc0a68e1077d1765bfab5f16a79333a76a8382a6d08024b3c02fb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"odyG93/RjgsMqkAtC/UxLeKFqRQBjustN06gWRj4CFiIGw1MJguD5ms3U9edqd3fXi5WG2wj4Uqzo4G4Q0KmBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T20:01:39.186117Z","bundle_sha256":"b4693c800888e182faaeb7d0c088762084bf36c21c9a5ce631da71e8306dcfb6"}}