{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:7LEVDWNAANH55Y3OTDAPYBV5VX","short_pith_number":"pith:7LEVDWNA","canonical_record":{"source":{"id":"1103.3316","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-03-16T23:28:48Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"32a4ad6cdda50a2465aae6e53e5767cf19988e1d840e6cd03eb67da7abafae65","abstract_canon_sha256":"1ba63f3ae90a26469107c7e854bb1d2383aa6cc1e1d33caa95b7380270b805e0"},"schema_version":"1.0"},"canonical_sha256":"fac951d9a0034fdee36e98c0fc06bdadddf48c636d287b1243afbe95ac125f58","source":{"kind":"arxiv","id":"1103.3316","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.3316","created_at":"2026-05-18T04:25:38Z"},{"alias_kind":"arxiv_version","alias_value":"1103.3316v2","created_at":"2026-05-18T04:25:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.3316","created_at":"2026-05-18T04:25:38Z"},{"alias_kind":"pith_short_12","alias_value":"7LEVDWNAANH5","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"7LEVDWNAANH55Y3O","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"7LEVDWNA","created_at":"2026-05-18T12:26:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:7LEVDWNAANH55Y3OTDAPYBV5VX","target":"record","payload":{"canonical_record":{"source":{"id":"1103.3316","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-03-16T23:28:48Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"32a4ad6cdda50a2465aae6e53e5767cf19988e1d840e6cd03eb67da7abafae65","abstract_canon_sha256":"1ba63f3ae90a26469107c7e854bb1d2383aa6cc1e1d33caa95b7380270b805e0"},"schema_version":"1.0"},"canonical_sha256":"fac951d9a0034fdee36e98c0fc06bdadddf48c636d287b1243afbe95ac125f58","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:25:38.709068Z","signature_b64":"vCB9wHDgJcbFeNVt/0LdshEmZJW7Zu25iArBaZXXtbvv1jOGmM5T9wUUk/XyTs3644bSfg4EdbqixJRiEe75CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fac951d9a0034fdee36e98c0fc06bdadddf48c636d287b1243afbe95ac125f58","last_reissued_at":"2026-05-18T04:25:38.708565Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:25:38.708565Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1103.3316","source_version":2,"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-18T04:25:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9eN9naKbYfxrcaomBwd8b05E1gzPFK66lWbYzWzjTY1cxZ9hK7cGXGljuKdGdG/b5CVIcNK3S1LEG10R85tGCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T07:08:43.023996Z"},"content_sha256":"6a872786d982ba94bee97e6e61bb47c8fdd19beab632bf12a47b9d72a1dd25c2","schema_version":"1.0","event_id":"sha256:6a872786d982ba94bee97e6e61bb47c8fdd19beab632bf12a47b9d72a1dd25c2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:7LEVDWNAANH55Y3OTDAPYBV5VX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Deterministic Bounds for Restricted Isometry of Compressed Sensing Matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Richard G. Baraniuk, Shriram Sarvotham","submitted_at":"2011-03-16T23:28:48Z","abstract_excerpt":"Compressed Sensing (CS) is an emerging field that enables reconstruction of a sparse signal $x \\in {\\mathbb R} ^n$ that has only $k \\ll n$ non-zero coefficients from a small number $m \\ll n$ of linear projections. The projections are obtained by multiplying $x$ by a matrix $\\Phi \\in {\\mathbb R}^{m \\times n}$ --- called a CS matrix --- where $k < m \\ll n$. In this work, we ask the following question: given the triplet $\\{k, m, n \\}$ that defines the CS problem size, what are the deterministic limits on the performance of the best CS matrix in ${\\mathbb R}^{m \\times n}$? We select Restricted Iso"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.3316","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"},"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-18T04:25:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bWn9R6/olCso+oEu5479HDDCPvl6fFu52CGdBgyIsjRPJG02+j5P0OG38sgiS6mU3ELIASht2AE5mjuZuTjdDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T07:08:43.024353Z"},"content_sha256":"120bea5a9ab4c685b464afb9df222341f150115f7f5b848390a5afbc4dbc07c3","schema_version":"1.0","event_id":"sha256:120bea5a9ab4c685b464afb9df222341f150115f7f5b848390a5afbc4dbc07c3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7LEVDWNAANH55Y3OTDAPYBV5VX/bundle.json","state_url":"https://pith.science/pith/7LEVDWNAANH55Y3OTDAPYBV5VX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7LEVDWNAANH55Y3OTDAPYBV5VX/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-20T07:08:43Z","links":{"resolver":"https://pith.science/pith/7LEVDWNAANH55Y3OTDAPYBV5VX","bundle":"https://pith.science/pith/7LEVDWNAANH55Y3OTDAPYBV5VX/bundle.json","state":"https://pith.science/pith/7LEVDWNAANH55Y3OTDAPYBV5VX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7LEVDWNAANH55Y3OTDAPYBV5VX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:7LEVDWNAANH55Y3OTDAPYBV5VX","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":"1ba63f3ae90a26469107c7e854bb1d2383aa6cc1e1d33caa95b7380270b805e0","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-03-16T23:28:48Z","title_canon_sha256":"32a4ad6cdda50a2465aae6e53e5767cf19988e1d840e6cd03eb67da7abafae65"},"schema_version":"1.0","source":{"id":"1103.3316","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.3316","created_at":"2026-05-18T04:25:38Z"},{"alias_kind":"arxiv_version","alias_value":"1103.3316v2","created_at":"2026-05-18T04:25:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.3316","created_at":"2026-05-18T04:25:38Z"},{"alias_kind":"pith_short_12","alias_value":"7LEVDWNAANH5","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"7LEVDWNAANH55Y3O","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"7LEVDWNA","created_at":"2026-05-18T12:26:22Z"}],"graph_snapshots":[{"event_id":"sha256:120bea5a9ab4c685b464afb9df222341f150115f7f5b848390a5afbc4dbc07c3","target":"graph","created_at":"2026-05-18T04:25:38Z","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":"Compressed Sensing (CS) is an emerging field that enables reconstruction of a sparse signal $x \\in {\\mathbb R} ^n$ that has only $k \\ll n$ non-zero coefficients from a small number $m \\ll n$ of linear projections. The projections are obtained by multiplying $x$ by a matrix $\\Phi \\in {\\mathbb R}^{m \\times n}$ --- called a CS matrix --- where $k < m \\ll n$. In this work, we ask the following question: given the triplet $\\{k, m, n \\}$ that defines the CS problem size, what are the deterministic limits on the performance of the best CS matrix in ${\\mathbb R}^{m \\times n}$? We select Restricted Iso","authors_text":"Richard G. Baraniuk, Shriram Sarvotham","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-03-16T23:28:48Z","title":"Deterministic Bounds for Restricted Isometry of Compressed Sensing Matrices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.3316","kind":"arxiv","version":2},"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:6a872786d982ba94bee97e6e61bb47c8fdd19beab632bf12a47b9d72a1dd25c2","target":"record","created_at":"2026-05-18T04:25:38Z","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":"1ba63f3ae90a26469107c7e854bb1d2383aa6cc1e1d33caa95b7380270b805e0","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-03-16T23:28:48Z","title_canon_sha256":"32a4ad6cdda50a2465aae6e53e5767cf19988e1d840e6cd03eb67da7abafae65"},"schema_version":"1.0","source":{"id":"1103.3316","kind":"arxiv","version":2}},"canonical_sha256":"fac951d9a0034fdee36e98c0fc06bdadddf48c636d287b1243afbe95ac125f58","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fac951d9a0034fdee36e98c0fc06bdadddf48c636d287b1243afbe95ac125f58","first_computed_at":"2026-05-18T04:25:38.708565Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:25:38.708565Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vCB9wHDgJcbFeNVt/0LdshEmZJW7Zu25iArBaZXXtbvv1jOGmM5T9wUUk/XyTs3644bSfg4EdbqixJRiEe75CA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:25:38.709068Z","signed_message":"canonical_sha256_bytes"},"source_id":"1103.3316","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6a872786d982ba94bee97e6e61bb47c8fdd19beab632bf12a47b9d72a1dd25c2","sha256:120bea5a9ab4c685b464afb9df222341f150115f7f5b848390a5afbc4dbc07c3"],"state_sha256":"0f4c41f4d3bdd6e07f9d5228da98a95cce4bd9721b633fcb878cd7b113d23007"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SQ+k+m37SGTKmk/zR9ZAVT5jd7Nf80R+2GufNibxk4YQj2dfbTLU7i/V8oig4qydgsufcDq2f2XAoyybLK9kBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T07:08:43.026209Z","bundle_sha256":"8de65e182d6bc2182129276ead38233687eb7d2176ed8831741f96a21c3ae008"}}