{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:CKMNSB2PTD4ZYKNGOXQVYRLDQW","short_pith_number":"pith:CKMNSB2P","schema_version":"1.0","canonical_sha256":"1298d9074f98f99c29a675e15c456385a1075e38ed36f99b626d53f761edb4c6","source":{"kind":"arxiv","id":"2502.00463","version":3},"attestation_state":"computed","paper":{"title":"Efficient Over-parameterized Matrix Sensing from Noisy Measurements via Alternating Preconditioned Gradient Descent","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Shaojie Tang, Yandong Tang, Yao Wang, Zhi Han, Zhiyu Liu","submitted_at":"2025-02-01T15:44:39Z","abstract_excerpt":"We consider the noisy matrix sensing problem in the over-parameterization setting, where the estimated rank $r$ is larger than the true rank $r_\\star$ of the target matrix $X_\\star$. Specifically, our main objective is to recover a matrix $ X_\\star \\in \\mathbb{R}^{n_1 \\times n_2} $ with rank $ r_\\star $ from noisy measurements using an over-parameterized factorization $ LR^\\top $, where $ L \\in \\mathbb{R}^{n_1 \\times r}, \\, R \\in \\mathbb{R}^{n_2 \\times r} $ and $ \\min\\{n_1, n_2\\} \\ge r > r_\\star $, with $ r_\\star $ being unknown. Recently, preconditioning methods have been proposed to accelera"},"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":"2502.00463","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-02-01T15:44:39Z","cross_cats_sorted":["math.OC","stat.ML"],"title_canon_sha256":"1aa7687d33a223f2027ceb37e9f35da2282637bd316b393e189feb36aec8cbae","abstract_canon_sha256":"13d4c9984b9f3e0b51752d5318182f608bed73dea4f3116d3a2ac477e72cc822"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:13:19.714136Z","signature_b64":"+XyZAL3xbq+xjlsl9TJSnyTCzBFMzuZwYLY2xoNOOaLeOKy6DMX8X3fCMALu0TYuswGYEY+U4NAwKAenXX11BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1298d9074f98f99c29a675e15c456385a1075e38ed36f99b626d53f761edb4c6","last_reissued_at":"2026-07-05T11:13:19.713700Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:13:19.713700Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Over-parameterized Matrix Sensing from Noisy Measurements via Alternating Preconditioned Gradient Descent","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Shaojie Tang, Yandong Tang, Yao Wang, Zhi Han, Zhiyu Liu","submitted_at":"2025-02-01T15:44:39Z","abstract_excerpt":"We consider the noisy matrix sensing problem in the over-parameterization setting, where the estimated rank $r$ is larger than the true rank $r_\\star$ of the target matrix $X_\\star$. Specifically, our main objective is to recover a matrix $ X_\\star \\in \\mathbb{R}^{n_1 \\times n_2} $ with rank $ r_\\star $ from noisy measurements using an over-parameterized factorization $ LR^\\top $, where $ L \\in \\mathbb{R}^{n_1 \\times r}, \\, R \\in \\mathbb{R}^{n_2 \\times r} $ and $ \\min\\{n_1, n_2\\} \\ge r > r_\\star $, with $ r_\\star $ being unknown. Recently, preconditioning methods have been proposed to accelera"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.00463","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2502.00463/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2502.00463","created_at":"2026-07-05T11:13:19.713754+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.00463v3","created_at":"2026-07-05T11:13:19.713754+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.00463","created_at":"2026-07-05T11:13:19.713754+00:00"},{"alias_kind":"pith_short_12","alias_value":"CKMNSB2PTD4Z","created_at":"2026-07-05T11:13:19.713754+00:00"},{"alias_kind":"pith_short_16","alias_value":"CKMNSB2PTD4ZYKNG","created_at":"2026-07-05T11:13:19.713754+00:00"},{"alias_kind":"pith_short_8","alias_value":"CKMNSB2P","created_at":"2026-07-05T11:13:19.713754+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2602.19926","citing_title":"Rethinking LoRA for Privacy-Preserving Federated Learning in Large Models","ref_index":16,"is_internal_anchor":false},{"citing_arxiv_id":"2604.21905","citing_title":"Low-Rank Adaptation Redux for Large Models","ref_index":118,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CKMNSB2PTD4ZYKNGOXQVYRLDQW","json":"https://pith.science/pith/CKMNSB2PTD4ZYKNGOXQVYRLDQW.json","graph_json":"https://pith.science/api/pith-number/CKMNSB2PTD4ZYKNGOXQVYRLDQW/graph.json","events_json":"https://pith.science/api/pith-number/CKMNSB2PTD4ZYKNGOXQVYRLDQW/events.json","paper":"https://pith.science/paper/CKMNSB2P"},"agent_actions":{"view_html":"https://pith.science/pith/CKMNSB2PTD4ZYKNGOXQVYRLDQW","download_json":"https://pith.science/pith/CKMNSB2PTD4ZYKNGOXQVYRLDQW.json","view_paper":"https://pith.science/paper/CKMNSB2P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.00463&json=true","fetch_graph":"https://pith.science/api/pith-number/CKMNSB2PTD4ZYKNGOXQVYRLDQW/graph.json","fetch_events":"https://pith.science/api/pith-number/CKMNSB2PTD4ZYKNGOXQVYRLDQW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CKMNSB2PTD4ZYKNGOXQVYRLDQW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CKMNSB2PTD4ZYKNGOXQVYRLDQW/action/storage_attestation","attest_author":"https://pith.science/pith/CKMNSB2PTD4ZYKNGOXQVYRLDQW/action/author_attestation","sign_citation":"https://pith.science/pith/CKMNSB2PTD4ZYKNGOXQVYRLDQW/action/citation_signature","submit_replication":"https://pith.science/pith/CKMNSB2PTD4ZYKNGOXQVYRLDQW/action/replication_record"}},"created_at":"2026-07-05T11:13:19.713754+00:00","updated_at":"2026-07-05T11:13:19.713754+00:00"}