{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:LB2XP5PNGTCBW4JGQNC735OCCA","short_pith_number":"pith:LB2XP5PN","schema_version":"1.0","canonical_sha256":"587577f5ed34c41b71268345fdf5c210384d45755f6828cd8cd83f63e136721b","source":{"kind":"arxiv","id":"1511.01245","version":3},"attestation_state":"computed","paper":{"title":"Decomposition into Low-rank plus Additive Matrices for Background/Foreground Separation: A Review for a Comparative Evaluation with a Large-Scale Dataset","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Andrews Sobral, El-Hadi Zahzah, Sajid Javed, Soon Ki Jung, Thierry Bouwmans","submitted_at":"2015-11-04T08:51:59Z","abstract_excerpt":"Recent research on problem formulations based on decomposition into low-rank plus sparse matrices shows a suitable framework to separate moving objects from the background. The most representative problem formulation is the Robust Principal Component Analysis (RPCA) solved via Principal Component Pursuit (PCP) which decomposes a data matrix in a low-rank matrix and a sparse matrix. However, similar robust implicit or explicit decompositions can be made in the following problem formulations: Robust Non-negative Matrix Factorization (RNMF), Robust Matrix Completion (RMC), Robust Subspace Recover"},"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":"1511.01245","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-11-04T08:51:59Z","cross_cats_sorted":[],"title_canon_sha256":"f038b330bb0852903ac3567fd0750463986fa7ccc1f9b695e539f938792dc084","abstract_canon_sha256":"22682a7c416b0770b236beb48190bdb4d1a9597a81271191f641b027f6b96656"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:56:31.518469Z","signature_b64":"84s+qeThp+CoP5u6X8wqBIGWPglcYtm4lBg7FJwO/z9b3do6MtrTB+wqfMOBMq6jlN/TdKmeSoW38ul0YMWACA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"587577f5ed34c41b71268345fdf5c210384d45755f6828cd8cd83f63e136721b","last_reissued_at":"2026-05-18T00:56:31.517836Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:56:31.517836Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Decomposition into Low-rank plus Additive Matrices for Background/Foreground Separation: A Review for a Comparative Evaluation with a Large-Scale Dataset","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Andrews Sobral, El-Hadi Zahzah, Sajid Javed, Soon Ki Jung, Thierry Bouwmans","submitted_at":"2015-11-04T08:51:59Z","abstract_excerpt":"Recent research on problem formulations based on decomposition into low-rank plus sparse matrices shows a suitable framework to separate moving objects from the background. The most representative problem formulation is the Robust Principal Component Analysis (RPCA) solved via Principal Component Pursuit (PCP) which decomposes a data matrix in a low-rank matrix and a sparse matrix. However, similar robust implicit or explicit decompositions can be made in the following problem formulations: Robust Non-negative Matrix Factorization (RNMF), Robust Matrix Completion (RMC), Robust Subspace Recover"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.01245","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":"1511.01245","created_at":"2026-05-18T00:56:31.517930+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.01245v3","created_at":"2026-05-18T00:56:31.517930+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.01245","created_at":"2026-05-18T00:56:31.517930+00:00"},{"alias_kind":"pith_short_12","alias_value":"LB2XP5PNGTCB","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_16","alias_value":"LB2XP5PNGTCBW4JG","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_8","alias_value":"LB2XP5PN","created_at":"2026-05-18T12:29:29.992203+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/LB2XP5PNGTCBW4JGQNC735OCCA","json":"https://pith.science/pith/LB2XP5PNGTCBW4JGQNC735OCCA.json","graph_json":"https://pith.science/api/pith-number/LB2XP5PNGTCBW4JGQNC735OCCA/graph.json","events_json":"https://pith.science/api/pith-number/LB2XP5PNGTCBW4JGQNC735OCCA/events.json","paper":"https://pith.science/paper/LB2XP5PN"},"agent_actions":{"view_html":"https://pith.science/pith/LB2XP5PNGTCBW4JGQNC735OCCA","download_json":"https://pith.science/pith/LB2XP5PNGTCBW4JGQNC735OCCA.json","view_paper":"https://pith.science/paper/LB2XP5PN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.01245&json=true","fetch_graph":"https://pith.science/api/pith-number/LB2XP5PNGTCBW4JGQNC735OCCA/graph.json","fetch_events":"https://pith.science/api/pith-number/LB2XP5PNGTCBW4JGQNC735OCCA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LB2XP5PNGTCBW4JGQNC735OCCA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LB2XP5PNGTCBW4JGQNC735OCCA/action/storage_attestation","attest_author":"https://pith.science/pith/LB2XP5PNGTCBW4JGQNC735OCCA/action/author_attestation","sign_citation":"https://pith.science/pith/LB2XP5PNGTCBW4JGQNC735OCCA/action/citation_signature","submit_replication":"https://pith.science/pith/LB2XP5PNGTCBW4JGQNC735OCCA/action/replication_record"}},"created_at":"2026-05-18T00:56:31.517930+00:00","updated_at":"2026-05-18T00:56:31.517930+00:00"}