{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:OJFF3WT5UGN6OAVCVDONGKJEYK","short_pith_number":"pith:OJFF3WT5","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"},"canonical_sha256":"724a5dda7da19be702a2a8dcd32924c296a034d8c80482a1f0c4034692c7eeeb","source":{"kind":"arxiv","id":"1306.6239","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.6239","created_at":"2026-05-18T02:52:58Z"},{"alias_kind":"arxiv_version","alias_value":"1306.6239v2","created_at":"2026-05-18T02:52:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.6239","created_at":"2026-05-18T02:52:58Z"},{"alias_kind":"pith_short_12","alias_value":"OJFF3WT5UGN6","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"OJFF3WT5UGN6OAVC","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"OJFF3WT5","created_at":"2026-05-18T12:27:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:OJFF3WT5UGN6OAVCVDONGKJEYK","target":"record","payload":{"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"},"canonical_sha256":"724a5dda7da19be702a2a8dcd32924c296a034d8c80482a1f0c4034692c7eeeb","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"},"source_kind":"arxiv","source_id":"1306.6239","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:52:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"itIbPU2gqKb6k9Agjwv0qxG9dEiSKBbUKS77liJglx7w3DBeYf1rlNAl7ggrjWxpfUUJXlQhQ8+wmmu3GQNeBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T16:39:30.933094Z"},"content_sha256":"32341f90965d826c774d85c8db69b730cdacc4df600fa05a958828aab4d05190","schema_version":"1.0","event_id":"sha256:32341f90965d826c774d85c8db69b730cdacc4df600fa05a958828aab4d05190"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:OJFF3WT5UGN6OAVCVDONGKJEYK","target":"graph","payload":{"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"},"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:52:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gfZFwnQddrqFLx0VPpm6pbEOSuoy9qJKAeetJR7ZLMR3S1iXgFs04oFlJ1xs6yXhw1GsgQRFrWPmsQFg7IqMDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T16:39:30.933760Z"},"content_sha256":"b5601969fe68860c2c1e2654b0a1b40c86fa36663a9697e7c20b1a23c6d571ec","schema_version":"1.0","event_id":"sha256:b5601969fe68860c2c1e2654b0a1b40c86fa36663a9697e7c20b1a23c6d571ec"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OJFF3WT5UGN6OAVCVDONGKJEYK/bundle.json","state_url":"https://pith.science/pith/OJFF3WT5UGN6OAVCVDONGKJEYK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OJFF3WT5UGN6OAVCVDONGKJEYK/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-05-25T16:39:30Z","links":{"resolver":"https://pith.science/pith/OJFF3WT5UGN6OAVCVDONGKJEYK","bundle":"https://pith.science/pith/OJFF3WT5UGN6OAVCVDONGKJEYK/bundle.json","state":"https://pith.science/pith/OJFF3WT5UGN6OAVCVDONGKJEYK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OJFF3WT5UGN6OAVCVDONGKJEYK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:OJFF3WT5UGN6OAVCVDONGKJEYK","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":"6d71d6253eaf3890f64f502d4bdfd4de144558186fa8c31eb4c80f727a4c4e9a","cross_cats_sorted":["math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-06-26T13:39:01Z","title_canon_sha256":"7f51611e282b7585f00f0cd75c4dfec00646b54dc037aca82ca3b00e2d332a4f"},"schema_version":"1.0","source":{"id":"1306.6239","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.6239","created_at":"2026-05-18T02:52:58Z"},{"alias_kind":"arxiv_version","alias_value":"1306.6239v2","created_at":"2026-05-18T02:52:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.6239","created_at":"2026-05-18T02:52:58Z"},{"alias_kind":"pith_short_12","alias_value":"OJFF3WT5UGN6","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"OJFF3WT5UGN6OAVC","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"OJFF3WT5","created_at":"2026-05-18T12:27:54Z"}],"graph_snapshots":[{"event_id":"sha256:b5601969fe68860c2c1e2654b0a1b40c86fa36663a9697e7c20b1a23c6d571ec","target":"graph","created_at":"2026-05-18T02:52:58Z","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":"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 ","authors_text":"Matthew L. Malloy, Robert D. Nowak","cross_cats":["math.IT","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-06-26T13:39:01Z","title":"Near-Optimal Adaptive Compressed Sensing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.6239","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:32341f90965d826c774d85c8db69b730cdacc4df600fa05a958828aab4d05190","target":"record","created_at":"2026-05-18T02:52:58Z","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":"6d71d6253eaf3890f64f502d4bdfd4de144558186fa8c31eb4c80f727a4c4e9a","cross_cats_sorted":["math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-06-26T13:39:01Z","title_canon_sha256":"7f51611e282b7585f00f0cd75c4dfec00646b54dc037aca82ca3b00e2d332a4f"},"schema_version":"1.0","source":{"id":"1306.6239","kind":"arxiv","version":2}},"canonical_sha256":"724a5dda7da19be702a2a8dcd32924c296a034d8c80482a1f0c4034692c7eeeb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"724a5dda7da19be702a2a8dcd32924c296a034d8c80482a1f0c4034692c7eeeb","first_computed_at":"2026-05-18T02:52:58.445603Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:52:58.445603Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tGTeJSZRyStM0/bboqOusneFzfXZ/WZXUUv3zEeYhKQflImuKuuLU9JAuaXCUkQZURVAQ8f1j2ydmlRtgxGKDw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:52:58.446331Z","signed_message":"canonical_sha256_bytes"},"source_id":"1306.6239","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:32341f90965d826c774d85c8db69b730cdacc4df600fa05a958828aab4d05190","sha256:b5601969fe68860c2c1e2654b0a1b40c86fa36663a9697e7c20b1a23c6d571ec"],"state_sha256":"65baf48c31212eb44bd0b6ef70d7ef550c6bb0f3eb0a681d814b1045bccf7ece"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qzlx7xY9Dy9VKfVmuaIZ7RsZKxUCCxXBZc9lxeKjHpmYWFEdSf8wnXkELv7neCrfelByNvWmA3eyFRvSoI9rDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T16:39:30.937526Z","bundle_sha256":"68d6a5376fa408415cd30912074ab66c80f196b1c5732a789c8a0f9f0715c9b3"}}