{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:KDQUVZE67TQTCUZPAXUPYZEKHV","short_pith_number":"pith:KDQUVZE6","schema_version":"1.0","canonical_sha256":"50e14ae49efce131532f05e8fc648a3d72d8c273e81152cef06fcd1bd7e0541b","source":{"kind":"arxiv","id":"1106.5037","version":1},"attestation_state":"computed","paper":{"title":"Fast and Efficient Compressive Sensing using Structurally Random Matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Lu Gan, Nam H. Nguyen, Thong T. Do, Trac D. Tran","submitted_at":"2011-06-24T19:01:45Z","abstract_excerpt":"This paper introduces a new framework of fast and efficient sensing matrices for practical compressive sensing, called Structurally Random Matrix (SRM). In the proposed framework, we pre-randomize a sensing signal by scrambling its samples or flipping its sample signs and then fast-transform the randomized samples and finally, subsample the transform coefficients as the final sensing measurements. SRM is highly relevant for large-scale, real-time compressive sensing applications as it has fast computation and supports block-based processing. In addition, we can show that SRM has theoretical se"},"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":"1106.5037","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-06-24T19:01:45Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"133c6f448b68ed2afdf925798496fd0db0c721a8e68e2481e7fb0d1b0feed80a","abstract_canon_sha256":"6798da9c6ef58930cc234913376296be37b94f631dd68f878afcb7448159bfbf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:01:30.959685Z","signature_b64":"bCunXTGVzoLTEjGU9J7bboiX/dXTzCjjtiIig5TiyE9sLl9jDXrDZ+gkChNMLCaDvQhCAHRFynOeg72OZuPVDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"50e14ae49efce131532f05e8fc648a3d72d8c273e81152cef06fcd1bd7e0541b","last_reissued_at":"2026-05-18T02:01:30.958551Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:01:30.958551Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast and Efficient Compressive Sensing using Structurally Random Matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Lu Gan, Nam H. Nguyen, Thong T. Do, Trac D. Tran","submitted_at":"2011-06-24T19:01:45Z","abstract_excerpt":"This paper introduces a new framework of fast and efficient sensing matrices for practical compressive sensing, called Structurally Random Matrix (SRM). In the proposed framework, we pre-randomize a sensing signal by scrambling its samples or flipping its sample signs and then fast-transform the randomized samples and finally, subsample the transform coefficients as the final sensing measurements. SRM is highly relevant for large-scale, real-time compressive sensing applications as it has fast computation and supports block-based processing. In addition, we can show that SRM has theoretical se"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.5037","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":"1106.5037","created_at":"2026-05-18T02:01:30.958949+00:00"},{"alias_kind":"arxiv_version","alias_value":"1106.5037v1","created_at":"2026-05-18T02:01:30.958949+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.5037","created_at":"2026-05-18T02:01:30.958949+00:00"},{"alias_kind":"pith_short_12","alias_value":"KDQUVZE67TQT","created_at":"2026-05-18T12:26:32.869790+00:00"},{"alias_kind":"pith_short_16","alias_value":"KDQUVZE67TQTCUZP","created_at":"2026-05-18T12:26:32.869790+00:00"},{"alias_kind":"pith_short_8","alias_value":"KDQUVZE6","created_at":"2026-05-18T12:26:32.869790+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/KDQUVZE67TQTCUZPAXUPYZEKHV","json":"https://pith.science/pith/KDQUVZE67TQTCUZPAXUPYZEKHV.json","graph_json":"https://pith.science/api/pith-number/KDQUVZE67TQTCUZPAXUPYZEKHV/graph.json","events_json":"https://pith.science/api/pith-number/KDQUVZE67TQTCUZPAXUPYZEKHV/events.json","paper":"https://pith.science/paper/KDQUVZE6"},"agent_actions":{"view_html":"https://pith.science/pith/KDQUVZE67TQTCUZPAXUPYZEKHV","download_json":"https://pith.science/pith/KDQUVZE67TQTCUZPAXUPYZEKHV.json","view_paper":"https://pith.science/paper/KDQUVZE6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1106.5037&json=true","fetch_graph":"https://pith.science/api/pith-number/KDQUVZE67TQTCUZPAXUPYZEKHV/graph.json","fetch_events":"https://pith.science/api/pith-number/KDQUVZE67TQTCUZPAXUPYZEKHV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KDQUVZE67TQTCUZPAXUPYZEKHV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KDQUVZE67TQTCUZPAXUPYZEKHV/action/storage_attestation","attest_author":"https://pith.science/pith/KDQUVZE67TQTCUZPAXUPYZEKHV/action/author_attestation","sign_citation":"https://pith.science/pith/KDQUVZE67TQTCUZPAXUPYZEKHV/action/citation_signature","submit_replication":"https://pith.science/pith/KDQUVZE67TQTCUZPAXUPYZEKHV/action/replication_record"}},"created_at":"2026-05-18T02:01:30.958949+00:00","updated_at":"2026-05-18T02:01:30.958949+00:00"}