{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:4T376IN2R5L46YHKN7Z3KVU7PQ","short_pith_number":"pith:4T376IN2","schema_version":"1.0","canonical_sha256":"e4f7ff21ba8f57cf60ea6ff3b5569f7c08cb3b4d4ec3878b34e96b6de32a394f","source":{"kind":"arxiv","id":"1002.4458","version":4},"attestation_state":"computed","paper":{"title":"Approximate Sparsity Pattern Recovery: Information-Theoretic Lower Bounds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Galen Reeves, Michael Gastpar","submitted_at":"2010-02-24T02:54:37Z","abstract_excerpt":"Recovery of the sparsity pattern (or support) of an unknown sparse vector from a small number of noisy linear measurements is an important problem in compressed sensing. In this paper, the high-dimensional setting is considered. It is shown that if the measurement rate and per-sample signal-to-noise ratio (SNR) are finite constants independent of the length of the vector, then the optimal sparsity pattern estimate will have a constant fraction of errors. Lower bounds on the measurement rate needed to attain a desired fraction of errors are given in terms of the SNR and various key parameters o"},"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":"1002.4458","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-02-24T02:54:37Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"17dbdf84512690fbcc0b121b34c5a7938a0836a9fcc52517105cf7834a64fc4d","abstract_canon_sha256":"15021d4efb02fdefe7e87698438522f42d2990b3ba060a34ce807fcfb5bc701b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:34:36.064434Z","signature_b64":"vW8JZxn6lBc3936tu0hWDiEPFwxlMcg1N/8u+eQTajHp+Khj3AeCYy2M0SsykmYMLmgOF307Gf22BQi9U1BLBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e4f7ff21ba8f57cf60ea6ff3b5569f7c08cb3b4d4ec3878b34e96b6de32a394f","last_reissued_at":"2026-05-18T03:34:36.063824Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:34:36.063824Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximate Sparsity Pattern Recovery: Information-Theoretic Lower Bounds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Galen Reeves, Michael Gastpar","submitted_at":"2010-02-24T02:54:37Z","abstract_excerpt":"Recovery of the sparsity pattern (or support) of an unknown sparse vector from a small number of noisy linear measurements is an important problem in compressed sensing. In this paper, the high-dimensional setting is considered. It is shown that if the measurement rate and per-sample signal-to-noise ratio (SNR) are finite constants independent of the length of the vector, then the optimal sparsity pattern estimate will have a constant fraction of errors. Lower bounds on the measurement rate needed to attain a desired fraction of errors are given in terms of the SNR and various key parameters o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1002.4458","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":"1002.4458","created_at":"2026-05-18T03:34:36.063915+00:00"},{"alias_kind":"arxiv_version","alias_value":"1002.4458v4","created_at":"2026-05-18T03:34:36.063915+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1002.4458","created_at":"2026-05-18T03:34:36.063915+00:00"},{"alias_kind":"pith_short_12","alias_value":"4T376IN2R5L4","created_at":"2026-05-18T12:26:04.259169+00:00"},{"alias_kind":"pith_short_16","alias_value":"4T376IN2R5L46YHK","created_at":"2026-05-18T12:26:04.259169+00:00"},{"alias_kind":"pith_short_8","alias_value":"4T376IN2","created_at":"2026-05-18T12:26:04.259169+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/4T376IN2R5L46YHKN7Z3KVU7PQ","json":"https://pith.science/pith/4T376IN2R5L46YHKN7Z3KVU7PQ.json","graph_json":"https://pith.science/api/pith-number/4T376IN2R5L46YHKN7Z3KVU7PQ/graph.json","events_json":"https://pith.science/api/pith-number/4T376IN2R5L46YHKN7Z3KVU7PQ/events.json","paper":"https://pith.science/paper/4T376IN2"},"agent_actions":{"view_html":"https://pith.science/pith/4T376IN2R5L46YHKN7Z3KVU7PQ","download_json":"https://pith.science/pith/4T376IN2R5L46YHKN7Z3KVU7PQ.json","view_paper":"https://pith.science/paper/4T376IN2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1002.4458&json=true","fetch_graph":"https://pith.science/api/pith-number/4T376IN2R5L46YHKN7Z3KVU7PQ/graph.json","fetch_events":"https://pith.science/api/pith-number/4T376IN2R5L46YHKN7Z3KVU7PQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4T376IN2R5L46YHKN7Z3KVU7PQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4T376IN2R5L46YHKN7Z3KVU7PQ/action/storage_attestation","attest_author":"https://pith.science/pith/4T376IN2R5L46YHKN7Z3KVU7PQ/action/author_attestation","sign_citation":"https://pith.science/pith/4T376IN2R5L46YHKN7Z3KVU7PQ/action/citation_signature","submit_replication":"https://pith.science/pith/4T376IN2R5L46YHKN7Z3KVU7PQ/action/replication_record"}},"created_at":"2026-05-18T03:34:36.063915+00:00","updated_at":"2026-05-18T03:34:36.063915+00:00"}