{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:35K65HFN6DTGZIVSM52I2ZM2JT","short_pith_number":"pith:35K65HFN","schema_version":"1.0","canonical_sha256":"df55ee9cadf0e66ca2b267748d659a4cdac7b7a4281938594c1e7784862d253a","source":{"kind":"arxiv","id":"1606.03168","version":3},"attestation_state":"computed","paper":{"title":"Finding Low-Rank Solutions via Non-Convex Matrix Factorization, Efficiently and Provably","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.IT","cs.LG","cs.NA","math.IT"],"primary_cat":"math.OC","authors_text":"Anastasios Kyrillidis, Constantine Caramanis, Dohyung Park, Sujay Sanghavi","submitted_at":"2016-06-10T03:18:01Z","abstract_excerpt":"A rank-$r$ matrix $X \\in \\mathbb{R}^{m \\times n}$ can be written as a product $U V^\\top$, where $U \\in \\mathbb{R}^{m \\times r}$ and $V \\in \\mathbb{R}^{n \\times r}$. One could exploit this observation in optimization: e.g., consider the minimization of a convex function $f(X)$ over rank-$r$ matrices, where the set of rank-$r$ matrices is modeled via the factorization $UV^\\top$. Though such parameterization reduces the number of variables, and is more computationally efficient (of particular interest is the case $r \\ll \\min\\{m, n\\}$), it comes at a cost: $f(UV^\\top)$ becomes a non-convex functio"},"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.03168","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-06-10T03:18:01Z","cross_cats_sorted":["cs.DS","cs.IT","cs.LG","cs.NA","math.IT"],"title_canon_sha256":"75811c46e80e803cebf1cff2cda65481a78aef3d2cbda72a827c7f41ef2cecdc","abstract_canon_sha256":"95c7b9537fcf96d66abc56734891c31816d9ece6a298e2e9733a7fb4df6a5674"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:00:52.889495Z","signature_b64":"F5xeSXpfkkBHAY6YeJ9bR1BMcBgTWTm5PxEropFHK1ipmEW2iVK7HUyFDwIxQ9Kcsx0sR/DDbIFlKMlHg7DVDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"df55ee9cadf0e66ca2b267748d659a4cdac7b7a4281938594c1e7784862d253a","last_reissued_at":"2026-05-18T01:00:52.888790Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:00:52.888790Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Finding Low-Rank Solutions via Non-Convex Matrix Factorization, Efficiently and Provably","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.IT","cs.LG","cs.NA","math.IT"],"primary_cat":"math.OC","authors_text":"Anastasios Kyrillidis, Constantine Caramanis, Dohyung Park, Sujay Sanghavi","submitted_at":"2016-06-10T03:18:01Z","abstract_excerpt":"A rank-$r$ matrix $X \\in \\mathbb{R}^{m \\times n}$ can be written as a product $U V^\\top$, where $U \\in \\mathbb{R}^{m \\times r}$ and $V \\in \\mathbb{R}^{n \\times r}$. One could exploit this observation in optimization: e.g., consider the minimization of a convex function $f(X)$ over rank-$r$ matrices, where the set of rank-$r$ matrices is modeled via the factorization $UV^\\top$. Though such parameterization reduces the number of variables, and is more computationally efficient (of particular interest is the case $r \\ll \\min\\{m, n\\}$), it comes at a cost: $f(UV^\\top)$ becomes a non-convex functio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.03168","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.03168","created_at":"2026-05-18T01:00:52.888902+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.03168v3","created_at":"2026-05-18T01:00:52.888902+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.03168","created_at":"2026-05-18T01:00:52.888902+00:00"},{"alias_kind":"pith_short_12","alias_value":"35K65HFN6DTG","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_16","alias_value":"35K65HFN6DTGZIVS","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_8","alias_value":"35K65HFN","created_at":"2026-05-18T12:29:55.572404+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/35K65HFN6DTGZIVSM52I2ZM2JT","json":"https://pith.science/pith/35K65HFN6DTGZIVSM52I2ZM2JT.json","graph_json":"https://pith.science/api/pith-number/35K65HFN6DTGZIVSM52I2ZM2JT/graph.json","events_json":"https://pith.science/api/pith-number/35K65HFN6DTGZIVSM52I2ZM2JT/events.json","paper":"https://pith.science/paper/35K65HFN"},"agent_actions":{"view_html":"https://pith.science/pith/35K65HFN6DTGZIVSM52I2ZM2JT","download_json":"https://pith.science/pith/35K65HFN6DTGZIVSM52I2ZM2JT.json","view_paper":"https://pith.science/paper/35K65HFN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.03168&json=true","fetch_graph":"https://pith.science/api/pith-number/35K65HFN6DTGZIVSM52I2ZM2JT/graph.json","fetch_events":"https://pith.science/api/pith-number/35K65HFN6DTGZIVSM52I2ZM2JT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/35K65HFN6DTGZIVSM52I2ZM2JT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/35K65HFN6DTGZIVSM52I2ZM2JT/action/storage_attestation","attest_author":"https://pith.science/pith/35K65HFN6DTGZIVSM52I2ZM2JT/action/author_attestation","sign_citation":"https://pith.science/pith/35K65HFN6DTGZIVSM52I2ZM2JT/action/citation_signature","submit_replication":"https://pith.science/pith/35K65HFN6DTGZIVSM52I2ZM2JT/action/replication_record"}},"created_at":"2026-05-18T01:00:52.888902+00:00","updated_at":"2026-05-18T01:00:52.888902+00:00"}