{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:UKZY3J2J5WNIK5X437SACOB56C","short_pith_number":"pith:UKZY3J2J","schema_version":"1.0","canonical_sha256":"a2b38da749ed9a8576fcdfe401383df0a57e8a803955c50585a45f424b641b2a","source":{"kind":"arxiv","id":"1206.5986","version":3},"attestation_state":"computed","paper":{"title":"On the Theorem of Uniform Recovery of Random Sampling Matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.IT"],"primary_cat":"cs.IT","authors_text":"Jan-Olov Str\\\"omberg, Joel Andersson","submitted_at":"2012-06-26T13:37:49Z","abstract_excerpt":"We consider two theorems from the theory of compressive sensing. Mainly a theorem concerning uniform recovery of random sampling matrices, where the number of samples needed in order to recover an $s$-sparse signal from linear measurements (with high probability) is known to be $m\\gtrsim s(\\ln s)^3\\ln N$. We present new and improved constants together with what we consider to be a more explicit proof. A proof that also allows for a slightly larger class of $m\\times N$-matrices, by considering what we call \\emph{low entropy}. We also present an improved condition on the so-called restricted iso"},"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":"1206.5986","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-06-26T13:37:49Z","cross_cats_sorted":["cs.NA","math.IT"],"title_canon_sha256":"0ce7aee0fd2cc462d1021fe8c0c7bbf9c4e80a9a8046c2bf72a0eb2c532aa86a","abstract_canon_sha256":"18e47d557d7ffc0a859d0a447bdfecf8b7ce0b2203ed4a0c694159663234c402"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:21:54.126096Z","signature_b64":"f8mrUPTGjZAHGJ9l1Z9aNfADwtZ3zPKtnlei35/54kj60sxna1FAAIC96UQpWNgnY9Y6+TmZIBFVezml8aboBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a2b38da749ed9a8576fcdfe401383df0a57e8a803955c50585a45f424b641b2a","last_reissued_at":"2026-05-18T03:21:54.125708Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:21:54.125708Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Theorem of Uniform Recovery of Random Sampling Matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.IT"],"primary_cat":"cs.IT","authors_text":"Jan-Olov Str\\\"omberg, Joel Andersson","submitted_at":"2012-06-26T13:37:49Z","abstract_excerpt":"We consider two theorems from the theory of compressive sensing. Mainly a theorem concerning uniform recovery of random sampling matrices, where the number of samples needed in order to recover an $s$-sparse signal from linear measurements (with high probability) is known to be $m\\gtrsim s(\\ln s)^3\\ln N$. We present new and improved constants together with what we consider to be a more explicit proof. A proof that also allows for a slightly larger class of $m\\times N$-matrices, by considering what we call \\emph{low entropy}. We also present an improved condition on the so-called restricted iso"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.5986","kind":"arxiv","version":3},"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":"1206.5986","created_at":"2026-05-18T03:21:54.125762+00:00"},{"alias_kind":"arxiv_version","alias_value":"1206.5986v3","created_at":"2026-05-18T03:21:54.125762+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.5986","created_at":"2026-05-18T03:21:54.125762+00:00"},{"alias_kind":"pith_short_12","alias_value":"UKZY3J2J5WNI","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_16","alias_value":"UKZY3J2J5WNIK5X4","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_8","alias_value":"UKZY3J2J","created_at":"2026-05-18T12:27:23.164592+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/UKZY3J2J5WNIK5X437SACOB56C","json":"https://pith.science/pith/UKZY3J2J5WNIK5X437SACOB56C.json","graph_json":"https://pith.science/api/pith-number/UKZY3J2J5WNIK5X437SACOB56C/graph.json","events_json":"https://pith.science/api/pith-number/UKZY3J2J5WNIK5X437SACOB56C/events.json","paper":"https://pith.science/paper/UKZY3J2J"},"agent_actions":{"view_html":"https://pith.science/pith/UKZY3J2J5WNIK5X437SACOB56C","download_json":"https://pith.science/pith/UKZY3J2J5WNIK5X437SACOB56C.json","view_paper":"https://pith.science/paper/UKZY3J2J","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1206.5986&json=true","fetch_graph":"https://pith.science/api/pith-number/UKZY3J2J5WNIK5X437SACOB56C/graph.json","fetch_events":"https://pith.science/api/pith-number/UKZY3J2J5WNIK5X437SACOB56C/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UKZY3J2J5WNIK5X437SACOB56C/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UKZY3J2J5WNIK5X437SACOB56C/action/storage_attestation","attest_author":"https://pith.science/pith/UKZY3J2J5WNIK5X437SACOB56C/action/author_attestation","sign_citation":"https://pith.science/pith/UKZY3J2J5WNIK5X437SACOB56C/action/citation_signature","submit_replication":"https://pith.science/pith/UKZY3J2J5WNIK5X437SACOB56C/action/replication_record"}},"created_at":"2026-05-18T03:21:54.125762+00:00","updated_at":"2026-05-18T03:21:54.125762+00:00"}