{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:ISR4FGO35ZXQAFTIABM4IIWNRE","short_pith_number":"pith:ISR4FGO3","schema_version":"1.0","canonical_sha256":"44a3c299dbee6f0016680059c422cd8932932428c5f39e192b69d0692d6de7ab","source":{"kind":"arxiv","id":"1811.03864","version":2},"attestation_state":"computed","paper":{"title":"Non-convex Lasso-kind approach to compressed sensing for finite-valued signals","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Sophie M. Fosson","submitted_at":"2018-11-09T11:22:30Z","abstract_excerpt":"In this paper, we bring together two trends that have recently emerged in sparse signal recovery: the problem of sparse signals that stem from finite alphabets and the techniques that introduce concave penalties. Specifically, we show that using a minimax concave penalty (MCP) the recovery of finite-valued sparse signals is enhanced with respect to classical Lasso, in terms of estimation accuracy, number of necessary measurements, and run time. We focus on problems where sparse signals can be recovered from few linear measurements, as stated in compressed sensing theory. We start by proposing "},"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":"1811.03864","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.OC","submitted_at":"2018-11-09T11:22:30Z","cross_cats_sorted":[],"title_canon_sha256":"cb723d23939a1f15028c832cf51ddfae5da7ff1f1fd5921fc193028d81154db8","abstract_canon_sha256":"cdcb0beb338b6dbf6b269740ef98e5a5fc3185cccf37b0fea30f30f10726b742"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:27.669913Z","signature_b64":"ZUerylwi+d93ZF5gtoq5yZejBGylLTdsthj9N9pNY8dGoHiXK7OWQV0jASab3jMw38Se0+nczmPB1ax8NNrPAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"44a3c299dbee6f0016680059c422cd8932932428c5f39e192b69d0692d6de7ab","last_reissued_at":"2026-05-17T23:59:27.669419Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:27.669419Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Non-convex Lasso-kind approach to compressed sensing for finite-valued signals","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Sophie M. Fosson","submitted_at":"2018-11-09T11:22:30Z","abstract_excerpt":"In this paper, we bring together two trends that have recently emerged in sparse signal recovery: the problem of sparse signals that stem from finite alphabets and the techniques that introduce concave penalties. Specifically, we show that using a minimax concave penalty (MCP) the recovery of finite-valued sparse signals is enhanced with respect to classical Lasso, in terms of estimation accuracy, number of necessary measurements, and run time. We focus on problems where sparse signals can be recovered from few linear measurements, as stated in compressed sensing theory. We start by proposing "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.03864","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":"1811.03864","created_at":"2026-05-17T23:59:27.669494+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.03864v2","created_at":"2026-05-17T23:59:27.669494+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.03864","created_at":"2026-05-17T23:59:27.669494+00:00"},{"alias_kind":"pith_short_12","alias_value":"ISR4FGO35ZXQ","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_16","alias_value":"ISR4FGO35ZXQAFTI","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_8","alias_value":"ISR4FGO3","created_at":"2026-05-18T12:32:31.084164+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/ISR4FGO35ZXQAFTIABM4IIWNRE","json":"https://pith.science/pith/ISR4FGO35ZXQAFTIABM4IIWNRE.json","graph_json":"https://pith.science/api/pith-number/ISR4FGO35ZXQAFTIABM4IIWNRE/graph.json","events_json":"https://pith.science/api/pith-number/ISR4FGO35ZXQAFTIABM4IIWNRE/events.json","paper":"https://pith.science/paper/ISR4FGO3"},"agent_actions":{"view_html":"https://pith.science/pith/ISR4FGO35ZXQAFTIABM4IIWNRE","download_json":"https://pith.science/pith/ISR4FGO35ZXQAFTIABM4IIWNRE.json","view_paper":"https://pith.science/paper/ISR4FGO3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.03864&json=true","fetch_graph":"https://pith.science/api/pith-number/ISR4FGO35ZXQAFTIABM4IIWNRE/graph.json","fetch_events":"https://pith.science/api/pith-number/ISR4FGO35ZXQAFTIABM4IIWNRE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ISR4FGO35ZXQAFTIABM4IIWNRE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ISR4FGO35ZXQAFTIABM4IIWNRE/action/storage_attestation","attest_author":"https://pith.science/pith/ISR4FGO35ZXQAFTIABM4IIWNRE/action/author_attestation","sign_citation":"https://pith.science/pith/ISR4FGO35ZXQAFTIABM4IIWNRE/action/citation_signature","submit_replication":"https://pith.science/pith/ISR4FGO35ZXQAFTIABM4IIWNRE/action/replication_record"}},"created_at":"2026-05-17T23:59:27.669494+00:00","updated_at":"2026-05-17T23:59:27.669494+00:00"}