{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:4NM3PC6QYEGFXE3OVOLCWP243V","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"8b37707a89b27992bc9d9041a95ac93785aac60abba588cdb7f5b6b11618c543","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2019-10-12T21:54:28Z","title_canon_sha256":"4ef6f6250e5bc30b7266416d68f0ef2d015774933b852eb189a9a8f1ea53fe7f"},"schema_version":"1.0","source":{"id":"1910.05652","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1910.05652","created_at":"2026-07-05T01:21:34Z"},{"alias_kind":"arxiv_version","alias_value":"1910.05652v2","created_at":"2026-07-05T01:21:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1910.05652","created_at":"2026-07-05T01:21:34Z"},{"alias_kind":"pith_short_12","alias_value":"4NM3PC6QYEGF","created_at":"2026-07-05T01:21:34Z"},{"alias_kind":"pith_short_16","alias_value":"4NM3PC6QYEGFXE3O","created_at":"2026-07-05T01:21:34Z"},{"alias_kind":"pith_short_8","alias_value":"4NM3PC6Q","created_at":"2026-07-05T01:21:34Z"}],"graph_snapshots":[{"event_id":"sha256:a93cd219c136aa83d614d7fb6da416dd8d2fc73db2faea073c51682fe849419c","target":"graph","created_at":"2026-07-05T01:21:34Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1910.05652/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 ","authors_text":"Daniel P. Robinson, Enrique Mallada, Mengnan Zhao, Mustafa D. Kaba, Rene Vidal","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2019-10-12T21:54:28Z","title":"What is the Largest Sparsity Pattern that Can Be Recovered by 1-Norm Minimization?"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1910.05652","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:b6ca4652553e841d77b472a1f2c06df00df44aefc1c7f6700404220d84aedafb","target":"record","created_at":"2026-07-05T01:21:34Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"8b37707a89b27992bc9d9041a95ac93785aac60abba588cdb7f5b6b11618c543","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2019-10-12T21:54:28Z","title_canon_sha256":"4ef6f6250e5bc30b7266416d68f0ef2d015774933b852eb189a9a8f1ea53fe7f"},"schema_version":"1.0","source":{"id":"1910.05652","kind":"arxiv","version":2}},"canonical_sha256":"e359b78bd0c10c5b936eab962b3f5cdd69dc0d86c4d536cb076c9462638c2973","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e359b78bd0c10c5b936eab962b3f5cdd69dc0d86c4d536cb076c9462638c2973","first_computed_at":"2026-07-05T01:21:34.972593Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:21:34.972593Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lS9pr8XEd7LEQ6ROLJE99Sgg/X84COiWdptCvSDlJurygya+3WwEcLptFIIcpoz741+xRrrvPDwFQMPpOLTpAw==","signature_status":"signed_v1","signed_at":"2026-07-05T01:21:34.972946Z","signed_message":"canonical_sha256_bytes"},"source_id":"1910.05652","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b6ca4652553e841d77b472a1f2c06df00df44aefc1c7f6700404220d84aedafb","sha256:a93cd219c136aa83d614d7fb6da416dd8d2fc73db2faea073c51682fe849419c"],"state_sha256":"e4fe9ddb3ae31adaa139e9ce2d7f410977d8d3c994be93caf4c5d72e390f06a3"}