{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:DHTNQSGUHWQZHQYPN4PT7Y7EDQ","short_pith_number":"pith:DHTNQSGU","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"},"canonical_sha256":"19e6d848d43da193c30f6f1f3fe3e41c156d85f6c84e08e7ec0139408ffed5ef","source":{"kind":"arxiv","id":"1403.2807","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.2807","created_at":"2026-05-18T02:27:44Z"},{"alias_kind":"arxiv_version","alias_value":"1403.2807v2","created_at":"2026-05-18T02:27:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.2807","created_at":"2026-05-18T02:27:44Z"},{"alias_kind":"pith_short_12","alias_value":"DHTNQSGUHWQZ","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"DHTNQSGUHWQZHQYP","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"DHTNQSGU","created_at":"2026-05-18T12:28:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:DHTNQSGUHWQZHQYPN4PT7Y7EDQ","target":"record","payload":{"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"},"canonical_sha256":"19e6d848d43da193c30f6f1f3fe3e41c156d85f6c84e08e7ec0139408ffed5ef","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"},"source_kind":"arxiv","source_id":"1403.2807","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-18T02:27:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8snFobmkCEpZkt+ELyPgZN2Q/4DUntajYPgz1pRDNbQq5N7h7veLKdLzg8jTg4nTH2wnlZJ97012Nh4qCXgVCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T05:41:19.822016Z"},"content_sha256":"298a7c0524754f68487057fc8f693f50a7e6ea9bbf48f7449139d0222cfb7d45","schema_version":"1.0","event_id":"sha256:298a7c0524754f68487057fc8f693f50a7e6ea9bbf48f7449139d0222cfb7d45"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:DHTNQSGUHWQZHQYPN4PT7Y7EDQ","target":"graph","payload":{"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"},"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:27:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RW2hrk7gd5FcULO67VMxLgJ0UJbG0nCfomKhAfj80o1hqb8ACMGgLyvICVczV/Dy+tkUeOalIf6TIN/XQciACg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T05:41:19.822384Z"},"content_sha256":"199fe2012d62f664ab6c20684cabd2f0ad30f1c0bb6ec7286c904d367b08c33f","schema_version":"1.0","event_id":"sha256:199fe2012d62f664ab6c20684cabd2f0ad30f1c0bb6ec7286c904d367b08c33f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DHTNQSGUHWQZHQYPN4PT7Y7EDQ/bundle.json","state_url":"https://pith.science/pith/DHTNQSGUHWQZHQYPN4PT7Y7EDQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DHTNQSGUHWQZHQYPN4PT7Y7EDQ/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-01T05:41:19Z","links":{"resolver":"https://pith.science/pith/DHTNQSGUHWQZHQYPN4PT7Y7EDQ","bundle":"https://pith.science/pith/DHTNQSGUHWQZHQYPN4PT7Y7EDQ/bundle.json","state":"https://pith.science/pith/DHTNQSGUHWQZHQYPN4PT7Y7EDQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DHTNQSGUHWQZHQYPN4PT7Y7EDQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:DHTNQSGUHWQZHQYPN4PT7Y7EDQ","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":"fe0d2713e9ee4b2e1b392b613a0d4da367666ed548e057145fe00e6fc00ffb33","cross_cats_sorted":["math.CO","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.FA","submitted_at":"2014-03-12T04:28:42Z","title_canon_sha256":"fbfcaf253b28968a9c0f18034f0f63e3895a48d3b0f6f26bd933d75a75ac235a"},"schema_version":"1.0","source":{"id":"1403.2807","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.2807","created_at":"2026-05-18T02:27:44Z"},{"alias_kind":"arxiv_version","alias_value":"1403.2807v2","created_at":"2026-05-18T02:27:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.2807","created_at":"2026-05-18T02:27:44Z"},{"alias_kind":"pith_short_12","alias_value":"DHTNQSGUHWQZ","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"DHTNQSGUHWQZHQYP","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"DHTNQSGU","created_at":"2026-05-18T12:28:25Z"}],"graph_snapshots":[{"event_id":"sha256:199fe2012d62f664ab6c20684cabd2f0ad30f1c0bb6ec7286c904d367b08c33f","target":"graph","created_at":"2026-05-18T02:27:44Z","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":"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 ","authors_text":"Darryn Bryant, Padraig \\'O Cath\\'ain","cross_cats":["math.CO","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.FA","submitted_at":"2014-03-12T04:28:42Z","title":"An asymptotic existence result on compressed sensing matrices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.2807","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:298a7c0524754f68487057fc8f693f50a7e6ea9bbf48f7449139d0222cfb7d45","target":"record","created_at":"2026-05-18T02:27:44Z","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":"fe0d2713e9ee4b2e1b392b613a0d4da367666ed548e057145fe00e6fc00ffb33","cross_cats_sorted":["math.CO","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.FA","submitted_at":"2014-03-12T04:28:42Z","title_canon_sha256":"fbfcaf253b28968a9c0f18034f0f63e3895a48d3b0f6f26bd933d75a75ac235a"},"schema_version":"1.0","source":{"id":"1403.2807","kind":"arxiv","version":2}},"canonical_sha256":"19e6d848d43da193c30f6f1f3fe3e41c156d85f6c84e08e7ec0139408ffed5ef","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"19e6d848d43da193c30f6f1f3fe3e41c156d85f6c84e08e7ec0139408ffed5ef","first_computed_at":"2026-05-18T02:27:44.706991Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:27:44.706991Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"F6X+AmeK8W7gHBOqb/FhKi8k6nkEDyIlrdYATNDld1rAEATH7g52vczaQlhnnqwNtei6enyntCO6Vaa1JjNvDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:27:44.707441Z","signed_message":"canonical_sha256_bytes"},"source_id":"1403.2807","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:298a7c0524754f68487057fc8f693f50a7e6ea9bbf48f7449139d0222cfb7d45","sha256:199fe2012d62f664ab6c20684cabd2f0ad30f1c0bb6ec7286c904d367b08c33f"],"state_sha256":"3cd904e51467f79b2c79a1fb592842e3fb71ea856ff186b1909b48c866ed5337"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EmqgUrNxs8HmD47wAxmOLzlS9z+qNIjirvfDfUaI/NyUylzL3r8ut7uwZC+WwDFRGlLzEhgb1nqGgbH9bquUCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T05:41:19.824413Z","bundle_sha256":"e010fa39133d5ed22c547630d0d7daef613e33b5c095b2795262e05a7e2fd59a"}}