{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:FPCS72EPPZ7K2FVJZEEGPRP3FP","short_pith_number":"pith:FPCS72EP","schema_version":"1.0","canonical_sha256":"2bc52fe88f7e7ead16a9c90867c5fb2bc5672e90e22a3ff21f2ca598ba00e134","source":{"kind":"arxiv","id":"1606.07231","version":1},"attestation_state":"computed","paper":{"title":"A Compact Formulation for the $\\ell_{2,1}$ Mixed-Norm Minimization Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Christian Steffens, Marc E. Pfetsch, Marius Pesavento","submitted_at":"2016-06-23T08:59:20Z","abstract_excerpt":"Parameter estimation from multiple measurement vectors (MMVs) is a fundamental problem in many signal processing applications, e.g., spectral analysis and direction-of- arrival estimation. Recently, this problem has been address using prior information in form of a jointly sparse signal structure. A prominent approach for exploiting joint sparsity considers mixed-norm minimization in which, however, the problem size grows with the number of measurements and the desired resolution, respectively. In this work we derive an equivalent, compact reformulation of the $\\ell_{2,1}$ mixed-norm minimizat"},"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":"1606.07231","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-06-23T08:59:20Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"670d6d8d0c11603b1c411601c8ce4737620cdb7915a262856d2e1aa0635b7477","abstract_canon_sha256":"1f7e9905bc38441b79a1cf0c337b672e5fd7005d3fca562222f3f43d916c4ecc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:58.414948Z","signature_b64":"TucqF0eW01Z1UrcWlYXQHG0FhsqlLAf6Rv5D9NMlUpkRxTClC2mUO2if7Lpmc00SfoGlluBcMimGWKa/wi70DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2bc52fe88f7e7ead16a9c90867c5fb2bc5672e90e22a3ff21f2ca598ba00e134","last_reissued_at":"2026-05-18T01:11:58.414609Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:58.414609Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Compact Formulation for the $\\ell_{2,1}$ Mixed-Norm Minimization Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Christian Steffens, Marc E. Pfetsch, Marius Pesavento","submitted_at":"2016-06-23T08:59:20Z","abstract_excerpt":"Parameter estimation from multiple measurement vectors (MMVs) is a fundamental problem in many signal processing applications, e.g., spectral analysis and direction-of- arrival estimation. Recently, this problem has been address using prior information in form of a jointly sparse signal structure. A prominent approach for exploiting joint sparsity considers mixed-norm minimization in which, however, the problem size grows with the number of measurements and the desired resolution, respectively. In this work we derive an equivalent, compact reformulation of the $\\ell_{2,1}$ mixed-norm minimizat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.07231","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":"1606.07231","created_at":"2026-05-18T01:11:58.414663+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.07231v1","created_at":"2026-05-18T01:11:58.414663+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.07231","created_at":"2026-05-18T01:11:58.414663+00:00"},{"alias_kind":"pith_short_12","alias_value":"FPCS72EPPZ7K","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_16","alias_value":"FPCS72EPPZ7K2FVJ","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_8","alias_value":"FPCS72EP","created_at":"2026-05-18T12:30:15.759754+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/FPCS72EPPZ7K2FVJZEEGPRP3FP","json":"https://pith.science/pith/FPCS72EPPZ7K2FVJZEEGPRP3FP.json","graph_json":"https://pith.science/api/pith-number/FPCS72EPPZ7K2FVJZEEGPRP3FP/graph.json","events_json":"https://pith.science/api/pith-number/FPCS72EPPZ7K2FVJZEEGPRP3FP/events.json","paper":"https://pith.science/paper/FPCS72EP"},"agent_actions":{"view_html":"https://pith.science/pith/FPCS72EPPZ7K2FVJZEEGPRP3FP","download_json":"https://pith.science/pith/FPCS72EPPZ7K2FVJZEEGPRP3FP.json","view_paper":"https://pith.science/paper/FPCS72EP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.07231&json=true","fetch_graph":"https://pith.science/api/pith-number/FPCS72EPPZ7K2FVJZEEGPRP3FP/graph.json","fetch_events":"https://pith.science/api/pith-number/FPCS72EPPZ7K2FVJZEEGPRP3FP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FPCS72EPPZ7K2FVJZEEGPRP3FP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FPCS72EPPZ7K2FVJZEEGPRP3FP/action/storage_attestation","attest_author":"https://pith.science/pith/FPCS72EPPZ7K2FVJZEEGPRP3FP/action/author_attestation","sign_citation":"https://pith.science/pith/FPCS72EPPZ7K2FVJZEEGPRP3FP/action/citation_signature","submit_replication":"https://pith.science/pith/FPCS72EPPZ7K2FVJZEEGPRP3FP/action/replication_record"}},"created_at":"2026-05-18T01:11:58.414663+00:00","updated_at":"2026-05-18T01:11:58.414663+00:00"}