{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:4NM3PC6QYEGFXE3OVOLCWP243V","short_pith_number":"pith:4NM3PC6Q","schema_version":"1.0","canonical_sha256":"e359b78bd0c10c5b936eab962b3f5cdd69dc0d86c4d536cb076c9462638c2973","source":{"kind":"arxiv","id":"1910.05652","version":2},"attestation_state":"computed","paper":{"title":"What is the Largest Sparsity Pattern that Can Be Recovered by 1-Norm Minimization?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"eess.SP","authors_text":"Daniel P. Robinson, Enrique Mallada, Mengnan Zhao, Mustafa D. Kaba, Rene Vidal","submitted_at":"2019-10-12T21:54:28Z","abstract_excerpt":"Much of the existing literature in sparse recovery is concerned with the following question: given a sparsity pattern and a corresponding regularizer, derive conditions on the dictionary under which exact recovery is possible. In this paper, we study the opposite question: given a dictionary and the 1-norm regularizer, find the largest sparsity pattern that can be recovered. We show that such a pattern is described by a mathematical object called a \"maximum abstract simplicial complex\", and provide two different characterizations of this object: one based on extreme points and the other based "},"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":"1910.05652","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2019-10-12T21:54:28Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"4ef6f6250e5bc30b7266416d68f0ef2d015774933b852eb189a9a8f1ea53fe7f","abstract_canon_sha256":"8b37707a89b27992bc9d9041a95ac93785aac60abba588cdb7f5b6b11618c543"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:21:34.972946Z","signature_b64":"lS9pr8XEd7LEQ6ROLJE99Sgg/X84COiWdptCvSDlJurygya+3WwEcLptFIIcpoz741+xRrrvPDwFQMPpOLTpAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e359b78bd0c10c5b936eab962b3f5cdd69dc0d86c4d536cb076c9462638c2973","last_reissued_at":"2026-07-05T01:21:34.972593Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:21:34.972593Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"What is the Largest Sparsity Pattern that Can Be Recovered by 1-Norm Minimization?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"eess.SP","authors_text":"Daniel P. Robinson, Enrique Mallada, Mengnan Zhao, Mustafa D. Kaba, Rene Vidal","submitted_at":"2019-10-12T21:54:28Z","abstract_excerpt":"Much of the existing literature in sparse recovery is concerned with the following question: given a sparsity pattern and a corresponding regularizer, derive conditions on the dictionary under which exact recovery is possible. In this paper, we study the opposite question: given a dictionary and the 1-norm regularizer, find the largest sparsity pattern that can be recovered. We show that such a pattern is described by a mathematical object called a \"maximum abstract simplicial complex\", and provide two different characterizations of this object: one based on extreme points and the other based "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1910.05652","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/1910.05652/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":"1910.05652","created_at":"2026-07-05T01:21:34.972655+00:00"},{"alias_kind":"arxiv_version","alias_value":"1910.05652v2","created_at":"2026-07-05T01:21:34.972655+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1910.05652","created_at":"2026-07-05T01:21:34.972655+00:00"},{"alias_kind":"pith_short_12","alias_value":"4NM3PC6QYEGF","created_at":"2026-07-05T01:21:34.972655+00:00"},{"alias_kind":"pith_short_16","alias_value":"4NM3PC6QYEGFXE3O","created_at":"2026-07-05T01:21:34.972655+00:00"},{"alias_kind":"pith_short_8","alias_value":"4NM3PC6Q","created_at":"2026-07-05T01:21:34.972655+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/4NM3PC6QYEGFXE3OVOLCWP243V","json":"https://pith.science/pith/4NM3PC6QYEGFXE3OVOLCWP243V.json","graph_json":"https://pith.science/api/pith-number/4NM3PC6QYEGFXE3OVOLCWP243V/graph.json","events_json":"https://pith.science/api/pith-number/4NM3PC6QYEGFXE3OVOLCWP243V/events.json","paper":"https://pith.science/paper/4NM3PC6Q"},"agent_actions":{"view_html":"https://pith.science/pith/4NM3PC6QYEGFXE3OVOLCWP243V","download_json":"https://pith.science/pith/4NM3PC6QYEGFXE3OVOLCWP243V.json","view_paper":"https://pith.science/paper/4NM3PC6Q","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1910.05652&json=true","fetch_graph":"https://pith.science/api/pith-number/4NM3PC6QYEGFXE3OVOLCWP243V/graph.json","fetch_events":"https://pith.science/api/pith-number/4NM3PC6QYEGFXE3OVOLCWP243V/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4NM3PC6QYEGFXE3OVOLCWP243V/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4NM3PC6QYEGFXE3OVOLCWP243V/action/storage_attestation","attest_author":"https://pith.science/pith/4NM3PC6QYEGFXE3OVOLCWP243V/action/author_attestation","sign_citation":"https://pith.science/pith/4NM3PC6QYEGFXE3OVOLCWP243V/action/citation_signature","submit_replication":"https://pith.science/pith/4NM3PC6QYEGFXE3OVOLCWP243V/action/replication_record"}},"created_at":"2026-07-05T01:21:34.972655+00:00","updated_at":"2026-07-05T01:21:34.972655+00:00"}