Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 383

The DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.

One‐Bit Compressed Sensing by Linear Programming

Open access
Plan, Yaniv, Vershynin, Roman·2013·Communications on Pure and Applied Mathematics

Abstract

We give the first computationally tractable and almost optimal solution to the problem of one‐bit compressed sensing, showing how to accurately recover an s‐sparse vector \input amssym $x \in {\Bbb R}^n$ from the signs of $O(s \log^2(n/s))$ random linear measurements of x. The recovery is achieved by a simple linear program. This result extends to approximately sparse vectors x. Our result is universal in the sense that with high probability, one measurement scheme will successfully recover all sparse vectors simultaneously. The argument is based on solving an equivalent geometric problem on random hyperplane tessellations.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1002/cpa.21442

Cites

13 of 13 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 13 references

Cited by

See all 383

Metadata

Authors
Plan, Y., & Vershynin, R.
Venue
Communications on Pure and Applied Mathematics
Publisher
Wiley
Published
2013-02-12
Volume
66
Issue
8
Pages
1275-1297
ISSN
  • 0010-3640 (ISSN-L)
  • 1097-0312
OpenAlex
W2145218531
Cited by
383
References
13
FWCI
43.65
Type
journal article
Language
en
Open access
bronze

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: One‐Bit Compressed Sensing by Linear Programming. https://app.cochat.ai/papers/10.1002/cpa.21442
The paper
Plan, Y., & Vershynin, R. (2013). One‐Bit Compressed Sensing by Linear Programming. Communications on Pure and Applied Mathematics. https://doi.org/10.1002/cpa.21442

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.