{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:H4D3YHVASQSDWSACPVJNXMOWE3","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":"7251e26afcb9786fd3807bae02add24e3bba00eca3c56fe939d9efe8440b851d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-12-04T19:44:16Z","title_canon_sha256":"155470b158b6c4a4bfc9675ae70afbbfa6f6d3b7c3d50c1852d7260e96dadcba"},"schema_version":"1.0","source":{"id":"1112.0789","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.0789","created_at":"2026-05-18T00:58:18Z"},{"alias_kind":"arxiv_version","alias_value":"1112.0789v1","created_at":"2026-05-18T00:58:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.0789","created_at":"2026-05-18T00:58:18Z"},{"alias_kind":"pith_short_12","alias_value":"H4D3YHVASQSD","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_16","alias_value":"H4D3YHVASQSDWSAC","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_8","alias_value":"H4D3YHVA","created_at":"2026-05-18T12:26:30Z"}],"graph_snapshots":[{"event_id":"sha256:141bed2c39cddf6c2293f079c7c665ce04376d4a73e780f71adf263befa59d17","target":"graph","created_at":"2026-05-18T00:58:18Z","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"},"paper":{"abstract_excerpt":"Let A be an n by m matrix with m>n, and suppose that the underdetermined linear system As=x admits a sparse solution s0 for which ||s0||_0 < 1/2 spark(A). Such a sparse solution is unique due to a well-known uniqueness theorem. Suppose now that we have somehow a solution s_hat as an estimation of s0, and suppose that s_hat is only `approximately sparse', that is, many of its components are very small and nearly zero, but not mathematically equal to zero. Is such a solution necessarily close to the true sparsest solution? More generally, is it possible to construct an upper bound on the estimat","authors_text":"Christian Jutten, Hosein Mohimani, Massoud Babaie-Zadeh","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-12-04T19:44:16Z","title":"On the error of estimating the sparsest solution of underdetermined linear systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.0789","kind":"arxiv","version":1},"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:9fdbb80b9e01cd47389257b3d812a856542b816541112dc11f5fd3c6a1fd45b4","target":"record","created_at":"2026-05-18T00:58:18Z","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":"7251e26afcb9786fd3807bae02add24e3bba00eca3c56fe939d9efe8440b851d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-12-04T19:44:16Z","title_canon_sha256":"155470b158b6c4a4bfc9675ae70afbbfa6f6d3b7c3d50c1852d7260e96dadcba"},"schema_version":"1.0","source":{"id":"1112.0789","kind":"arxiv","version":1}},"canonical_sha256":"3f07bc1ea094243b48027d52dbb1d626d5e0e8881b6e99cd36375469c2998836","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3f07bc1ea094243b48027d52dbb1d626d5e0e8881b6e99cd36375469c2998836","first_computed_at":"2026-05-18T00:58:18.584106Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:18.584106Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6wBMqjUHr5h85oQ3H5JWMt4qT3Xg97VRtYMgqXiXEr4odUePlZelCXTPmzZEfhBM90U3jkm8Vggr5+lLLe+rAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:18.584849Z","signed_message":"canonical_sha256_bytes"},"source_id":"1112.0789","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9fdbb80b9e01cd47389257b3d812a856542b816541112dc11f5fd3c6a1fd45b4","sha256:141bed2c39cddf6c2293f079c7c665ce04376d4a73e780f71adf263befa59d17"],"state_sha256":"4ff9ddb0a5965b24ad3d6ea76a167132c1fa6db1228090fd2d2ab83c071ee578"}