{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:BFL4QY2GFIOWYWAII4UVZU35QR","short_pith_number":"pith:BFL4QY2G","canonical_record":{"source":{"id":"1111.6923","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2011-11-29T18:31:54Z","cross_cats_sorted":["cs.CV","cs.IT","math.IT","math.PR","stat.AP"],"title_canon_sha256":"6a5f755dac85f33b5e50a41319295dd04ad236e55e080759f68e4709868c32ce","abstract_canon_sha256":"90456bc81199a791b8428ce819d6dbdbe522dd33ea4e8e5dca956399d87bab8d"},"schema_version":"1.0"},"canonical_sha256":"0957c863462a1d6c580847295cd37d844aa106a962d9f5b408587d540d68217f","source":{"kind":"arxiv","id":"1111.6923","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.6923","created_at":"2026-05-18T04:07:28Z"},{"alias_kind":"arxiv_version","alias_value":"1111.6923v1","created_at":"2026-05-18T04:07:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.6923","created_at":"2026-05-18T04:07:28Z"},{"alias_kind":"pith_short_12","alias_value":"BFL4QY2GFIOW","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"BFL4QY2GFIOWYWAI","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"BFL4QY2G","created_at":"2026-05-18T12:26:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:BFL4QY2GFIOWYWAII4UVZU35QR","target":"record","payload":{"canonical_record":{"source":{"id":"1111.6923","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2011-11-29T18:31:54Z","cross_cats_sorted":["cs.CV","cs.IT","math.IT","math.PR","stat.AP"],"title_canon_sha256":"6a5f755dac85f33b5e50a41319295dd04ad236e55e080759f68e4709868c32ce","abstract_canon_sha256":"90456bc81199a791b8428ce819d6dbdbe522dd33ea4e8e5dca956399d87bab8d"},"schema_version":"1.0"},"canonical_sha256":"0957c863462a1d6c580847295cd37d844aa106a962d9f5b408587d540d68217f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:07:28.239448Z","signature_b64":"34W8LWj9XfCi7etcW8kn+Bv1VnorXlsAyxvmw8/3B3xHKXXPoHXVClQCIjlKm9Ha46AwEDlAvEURGHu+SdLvBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0957c863462a1d6c580847295cd37d844aa106a962d9f5b408587d540d68217f","last_reissued_at":"2026-05-18T04:07:28.238976Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:07:28.238976Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1111.6923","source_version":1,"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-18T04:07:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HQEGHGkqWJmiRSFpY5dRLk5WpGItDrUL9cGXv/zWcwtPliCvPI+SicO3OfwA8ob5JKZ1NJWIDHM9VnDKsp1OBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T02:24:47.720730Z"},"content_sha256":"b9d17f4162a685207f8bbcb63da4527e6a498ed9371bf01fd957227064052027","schema_version":"1.0","event_id":"sha256:b9d17f4162a685207f8bbcb63da4527e6a498ed9371bf01fd957227064052027"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:BFL4QY2GFIOWYWAII4UVZU35QR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Adaptive Compressive Sensing Using Sparse Hierarchical Learned Dictionaries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.IT","math.IT","math.PR","stat.AP"],"primary_cat":"stat.ML","authors_text":"Akshay Soni, Jarvis Haupt","submitted_at":"2011-11-29T18:31:54Z","abstract_excerpt":"Recent breakthrough results in compressed sensing (CS) have established that many high dimensional objects can be accurately recovered from a relatively small number of non- adaptive linear projection observations, provided that the objects possess a sparse representation in some basis. Subsequent efforts have shown that the performance of CS can be improved by exploiting the structure in the location of the non-zero signal coefficients (structured sparsity) or using some form of online measurement focusing (adaptivity) in the sensing process. In this paper we examine a powerful hybrid of thes"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.6923","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"},"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-18T04:07:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UmYacDxa8ylkdsVg2I+rplPGwYC9Sz91nzHiYqb4nxrugncWa47Aw5wuG6h4vwb+a9cuNV42VruqGmrW7+ygCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T02:24:47.721135Z"},"content_sha256":"31f9a934313b5bcdac349df2411e94a9aa418603410d04e7caf4dde439da09b2","schema_version":"1.0","event_id":"sha256:31f9a934313b5bcdac349df2411e94a9aa418603410d04e7caf4dde439da09b2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BFL4QY2GFIOWYWAII4UVZU35QR/bundle.json","state_url":"https://pith.science/pith/BFL4QY2GFIOWYWAII4UVZU35QR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BFL4QY2GFIOWYWAII4UVZU35QR/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-26T02:24:47Z","links":{"resolver":"https://pith.science/pith/BFL4QY2GFIOWYWAII4UVZU35QR","bundle":"https://pith.science/pith/BFL4QY2GFIOWYWAII4UVZU35QR/bundle.json","state":"https://pith.science/pith/BFL4QY2GFIOWYWAII4UVZU35QR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BFL4QY2GFIOWYWAII4UVZU35QR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:BFL4QY2GFIOWYWAII4UVZU35QR","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":"90456bc81199a791b8428ce819d6dbdbe522dd33ea4e8e5dca956399d87bab8d","cross_cats_sorted":["cs.CV","cs.IT","math.IT","math.PR","stat.AP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2011-11-29T18:31:54Z","title_canon_sha256":"6a5f755dac85f33b5e50a41319295dd04ad236e55e080759f68e4709868c32ce"},"schema_version":"1.0","source":{"id":"1111.6923","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.6923","created_at":"2026-05-18T04:07:28Z"},{"alias_kind":"arxiv_version","alias_value":"1111.6923v1","created_at":"2026-05-18T04:07:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.6923","created_at":"2026-05-18T04:07:28Z"},{"alias_kind":"pith_short_12","alias_value":"BFL4QY2GFIOW","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"BFL4QY2GFIOWYWAI","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"BFL4QY2G","created_at":"2026-05-18T12:26:24Z"}],"graph_snapshots":[{"event_id":"sha256:31f9a934313b5bcdac349df2411e94a9aa418603410d04e7caf4dde439da09b2","target":"graph","created_at":"2026-05-18T04:07:28Z","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":"Recent breakthrough results in compressed sensing (CS) have established that many high dimensional objects can be accurately recovered from a relatively small number of non- adaptive linear projection observations, provided that the objects possess a sparse representation in some basis. Subsequent efforts have shown that the performance of CS can be improved by exploiting the structure in the location of the non-zero signal coefficients (structured sparsity) or using some form of online measurement focusing (adaptivity) in the sensing process. In this paper we examine a powerful hybrid of thes","authors_text":"Akshay Soni, Jarvis Haupt","cross_cats":["cs.CV","cs.IT","math.IT","math.PR","stat.AP"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2011-11-29T18:31:54Z","title":"Efficient Adaptive Compressive Sensing Using Sparse Hierarchical Learned Dictionaries"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.6923","kind":"arxiv","version":1},"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:b9d17f4162a685207f8bbcb63da4527e6a498ed9371bf01fd957227064052027","target":"record","created_at":"2026-05-18T04:07:28Z","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":"90456bc81199a791b8428ce819d6dbdbe522dd33ea4e8e5dca956399d87bab8d","cross_cats_sorted":["cs.CV","cs.IT","math.IT","math.PR","stat.AP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2011-11-29T18:31:54Z","title_canon_sha256":"6a5f755dac85f33b5e50a41319295dd04ad236e55e080759f68e4709868c32ce"},"schema_version":"1.0","source":{"id":"1111.6923","kind":"arxiv","version":1}},"canonical_sha256":"0957c863462a1d6c580847295cd37d844aa106a962d9f5b408587d540d68217f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0957c863462a1d6c580847295cd37d844aa106a962d9f5b408587d540d68217f","first_computed_at":"2026-05-18T04:07:28.238976Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:07:28.238976Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"34W8LWj9XfCi7etcW8kn+Bv1VnorXlsAyxvmw8/3B3xHKXXPoHXVClQCIjlKm9Ha46AwEDlAvEURGHu+SdLvBg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:07:28.239448Z","signed_message":"canonical_sha256_bytes"},"source_id":"1111.6923","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b9d17f4162a685207f8bbcb63da4527e6a498ed9371bf01fd957227064052027","sha256:31f9a934313b5bcdac349df2411e94a9aa418603410d04e7caf4dde439da09b2"],"state_sha256":"3887ae252934df17b11001aae6dc7c9f582cd038a1c1129e072657b7be58bb7c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fUpr4otr4lZzIF6lW7/94qgq7NFLJ7/uDtNFoaiyzq1Xp8KPBXntwTP1u8kkrVaMJKJ2iIFGp9oS05B3eIX5AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T02:24:47.724031Z","bundle_sha256":"cd070a8d8fa6a86d90e9e791fe9ff30d5c65b8015403b5ee270eb38941081497"}}