{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:HTZZDR2KVL6COIYEO62UICN2SH","short_pith_number":"pith:HTZZDR2K","schema_version":"1.0","canonical_sha256":"3cf391c74aaafc27230477b54409ba91f4e390621b3bac1e9c53b6727ca3b8c8","source":{"kind":"arxiv","id":"1210.0805","version":2},"attestation_state":"computed","paper":{"title":"Robust PCA and subspace tracking from incomplete observations using L0-surrogates","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Clemens Hage, Martin Kleinsteuber","submitted_at":"2012-10-02T15:26:15Z","abstract_excerpt":"Many applications in data analysis rely on the decomposition of a data matrix into a low-rank and a sparse component. Existing methods that tackle this task use the nuclear norm and L1-cost functions as convex relaxations of the rank constraint and the sparsity measure, respectively, or employ thresholding techniques. We propose a method that allows for reconstructing and tracking a subspace of upper-bounded dimension from incomplete and corrupted observations. It does not require any a priori information about the number of outliers. The core of our algorithm is an intrinsic Conjugate Gradien"},"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":"1210.0805","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-10-02T15:26:15Z","cross_cats_sorted":[],"title_canon_sha256":"718d2d2bfcbebb40cebec5e305633c53f9f1f7bd28b97189ecca817edbc42d6b","abstract_canon_sha256":"80ceb6172577220b731d9d26b1754a01c64540b47b405c50cedfdb1d00e7c3d6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:36:15.844219Z","signature_b64":"Sc8B3sh7cQoaqJ8LRxFPq6AUtxgqjSEoN1uUSQK5L6AWL4589VvCHvtr3Pk1nP/24HYFd7GxJ8BNrVvG0P0YAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3cf391c74aaafc27230477b54409ba91f4e390621b3bac1e9c53b6727ca3b8c8","last_reissued_at":"2026-05-18T03:36:15.843596Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:36:15.843596Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Robust PCA and subspace tracking from incomplete observations using L0-surrogates","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Clemens Hage, Martin Kleinsteuber","submitted_at":"2012-10-02T15:26:15Z","abstract_excerpt":"Many applications in data analysis rely on the decomposition of a data matrix into a low-rank and a sparse component. Existing methods that tackle this task use the nuclear norm and L1-cost functions as convex relaxations of the rank constraint and the sparsity measure, respectively, or employ thresholding techniques. We propose a method that allows for reconstructing and tracking a subspace of upper-bounded dimension from incomplete and corrupted observations. It does not require any a priori information about the number of outliers. The core of our algorithm is an intrinsic Conjugate Gradien"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.0805","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":"1210.0805","created_at":"2026-05-18T03:36:15.843689+00:00"},{"alias_kind":"arxiv_version","alias_value":"1210.0805v2","created_at":"2026-05-18T03:36:15.843689+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.0805","created_at":"2026-05-18T03:36:15.843689+00:00"},{"alias_kind":"pith_short_12","alias_value":"HTZZDR2KVL6C","created_at":"2026-05-18T12:27:09.501522+00:00"},{"alias_kind":"pith_short_16","alias_value":"HTZZDR2KVL6COIYE","created_at":"2026-05-18T12:27:09.501522+00:00"},{"alias_kind":"pith_short_8","alias_value":"HTZZDR2K","created_at":"2026-05-18T12:27:09.501522+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/HTZZDR2KVL6COIYEO62UICN2SH","json":"https://pith.science/pith/HTZZDR2KVL6COIYEO62UICN2SH.json","graph_json":"https://pith.science/api/pith-number/HTZZDR2KVL6COIYEO62UICN2SH/graph.json","events_json":"https://pith.science/api/pith-number/HTZZDR2KVL6COIYEO62UICN2SH/events.json","paper":"https://pith.science/paper/HTZZDR2K"},"agent_actions":{"view_html":"https://pith.science/pith/HTZZDR2KVL6COIYEO62UICN2SH","download_json":"https://pith.science/pith/HTZZDR2KVL6COIYEO62UICN2SH.json","view_paper":"https://pith.science/paper/HTZZDR2K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1210.0805&json=true","fetch_graph":"https://pith.science/api/pith-number/HTZZDR2KVL6COIYEO62UICN2SH/graph.json","fetch_events":"https://pith.science/api/pith-number/HTZZDR2KVL6COIYEO62UICN2SH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HTZZDR2KVL6COIYEO62UICN2SH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HTZZDR2KVL6COIYEO62UICN2SH/action/storage_attestation","attest_author":"https://pith.science/pith/HTZZDR2KVL6COIYEO62UICN2SH/action/author_attestation","sign_citation":"https://pith.science/pith/HTZZDR2KVL6COIYEO62UICN2SH/action/citation_signature","submit_replication":"https://pith.science/pith/HTZZDR2KVL6COIYEO62UICN2SH/action/replication_record"}},"created_at":"2026-05-18T03:36:15.843689+00:00","updated_at":"2026-05-18T03:36:15.843689+00:00"}