{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:I7YBVGOHUGS7V4Y4UDPI34BKJD","short_pith_number":"pith:I7YBVGOH","schema_version":"1.0","canonical_sha256":"47f01a99c7a1a5faf31ca0de8df02a48e0c5bb6f2b6f6ea321b1f68c208b784d","source":{"kind":"arxiv","id":"2412.03106","version":1},"attestation_state":"computed","paper":{"title":"Improved Turbo Message Passing for Compressive Robust Principal Component Analysis: Algorithm Design and Asymptotic Analysis","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Junjie Ma, Xiaojun Yuan, Zhuohang He","submitted_at":"2024-12-04T08:12:35Z","abstract_excerpt":"Compressive Robust Principal Component Analysis (CRPCA) naturally arises in various applications as a means to recover a low-rank matrix low-rank matrix $\\boldsymbol{L}$ and a sparse matrix $\\boldsymbol{S}$ from compressive measurements. In this paper, we approach the problem from a Bayesian inference perspective. We establish a probabilistic model for the problem and develop an improved turbo message passing (ITMP) algorithm based on the sum-product rule and the appropriate approximations. Additionally, we establish a state evolution framework to characterize the asymptotic behavior of the IT"},"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":"2412.03106","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2024-12-04T08:12:35Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"9ee3dcb02dac951bc184f99a591b61cb78073867c8f8df3ea4a6e8077505ed77","abstract_canon_sha256":"b70e56e2a6d917d175db8742022da6700b8c611d1229f3c401bb26cac1816120"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:44:25.066446Z","signature_b64":"3Z/8gP907ZO42vZP6binK5x6ufNiqOc/QWMpgcWXK4/y4W05Mfm0t+XEOB52vSKfWyKiVi8vN8EBk3EaqjorDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"47f01a99c7a1a5faf31ca0de8df02a48e0c5bb6f2b6f6ea321b1f68c208b784d","last_reissued_at":"2026-07-05T09:44:25.066049Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:44:25.066049Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved Turbo Message Passing for Compressive Robust Principal Component Analysis: Algorithm Design and Asymptotic Analysis","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Junjie Ma, Xiaojun Yuan, Zhuohang He","submitted_at":"2024-12-04T08:12:35Z","abstract_excerpt":"Compressive Robust Principal Component Analysis (CRPCA) naturally arises in various applications as a means to recover a low-rank matrix low-rank matrix $\\boldsymbol{L}$ and a sparse matrix $\\boldsymbol{S}$ from compressive measurements. In this paper, we approach the problem from a Bayesian inference perspective. We establish a probabilistic model for the problem and develop an improved turbo message passing (ITMP) algorithm based on the sum-product rule and the appropriate approximations. Additionally, we establish a state evolution framework to characterize the asymptotic behavior of the IT"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.03106","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2412.03106/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2412.03106","created_at":"2026-07-05T09:44:25.066105+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.03106v1","created_at":"2026-07-05T09:44:25.066105+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.03106","created_at":"2026-07-05T09:44:25.066105+00:00"},{"alias_kind":"pith_short_12","alias_value":"I7YBVGOHUGS7","created_at":"2026-07-05T09:44:25.066105+00:00"},{"alias_kind":"pith_short_16","alias_value":"I7YBVGOHUGS7V4Y4","created_at":"2026-07-05T09:44:25.066105+00:00"},{"alias_kind":"pith_short_8","alias_value":"I7YBVGOH","created_at":"2026-07-05T09:44:25.066105+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/I7YBVGOHUGS7V4Y4UDPI34BKJD","json":"https://pith.science/pith/I7YBVGOHUGS7V4Y4UDPI34BKJD.json","graph_json":"https://pith.science/api/pith-number/I7YBVGOHUGS7V4Y4UDPI34BKJD/graph.json","events_json":"https://pith.science/api/pith-number/I7YBVGOHUGS7V4Y4UDPI34BKJD/events.json","paper":"https://pith.science/paper/I7YBVGOH"},"agent_actions":{"view_html":"https://pith.science/pith/I7YBVGOHUGS7V4Y4UDPI34BKJD","download_json":"https://pith.science/pith/I7YBVGOHUGS7V4Y4UDPI34BKJD.json","view_paper":"https://pith.science/paper/I7YBVGOH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.03106&json=true","fetch_graph":"https://pith.science/api/pith-number/I7YBVGOHUGS7V4Y4UDPI34BKJD/graph.json","fetch_events":"https://pith.science/api/pith-number/I7YBVGOHUGS7V4Y4UDPI34BKJD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/I7YBVGOHUGS7V4Y4UDPI34BKJD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/I7YBVGOHUGS7V4Y4UDPI34BKJD/action/storage_attestation","attest_author":"https://pith.science/pith/I7YBVGOHUGS7V4Y4UDPI34BKJD/action/author_attestation","sign_citation":"https://pith.science/pith/I7YBVGOHUGS7V4Y4UDPI34BKJD/action/citation_signature","submit_replication":"https://pith.science/pith/I7YBVGOHUGS7V4Y4UDPI34BKJD/action/replication_record"}},"created_at":"2026-07-05T09:44:25.066105+00:00","updated_at":"2026-07-05T09:44:25.066105+00:00"}