{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:JRHLWU33DXRT5P4ENZJ7KL6QAQ","short_pith_number":"pith:JRHLWU33","schema_version":"1.0","canonical_sha256":"4c4ebb537b1de33ebf846e53f52fd0040d78dc13b6f886cf99e90c922a55c8a3","source":{"kind":"arxiv","id":"1509.07145","version":1},"attestation_state":"computed","paper":{"title":"On the Doubly Sparse Compressed Sensing Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Cedric Tavernier, Grigory Kabatiansky, Serge Vladuts","submitted_at":"2015-09-23T20:26:44Z","abstract_excerpt":"A new variant of the Compressed Sensing problem is investigated when the number of measurements corrupted by errors is upper bounded by some value l but there are no more restrictions on errors. We prove that in this case it is enough to make 2(t+l) measurements, where t is the sparsity of original data. Moreover for this case a rather simple recovery algorithm is proposed. An analog of the Singleton bound from coding theory is derived what proves optimality of the corresponding measurement matrices."},"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":"1509.07145","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-09-23T20:26:44Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"73b0ef1b34f31ba88f4ff9ce85aca5fbcfeb591037a07abe1e7eecb9137a7620","abstract_canon_sha256":"7275ea2b65d3b48e6c6da3c97ee7c18846db1f9c00531c8b315cf7d8c18a12ce"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:32:11.251727Z","signature_b64":"ylmaPfcpUsnGxnmsNOK2mYE+qf2itse/K0m3rQm/iIN2zvJ9UgPW9I2kK3fy44vyt1qCGrGWgMbPQA94YT95DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4c4ebb537b1de33ebf846e53f52fd0040d78dc13b6f886cf99e90c922a55c8a3","last_reissued_at":"2026-05-18T01:32:11.251028Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:32:11.251028Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Doubly Sparse Compressed Sensing Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Cedric Tavernier, Grigory Kabatiansky, Serge Vladuts","submitted_at":"2015-09-23T20:26:44Z","abstract_excerpt":"A new variant of the Compressed Sensing problem is investigated when the number of measurements corrupted by errors is upper bounded by some value l but there are no more restrictions on errors. We prove that in this case it is enough to make 2(t+l) measurements, where t is the sparsity of original data. Moreover for this case a rather simple recovery algorithm is proposed. An analog of the Singleton bound from coding theory is derived what proves optimality of the corresponding measurement matrices."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.07145","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":"1509.07145","created_at":"2026-05-18T01:32:11.251156+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.07145v1","created_at":"2026-05-18T01:32:11.251156+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.07145","created_at":"2026-05-18T01:32:11.251156+00:00"},{"alias_kind":"pith_short_12","alias_value":"JRHLWU33DXRT","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_16","alias_value":"JRHLWU33DXRT5P4E","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_8","alias_value":"JRHLWU33","created_at":"2026-05-18T12:29:27.538025+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/JRHLWU33DXRT5P4ENZJ7KL6QAQ","json":"https://pith.science/pith/JRHLWU33DXRT5P4ENZJ7KL6QAQ.json","graph_json":"https://pith.science/api/pith-number/JRHLWU33DXRT5P4ENZJ7KL6QAQ/graph.json","events_json":"https://pith.science/api/pith-number/JRHLWU33DXRT5P4ENZJ7KL6QAQ/events.json","paper":"https://pith.science/paper/JRHLWU33"},"agent_actions":{"view_html":"https://pith.science/pith/JRHLWU33DXRT5P4ENZJ7KL6QAQ","download_json":"https://pith.science/pith/JRHLWU33DXRT5P4ENZJ7KL6QAQ.json","view_paper":"https://pith.science/paper/JRHLWU33","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.07145&json=true","fetch_graph":"https://pith.science/api/pith-number/JRHLWU33DXRT5P4ENZJ7KL6QAQ/graph.json","fetch_events":"https://pith.science/api/pith-number/JRHLWU33DXRT5P4ENZJ7KL6QAQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JRHLWU33DXRT5P4ENZJ7KL6QAQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JRHLWU33DXRT5P4ENZJ7KL6QAQ/action/storage_attestation","attest_author":"https://pith.science/pith/JRHLWU33DXRT5P4ENZJ7KL6QAQ/action/author_attestation","sign_citation":"https://pith.science/pith/JRHLWU33DXRT5P4ENZJ7KL6QAQ/action/citation_signature","submit_replication":"https://pith.science/pith/JRHLWU33DXRT5P4ENZJ7KL6QAQ/action/replication_record"}},"created_at":"2026-05-18T01:32:11.251156+00:00","updated_at":"2026-05-18T01:32:11.251156+00:00"}