{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:DHTNQSGUHWQZHQYPN4PT7Y7EDQ","short_pith_number":"pith:DHTNQSGU","schema_version":"1.0","canonical_sha256":"19e6d848d43da193c30f6f1f3fe3e41c156d85f6c84e08e7ec0139408ffed5ef","source":{"kind":"arxiv","id":"1403.2807","version":2},"attestation_state":"computed","paper":{"title":"An asymptotic existence result on compressed sensing matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.OC"],"primary_cat":"math.FA","authors_text":"Darryn Bryant, Padraig \\'O Cath\\'ain","submitted_at":"2014-03-12T04:28:42Z","abstract_excerpt":"For any rational number $h$ and all sufficiently large $n$ we give a deterministic construction for an $n\\times \\lfloor hn\\rfloor$ compressed sensing matrix with $(\\ell_1,t)$-recoverability where $t=O(\\sqrt{n})$. Our method uses pairwise balanced designs and complex Hadamard matrices in the construction of $\\epsilon$-equiangular frames, which we introduce as a generalisation of equiangular tight frames. The method is general and produces good compressed sensing matrices from any appropriately chosen pairwise balanced design. The $(\\ell_1,t)$-recoverability performance is specified as a simple "},"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":"1403.2807","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.FA","submitted_at":"2014-03-12T04:28:42Z","cross_cats_sorted":["math.CO","math.OC"],"title_canon_sha256":"fbfcaf253b28968a9c0f18034f0f63e3895a48d3b0f6f26bd933d75a75ac235a","abstract_canon_sha256":"fe0d2713e9ee4b2e1b392b613a0d4da367666ed548e057145fe00e6fc00ffb33"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:27:44.707441Z","signature_b64":"F6X+AmeK8W7gHBOqb/FhKi8k6nkEDyIlrdYATNDld1rAEATH7g52vczaQlhnnqwNtei6enyntCO6Vaa1JjNvDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"19e6d848d43da193c30f6f1f3fe3e41c156d85f6c84e08e7ec0139408ffed5ef","last_reissued_at":"2026-05-18T02:27:44.706991Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:27:44.706991Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An asymptotic existence result on compressed sensing matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.OC"],"primary_cat":"math.FA","authors_text":"Darryn Bryant, Padraig \\'O Cath\\'ain","submitted_at":"2014-03-12T04:28:42Z","abstract_excerpt":"For any rational number $h$ and all sufficiently large $n$ we give a deterministic construction for an $n\\times \\lfloor hn\\rfloor$ compressed sensing matrix with $(\\ell_1,t)$-recoverability where $t=O(\\sqrt{n})$. Our method uses pairwise balanced designs and complex Hadamard matrices in the construction of $\\epsilon$-equiangular frames, which we introduce as a generalisation of equiangular tight frames. The method is general and produces good compressed sensing matrices from any appropriately chosen pairwise balanced design. The $(\\ell_1,t)$-recoverability performance is specified as a simple "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.2807","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":"1403.2807","created_at":"2026-05-18T02:27:44.707056+00:00"},{"alias_kind":"arxiv_version","alias_value":"1403.2807v2","created_at":"2026-05-18T02:27:44.707056+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.2807","created_at":"2026-05-18T02:27:44.707056+00:00"},{"alias_kind":"pith_short_12","alias_value":"DHTNQSGUHWQZ","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_16","alias_value":"DHTNQSGUHWQZHQYP","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_8","alias_value":"DHTNQSGU","created_at":"2026-05-18T12:28:25.294606+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.07396","citing_title":"Sparse recovery guarantees for block orthogonal binary matrices constructed via Generalized Euler Squares","ref_index":22,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DHTNQSGUHWQZHQYPN4PT7Y7EDQ","json":"https://pith.science/pith/DHTNQSGUHWQZHQYPN4PT7Y7EDQ.json","graph_json":"https://pith.science/api/pith-number/DHTNQSGUHWQZHQYPN4PT7Y7EDQ/graph.json","events_json":"https://pith.science/api/pith-number/DHTNQSGUHWQZHQYPN4PT7Y7EDQ/events.json","paper":"https://pith.science/paper/DHTNQSGU"},"agent_actions":{"view_html":"https://pith.science/pith/DHTNQSGUHWQZHQYPN4PT7Y7EDQ","download_json":"https://pith.science/pith/DHTNQSGUHWQZHQYPN4PT7Y7EDQ.json","view_paper":"https://pith.science/paper/DHTNQSGU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1403.2807&json=true","fetch_graph":"https://pith.science/api/pith-number/DHTNQSGUHWQZHQYPN4PT7Y7EDQ/graph.json","fetch_events":"https://pith.science/api/pith-number/DHTNQSGUHWQZHQYPN4PT7Y7EDQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DHTNQSGUHWQZHQYPN4PT7Y7EDQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DHTNQSGUHWQZHQYPN4PT7Y7EDQ/action/storage_attestation","attest_author":"https://pith.science/pith/DHTNQSGUHWQZHQYPN4PT7Y7EDQ/action/author_attestation","sign_citation":"https://pith.science/pith/DHTNQSGUHWQZHQYPN4PT7Y7EDQ/action/citation_signature","submit_replication":"https://pith.science/pith/DHTNQSGUHWQZHQYPN4PT7Y7EDQ/action/replication_record"}},"created_at":"2026-05-18T02:27:44.707056+00:00","updated_at":"2026-05-18T02:27:44.707056+00:00"}