{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:EANHHLAIJ34KFX5KW6JGEWXF7J","short_pith_number":"pith:EANHHLAI","schema_version":"1.0","canonical_sha256":"201a73ac084ef8a2dfaab792625ae5fa6ed6e5bbea208ccc0066609b5faabee7","source":{"kind":"arxiv","id":"1507.03566","version":2},"attestation_state":"computed","paper":{"title":"Low-rank Solutions of Linear Matrix Equations via Procrustes Flow","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Benjamin Recht, Mahdi Soltanolkotabi, Max Simchowitz, Ross Boczar, Stephen Tu","submitted_at":"2015-07-13T19:45:28Z","abstract_excerpt":"In this paper we study the problem of recovering a low-rank matrix from linear measurements. Our algorithm, which we call Procrustes Flow, starts from an initial estimate obtained by a thresholding scheme followed by gradient descent on a non-convex objective. We show that as long as the measurements obey a standard restricted isometry property, our algorithm converges to the unknown matrix at a geometric rate. In the case of Gaussian measurements, such convergence occurs for a $n_1 \\times n_2$ matrix of rank $r$ when the number of measurements exceeds a constant times $(n_1+n_2)r$."},"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":"1507.03566","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-07-13T19:45:28Z","cross_cats_sorted":[],"title_canon_sha256":"fe944141bc9730f67c44e49c4edf969735e3ca7483433782cfad1b30abef769f","abstract_canon_sha256":"d2ef73a90604acf97e7c4dcedba131e37342ff20910fcf8966acb810da01e41a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:21:15.866458Z","signature_b64":"81ssKT4E7nGUO/GNw6Bpn2am86JwU8semjSaTUnv9zdHQnJbOSd6li4dK4brpw37U+/dqD1tLVV9Tq8Ma5BzCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"201a73ac084ef8a2dfaab792625ae5fa6ed6e5bbea208ccc0066609b5faabee7","last_reissued_at":"2026-05-18T01:21:15.865693Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:21:15.865693Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Low-rank Solutions of Linear Matrix Equations via Procrustes Flow","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Benjamin Recht, Mahdi Soltanolkotabi, Max Simchowitz, Ross Boczar, Stephen Tu","submitted_at":"2015-07-13T19:45:28Z","abstract_excerpt":"In this paper we study the problem of recovering a low-rank matrix from linear measurements. Our algorithm, which we call Procrustes Flow, starts from an initial estimate obtained by a thresholding scheme followed by gradient descent on a non-convex objective. We show that as long as the measurements obey a standard restricted isometry property, our algorithm converges to the unknown matrix at a geometric rate. In the case of Gaussian measurements, such convergence occurs for a $n_1 \\times n_2$ matrix of rank $r$ when the number of measurements exceeds a constant times $(n_1+n_2)r$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.03566","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1507.03566","created_at":"2026-05-18T01:21:15.865840+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.03566v2","created_at":"2026-05-18T01:21:15.865840+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.03566","created_at":"2026-05-18T01:21:15.865840+00:00"},{"alias_kind":"pith_short_12","alias_value":"EANHHLAIJ34K","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_16","alias_value":"EANHHLAIJ34KFX5K","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_8","alias_value":"EANHHLAI","created_at":"2026-05-18T12:29:19.899920+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/EANHHLAIJ34KFX5KW6JGEWXF7J","json":"https://pith.science/pith/EANHHLAIJ34KFX5KW6JGEWXF7J.json","graph_json":"https://pith.science/api/pith-number/EANHHLAIJ34KFX5KW6JGEWXF7J/graph.json","events_json":"https://pith.science/api/pith-number/EANHHLAIJ34KFX5KW6JGEWXF7J/events.json","paper":"https://pith.science/paper/EANHHLAI"},"agent_actions":{"view_html":"https://pith.science/pith/EANHHLAIJ34KFX5KW6JGEWXF7J","download_json":"https://pith.science/pith/EANHHLAIJ34KFX5KW6JGEWXF7J.json","view_paper":"https://pith.science/paper/EANHHLAI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.03566&json=true","fetch_graph":"https://pith.science/api/pith-number/EANHHLAIJ34KFX5KW6JGEWXF7J/graph.json","fetch_events":"https://pith.science/api/pith-number/EANHHLAIJ34KFX5KW6JGEWXF7J/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EANHHLAIJ34KFX5KW6JGEWXF7J/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EANHHLAIJ34KFX5KW6JGEWXF7J/action/storage_attestation","attest_author":"https://pith.science/pith/EANHHLAIJ34KFX5KW6JGEWXF7J/action/author_attestation","sign_citation":"https://pith.science/pith/EANHHLAIJ34KFX5KW6JGEWXF7J/action/citation_signature","submit_replication":"https://pith.science/pith/EANHHLAIJ34KFX5KW6JGEWXF7J/action/replication_record"}},"created_at":"2026-05-18T01:21:15.865840+00:00","updated_at":"2026-05-18T01:21:15.865840+00:00"}