{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:NXH2BYHSNKWMMKTULWITJONDOD","short_pith_number":"pith:NXH2BYHS","schema_version":"1.0","canonical_sha256":"6dcfa0e0f26aacc62a745d9134b9a370db10e0ed944fd365cba20c73669c6feb","source":{"kind":"arxiv","id":"1506.03523","version":4},"attestation_state":"computed","paper":{"title":"Sparsification of Matrices and Compressed Sensing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Fintan Hegarty, Padraig \\'O Cath\\'ain, Yunbin Zhao","submitted_at":"2015-06-11T01:05:21Z","abstract_excerpt":"Compressed sensing is a signal processing technique whereby the limits imposed by the Shannon--Nyquist theorem can be exceeded provided certain conditions are imposed on the signal. Such conditions occur in many real-world scenarios, and compressed sensing has emerging applications in medical imaging, big data, and statistics. Finding practical matrix constructions and computationally efficient recovery algorithms for compressed sensing is an area of intense research interest. Many probabilistic matrix constructions have been proposed, and it is now well known that matrices with entries drawn "},"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":"1506.03523","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-06-11T01:05:21Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"00e517c29c20a457f0599509ecb6667640234b880320cae6b0c8778f4c1271ea","abstract_canon_sha256":"8b33325453b9938d4d80db31973b9bf77692c70d8413c1df6f8d1f20efa63a61"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:23:17.386587Z","signature_b64":"tOpknXGdMPWh5Mfrypg9hZHHxfnIdoT1S5OlEjQCNGJ9gc78C5+Djdb1kWhq/dx5CdFEupeKIcmDuXQQDnLbCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6dcfa0e0f26aacc62a745d9134b9a370db10e0ed944fd365cba20c73669c6feb","last_reissued_at":"2026-05-18T00:23:17.385897Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:23:17.385897Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sparsification of Matrices and Compressed Sensing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Fintan Hegarty, Padraig \\'O Cath\\'ain, Yunbin Zhao","submitted_at":"2015-06-11T01:05:21Z","abstract_excerpt":"Compressed sensing is a signal processing technique whereby the limits imposed by the Shannon--Nyquist theorem can be exceeded provided certain conditions are imposed on the signal. Such conditions occur in many real-world scenarios, and compressed sensing has emerging applications in medical imaging, big data, and statistics. Finding practical matrix constructions and computationally efficient recovery algorithms for compressed sensing is an area of intense research interest. Many probabilistic matrix constructions have been proposed, and it is now well known that matrices with entries drawn "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.03523","kind":"arxiv","version":4},"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":"1506.03523","created_at":"2026-05-18T00:23:17.385989+00:00"},{"alias_kind":"arxiv_version","alias_value":"1506.03523v4","created_at":"2026-05-18T00:23:17.385989+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.03523","created_at":"2026-05-18T00:23:17.385989+00:00"},{"alias_kind":"pith_short_12","alias_value":"NXH2BYHSNKWM","created_at":"2026-05-18T12:29:34.919912+00:00"},{"alias_kind":"pith_short_16","alias_value":"NXH2BYHSNKWMMKTU","created_at":"2026-05-18T12:29:34.919912+00:00"},{"alias_kind":"pith_short_8","alias_value":"NXH2BYHS","created_at":"2026-05-18T12:29:34.919912+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/NXH2BYHSNKWMMKTULWITJONDOD","json":"https://pith.science/pith/NXH2BYHSNKWMMKTULWITJONDOD.json","graph_json":"https://pith.science/api/pith-number/NXH2BYHSNKWMMKTULWITJONDOD/graph.json","events_json":"https://pith.science/api/pith-number/NXH2BYHSNKWMMKTULWITJONDOD/events.json","paper":"https://pith.science/paper/NXH2BYHS"},"agent_actions":{"view_html":"https://pith.science/pith/NXH2BYHSNKWMMKTULWITJONDOD","download_json":"https://pith.science/pith/NXH2BYHSNKWMMKTULWITJONDOD.json","view_paper":"https://pith.science/paper/NXH2BYHS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1506.03523&json=true","fetch_graph":"https://pith.science/api/pith-number/NXH2BYHSNKWMMKTULWITJONDOD/graph.json","fetch_events":"https://pith.science/api/pith-number/NXH2BYHSNKWMMKTULWITJONDOD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NXH2BYHSNKWMMKTULWITJONDOD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NXH2BYHSNKWMMKTULWITJONDOD/action/storage_attestation","attest_author":"https://pith.science/pith/NXH2BYHSNKWMMKTULWITJONDOD/action/author_attestation","sign_citation":"https://pith.science/pith/NXH2BYHSNKWMMKTULWITJONDOD/action/citation_signature","submit_replication":"https://pith.science/pith/NXH2BYHSNKWMMKTULWITJONDOD/action/replication_record"}},"created_at":"2026-05-18T00:23:17.385989+00:00","updated_at":"2026-05-18T00:23:17.385989+00:00"}