{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:OJFF3WT5UGN6OAVCVDONGKJEYK","short_pith_number":"pith:OJFF3WT5","schema_version":"1.0","canonical_sha256":"724a5dda7da19be702a2a8dcd32924c296a034d8c80482a1f0c4034692c7eeeb","source":{"kind":"arxiv","id":"1306.6239","version":2},"attestation_state":"computed","paper":{"title":"Near-Optimal Adaptive Compressed Sensing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","stat.ML"],"primary_cat":"cs.IT","authors_text":"Matthew L. Malloy, Robert D. Nowak","submitted_at":"2013-06-26T13:39:01Z","abstract_excerpt":"This paper proposes a simple adaptive sensing and group testing algorithm for sparse signal recovery. The algorithm, termed Compressive Adaptive Sense and Search (CASS), is shown to be near-optimal in that it succeeds at the lowest possible signal-to-noise-ratio (SNR) levels, improving on previous work in adaptive compressed sensing. Like traditional compressed sensing based on random non-adaptive design matrices, the CASS algorithm requires only k log n measurements to recover a k-sparse signal of dimension n. However, CASS succeeds at SNR levels that are a factor log n less than required by "},"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":"1306.6239","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-06-26T13:39:01Z","cross_cats_sorted":["math.IT","stat.ML"],"title_canon_sha256":"7f51611e282b7585f00f0cd75c4dfec00646b54dc037aca82ca3b00e2d332a4f","abstract_canon_sha256":"6d71d6253eaf3890f64f502d4bdfd4de144558186fa8c31eb4c80f727a4c4e9a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:52:58.446331Z","signature_b64":"tGTeJSZRyStM0/bboqOusneFzfXZ/WZXUUv3zEeYhKQflImuKuuLU9JAuaXCUkQZURVAQ8f1j2ydmlRtgxGKDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"724a5dda7da19be702a2a8dcd32924c296a034d8c80482a1f0c4034692c7eeeb","last_reissued_at":"2026-05-18T02:52:58.445603Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:52:58.445603Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Near-Optimal Adaptive Compressed Sensing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","stat.ML"],"primary_cat":"cs.IT","authors_text":"Matthew L. Malloy, Robert D. Nowak","submitted_at":"2013-06-26T13:39:01Z","abstract_excerpt":"This paper proposes a simple adaptive sensing and group testing algorithm for sparse signal recovery. The algorithm, termed Compressive Adaptive Sense and Search (CASS), is shown to be near-optimal in that it succeeds at the lowest possible signal-to-noise-ratio (SNR) levels, improving on previous work in adaptive compressed sensing. Like traditional compressed sensing based on random non-adaptive design matrices, the CASS algorithm requires only k log n measurements to recover a k-sparse signal of dimension n. However, CASS succeeds at SNR levels that are a factor log n less than required by "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.6239","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":"1306.6239","created_at":"2026-05-18T02:52:58.445707+00:00"},{"alias_kind":"arxiv_version","alias_value":"1306.6239v2","created_at":"2026-05-18T02:52:58.445707+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.6239","created_at":"2026-05-18T02:52:58.445707+00:00"},{"alias_kind":"pith_short_12","alias_value":"OJFF3WT5UGN6","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_16","alias_value":"OJFF3WT5UGN6OAVC","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_8","alias_value":"OJFF3WT5","created_at":"2026-05-18T12:27:54.935989+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/OJFF3WT5UGN6OAVCVDONGKJEYK","json":"https://pith.science/pith/OJFF3WT5UGN6OAVCVDONGKJEYK.json","graph_json":"https://pith.science/api/pith-number/OJFF3WT5UGN6OAVCVDONGKJEYK/graph.json","events_json":"https://pith.science/api/pith-number/OJFF3WT5UGN6OAVCVDONGKJEYK/events.json","paper":"https://pith.science/paper/OJFF3WT5"},"agent_actions":{"view_html":"https://pith.science/pith/OJFF3WT5UGN6OAVCVDONGKJEYK","download_json":"https://pith.science/pith/OJFF3WT5UGN6OAVCVDONGKJEYK.json","view_paper":"https://pith.science/paper/OJFF3WT5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1306.6239&json=true","fetch_graph":"https://pith.science/api/pith-number/OJFF3WT5UGN6OAVCVDONGKJEYK/graph.json","fetch_events":"https://pith.science/api/pith-number/OJFF3WT5UGN6OAVCVDONGKJEYK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OJFF3WT5UGN6OAVCVDONGKJEYK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OJFF3WT5UGN6OAVCVDONGKJEYK/action/storage_attestation","attest_author":"https://pith.science/pith/OJFF3WT5UGN6OAVCVDONGKJEYK/action/author_attestation","sign_citation":"https://pith.science/pith/OJFF3WT5UGN6OAVCVDONGKJEYK/action/citation_signature","submit_replication":"https://pith.science/pith/OJFF3WT5UGN6OAVCVDONGKJEYK/action/replication_record"}},"created_at":"2026-05-18T02:52:58.445707+00:00","updated_at":"2026-05-18T02:52:58.445707+00:00"}