{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:MT252CYLYB6NZQRNQAP4PC7CIN","short_pith_number":"pith:MT252CYL","schema_version":"1.0","canonical_sha256":"64f5dd0b0bc07cdcc22d801fc78be24361d6087d235cc024a9c4423ab0ce1554","source":{"kind":"arxiv","id":"1704.00367","version":2},"attestation_state":"computed","paper":{"title":"Provable Inductive Robust PCA via Iterative Hard Thresholding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","stat.ML"],"primary_cat":"cs.LG","authors_text":"Arun Rajkumar, Theja Tulabandhula, U.N. Niranjan","submitted_at":"2017-04-02T21:32:34Z","abstract_excerpt":"The robust PCA problem, wherein, given an input data matrix that is the superposition of a low-rank matrix and a sparse matrix, we aim to separate out the low-rank and sparse components, is a well-studied problem in machine learning. One natural question that arises is that, as in the inductive setting, if features are provided as input as well, can we hope to do better? Answering this in the affirmative, the main goal of this paper is to study the robust PCA problem while incorporating feature information. In contrast to previous works in which recovery guarantees are based on the convex rela"},"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":"1704.00367","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-04-02T21:32:34Z","cross_cats_sorted":["cs.IT","math.IT","stat.ML"],"title_canon_sha256":"7bb0cda6818aaed4fa6e3f417e274a7c26b24d7cdfda736903e9745ddedb76c8","abstract_canon_sha256":"bd204ee9e9f81fdc5fd931357e911268f0c10301b8a4a67550fcc2dd8574cec4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:53.797954Z","signature_b64":"OIubbbkLECxnYY+zCDTnRCDA+eChGvvtL3b9qqRQs7iZgiSBNSc8Fq3FUGk2ibvEQZeONEFITaek6A+ilL/zBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"64f5dd0b0bc07cdcc22d801fc78be24361d6087d235cc024a9c4423ab0ce1554","last_reissued_at":"2026-05-18T00:40:53.797367Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:53.797367Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Provable Inductive Robust PCA via Iterative Hard Thresholding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","stat.ML"],"primary_cat":"cs.LG","authors_text":"Arun Rajkumar, Theja Tulabandhula, U.N. Niranjan","submitted_at":"2017-04-02T21:32:34Z","abstract_excerpt":"The robust PCA problem, wherein, given an input data matrix that is the superposition of a low-rank matrix and a sparse matrix, we aim to separate out the low-rank and sparse components, is a well-studied problem in machine learning. One natural question that arises is that, as in the inductive setting, if features are provided as input as well, can we hope to do better? Answering this in the affirmative, the main goal of this paper is to study the robust PCA problem while incorporating feature information. In contrast to previous works in which recovery guarantees are based on the convex rela"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.00367","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":"1704.00367","created_at":"2026-05-18T00:40:53.797461+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.00367v2","created_at":"2026-05-18T00:40:53.797461+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.00367","created_at":"2026-05-18T00:40:53.797461+00:00"},{"alias_kind":"pith_short_12","alias_value":"MT252CYLYB6N","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_16","alias_value":"MT252CYLYB6NZQRN","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_8","alias_value":"MT252CYL","created_at":"2026-05-18T12:31:31.346846+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/MT252CYLYB6NZQRNQAP4PC7CIN","json":"https://pith.science/pith/MT252CYLYB6NZQRNQAP4PC7CIN.json","graph_json":"https://pith.science/api/pith-number/MT252CYLYB6NZQRNQAP4PC7CIN/graph.json","events_json":"https://pith.science/api/pith-number/MT252CYLYB6NZQRNQAP4PC7CIN/events.json","paper":"https://pith.science/paper/MT252CYL"},"agent_actions":{"view_html":"https://pith.science/pith/MT252CYLYB6NZQRNQAP4PC7CIN","download_json":"https://pith.science/pith/MT252CYLYB6NZQRNQAP4PC7CIN.json","view_paper":"https://pith.science/paper/MT252CYL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.00367&json=true","fetch_graph":"https://pith.science/api/pith-number/MT252CYLYB6NZQRNQAP4PC7CIN/graph.json","fetch_events":"https://pith.science/api/pith-number/MT252CYLYB6NZQRNQAP4PC7CIN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MT252CYLYB6NZQRNQAP4PC7CIN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MT252CYLYB6NZQRNQAP4PC7CIN/action/storage_attestation","attest_author":"https://pith.science/pith/MT252CYLYB6NZQRNQAP4PC7CIN/action/author_attestation","sign_citation":"https://pith.science/pith/MT252CYLYB6NZQRNQAP4PC7CIN/action/citation_signature","submit_replication":"https://pith.science/pith/MT252CYLYB6NZQRNQAP4PC7CIN/action/replication_record"}},"created_at":"2026-05-18T00:40:53.797461+00:00","updated_at":"2026-05-18T00:40:53.797461+00:00"}