Paper Citation Record · LEDGER

Near-Optimal Lower Bounds on One-Bit Compressed Sensing of Approximately Sparse Signals

As of 22 August 2026, this Paper Citation Record lists 30 of 30 outbound references and 0 inbound Pith citation observations for arXiv:2607.06750.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2607.06750 v1

Coverage vector

measured 30 of 30 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-07-10T22:06:56.239466Z

measured 30 of 30 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-22T06:32:14.747728+00:00

measured 0 of 0 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: cited_works

Reference resolution

30 of 30 outbound references displayed

verified exact2
verified fuzzy27
unresolved1
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 286e1b06-e15a-4ab0-ae3e-ad3a9945866e · outbound

This paper cites Improved bounds for universal one-bit compressive sensing.

Near-Optimal Lower Bounds on One-Bit Compressed Sensing of Approximately Sparse Signals Improved bounds for universal one-bit compressive sensing

Reference 1

Resolution: verified fuzzy; raw_fallback, observed 2026-07-10T22:07:39.242459Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

Observation 1f2b5e8a-1168-448c-8847-71117e4f5691 · outbound

This paper cites Milman.Asymptotic Geometric Analysis, Part I, volume 202 ofMathematical Surveys and Monographs.

Near-Optimal Lower Bounds on One-Bit Compressed Sensing of Approximately Sparse Signals Milman.Asymptotic Geometric Analysis, Part I, volume 202 ofMathematical Surveys and Monographs

Reference 2

Resolution: verified fuzzy; raw_fallback, observed 2026-07-10T22:07:38.816773Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

Observation 6324281a-1d1f-477c-8b0d-ed0036373df4 · outbound

This paper cites Learning and 1-bit compressed sensing under asymmetric noise.

Near-Optimal Lower Bounds on One-Bit Compressed Sensing of Approximately Sparse Signals Learning and 1-bit compressed sensing under asymmetric noise

Reference 3

Resolution: verified fuzzy; raw_fallback, observed 2026-07-10T22:07:39.121932Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

Observation ca4d547f-d15c-4548-a0f3-063815b8c445 · outbound

This paper cites 1-bit compressive sensing.

Near-Optimal Lower Bounds on One-Bit Compressed Sensing of Approximately Sparse Signals 1-bit compressive sensing

Reference 4

Resolution: verified fuzzy; raw_fallback, observed 2026-07-10T22:07:39.119323Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

Observation 31e0eee2-0f81-47f0-b135-7369148ae3de · outbound

This paper cites Robust instance optimal phase-only com- pressed sensing.Information and Inference: A Journal of the IMA, 15(2):iaag014, 06 2026.

Near-Optimal Lower Bounds on One-Bit Compressed Sensing of Approximately Sparse Signals Robust instance optimal phase-only com- pressed sensing.Information and Inference: A Journal of the IMA, 15(2):iaag014, 06 2026

Reference 5

Resolution: verified fuzzy; raw_fallback, observed 2026-07-10T22:07:39.243697Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

Observation 9951afda-19f1-4bca-8d92-b5a94172f77d · outbound

This paper cites Optimal Quantized Compressed Sensing via Projected Gradient Descent.

Near-Optimal Lower Bounds on One-Bit Compressed Sensing of Approximately Sparse Signals Optimal Quantized Compressed Sensing via Projected Gradient Descent

Reference 6

Resolution: verified exact; local_arxiv, observed 2026-07-10T22:07:37.099138Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

Observation ccfd47db-c742-414b-8202-c4504d2f14a0 · outbound

This paper cites One-bit phase retrieval: Optimal rates and efficient algorithms.

Near-Optimal Lower Bounds on One-Bit Compressed Sensing of Approximately Sparse Signals One-bit phase retrieval: Optimal rates and efficient algorithms

Reference 7

Resolution: verified fuzzy; raw_fallback, observed 2026-07-10T22:07:38.779478Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

Observation 1add7a85-f7c8-4f02-a6ab-ddfbdceaaa1b · outbound

This paper cites Adaboost and robust one-bit compressed sensing.Mathematical Statistics and Learning, 5(1):117–158, 2022.

Near-Optimal Lower Bounds on One-Bit Compressed Sensing of Approximately Sparse Signals Adaboost and robust one-bit compressed sensing.Mathematical Statistics and Learning, 5(1):117–158, 2022

Reference 8

Resolution: verified fuzzy; raw_fallback, observed 2026-07-10T22:07:39.181429Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

Observation d0d98a22-f36b-4fc9-92f0-6e28200a8501 · outbound

This paper cites One-bit compressed sensing with partial gaussian circulant matrices.Information and Inference: A Journal of the IMA, 9(3):601– 626, 2020.

Near-Optimal Lower Bounds on One-Bit Compressed Sensing of Approximately Sparse Signals One-bit compressed sensing with partial gaussian circulant matrices.Information and Inference: A Journal of the IMA, 9(3):601– 626, 2020

Reference 9

Resolution: verified fuzzy; raw_fallback, observed 2026-07-10T22:07:39.267307Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

Observation ddb6b41b-532e-4eff-9d7d-be7c1c964099 · outbound

This paper cites Non-gaussian hyperplane tessellations and robust one-bit compressed sensing.Journal of the European Mathematical Society, 23(9):2913–2947, 2021.

Near-Optimal Lower Bounds on One-Bit Compressed Sensing of Approximately Sparse Signals Non-gaussian hyperplane tessellations and robust one-bit compressed sensing.Journal of the European Mathematical Society, 23(9):2913–2947, 2021

Reference 10

Resolution: verified fuzzy; raw_fallback, observed 2026-07-10T22:07:39.100386Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

Observation 5dccd558-fc0a-4ff9-9a81-0b8b1f7df2df · outbound

This paper cites Robust one-bit compressed sensing with partial circulant matrices.The Annals of Applied Probability, 33(3):1874–1903, 2023.

Near-Optimal Lower Bounds on One-Bit Compressed Sensing of Approximately Sparse Signals Robust one-bit compressed sensing with partial circulant matrices.The Annals of Applied Probability, 33(3):1874–1903, 2023

Reference 11

Resolution: verified fuzzy; raw_fallback, observed 2026-07-10T22:07:39.021577Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

Observation 6e6fe5df-75a9-4125-9331-6cf5daad9047 · outbound

This paper cites Sharp estimates on random hyperplane tessellations.SIAM Journal on Mathematics of Data Science, 4(4):1396–1419, 2022.

Near-Optimal Lower Bounds on One-Bit Compressed Sensing of Approximately Sparse Signals Sharp estimates on random hyperplane tessellations.SIAM Journal on Mathematics of Data Science, 4(4):1396–1419, 2022

Reference 12

Resolution: verified fuzzy; raw_fallback, observed 2026-07-10T22:07:39.080199Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

Observation 07be3377-ea21-46b0-8056-13f620aba56f · outbound

This paper cites A resolution of the gaussian hyperplane tessellation conjecture on the sphere.Applied and Computational Harmonic Analysis, page 101903, 2026.

Near-Optimal Lower Bounds on One-Bit Compressed Sensing of Approximately Sparse Signals A resolution of the gaussian hyperplane tessellation conjecture on the sphere.Applied and Computational Harmonic Analysis, page 101903, 2026

Reference 13

Resolution: verified fuzzy; raw_fallback, observed 2026-07-10T22:07:39.021148Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

Observation b8ab7809-a3e1-4546-bd8b-7c04d54c34ff · outbound

This paper cites Nbiht: An efficient algorithm for 1-bit compressed sensing with optimal error decay rate.IEEE Transactions on Information Theory, 68(2):1157–1177, 2021.

Near-Optimal Lower Bounds on One-Bit Compressed Sensing of Approximately Sparse Signals Nbiht: An efficient algorithm for 1-bit compressed sensing with optimal error decay rate.IEEE Transactions on Information Theory, 68(2):1157–1177, 2021

Reference 14

Resolution: verified fuzzy; raw_fallback, observed 2026-07-10T22:07:38.966278Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

Observation 9d2de407-141d-40a3-a7c5-a31d40a14f82 · outbound

This paper cites On the sample complexity of parameter estimation in logistic regression with normal design.

Near-Optimal Lower Bounds on One-Bit Compressed Sensing of Approximately Sparse Signals On the sample complexity of parameter estimation in logistic regression with normal design

Reference 15

Resolution: verified fuzzy; raw_fallback, observed 2026-07-10T22:07:39.100669Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

Observation 3a17f1b0-b1fe-4ba8-9386-f5ec9d242660 · outbound

This paper cites Robust 1- bit compressive sensing via binary stable embeddings of sparse vectors.IEEE Transactions on Information Theory, 59(4):2082–2102, 2013.

Near-Optimal Lower Bounds on One-Bit Compressed Sensing of Approximately Sparse Signals Robust 1- bit compressive sensing via binary stable embeddings of sparse vectors.IEEE Transactions on Information Theory, 59(4):2082–2102, 2013

Reference 16

Resolution: verified fuzzy; raw_fallback, observed 2026-07-10T22:07:39.040665Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

Observation 68307ee1-a72a-48d2-9dbe-948c4a1dd822 · outbound

This paper cites Quantized com- pressed sensing by rectified linear units.IEEE Transactions on Information Theory, 67(6):4125– 4149, 2021.

Near-Optimal Lower Bounds on One-Bit Compressed Sensing of Approximately Sparse Signals Quantized com- pressed sensing by rectified linear units.IEEE Transactions on Information Theory, 67(6):4125– 4149, 2021

Reference 17

Resolution: verified fuzzy; raw_fallback, observed 2026-07-10T22:07:39.060829Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

Observation daf2ced6-caa0-404f-bdf3-a3c8ae2c11c3 · outbound

This paper cites Efficient learning of gener- alized linear and single index models with isotonic regression.Advances in Neural Information Processing Systems, 24, 2011.

Near-Optimal Lower Bounds on One-Bit Compressed Sensing of Approximately Sparse Signals Efficient learning of gener- alized linear and single index models with isotonic regression.Advances in Neural Information Processing Systems, 24, 2011

Reference 18

Resolution: verified fuzzy; raw_fallback, observed 2026-07-10T22:07:39.318089Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

Observation 817e1c2c-7878-4148-9f33-7ffd1f0f9e3c · outbound

This paper cites One-bit compressive sensing with norm estima- tion.IEEE Transactions on Information Theory, 62(5):2748–2758, 2016.

Near-Optimal Lower Bounds on One-Bit Compressed Sensing of Approximately Sparse Signals One-bit compressive sensing with norm estima- tion.IEEE Transactions on Information Theory, 62(5):2748–2758, 2016

Reference 19

Resolution: verified fuzzy; raw_fallback, observed 2026-07-10T22:07:38.994578Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

Observation 227f45f6-a460-4c15-be9e-db2f5a33a2ed · outbound

This paper cites an unresolved cited work.

Near-Optimal Lower Bounds on One-Bit Compressed Sensing of Approximately Sparse Signals Unresolved cited work

Reference 20

Resolution: unresolved; raw_fallback, observed 2026-07-10T22:07:38.630985Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

Observation 59cb065d-25f3-4c25-a5ae-85ef5c27f351 · outbound

This paper cites On the sample complexity of pac learning half-spaces against the uniform distribution.IEEE Transactions on Neural Networks, 6(6):1556–1559, 1995.

Near-Optimal Lower Bounds on One-Bit Compressed Sensing of Approximately Sparse Signals On the sample complexity of pac learning half-spaces against the uniform distribution.IEEE Transactions on Neural Networks, 6(6):1556–1559, 1995

Reference 21

Resolution: verified fuzzy; raw_fallback, observed 2026-07-10T22:07:39.060066Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

Observation 7cef824c-7dcb-4385-9a40-4bfd617d3b88 · outbound

This paper cites Binary iterative hard thresholding converges with optimal number of measurements for 1-bit compressed sensing.Journal of the ACM, 71(5):1–64, 2024.

Near-Optimal Lower Bounds on One-Bit Compressed Sensing of Approximately Sparse Signals Binary iterative hard thresholding converges with optimal number of measurements for 1-bit compressed sensing.Journal of the ACM, 71(5):1–64, 2024

Reference 22

Resolution: verified fuzzy; raw_fallback, observed 2026-07-10T22:07:39.216305Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

Observation d54e8647-d3d7-4bad-8707-ed2006656d59 · outbound

This paper cites Robust 1-bit compressed sensing with iterative hard thresholding.

Near-Optimal Lower Bounds on One-Bit Compressed Sensing of Approximately Sparse Signals Robust 1-bit compressed sensing with iterative hard thresholding

Reference 23

Resolution: verified fuzzy; raw_fallback, observed 2026-07-10T22:07:38.939994Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

Observation f88bd443-9535-40fc-8586-3a295ca73b34 · outbound

This paper cites Near-Optimal Bounds for Binary Embeddings of Arbitrary Sets.

Near-Optimal Lower Bounds on One-Bit Compressed Sensing of Approximately Sparse Signals Near-Optimal Bounds for Binary Embeddings of Arbitrary Sets

Reference 24

Resolution: verified exact; local_arxiv, observed 2026-07-10T22:07:37.070313Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

Observation 009dd5cc-8d6c-4c46-a82c-43d8f20108a3 · outbound

This paper cites Robust 1-bit compressed sensing and sparse logistic regres- sion: A convex programming approach.IEEE Transactions on Information Theory, 59(1):482– 494, 2012.

Near-Optimal Lower Bounds on One-Bit Compressed Sensing of Approximately Sparse Signals Robust 1-bit compressed sensing and sparse logistic regres- sion: A convex programming approach.IEEE Transactions on Information Theory, 59(1):482– 494, 2012

Reference 25

Resolution: verified fuzzy; raw_fallback, observed 2026-07-10T22:07:38.940271Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

Observation d96f045c-7793-4101-beec-d4f638c78d17 · outbound

This paper cites One-bit compressed sensing by linear programming.Com- munications on Pure and Applied Mathematics, 66(8):1275–1297, 2013.

Near-Optimal Lower Bounds on One-Bit Compressed Sensing of Approximately Sparse Signals One-bit compressed sensing by linear programming.Com- munications on Pure and Applied Mathematics, 66(8):1275–1297, 2013

Reference 26

Resolution: verified fuzzy; raw_fallback, observed 2026-07-10T22:07:39.267023Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

Observation 1cc073b9-f18d-4139-9153-8676d55669a3 · outbound

This paper cites Dimension reduction by random hyperplane tessellations.

Near-Optimal Lower Bounds on One-Bit Compressed Sensing of Approximately Sparse Signals Dimension reduction by random hyperplane tessellations

Reference 27

Resolution: verified fuzzy; raw_fallback, observed 2026-07-10T22:07:38.840816Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

Observation 866f6435-364a-4edb-a87c-ad276c87fdf0 · outbound

This paper cites The generalized lasso for sub-gaussian measure- ments with dithered quantization.IEEE Transactions on Information Theory, 66(4):2487–2500, 2020.

Near-Optimal Lower Bounds on One-Bit Compressed Sensing of Approximately Sparse Signals The generalized lasso for sub-gaussian measure- ments with dithered quantization.IEEE Transactions on Information Theory, 66(4):2487–2500, 2020

Reference 28

Resolution: verified fuzzy; raw_fallback, observed 2026-07-10T22:07:39.211929Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

Observation b3e25aaa-3638-4904-b15b-b153b7138203 · outbound

This paper cites Quantized compressive sensing with rip matrices: The benefit of dithering.Information and Inference: A Journal of the IMA, 9(3):543–586, 2020.

Near-Optimal Lower Bounds on One-Bit Compressed Sensing of Approximately Sparse Signals Quantized compressive sensing with rip matrices: The benefit of dithering.Information and Inference: A Journal of the IMA, 9(3):543–586, 2020

Reference 29

Resolution: verified fuzzy; raw_fallback, observed 2026-07-10T22:07:38.818218Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

Observation 02af0c46-d0d0-4549-b333-c8e317005692 · outbound

This paper cites Now notice that the condition (58) is equivalent tos1− q 2 rq ≤k 1− q 2 .Hence∥u∥ q ≤k 1 q − 1 2, meaning thatu∈k 1 q − 1 2 Bn q by viewinguas(u ⊤,0 n−s)⊤.

Near-Optimal Lower Bounds on One-Bit Compressed Sensing of Approximately Sparse Signals Now notice that the condition (58) is equivalent tos1− q 2 rq ≤k 1− q 2 .Hence∥u∥ q ≤k 1 q − 1 2, meaning thatu∈k 1 q − 1 2 Bn q by viewinguas(u ⊤,0 n−s)⊤

Reference 30

Resolution: verified fuzzy; raw_fallback, observed 2026-07-10T22:07:39.295848Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

Pith citing papers

No inbound Pith citation observations are available.