{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2006:LAGRYL4JW7IWKMRVLTS2GNLFVF","short_pith_number":"pith:LAGRYL4J","schema_version":"1.0","canonical_sha256":"580d1c2f89b7d16532355ce5a33565a96df3c7c77106c0e7cb98faf9058bcb92","source":{"kind":"arxiv","id":"math/0608124","version":2},"attestation_state":"computed","paper":{"title":"Recovery algorithms for vector valued data with joint sparsity constraints","license":"","headline":"","cross_cats":["cs.NA","math.FA"],"primary_cat":"math.NA","authors_text":"Holger Rauhut, Massimo Fornasier","submitted_at":"2006-08-04T16:42:45Z","abstract_excerpt":"Vector valued data appearing in concrete applications often possess sparse expansions with respect to a preassigned frame for each vector component individually. Additionally, different components may also exhibit common sparsity patterns. Recently, there were introduced sparsity measures that take into account such joint sparsity patterns, promoting coupling of non-vanishing components. These measures are typically constructed as weighted $\\ell_1$ norms of componentwise $\\ell_q$ norms of frame coefficients. We show how to compute solutions of linear inverse problems with such joint sparsity r"},"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":"math/0608124","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"math.NA","submitted_at":"2006-08-04T16:42:45Z","cross_cats_sorted":["cs.NA","math.FA"],"title_canon_sha256":"ea94f67110be74b727c845a54fe1efe45e08c993c6df11a134802337449e8e2c","abstract_canon_sha256":"4bd80b2c55acfeb46867d1a0820d9d030a830d519ebd099b48b93a4426244d11"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-03T22:06:20.329792Z","signature_b64":"4bS6emfpMnMAX5/ChKkBqPi+5ZpbAxOQbdTHdNK8ViHDF9zPNdcUojx9JK60OfD45FNEzU9VJ8Zt5Tc4KyaCBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"580d1c2f89b7d16532355ce5a33565a96df3c7c77106c0e7cb98faf9058bcb92","last_reissued_at":"2026-06-03T22:06:20.329370Z","signature_status":"signed_v1","first_computed_at":"2026-06-03T22:06:20.329370Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Recovery algorithms for vector valued data with joint sparsity constraints","license":"","headline":"","cross_cats":["cs.NA","math.FA"],"primary_cat":"math.NA","authors_text":"Holger Rauhut, Massimo Fornasier","submitted_at":"2006-08-04T16:42:45Z","abstract_excerpt":"Vector valued data appearing in concrete applications often possess sparse expansions with respect to a preassigned frame for each vector component individually. Additionally, different components may also exhibit common sparsity patterns. Recently, there were introduced sparsity measures that take into account such joint sparsity patterns, promoting coupling of non-vanishing components. These measures are typically constructed as weighted $\\ell_1$ norms of componentwise $\\ell_q$ norms of frame coefficients. We show how to compute solutions of linear inverse problems with such joint sparsity r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0608124","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/math/0608124/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"math/0608124","created_at":"2026-06-03T22:06:20.329432+00:00"},{"alias_kind":"arxiv_version","alias_value":"math/0608124v2","created_at":"2026-06-03T22:06:20.329432+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0608124","created_at":"2026-06-03T22:06:20.329432+00:00"},{"alias_kind":"pith_short_12","alias_value":"LAGRYL4JW7IW","created_at":"2026-06-03T22:06:20.329432+00:00"},{"alias_kind":"pith_short_16","alias_value":"LAGRYL4JW7IWKMRV","created_at":"2026-06-03T22:06:20.329432+00:00"},{"alias_kind":"pith_short_8","alias_value":"LAGRYL4J","created_at":"2026-06-03T22:06:20.329432+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/LAGRYL4JW7IWKMRVLTS2GNLFVF","json":"https://pith.science/pith/LAGRYL4JW7IWKMRVLTS2GNLFVF.json","graph_json":"https://pith.science/api/pith-number/LAGRYL4JW7IWKMRVLTS2GNLFVF/graph.json","events_json":"https://pith.science/api/pith-number/LAGRYL4JW7IWKMRVLTS2GNLFVF/events.json","paper":"https://pith.science/paper/LAGRYL4J"},"agent_actions":{"view_html":"https://pith.science/pith/LAGRYL4JW7IWKMRVLTS2GNLFVF","download_json":"https://pith.science/pith/LAGRYL4JW7IWKMRVLTS2GNLFVF.json","view_paper":"https://pith.science/paper/LAGRYL4J","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=math/0608124&json=true","fetch_graph":"https://pith.science/api/pith-number/LAGRYL4JW7IWKMRVLTS2GNLFVF/graph.json","fetch_events":"https://pith.science/api/pith-number/LAGRYL4JW7IWKMRVLTS2GNLFVF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LAGRYL4JW7IWKMRVLTS2GNLFVF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LAGRYL4JW7IWKMRVLTS2GNLFVF/action/storage_attestation","attest_author":"https://pith.science/pith/LAGRYL4JW7IWKMRVLTS2GNLFVF/action/author_attestation","sign_citation":"https://pith.science/pith/LAGRYL4JW7IWKMRVLTS2GNLFVF/action/citation_signature","submit_replication":"https://pith.science/pith/LAGRYL4JW7IWKMRVLTS2GNLFVF/action/replication_record"}},"created_at":"2026-06-03T22:06:20.329432+00:00","updated_at":"2026-06-03T22:06:20.329432+00:00"}