{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:5KZN5K4LNA5RCVWSSERNKNSLUT","short_pith_number":"pith:5KZN5K4L","schema_version":"1.0","canonical_sha256":"eab2deab8b683b1156d29122d5364ba4d9b2a38ca3b51a53ca25686a60c03a76","source":{"kind":"arxiv","id":"1609.02071","version":1},"attestation_state":"computed","paper":{"title":"Quantitative recovery conditions for tree-based compressed sensing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.NA"],"primary_cat":"cs.IT","authors_text":"Andrew Thompson, Coralia Cartis","submitted_at":"2016-08-15T14:37:02Z","abstract_excerpt":"As shown in [Blumensath and Davies 2009, Baraniuk et al. 2010], signals whose wavelet coefficients exhibit a rooted tree structure can be recovered using specially-adapted compressed sensing algorithms from just n=O(k) measurements, where k is the sparsity of the signal. Motivated by these results, we introduce a simplified proportional-dimensional asymptotic framework which enables the quantitative evaluation of recovery guarantees for tree-based compressed sensing. In the context of Gaussian matrices, we apply this framework to existing worst-case analysis of the Iterative Tree Projection (I"},"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":"1609.02071","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-08-15T14:37:02Z","cross_cats_sorted":["math.IT","math.NA"],"title_canon_sha256":"6e944066a82ecf3b38e9660d746d649d12293e6183a5d82f71d167e05b151ed9","abstract_canon_sha256":"274a349d06049fb590b351f2ddfd2c015ca246ed104800330a19cc71f7e80c1c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:05:09.246603Z","signature_b64":"Eu3VsrsWZysim5VyJ55suyshrOhMl/3wazz0kcO7k+S/ahlHBjICdQbeZF6mOdH6hMET+RxkuJC7UlWWAOA5BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eab2deab8b683b1156d29122d5364ba4d9b2a38ca3b51a53ca25686a60c03a76","last_reissued_at":"2026-05-18T01:05:09.246086Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:05:09.246086Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantitative recovery conditions for tree-based compressed sensing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.NA"],"primary_cat":"cs.IT","authors_text":"Andrew Thompson, Coralia Cartis","submitted_at":"2016-08-15T14:37:02Z","abstract_excerpt":"As shown in [Blumensath and Davies 2009, Baraniuk et al. 2010], signals whose wavelet coefficients exhibit a rooted tree structure can be recovered using specially-adapted compressed sensing algorithms from just n=O(k) measurements, where k is the sparsity of the signal. Motivated by these results, we introduce a simplified proportional-dimensional asymptotic framework which enables the quantitative evaluation of recovery guarantees for tree-based compressed sensing. In the context of Gaussian matrices, we apply this framework to existing worst-case analysis of the Iterative Tree Projection (I"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.02071","kind":"arxiv","version":1},"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":"1609.02071","created_at":"2026-05-18T01:05:09.246166+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.02071v1","created_at":"2026-05-18T01:05:09.246166+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.02071","created_at":"2026-05-18T01:05:09.246166+00:00"},{"alias_kind":"pith_short_12","alias_value":"5KZN5K4LNA5R","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_16","alias_value":"5KZN5K4LNA5RCVWS","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_8","alias_value":"5KZN5K4L","created_at":"2026-05-18T12:30:01.593930+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/5KZN5K4LNA5RCVWSSERNKNSLUT","json":"https://pith.science/pith/5KZN5K4LNA5RCVWSSERNKNSLUT.json","graph_json":"https://pith.science/api/pith-number/5KZN5K4LNA5RCVWSSERNKNSLUT/graph.json","events_json":"https://pith.science/api/pith-number/5KZN5K4LNA5RCVWSSERNKNSLUT/events.json","paper":"https://pith.science/paper/5KZN5K4L"},"agent_actions":{"view_html":"https://pith.science/pith/5KZN5K4LNA5RCVWSSERNKNSLUT","download_json":"https://pith.science/pith/5KZN5K4LNA5RCVWSSERNKNSLUT.json","view_paper":"https://pith.science/paper/5KZN5K4L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.02071&json=true","fetch_graph":"https://pith.science/api/pith-number/5KZN5K4LNA5RCVWSSERNKNSLUT/graph.json","fetch_events":"https://pith.science/api/pith-number/5KZN5K4LNA5RCVWSSERNKNSLUT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5KZN5K4LNA5RCVWSSERNKNSLUT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5KZN5K4LNA5RCVWSSERNKNSLUT/action/storage_attestation","attest_author":"https://pith.science/pith/5KZN5K4LNA5RCVWSSERNKNSLUT/action/author_attestation","sign_citation":"https://pith.science/pith/5KZN5K4LNA5RCVWSSERNKNSLUT/action/citation_signature","submit_replication":"https://pith.science/pith/5KZN5K4LNA5RCVWSSERNKNSLUT/action/replication_record"}},"created_at":"2026-05-18T01:05:09.246166+00:00","updated_at":"2026-05-18T01:05:09.246166+00:00"}