{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:KOSLHNRP3CGXJE7TXRWWYSAFO3","short_pith_number":"pith:KOSLHNRP","schema_version":"1.0","canonical_sha256":"53a4b3b62fd88d7493f3bc6d6c480576eca06c98d789261f05a4ea6ea878f7a7","source":{"kind":"arxiv","id":"1207.2853","version":2},"attestation_state":"computed","paper":{"title":"Compressed sensing with sparse, structured matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.dis-nn","cond-mat.stat-mech","math.IT"],"primary_cat":"cs.IT","authors_text":"Federico Ricci-Tersenghi, Maria Chiara Angelini, Yoshiyuki Kabashima","submitted_at":"2012-07-12T06:16:33Z","abstract_excerpt":"In the context of the compressed sensing problem, we propose a new ensemble of sparse random matrices which allow one (i) to acquire and compress a {\\rho}0-sparse signal of length N in a time linear in N and (ii) to perfectly recover the original signal, compressed at a rate {\\alpha}, by using a message passing algorithm (Expectation Maximization Belief Propagation) that runs in a time linear in N. In the large N limit, the scheme proposed here closely approaches the theoretical bound {\\rho}0 = {\\alpha}, and so it is both optimal and efficient (linear time complexity). More generally, we show "},"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":"1207.2853","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-07-12T06:16:33Z","cross_cats_sorted":["cond-mat.dis-nn","cond-mat.stat-mech","math.IT"],"title_canon_sha256":"09be205904d51021b92ab740141a18295286289dd351aa6203b8d7b532e4b4d5","abstract_canon_sha256":"d0b579c320b8dcc3b16cabb9e8ed31672b08107e11414d70aba25c833ea27e6e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:28:17.462353Z","signature_b64":"kItSc5UqAbzMJFU8yQiNfH2emOwUcIy0Shdly72pWyyWaaRrvwf9zFSBhqNSr2h8KgM0RJjaFGGgBXgvhGE8BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"53a4b3b62fd88d7493f3bc6d6c480576eca06c98d789261f05a4ea6ea878f7a7","last_reissued_at":"2026-05-18T03:28:17.461521Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:28:17.461521Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Compressed sensing with sparse, structured matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.dis-nn","cond-mat.stat-mech","math.IT"],"primary_cat":"cs.IT","authors_text":"Federico Ricci-Tersenghi, Maria Chiara Angelini, Yoshiyuki Kabashima","submitted_at":"2012-07-12T06:16:33Z","abstract_excerpt":"In the context of the compressed sensing problem, we propose a new ensemble of sparse random matrices which allow one (i) to acquire and compress a {\\rho}0-sparse signal of length N in a time linear in N and (ii) to perfectly recover the original signal, compressed at a rate {\\alpha}, by using a message passing algorithm (Expectation Maximization Belief Propagation) that runs in a time linear in N. In the large N limit, the scheme proposed here closely approaches the theoretical bound {\\rho}0 = {\\alpha}, and so it is both optimal and efficient (linear time complexity). More generally, we show "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.2853","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":"1207.2853","created_at":"2026-05-18T03:28:17.461632+00:00"},{"alias_kind":"arxiv_version","alias_value":"1207.2853v2","created_at":"2026-05-18T03:28:17.461632+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.2853","created_at":"2026-05-18T03:28:17.461632+00:00"},{"alias_kind":"pith_short_12","alias_value":"KOSLHNRP3CGX","created_at":"2026-05-18T12:27:11.947152+00:00"},{"alias_kind":"pith_short_16","alias_value":"KOSLHNRP3CGXJE7T","created_at":"2026-05-18T12:27:11.947152+00:00"},{"alias_kind":"pith_short_8","alias_value":"KOSLHNRP","created_at":"2026-05-18T12:27:11.947152+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/KOSLHNRP3CGXJE7TXRWWYSAFO3","json":"https://pith.science/pith/KOSLHNRP3CGXJE7TXRWWYSAFO3.json","graph_json":"https://pith.science/api/pith-number/KOSLHNRP3CGXJE7TXRWWYSAFO3/graph.json","events_json":"https://pith.science/api/pith-number/KOSLHNRP3CGXJE7TXRWWYSAFO3/events.json","paper":"https://pith.science/paper/KOSLHNRP"},"agent_actions":{"view_html":"https://pith.science/pith/KOSLHNRP3CGXJE7TXRWWYSAFO3","download_json":"https://pith.science/pith/KOSLHNRP3CGXJE7TXRWWYSAFO3.json","view_paper":"https://pith.science/paper/KOSLHNRP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1207.2853&json=true","fetch_graph":"https://pith.science/api/pith-number/KOSLHNRP3CGXJE7TXRWWYSAFO3/graph.json","fetch_events":"https://pith.science/api/pith-number/KOSLHNRP3CGXJE7TXRWWYSAFO3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KOSLHNRP3CGXJE7TXRWWYSAFO3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KOSLHNRP3CGXJE7TXRWWYSAFO3/action/storage_attestation","attest_author":"https://pith.science/pith/KOSLHNRP3CGXJE7TXRWWYSAFO3/action/author_attestation","sign_citation":"https://pith.science/pith/KOSLHNRP3CGXJE7TXRWWYSAFO3/action/citation_signature","submit_replication":"https://pith.science/pith/KOSLHNRP3CGXJE7TXRWWYSAFO3/action/replication_record"}},"created_at":"2026-05-18T03:28:17.461632+00:00","updated_at":"2026-05-18T03:28:17.461632+00:00"}