{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:RRR6Z2XPEZFP7GNTYHQIBVNQXB","short_pith_number":"pith:RRR6Z2XP","schema_version":"1.0","canonical_sha256":"8c63eceaef264aff99b3c1e080d5b0b84a78260af95923a8eb55432e8be47f66","source":{"kind":"arxiv","id":"1606.01316","version":3},"attestation_state":"computed","paper":{"title":"Provable Burer-Monteiro factorization for a class of norm-constrained matrix problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.IT","cs.NA","math.IT","math.OC"],"primary_cat":"stat.ML","authors_text":"Anastasios Kyrillidis, Constantine Caramanis, Dohyung Park, Srinadh Bhojanapalli, Sujay Sanghavi","submitted_at":"2016-06-04T02:12:13Z","abstract_excerpt":"We study the projected gradient descent method on low-rank matrix problems with a strongly convex objective. We use the Burer-Monteiro factorization approach to implicitly enforce low-rankness; such factorization introduces non-convexity in the objective. We focus on constraint sets that include both positive semi-definite (PSD) constraints and specific matrix norm-constraints. Such criteria appear in quantum state tomography and phase retrieval applications.\n  We show that non-convex projected gradient descent favors local linear convergence in the factored space. We build our theory on a nov"},"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":"1606.01316","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-06-04T02:12:13Z","cross_cats_sorted":["cs.DS","cs.IT","cs.NA","math.IT","math.OC"],"title_canon_sha256":"7023059f02a421e4bec3784b2d366e1a9d57ae76e1bdd404ff5e9b74c18f614e","abstract_canon_sha256":"14436074d6859f13cb878b64cf264cb8c3014e143e594ce3aa777ac0da5ac426"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:03:32.491202Z","signature_b64":"62dXP9PGX9DhjLn6KqxfNAj3BDe8Sah6ufWemqH4GNK7J6UKkbScVa6Mc3LCipIbCyFuA/HHxpn1k+2XJbn2AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8c63eceaef264aff99b3c1e080d5b0b84a78260af95923a8eb55432e8be47f66","last_reissued_at":"2026-05-18T01:03:32.490589Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:03:32.490589Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Provable Burer-Monteiro factorization for a class of norm-constrained matrix problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.IT","cs.NA","math.IT","math.OC"],"primary_cat":"stat.ML","authors_text":"Anastasios Kyrillidis, Constantine Caramanis, Dohyung Park, Srinadh Bhojanapalli, Sujay Sanghavi","submitted_at":"2016-06-04T02:12:13Z","abstract_excerpt":"We study the projected gradient descent method on low-rank matrix problems with a strongly convex objective. We use the Burer-Monteiro factorization approach to implicitly enforce low-rankness; such factorization introduces non-convexity in the objective. We focus on constraint sets that include both positive semi-definite (PSD) constraints and specific matrix norm-constraints. Such criteria appear in quantum state tomography and phase retrieval applications.\n  We show that non-convex projected gradient descent favors local linear convergence in the factored space. We build our theory on a nov"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.01316","kind":"arxiv","version":3},"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":"1606.01316","created_at":"2026-05-18T01:03:32.490690+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.01316v3","created_at":"2026-05-18T01:03:32.490690+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.01316","created_at":"2026-05-18T01:03:32.490690+00:00"},{"alias_kind":"pith_short_12","alias_value":"RRR6Z2XPEZFP","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_16","alias_value":"RRR6Z2XPEZFP7GNT","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_8","alias_value":"RRR6Z2XP","created_at":"2026-05-18T12:30:41.710351+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/RRR6Z2XPEZFP7GNTYHQIBVNQXB","json":"https://pith.science/pith/RRR6Z2XPEZFP7GNTYHQIBVNQXB.json","graph_json":"https://pith.science/api/pith-number/RRR6Z2XPEZFP7GNTYHQIBVNQXB/graph.json","events_json":"https://pith.science/api/pith-number/RRR6Z2XPEZFP7GNTYHQIBVNQXB/events.json","paper":"https://pith.science/paper/RRR6Z2XP"},"agent_actions":{"view_html":"https://pith.science/pith/RRR6Z2XPEZFP7GNTYHQIBVNQXB","download_json":"https://pith.science/pith/RRR6Z2XPEZFP7GNTYHQIBVNQXB.json","view_paper":"https://pith.science/paper/RRR6Z2XP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.01316&json=true","fetch_graph":"https://pith.science/api/pith-number/RRR6Z2XPEZFP7GNTYHQIBVNQXB/graph.json","fetch_events":"https://pith.science/api/pith-number/RRR6Z2XPEZFP7GNTYHQIBVNQXB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RRR6Z2XPEZFP7GNTYHQIBVNQXB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RRR6Z2XPEZFP7GNTYHQIBVNQXB/action/storage_attestation","attest_author":"https://pith.science/pith/RRR6Z2XPEZFP7GNTYHQIBVNQXB/action/author_attestation","sign_citation":"https://pith.science/pith/RRR6Z2XPEZFP7GNTYHQIBVNQXB/action/citation_signature","submit_replication":"https://pith.science/pith/RRR6Z2XPEZFP7GNTYHQIBVNQXB/action/replication_record"}},"created_at":"2026-05-18T01:03:32.490690+00:00","updated_at":"2026-05-18T01:03:32.490690+00:00"}