{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:2Y2OLSQEAVN6QRKM6FP7KLWRWE","short_pith_number":"pith:2Y2OLSQE","schema_version":"1.0","canonical_sha256":"d634e5ca04055be8454cf15ff52ed1b1213a74d3fc4d94f86d1500914bde2fad","source":{"kind":"arxiv","id":"1010.2471","version":4},"attestation_state":"computed","paper":{"title":"Low-rank matrix recovery via iteratively reweighted least squares minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Holger Rauhut, Massimo Fornasier, Rachel Ward","submitted_at":"2010-10-12T18:47:46Z","abstract_excerpt":"We present and analyze an efficient implementation of an iteratively reweighted least squares algorithm for recovering a matrix from a small number of linear measurements. The algorithm is designed for the simultaneous promotion of both a minimal nuclear norm and an approximatively low-rank solution. Under the assumption that the linear measurements fulfill a suitable generalization of the Null Space Property known in the context of compressed sensing, the algorithm is guaranteed to recover iteratively any matrix with an error of the order of the best k-rank approximation. In certain relevant "},"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":"1010.2471","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2010-10-12T18:47:46Z","cross_cats_sorted":[],"title_canon_sha256":"9d02cdff711713fd041dc1081b7ba2badc9105a5c2c5f207b7532a32e6b9b5b2","abstract_canon_sha256":"471dc06a802cb40ecfe0bd75bf4de1e4e2bdc4925ff03a92baf4db5df4637833"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:18:04.504669Z","signature_b64":"nRop9s7CcUUdzFcmqCjoHcbmraVRv/oFOz8yP6q6tY/PmwwjBQOR1WA/BYiHVOwvkBc8rH+ssvcjXFFyjf/kDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d634e5ca04055be8454cf15ff52ed1b1213a74d3fc4d94f86d1500914bde2fad","last_reissued_at":"2026-05-18T04:18:04.503959Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:18:04.503959Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Low-rank matrix recovery via iteratively reweighted least squares minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Holger Rauhut, Massimo Fornasier, Rachel Ward","submitted_at":"2010-10-12T18:47:46Z","abstract_excerpt":"We present and analyze an efficient implementation of an iteratively reweighted least squares algorithm for recovering a matrix from a small number of linear measurements. The algorithm is designed for the simultaneous promotion of both a minimal nuclear norm and an approximatively low-rank solution. Under the assumption that the linear measurements fulfill a suitable generalization of the Null Space Property known in the context of compressed sensing, the algorithm is guaranteed to recover iteratively any matrix with an error of the order of the best k-rank approximation. In certain relevant "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.2471","kind":"arxiv","version":4},"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":"1010.2471","created_at":"2026-05-18T04:18:04.504059+00:00"},{"alias_kind":"arxiv_version","alias_value":"1010.2471v4","created_at":"2026-05-18T04:18:04.504059+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.2471","created_at":"2026-05-18T04:18:04.504059+00:00"},{"alias_kind":"pith_short_12","alias_value":"2Y2OLSQEAVN6","created_at":"2026-05-18T12:26:03.138858+00:00"},{"alias_kind":"pith_short_16","alias_value":"2Y2OLSQEAVN6QRKM","created_at":"2026-05-18T12:26:03.138858+00:00"},{"alias_kind":"pith_short_8","alias_value":"2Y2OLSQE","created_at":"2026-05-18T12:26:03.138858+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/2Y2OLSQEAVN6QRKM6FP7KLWRWE","json":"https://pith.science/pith/2Y2OLSQEAVN6QRKM6FP7KLWRWE.json","graph_json":"https://pith.science/api/pith-number/2Y2OLSQEAVN6QRKM6FP7KLWRWE/graph.json","events_json":"https://pith.science/api/pith-number/2Y2OLSQEAVN6QRKM6FP7KLWRWE/events.json","paper":"https://pith.science/paper/2Y2OLSQE"},"agent_actions":{"view_html":"https://pith.science/pith/2Y2OLSQEAVN6QRKM6FP7KLWRWE","download_json":"https://pith.science/pith/2Y2OLSQEAVN6QRKM6FP7KLWRWE.json","view_paper":"https://pith.science/paper/2Y2OLSQE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1010.2471&json=true","fetch_graph":"https://pith.science/api/pith-number/2Y2OLSQEAVN6QRKM6FP7KLWRWE/graph.json","fetch_events":"https://pith.science/api/pith-number/2Y2OLSQEAVN6QRKM6FP7KLWRWE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2Y2OLSQEAVN6QRKM6FP7KLWRWE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2Y2OLSQEAVN6QRKM6FP7KLWRWE/action/storage_attestation","attest_author":"https://pith.science/pith/2Y2OLSQEAVN6QRKM6FP7KLWRWE/action/author_attestation","sign_citation":"https://pith.science/pith/2Y2OLSQEAVN6QRKM6FP7KLWRWE/action/citation_signature","submit_replication":"https://pith.science/pith/2Y2OLSQEAVN6QRKM6FP7KLWRWE/action/replication_record"}},"created_at":"2026-05-18T04:18:04.504059+00:00","updated_at":"2026-05-18T04:18:04.504059+00:00"}