{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:H4D3YHVASQSDWSACPVJNXMOWE3","short_pith_number":"pith:H4D3YHVA","schema_version":"1.0","canonical_sha256":"3f07bc1ea094243b48027d52dbb1d626d5e0e8881b6e99cd36375469c2998836","source":{"kind":"arxiv","id":"1112.0789","version":1},"attestation_state":"computed","paper":{"title":"On the error of estimating the sparsest solution of underdetermined linear systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Christian Jutten, Hosein Mohimani, Massoud Babaie-Zadeh","submitted_at":"2011-12-04T19:44:16Z","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"},"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":"1112.0789","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-12-04T19:44:16Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"155470b158b6c4a4bfc9675ae70afbbfa6f6d3b7c3d50c1852d7260e96dadcba","abstract_canon_sha256":"7251e26afcb9786fd3807bae02add24e3bba00eca3c56fe939d9efe8440b851d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:18.584849Z","signature_b64":"6wBMqjUHr5h85oQ3H5JWMt4qT3Xg97VRtYMgqXiXEr4odUePlZelCXTPmzZEfhBM90U3jkm8Vggr5+lLLe+rAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3f07bc1ea094243b48027d52dbb1d626d5e0e8881b6e99cd36375469c2998836","last_reissued_at":"2026-05-18T00:58:18.584106Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:18.584106Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the error of estimating the sparsest solution of underdetermined linear systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Christian Jutten, Hosein Mohimani, Massoud Babaie-Zadeh","submitted_at":"2011-12-04T19:44:16Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.0789","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":"1112.0789","created_at":"2026-05-18T00:58:18.584211+00:00"},{"alias_kind":"arxiv_version","alias_value":"1112.0789v1","created_at":"2026-05-18T00:58:18.584211+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.0789","created_at":"2026-05-18T00:58:18.584211+00:00"},{"alias_kind":"pith_short_12","alias_value":"H4D3YHVASQSD","created_at":"2026-05-18T12:26:30.835961+00:00"},{"alias_kind":"pith_short_16","alias_value":"H4D3YHVASQSDWSAC","created_at":"2026-05-18T12:26:30.835961+00:00"},{"alias_kind":"pith_short_8","alias_value":"H4D3YHVA","created_at":"2026-05-18T12:26:30.835961+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/H4D3YHVASQSDWSACPVJNXMOWE3","json":"https://pith.science/pith/H4D3YHVASQSDWSACPVJNXMOWE3.json","graph_json":"https://pith.science/api/pith-number/H4D3YHVASQSDWSACPVJNXMOWE3/graph.json","events_json":"https://pith.science/api/pith-number/H4D3YHVASQSDWSACPVJNXMOWE3/events.json","paper":"https://pith.science/paper/H4D3YHVA"},"agent_actions":{"view_html":"https://pith.science/pith/H4D3YHVASQSDWSACPVJNXMOWE3","download_json":"https://pith.science/pith/H4D3YHVASQSDWSACPVJNXMOWE3.json","view_paper":"https://pith.science/paper/H4D3YHVA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1112.0789&json=true","fetch_graph":"https://pith.science/api/pith-number/H4D3YHVASQSDWSACPVJNXMOWE3/graph.json","fetch_events":"https://pith.science/api/pith-number/H4D3YHVASQSDWSACPVJNXMOWE3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/H4D3YHVASQSDWSACPVJNXMOWE3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/H4D3YHVASQSDWSACPVJNXMOWE3/action/storage_attestation","attest_author":"https://pith.science/pith/H4D3YHVASQSDWSACPVJNXMOWE3/action/author_attestation","sign_citation":"https://pith.science/pith/H4D3YHVASQSDWSACPVJNXMOWE3/action/citation_signature","submit_replication":"https://pith.science/pith/H4D3YHVASQSDWSACPVJNXMOWE3/action/replication_record"}},"created_at":"2026-05-18T00:58:18.584211+00:00","updated_at":"2026-05-18T00:58:18.584211+00:00"}