{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:KDQUVZE67TQTCUZPAXUPYZEKHV","short_pith_number":"pith:KDQUVZE6","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"},"canonical_sha256":"50e14ae49efce131532f05e8fc648a3d72d8c273e81152cef06fcd1bd7e0541b","source":{"kind":"arxiv","id":"1106.5037","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.5037","created_at":"2026-05-18T02:01:30Z"},{"alias_kind":"arxiv_version","alias_value":"1106.5037v1","created_at":"2026-05-18T02:01:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.5037","created_at":"2026-05-18T02:01:30Z"},{"alias_kind":"pith_short_12","alias_value":"KDQUVZE67TQT","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_16","alias_value":"KDQUVZE67TQTCUZP","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_8","alias_value":"KDQUVZE6","created_at":"2026-05-18T12:26:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:KDQUVZE67TQTCUZPAXUPYZEKHV","target":"record","payload":{"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"},"canonical_sha256":"50e14ae49efce131532f05e8fc648a3d72d8c273e81152cef06fcd1bd7e0541b","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"},"source_kind":"arxiv","source_id":"1106.5037","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:01:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6rZ7an0/p94PgKrCa6fafc5x5kx/Ybt/UinvOZu7u11yfIHLj4KZ4096xoPiwEyn7sEgQ/ZuqbFaf8FQAcYBAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T02:18:59.878897Z"},"content_sha256":"d3873f338aee8938bb28c27f1e693f66d2751c39ddfae82b2996b986db7687cd","schema_version":"1.0","event_id":"sha256:d3873f338aee8938bb28c27f1e693f66d2751c39ddfae82b2996b986db7687cd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:KDQUVZE67TQTCUZPAXUPYZEKHV","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:01:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FzAhS3wOJhRKuZSZRWxSYjWTyhw+g2L6TdPlkE6H0Ui0YLrmDi9uJfEz0x26HjduMqIFmvZ5zi6/1idvWNGpBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T02:18:59.879231Z"},"content_sha256":"209c5c52cab508f230806b78794ce5c0a9ffa5612746e41ea81d110ec5a041fa","schema_version":"1.0","event_id":"sha256:209c5c52cab508f230806b78794ce5c0a9ffa5612746e41ea81d110ec5a041fa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KDQUVZE67TQTCUZPAXUPYZEKHV/bundle.json","state_url":"https://pith.science/pith/KDQUVZE67TQTCUZPAXUPYZEKHV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KDQUVZE67TQTCUZPAXUPYZEKHV/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-02T02:18:59Z","links":{"resolver":"https://pith.science/pith/KDQUVZE67TQTCUZPAXUPYZEKHV","bundle":"https://pith.science/pith/KDQUVZE67TQTCUZPAXUPYZEKHV/bundle.json","state":"https://pith.science/pith/KDQUVZE67TQTCUZPAXUPYZEKHV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KDQUVZE67TQTCUZPAXUPYZEKHV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:KDQUVZE67TQTCUZPAXUPYZEKHV","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"6798da9c6ef58930cc234913376296be37b94f631dd68f878afcb7448159bfbf","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-06-24T19:01:45Z","title_canon_sha256":"133c6f448b68ed2afdf925798496fd0db0c721a8e68e2481e7fb0d1b0feed80a"},"schema_version":"1.0","source":{"id":"1106.5037","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.5037","created_at":"2026-05-18T02:01:30Z"},{"alias_kind":"arxiv_version","alias_value":"1106.5037v1","created_at":"2026-05-18T02:01:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.5037","created_at":"2026-05-18T02:01:30Z"},{"alias_kind":"pith_short_12","alias_value":"KDQUVZE67TQT","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_16","alias_value":"KDQUVZE67TQTCUZP","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_8","alias_value":"KDQUVZE6","created_at":"2026-05-18T12:26:32Z"}],"graph_snapshots":[{"event_id":"sha256:209c5c52cab508f230806b78794ce5c0a9ffa5612746e41ea81d110ec5a041fa","target":"graph","created_at":"2026-05-18T02:01:30Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Lu Gan, Nam H. Nguyen, Thong T. Do, Trac D. Tran","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-06-24T19:01:45Z","title":"Fast and Efficient Compressive Sensing using Structurally Random Matrices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.5037","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:d3873f338aee8938bb28c27f1e693f66d2751c39ddfae82b2996b986db7687cd","target":"record","created_at":"2026-05-18T02:01:30Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"6798da9c6ef58930cc234913376296be37b94f631dd68f878afcb7448159bfbf","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-06-24T19:01:45Z","title_canon_sha256":"133c6f448b68ed2afdf925798496fd0db0c721a8e68e2481e7fb0d1b0feed80a"},"schema_version":"1.0","source":{"id":"1106.5037","kind":"arxiv","version":1}},"canonical_sha256":"50e14ae49efce131532f05e8fc648a3d72d8c273e81152cef06fcd1bd7e0541b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"50e14ae49efce131532f05e8fc648a3d72d8c273e81152cef06fcd1bd7e0541b","first_computed_at":"2026-05-18T02:01:30.958551Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:01:30.958551Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bCunXTGVzoLTEjGU9J7bboiX/dXTzCjjtiIig5TiyE9sLl9jDXrDZ+gkChNMLCaDvQhCAHRFynOeg72OZuPVDw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:01:30.959685Z","signed_message":"canonical_sha256_bytes"},"source_id":"1106.5037","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d3873f338aee8938bb28c27f1e693f66d2751c39ddfae82b2996b986db7687cd","sha256:209c5c52cab508f230806b78794ce5c0a9ffa5612746e41ea81d110ec5a041fa"],"state_sha256":"2068d65da4bcf87e1acec521fda5f424e12053f37c3636c009094f3882d4c301"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N/MAUlWs2Zz6LCCMeQTcY4m4LNCCBmJbwY3iNG2SinzHig59Ang25dMz8H8UoxWgKE5lGd1t8HM1haJMxKZ9AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T02:18:59.881191Z","bundle_sha256":"7f7b38f9c1bb941b6aad3c6eede6c743013635df0b75eac6b3f51b402ced23fa"}}