{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:2KGQRU7KRRXDJCF5LBBAIWLUFL","short_pith_number":"pith:2KGQRU7K","schema_version":"1.0","canonical_sha256":"d28d08d3ea8c6e3488bd58420459742ac2c4bca16e6f044d603dcc635f0e1983","source":{"kind":"arxiv","id":"1503.03004","version":3},"attestation_state":"computed","paper":{"title":"Fast and Robust Fixed-Rank Matrix Recovery","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"cs.CV","authors_text":"German Ros, Julio Guerrero","submitted_at":"2015-03-10T17:35:46Z","abstract_excerpt":"We address the problem of efficient sparse fixed-rank (S-FR) matrix decomposition, i.e., splitting a corrupted matrix $M$ into an uncorrupted matrix $L$ of rank $r$ and a sparse matrix of outliers $S$. Fixed-rank constraints are usually imposed by the physical restrictions of the system under study. Here we propose a method to perform accurate and very efficient S-FR decomposition that is more suitable for large-scale problems than existing approaches. Our method is a grateful combination of geometrical and algebraical techniques, which avoids the bottleneck caused by the Truncated SVD (TSVD)."},"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":"1503.03004","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-03-10T17:35:46Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"56ed78f8c5ea022c92972c1e7ed16cc42fb630f91f074c099e541d8201f0ae5f","abstract_canon_sha256":"250a248c06744a23706991bbdebdaa4b687302fdf518974d10e73205dc81dab4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:20:28.222772Z","signature_b64":"lrH5whHf04uq53rbtpZicaQ/ZfYZM4CVYc/4yyNX7rHkHaCkC2mWA6AcOxvRj6wH7FB79Fg2p2pwq64F5VSBBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d28d08d3ea8c6e3488bd58420459742ac2c4bca16e6f044d603dcc635f0e1983","last_reissued_at":"2026-05-18T02:20:28.222202Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:20:28.222202Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast and Robust Fixed-Rank Matrix Recovery","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"cs.CV","authors_text":"German Ros, Julio Guerrero","submitted_at":"2015-03-10T17:35:46Z","abstract_excerpt":"We address the problem of efficient sparse fixed-rank (S-FR) matrix decomposition, i.e., splitting a corrupted matrix $M$ into an uncorrupted matrix $L$ of rank $r$ and a sparse matrix of outliers $S$. Fixed-rank constraints are usually imposed by the physical restrictions of the system under study. Here we propose a method to perform accurate and very efficient S-FR decomposition that is more suitable for large-scale problems than existing approaches. Our method is a grateful combination of geometrical and algebraical techniques, which avoids the bottleneck caused by the Truncated SVD (TSVD)."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.03004","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":"1503.03004","created_at":"2026-05-18T02:20:28.222293+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.03004v3","created_at":"2026-05-18T02:20:28.222293+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.03004","created_at":"2026-05-18T02:20:28.222293+00:00"},{"alias_kind":"pith_short_12","alias_value":"2KGQRU7KRRXD","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_16","alias_value":"2KGQRU7KRRXDJCF5","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_8","alias_value":"2KGQRU7K","created_at":"2026-05-18T12:28:59.999130+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/2KGQRU7KRRXDJCF5LBBAIWLUFL","json":"https://pith.science/pith/2KGQRU7KRRXDJCF5LBBAIWLUFL.json","graph_json":"https://pith.science/api/pith-number/2KGQRU7KRRXDJCF5LBBAIWLUFL/graph.json","events_json":"https://pith.science/api/pith-number/2KGQRU7KRRXDJCF5LBBAIWLUFL/events.json","paper":"https://pith.science/paper/2KGQRU7K"},"agent_actions":{"view_html":"https://pith.science/pith/2KGQRU7KRRXDJCF5LBBAIWLUFL","download_json":"https://pith.science/pith/2KGQRU7KRRXDJCF5LBBAIWLUFL.json","view_paper":"https://pith.science/paper/2KGQRU7K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.03004&json=true","fetch_graph":"https://pith.science/api/pith-number/2KGQRU7KRRXDJCF5LBBAIWLUFL/graph.json","fetch_events":"https://pith.science/api/pith-number/2KGQRU7KRRXDJCF5LBBAIWLUFL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2KGQRU7KRRXDJCF5LBBAIWLUFL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2KGQRU7KRRXDJCF5LBBAIWLUFL/action/storage_attestation","attest_author":"https://pith.science/pith/2KGQRU7KRRXDJCF5LBBAIWLUFL/action/author_attestation","sign_citation":"https://pith.science/pith/2KGQRU7KRRXDJCF5LBBAIWLUFL/action/citation_signature","submit_replication":"https://pith.science/pith/2KGQRU7KRRXDJCF5LBBAIWLUFL/action/replication_record"}},"created_at":"2026-05-18T02:20:28.222293+00:00","updated_at":"2026-05-18T02:20:28.222293+00:00"}