{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:QNPQVHREF6T34EK7GGNEMC26AX","short_pith_number":"pith:QNPQVHRE","schema_version":"1.0","canonical_sha256":"835f0a9e242fa7be115f319a460b5e05d8d0f8260d8192fd396e14ffa8046c96","source":{"kind":"arxiv","id":"1403.8067","version":2},"attestation_state":"computed","paper":{"title":"Robust Subspace Recovery via Bi-Sparsity Pursuit","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Hamid Krim, Xiao Bian","submitted_at":"2014-03-31T16:09:27Z","abstract_excerpt":"Successful applications of sparse models in computer vision and machine learning imply that in many real-world applications, high dimensional data is distributed in a union of low dimensional subspaces. Nevertheless, the underlying structure may be affected by sparse errors and/or outliers. In this paper, we propose a bi-sparse model as a framework to analyze this problem and provide a novel algorithm to recover the union of subspaces in presence of sparse corruptions. We further show the effectiveness of our method by experiments on both synthetic data and real-world vision data."},"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":"1403.8067","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-03-31T16:09:27Z","cross_cats_sorted":[],"title_canon_sha256":"982fec9259e36111f3647383e977e58ed44ff66ffe4107a6f1a0f787e5e8d739","abstract_canon_sha256":"ef2efeeb8d4e1452d093aa275c64c816da2b5c413c1efbb2ff5e0aa79b792c42"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:53:52.962690Z","signature_b64":"tcgPNe8WMoTcLqqIjsrhYaxQb1jj4rj/r6EsYLYujhjXnT/5HN3J0ktqIFHe2m4sdJf6szggGYt5+SkP40ekCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"835f0a9e242fa7be115f319a460b5e05d8d0f8260d8192fd396e14ffa8046c96","last_reissued_at":"2026-05-18T02:53:52.961821Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:53:52.961821Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Robust Subspace Recovery via Bi-Sparsity Pursuit","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Hamid Krim, Xiao Bian","submitted_at":"2014-03-31T16:09:27Z","abstract_excerpt":"Successful applications of sparse models in computer vision and machine learning imply that in many real-world applications, high dimensional data is distributed in a union of low dimensional subspaces. Nevertheless, the underlying structure may be affected by sparse errors and/or outliers. In this paper, we propose a bi-sparse model as a framework to analyze this problem and provide a novel algorithm to recover the union of subspaces in presence of sparse corruptions. We further show the effectiveness of our method by experiments on both synthetic data and real-world vision data."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.8067","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":"1403.8067","created_at":"2026-05-18T02:53:52.961986+00:00"},{"alias_kind":"arxiv_version","alias_value":"1403.8067v2","created_at":"2026-05-18T02:53:52.961986+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.8067","created_at":"2026-05-18T02:53:52.961986+00:00"},{"alias_kind":"pith_short_12","alias_value":"QNPQVHREF6T3","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_16","alias_value":"QNPQVHREF6T34EK7","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_8","alias_value":"QNPQVHRE","created_at":"2026-05-18T12:28:46.137349+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/QNPQVHREF6T34EK7GGNEMC26AX","json":"https://pith.science/pith/QNPQVHREF6T34EK7GGNEMC26AX.json","graph_json":"https://pith.science/api/pith-number/QNPQVHREF6T34EK7GGNEMC26AX/graph.json","events_json":"https://pith.science/api/pith-number/QNPQVHREF6T34EK7GGNEMC26AX/events.json","paper":"https://pith.science/paper/QNPQVHRE"},"agent_actions":{"view_html":"https://pith.science/pith/QNPQVHREF6T34EK7GGNEMC26AX","download_json":"https://pith.science/pith/QNPQVHREF6T34EK7GGNEMC26AX.json","view_paper":"https://pith.science/paper/QNPQVHRE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1403.8067&json=true","fetch_graph":"https://pith.science/api/pith-number/QNPQVHREF6T34EK7GGNEMC26AX/graph.json","fetch_events":"https://pith.science/api/pith-number/QNPQVHREF6T34EK7GGNEMC26AX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QNPQVHREF6T34EK7GGNEMC26AX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QNPQVHREF6T34EK7GGNEMC26AX/action/storage_attestation","attest_author":"https://pith.science/pith/QNPQVHREF6T34EK7GGNEMC26AX/action/author_attestation","sign_citation":"https://pith.science/pith/QNPQVHREF6T34EK7GGNEMC26AX/action/citation_signature","submit_replication":"https://pith.science/pith/QNPQVHREF6T34EK7GGNEMC26AX/action/replication_record"}},"created_at":"2026-05-18T02:53:52.961986+00:00","updated_at":"2026-05-18T02:53:52.961986+00:00"}