{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:DWRAR7X2PFISDDV3YEXX4CRFUZ","short_pith_number":"pith:DWRAR7X2","schema_version":"1.0","canonical_sha256":"1da208fefa7951218ebbc12f7e0a25a655a834cb27a84b119e04fcf86c6c456c","source":{"kind":"arxiv","id":"1309.2460","version":1},"attestation_state":"computed","paper":{"title":"Computing and Analyzing Recoverable Supports for Sparse Reconstruction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","math.CO"],"primary_cat":"math.OC","authors_text":"Christian Kruschel, Dirk A. Lorenz","submitted_at":"2013-09-10T11:24:24Z","abstract_excerpt":"Designing computational experiments involving $\\ell_1$ minimization with linear constraints in a finite-dimensional, real-valued space for receiving a sparse solution with a precise number $k$ of nonzero entries is, in general, difficult. Several conditions were introduced which guarantee that, for small $k$ and for certain matrices, simply placing entries with desired characteristics on a randomly chosen support will produce vectors which can be recovered by $\\ell_1$ minimization.\n  In this work, we consider the case of large $k$ and propose both a methodology to quickly check whether a given"},"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":"1309.2460","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-09-10T11:24:24Z","cross_cats_sorted":["cs.CG","math.CO"],"title_canon_sha256":"e521291291dd200ffd4f02379fd04f731f86a2c714ee5d05c6e574c3da452df7","abstract_canon_sha256":"7e6cefb5f7eaf10a3b2a4974ac5fe80158184179f9bb933809245155f75be0e3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:13:44.604301Z","signature_b64":"irT3IGDK4mhxMta7VXeeTyOJpf63xILaTRK1eOh8u5GCOW2xOX5sr0mHHC2pCHwO8CYMFjM21b5DLuGgQuf/DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1da208fefa7951218ebbc12f7e0a25a655a834cb27a84b119e04fcf86c6c456c","last_reissued_at":"2026-05-18T03:13:44.603598Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:13:44.603598Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computing and Analyzing Recoverable Supports for Sparse Reconstruction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","math.CO"],"primary_cat":"math.OC","authors_text":"Christian Kruschel, Dirk A. Lorenz","submitted_at":"2013-09-10T11:24:24Z","abstract_excerpt":"Designing computational experiments involving $\\ell_1$ minimization with linear constraints in a finite-dimensional, real-valued space for receiving a sparse solution with a precise number $k$ of nonzero entries is, in general, difficult. Several conditions were introduced which guarantee that, for small $k$ and for certain matrices, simply placing entries with desired characteristics on a randomly chosen support will produce vectors which can be recovered by $\\ell_1$ minimization.\n  In this work, we consider the case of large $k$ and propose both a methodology to quickly check whether a given"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.2460","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":"1309.2460","created_at":"2026-05-18T03:13:44.603737+00:00"},{"alias_kind":"arxiv_version","alias_value":"1309.2460v1","created_at":"2026-05-18T03:13:44.603737+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.2460","created_at":"2026-05-18T03:13:44.603737+00:00"},{"alias_kind":"pith_short_12","alias_value":"DWRAR7X2PFIS","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_16","alias_value":"DWRAR7X2PFISDDV3","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_8","alias_value":"DWRAR7X2","created_at":"2026-05-18T12:27:43.054852+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/DWRAR7X2PFISDDV3YEXX4CRFUZ","json":"https://pith.science/pith/DWRAR7X2PFISDDV3YEXX4CRFUZ.json","graph_json":"https://pith.science/api/pith-number/DWRAR7X2PFISDDV3YEXX4CRFUZ/graph.json","events_json":"https://pith.science/api/pith-number/DWRAR7X2PFISDDV3YEXX4CRFUZ/events.json","paper":"https://pith.science/paper/DWRAR7X2"},"agent_actions":{"view_html":"https://pith.science/pith/DWRAR7X2PFISDDV3YEXX4CRFUZ","download_json":"https://pith.science/pith/DWRAR7X2PFISDDV3YEXX4CRFUZ.json","view_paper":"https://pith.science/paper/DWRAR7X2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1309.2460&json=true","fetch_graph":"https://pith.science/api/pith-number/DWRAR7X2PFISDDV3YEXX4CRFUZ/graph.json","fetch_events":"https://pith.science/api/pith-number/DWRAR7X2PFISDDV3YEXX4CRFUZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DWRAR7X2PFISDDV3YEXX4CRFUZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DWRAR7X2PFISDDV3YEXX4CRFUZ/action/storage_attestation","attest_author":"https://pith.science/pith/DWRAR7X2PFISDDV3YEXX4CRFUZ/action/author_attestation","sign_citation":"https://pith.science/pith/DWRAR7X2PFISDDV3YEXX4CRFUZ/action/citation_signature","submit_replication":"https://pith.science/pith/DWRAR7X2PFISDDV3YEXX4CRFUZ/action/replication_record"}},"created_at":"2026-05-18T03:13:44.603737+00:00","updated_at":"2026-05-18T03:13:44.603737+00:00"}