{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:5WY3HWOECKFSJO6KSBNO7JDWVD","short_pith_number":"pith:5WY3HWOE","schema_version":"1.0","canonical_sha256":"edb1b3d9c4128b24bbca905aefa476a8cc9d569471ec6d18831e3078c3b586aa","source":{"kind":"arxiv","id":"1211.4657","version":2},"attestation_state":"computed","paper":{"title":"Forest Sparsity for Multi-channel Compressive Sensing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.IT","math.IT","stat.ML"],"primary_cat":"cs.LG","authors_text":"Chen Chen, Junzhou Huang, Yeqing Li","submitted_at":"2012-11-20T03:22:45Z","abstract_excerpt":"In this paper, we investigate a new compressive sensing model for multi-channel sparse data where each channel can be represented as a hierarchical tree and different channels are highly correlated. Therefore, the full data could follow the forest structure and we call this property as \\emph{forest sparsity}. It exploits both intra- and inter- channel correlations and enriches the family of existing model-based compressive sensing theories. The proposed theory indicates that only $\\mathcal{O}(Tk+\\log(N/k))$ measurements are required for multi-channel data with forest sparsity, where $T$ is the"},"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":"1211.4657","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-11-20T03:22:45Z","cross_cats_sorted":["cs.CV","cs.IT","math.IT","stat.ML"],"title_canon_sha256":"41e5056c9f19ed6d85e5ff07989cba1ab003ceb06d994e5348aab437c4a4f04b","abstract_canon_sha256":"bf8077e3938438e76e3b0624e758b8dd50ede8f070ddfade590c7028fdaa5b33"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:52:49.665080Z","signature_b64":"sPAecTQxZ3KokS3/aCN/upKBEbjvRypNC29Kgizunm81mHNT6wpGu5I3Lu+6uYbl2XxUPWsNLsirYr6QzYmJAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"edb1b3d9c4128b24bbca905aefa476a8cc9d569471ec6d18831e3078c3b586aa","last_reissued_at":"2026-05-18T02:52:49.664710Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:52:49.664710Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Forest Sparsity for Multi-channel Compressive Sensing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.IT","math.IT","stat.ML"],"primary_cat":"cs.LG","authors_text":"Chen Chen, Junzhou Huang, Yeqing Li","submitted_at":"2012-11-20T03:22:45Z","abstract_excerpt":"In this paper, we investigate a new compressive sensing model for multi-channel sparse data where each channel can be represented as a hierarchical tree and different channels are highly correlated. Therefore, the full data could follow the forest structure and we call this property as \\emph{forest sparsity}. It exploits both intra- and inter- channel correlations and enriches the family of existing model-based compressive sensing theories. The proposed theory indicates that only $\\mathcal{O}(Tk+\\log(N/k))$ measurements are required for multi-channel data with forest sparsity, where $T$ is the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.4657","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":"1211.4657","created_at":"2026-05-18T02:52:49.664766+00:00"},{"alias_kind":"arxiv_version","alias_value":"1211.4657v2","created_at":"2026-05-18T02:52:49.664766+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.4657","created_at":"2026-05-18T02:52:49.664766+00:00"},{"alias_kind":"pith_short_12","alias_value":"5WY3HWOECKFS","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_16","alias_value":"5WY3HWOECKFSJO6K","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_8","alias_value":"5WY3HWOE","created_at":"2026-05-18T12:26:56.085431+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/5WY3HWOECKFSJO6KSBNO7JDWVD","json":"https://pith.science/pith/5WY3HWOECKFSJO6KSBNO7JDWVD.json","graph_json":"https://pith.science/api/pith-number/5WY3HWOECKFSJO6KSBNO7JDWVD/graph.json","events_json":"https://pith.science/api/pith-number/5WY3HWOECKFSJO6KSBNO7JDWVD/events.json","paper":"https://pith.science/paper/5WY3HWOE"},"agent_actions":{"view_html":"https://pith.science/pith/5WY3HWOECKFSJO6KSBNO7JDWVD","download_json":"https://pith.science/pith/5WY3HWOECKFSJO6KSBNO7JDWVD.json","view_paper":"https://pith.science/paper/5WY3HWOE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1211.4657&json=true","fetch_graph":"https://pith.science/api/pith-number/5WY3HWOECKFSJO6KSBNO7JDWVD/graph.json","fetch_events":"https://pith.science/api/pith-number/5WY3HWOECKFSJO6KSBNO7JDWVD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5WY3HWOECKFSJO6KSBNO7JDWVD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5WY3HWOECKFSJO6KSBNO7JDWVD/action/storage_attestation","attest_author":"https://pith.science/pith/5WY3HWOECKFSJO6KSBNO7JDWVD/action/author_attestation","sign_citation":"https://pith.science/pith/5WY3HWOECKFSJO6KSBNO7JDWVD/action/citation_signature","submit_replication":"https://pith.science/pith/5WY3HWOECKFSJO6KSBNO7JDWVD/action/replication_record"}},"created_at":"2026-05-18T02:52:49.664766+00:00","updated_at":"2026-05-18T02:52:49.664766+00:00"}