{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:VYGAAJ7QA5KTCEYSYI5JY3CAFF","short_pith_number":"pith:VYGAAJ7Q","schema_version":"1.0","canonical_sha256":"ae0c0027f00755311312c23a9c6c402968e75a66b24a2c6cdeae852cb5d76f8c","source":{"kind":"arxiv","id":"1703.08756","version":1},"attestation_state":"computed","paper":{"title":"Denoising-based Turbo Compressed Sensing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Junjie Ma, Xiaojun Yuan, Zhipeng Xue","submitted_at":"2017-03-26T02:26:33Z","abstract_excerpt":"Turbo compressed sensing (Turbo-CS) is an efficient iterative algorithm for sparse signal recovery with partial orthogonal sensing matrices. In this paper, we extend the Turbo-CS algorithm to solve compressed sensing problems involving more general signal structure, including compressive image recovery and low-rank matrix recovery. A main difficulty for such an extension is that the original Turbo-CS algorithm requires prior knowledge of the signal distribution that is usually unavailable in practice. To overcome this difficulty, we propose to redesign the Turbo-CS algorithm by employing a gen"},"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":"1703.08756","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-03-26T02:26:33Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"0b5427026e3ed3be39509a770568f09b39457ae6a3aafd5eaef2ca06c7287fd8","abstract_canon_sha256":"0dce4f0966c5c09da62d5359115ad9f284ecfb817e5c4396c7b288f80a204d36"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:47:55.665357Z","signature_b64":"Gp4KU6vswOunNK57LutH3G2v1rtD8j2mnCqxVLMY6cj3GDjYX/NSAVdVbAM1697/57T9i7EE3R7XDTkbgXyhAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ae0c0027f00755311312c23a9c6c402968e75a66b24a2c6cdeae852cb5d76f8c","last_reissued_at":"2026-05-18T00:47:55.664806Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:47:55.664806Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Denoising-based Turbo Compressed Sensing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Junjie Ma, Xiaojun Yuan, Zhipeng Xue","submitted_at":"2017-03-26T02:26:33Z","abstract_excerpt":"Turbo compressed sensing (Turbo-CS) is an efficient iterative algorithm for sparse signal recovery with partial orthogonal sensing matrices. In this paper, we extend the Turbo-CS algorithm to solve compressed sensing problems involving more general signal structure, including compressive image recovery and low-rank matrix recovery. A main difficulty for such an extension is that the original Turbo-CS algorithm requires prior knowledge of the signal distribution that is usually unavailable in practice. To overcome this difficulty, we propose to redesign the Turbo-CS algorithm by employing a gen"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.08756","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":""},"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":"1703.08756","created_at":"2026-05-18T00:47:55.664872+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.08756v1","created_at":"2026-05-18T00:47:55.664872+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.08756","created_at":"2026-05-18T00:47:55.664872+00:00"},{"alias_kind":"pith_short_12","alias_value":"VYGAAJ7QA5KT","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_16","alias_value":"VYGAAJ7QA5KTCEYS","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_8","alias_value":"VYGAAJ7Q","created_at":"2026-05-18T12:31:49.984773+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/VYGAAJ7QA5KTCEYSYI5JY3CAFF","json":"https://pith.science/pith/VYGAAJ7QA5KTCEYSYI5JY3CAFF.json","graph_json":"https://pith.science/api/pith-number/VYGAAJ7QA5KTCEYSYI5JY3CAFF/graph.json","events_json":"https://pith.science/api/pith-number/VYGAAJ7QA5KTCEYSYI5JY3CAFF/events.json","paper":"https://pith.science/paper/VYGAAJ7Q"},"agent_actions":{"view_html":"https://pith.science/pith/VYGAAJ7QA5KTCEYSYI5JY3CAFF","download_json":"https://pith.science/pith/VYGAAJ7QA5KTCEYSYI5JY3CAFF.json","view_paper":"https://pith.science/paper/VYGAAJ7Q","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.08756&json=true","fetch_graph":"https://pith.science/api/pith-number/VYGAAJ7QA5KTCEYSYI5JY3CAFF/graph.json","fetch_events":"https://pith.science/api/pith-number/VYGAAJ7QA5KTCEYSYI5JY3CAFF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VYGAAJ7QA5KTCEYSYI5JY3CAFF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VYGAAJ7QA5KTCEYSYI5JY3CAFF/action/storage_attestation","attest_author":"https://pith.science/pith/VYGAAJ7QA5KTCEYSYI5JY3CAFF/action/author_attestation","sign_citation":"https://pith.science/pith/VYGAAJ7QA5KTCEYSYI5JY3CAFF/action/citation_signature","submit_replication":"https://pith.science/pith/VYGAAJ7QA5KTCEYSYI5JY3CAFF/action/replication_record"}},"created_at":"2026-05-18T00:47:55.664872+00:00","updated_at":"2026-05-18T00:47:55.664872+00:00"}