{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:QD7AD34NYCTYRN5Q3OMCUQ3SOT","short_pith_number":"pith:QD7AD34N","schema_version":"1.0","canonical_sha256":"80fe01ef8dc0a788b7b0db982a437274e681a5ae227c6dbe7c217737ba453e7d","source":{"kind":"arxiv","id":"1811.03945","version":1},"attestation_state":"computed","paper":{"title":"Matrix Recovery with Implicitly Low-Rank Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Guangcan Liu, Jianlong Wu, Jun Wang, Xingyu Xie","submitted_at":"2018-11-09T15:04:24Z","abstract_excerpt":"In this paper, we study the problem of matrix recovery, which aims to restore a target matrix of authentic samples from grossly corrupted observations. Most of the existing methods, such as the well-known Robust Principal Component Analysis (RPCA), assume that the target matrix we wish to recover is low-rank. However, the underlying data structure is often non-linear in practice, therefore the low-rankness assumption could be violated. To tackle this issue, we propose a novel method for matrix recovery in this paper, which could well handle the case where the target matrix is low-rank in an im"},"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":"1811.03945","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-11-09T15:04:24Z","cross_cats_sorted":[],"title_canon_sha256":"6166906555734e5a2f79f5622812caf112850e0161be42c0215abf3695915ddb","abstract_canon_sha256":"c98d1ca0539f64ad47f0dee1e54945ec65e2af7c6f5f33c265361e7ad67b5817"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:11.480003Z","signature_b64":"ByHKyFNxaV9OOFE+isEImEUMpV3drWYjsym8Cmn8GQJQtszS808TcBOxZ6xjUpxjPY/s47gWlEw0lAmLy+0zDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"80fe01ef8dc0a788b7b0db982a437274e681a5ae227c6dbe7c217737ba453e7d","last_reissued_at":"2026-05-18T00:01:11.479352Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:11.479352Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Matrix Recovery with Implicitly Low-Rank Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Guangcan Liu, Jianlong Wu, Jun Wang, Xingyu Xie","submitted_at":"2018-11-09T15:04:24Z","abstract_excerpt":"In this paper, we study the problem of matrix recovery, which aims to restore a target matrix of authentic samples from grossly corrupted observations. Most of the existing methods, such as the well-known Robust Principal Component Analysis (RPCA), assume that the target matrix we wish to recover is low-rank. However, the underlying data structure is often non-linear in practice, therefore the low-rankness assumption could be violated. To tackle this issue, we propose a novel method for matrix recovery in this paper, which could well handle the case where the target matrix is low-rank in an im"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.03945","kind":"arxiv","version":1},"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":"1811.03945","created_at":"2026-05-18T00:01:11.479459+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.03945v1","created_at":"2026-05-18T00:01:11.479459+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.03945","created_at":"2026-05-18T00:01:11.479459+00:00"},{"alias_kind":"pith_short_12","alias_value":"QD7AD34NYCTY","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_16","alias_value":"QD7AD34NYCTYRN5Q","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_8","alias_value":"QD7AD34N","created_at":"2026-05-18T12:32:46.962924+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/QD7AD34NYCTYRN5Q3OMCUQ3SOT","json":"https://pith.science/pith/QD7AD34NYCTYRN5Q3OMCUQ3SOT.json","graph_json":"https://pith.science/api/pith-number/QD7AD34NYCTYRN5Q3OMCUQ3SOT/graph.json","events_json":"https://pith.science/api/pith-number/QD7AD34NYCTYRN5Q3OMCUQ3SOT/events.json","paper":"https://pith.science/paper/QD7AD34N"},"agent_actions":{"view_html":"https://pith.science/pith/QD7AD34NYCTYRN5Q3OMCUQ3SOT","download_json":"https://pith.science/pith/QD7AD34NYCTYRN5Q3OMCUQ3SOT.json","view_paper":"https://pith.science/paper/QD7AD34N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.03945&json=true","fetch_graph":"https://pith.science/api/pith-number/QD7AD34NYCTYRN5Q3OMCUQ3SOT/graph.json","fetch_events":"https://pith.science/api/pith-number/QD7AD34NYCTYRN5Q3OMCUQ3SOT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QD7AD34NYCTYRN5Q3OMCUQ3SOT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QD7AD34NYCTYRN5Q3OMCUQ3SOT/action/storage_attestation","attest_author":"https://pith.science/pith/QD7AD34NYCTYRN5Q3OMCUQ3SOT/action/author_attestation","sign_citation":"https://pith.science/pith/QD7AD34NYCTYRN5Q3OMCUQ3SOT/action/citation_signature","submit_replication":"https://pith.science/pith/QD7AD34NYCTYRN5Q3OMCUQ3SOT/action/replication_record"}},"created_at":"2026-05-18T00:01:11.479459+00:00","updated_at":"2026-05-18T00:01:11.479459+00:00"}