{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:HPWZWUBVLRY25DDFDZTFQXB7M5","short_pith_number":"pith:HPWZWUBV","schema_version":"1.0","canonical_sha256":"3bed9b50355c71ae8c651e66585c3f6747bcd1e82e3f9eeda26e53181b3765da","source":{"kind":"arxiv","id":"1303.3207","version":4},"attestation_state":"computed","paper":{"title":"Group-Sparse Model Selection: Hardness and Relaxations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","stat.ML"],"primary_cat":"cs.LG","authors_text":"Anastasios Kyrillidis, Luca Baldassarre, Nirav Bhan, Siddhartha Satpathi, Volkan Cevher","submitted_at":"2013-03-13T16:22:03Z","abstract_excerpt":"Group-based sparsity models are proven instrumental in linear regression problems for recovering signals from much fewer measurements than standard compressive sensing. The main promise of these models is the recovery of \"interpretable\" signals through the identification of their constituent groups. In this paper, we establish a combinatorial framework for group-model selection problems and highlight the underlying tractability issues. In particular, we show that the group-model selection problem is equivalent to the well-known NP-hard weighted maximum coverage problem (WMC). Leveraging a grap"},"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":"1303.3207","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-03-13T16:22:03Z","cross_cats_sorted":["cs.IT","math.IT","stat.ML"],"title_canon_sha256":"caa235703d04a09ba523902df6ccf5932cd8f57aaaf0bbde00e2defa91191417","abstract_canon_sha256":"9ade0092ab7f0e620bff345ceaed74e2400b557a9a1864d40a47fa29d169bcaf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:25:40.596121Z","signature_b64":"1m7ThgPEj3LOVJ9TpiryauFLn0TC17UMNofC7n3Ke9v7zlZQAbwZyXJ82KBJSai9YS8HDOmbVebq1OIqcrvCBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3bed9b50355c71ae8c651e66585c3f6747bcd1e82e3f9eeda26e53181b3765da","last_reissued_at":"2026-05-18T02:25:40.595626Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:25:40.595626Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Group-Sparse Model Selection: Hardness and Relaxations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","stat.ML"],"primary_cat":"cs.LG","authors_text":"Anastasios Kyrillidis, Luca Baldassarre, Nirav Bhan, Siddhartha Satpathi, Volkan Cevher","submitted_at":"2013-03-13T16:22:03Z","abstract_excerpt":"Group-based sparsity models are proven instrumental in linear regression problems for recovering signals from much fewer measurements than standard compressive sensing. The main promise of these models is the recovery of \"interpretable\" signals through the identification of their constituent groups. In this paper, we establish a combinatorial framework for group-model selection problems and highlight the underlying tractability issues. In particular, we show that the group-model selection problem is equivalent to the well-known NP-hard weighted maximum coverage problem (WMC). Leveraging a grap"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.3207","kind":"arxiv","version":4},"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":"1303.3207","created_at":"2026-05-18T02:25:40.595703+00:00"},{"alias_kind":"arxiv_version","alias_value":"1303.3207v4","created_at":"2026-05-18T02:25:40.595703+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.3207","created_at":"2026-05-18T02:25:40.595703+00:00"},{"alias_kind":"pith_short_12","alias_value":"HPWZWUBVLRY2","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_16","alias_value":"HPWZWUBVLRY25DDF","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_8","alias_value":"HPWZWUBV","created_at":"2026-05-18T12:27:46.883200+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/HPWZWUBVLRY25DDFDZTFQXB7M5","json":"https://pith.science/pith/HPWZWUBVLRY25DDFDZTFQXB7M5.json","graph_json":"https://pith.science/api/pith-number/HPWZWUBVLRY25DDFDZTFQXB7M5/graph.json","events_json":"https://pith.science/api/pith-number/HPWZWUBVLRY25DDFDZTFQXB7M5/events.json","paper":"https://pith.science/paper/HPWZWUBV"},"agent_actions":{"view_html":"https://pith.science/pith/HPWZWUBVLRY25DDFDZTFQXB7M5","download_json":"https://pith.science/pith/HPWZWUBVLRY25DDFDZTFQXB7M5.json","view_paper":"https://pith.science/paper/HPWZWUBV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1303.3207&json=true","fetch_graph":"https://pith.science/api/pith-number/HPWZWUBVLRY25DDFDZTFQXB7M5/graph.json","fetch_events":"https://pith.science/api/pith-number/HPWZWUBVLRY25DDFDZTFQXB7M5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HPWZWUBVLRY25DDFDZTFQXB7M5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HPWZWUBVLRY25DDFDZTFQXB7M5/action/storage_attestation","attest_author":"https://pith.science/pith/HPWZWUBVLRY25DDFDZTFQXB7M5/action/author_attestation","sign_citation":"https://pith.science/pith/HPWZWUBVLRY25DDFDZTFQXB7M5/action/citation_signature","submit_replication":"https://pith.science/pith/HPWZWUBVLRY25DDFDZTFQXB7M5/action/replication_record"}},"created_at":"2026-05-18T02:25:40.595703+00:00","updated_at":"2026-05-18T02:25:40.595703+00:00"}