{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:QKB7QMWXBATXH5X5ST7P7LL4XV","short_pith_number":"pith:QKB7QMWX","schema_version":"1.0","canonical_sha256":"8283f832d7082773f6fd94feffad7cbd6d3ef98cbaa33b493a082ba8f3b108c9","source":{"kind":"arxiv","id":"1903.03650","version":2},"attestation_state":"computed","paper":{"title":"SAT-based Compressive Sensing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Milton Halem, Ramin Ayanzadeh, Tim Finin","submitted_at":"2019-03-06T06:53:38Z","abstract_excerpt":"We propose to reduce the original well-posed problem of compressive sensing to weighted-MAX-SAT. Compressive sensing is a novel randomized data acquisition approach that linearly samples sparse or compressible signals at a rate much below the Nyquist-Shannon sampling rate. The original problem of compressive sensing in sparse recovery is NP-hard; therefore, in addition to restrictions for the uniqueness of the sparse solution, the coding matrix has also to satisfy additional stringent constraints -usually the restricted isometry property (RIP)- so we can handle it by its convex or nonconvex re"},"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":"1903.03650","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-03-06T06:53:38Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"2be32a4a5272493fc83ccf56c3d6d6fa9d65ab17b637c4f9ddbe1d044e5be63d","abstract_canon_sha256":"03089855c15226874f82eb16a132a9952d920ce39717211e63eb7ca9e3ea6b29"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:09.111749Z","signature_b64":"4/9ytu0XdeRCmtsBD9kjK0K7cs4IHDCfgNgaRHsd0p+iYhHSvBCCZvRUkzXQRe1EecjDa6GCNLkfJSr8nAmGBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8283f832d7082773f6fd94feffad7cbd6d3ef98cbaa33b493a082ba8f3b108c9","last_reissued_at":"2026-05-17T23:45:09.111087Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:09.111087Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"SAT-based Compressive Sensing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Milton Halem, Ramin Ayanzadeh, Tim Finin","submitted_at":"2019-03-06T06:53:38Z","abstract_excerpt":"We propose to reduce the original well-posed problem of compressive sensing to weighted-MAX-SAT. Compressive sensing is a novel randomized data acquisition approach that linearly samples sparse or compressible signals at a rate much below the Nyquist-Shannon sampling rate. The original problem of compressive sensing in sparse recovery is NP-hard; therefore, in addition to restrictions for the uniqueness of the sparse solution, the coding matrix has also to satisfy additional stringent constraints -usually the restricted isometry property (RIP)- so we can handle it by its convex or nonconvex re"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.03650","kind":"arxiv","version":2},"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":"1903.03650","created_at":"2026-05-17T23:45:09.111170+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.03650v2","created_at":"2026-05-17T23:45:09.111170+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.03650","created_at":"2026-05-17T23:45:09.111170+00:00"},{"alias_kind":"pith_short_12","alias_value":"QKB7QMWXBATX","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_16","alias_value":"QKB7QMWXBATXH5X5","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_8","alias_value":"QKB7QMWX","created_at":"2026-05-18T12:33:27.125529+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/QKB7QMWXBATXH5X5ST7P7LL4XV","json":"https://pith.science/pith/QKB7QMWXBATXH5X5ST7P7LL4XV.json","graph_json":"https://pith.science/api/pith-number/QKB7QMWXBATXH5X5ST7P7LL4XV/graph.json","events_json":"https://pith.science/api/pith-number/QKB7QMWXBATXH5X5ST7P7LL4XV/events.json","paper":"https://pith.science/paper/QKB7QMWX"},"agent_actions":{"view_html":"https://pith.science/pith/QKB7QMWXBATXH5X5ST7P7LL4XV","download_json":"https://pith.science/pith/QKB7QMWXBATXH5X5ST7P7LL4XV.json","view_paper":"https://pith.science/paper/QKB7QMWX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.03650&json=true","fetch_graph":"https://pith.science/api/pith-number/QKB7QMWXBATXH5X5ST7P7LL4XV/graph.json","fetch_events":"https://pith.science/api/pith-number/QKB7QMWXBATXH5X5ST7P7LL4XV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QKB7QMWXBATXH5X5ST7P7LL4XV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QKB7QMWXBATXH5X5ST7P7LL4XV/action/storage_attestation","attest_author":"https://pith.science/pith/QKB7QMWXBATXH5X5ST7P7LL4XV/action/author_attestation","sign_citation":"https://pith.science/pith/QKB7QMWXBATXH5X5ST7P7LL4XV/action/citation_signature","submit_replication":"https://pith.science/pith/QKB7QMWXBATXH5X5ST7P7LL4XV/action/replication_record"}},"created_at":"2026-05-17T23:45:09.111170+00:00","updated_at":"2026-05-17T23:45:09.111170+00:00"}