{"as_of":"2026-08-10T16:48:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0ad9858b75e21f51fdccb72a27a0995e8608e6efdf6178c9155f1a2fc207b18b","coverage":[{"denominator":30,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":30,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-10T22:06:56.239466Z","state":"measured"},{"denominator":30,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":30,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2607.06750/citation-record","integrity":"/paper/2607.06750/integrity","json":"/paper/2607.06750/citation-record.json","paper":"/paper/2607.06750"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T22:07:39.216282Z","title":"Improved bounds for universal one-bit compressive sensing","venue":null,"work_id":"05e89f4b-3a09-49b0-a8b5-95d29e1d1096","year":2017},"citing_paper":{"arxiv_id":"2607.06750","last_updated":"2026-07-07T19:31:38Z","snapshot_observed_at":"2026-08-10T02:34:56.414549Z","submitted_at":"2026-07-07T19:31:38Z","title":"Near-Optimal Lower Bounds on One-Bit Compressed Sensing of Approximately Sparse Signals","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-07-10T22:06:56.239466Z"},"links":{"citing_paper":"/paper/2607.06750"},"observation_digest":"sha256:0bbe152a1d677a15c67bb174b6d9171d9d07c3670408a3f9cc027c04d39716b6","observation_id":"286e1b06-e15a-4ab0-ae3e-ad3a9945866e","resolution":{"observed_at":"2026-07-10T22:07:39.242459Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T22:07:38.801022Z","title":"Milman.Asymptotic Geometric Analysis, Part I, volume 202 ofMathematical Surveys and Monographs","venue":null,"work_id":"1832482a-902e-4dda-93c9-ff37ce151d72","year":2015},"citing_paper":{"arxiv_id":"2607.06750","last_updated":"2026-07-07T19:31:38Z","snapshot_observed_at":"2026-08-10T02:34:56.414549Z","submitted_at":"2026-07-07T19:31:38Z","title":"Near-Optimal Lower Bounds on One-Bit Compressed Sensing of Approximately Sparse Signals","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-07-10T22:06:56.239466Z"},"links":{"citing_paper":"/paper/2607.06750"},"observation_digest":"sha256:6a872541dfbce6c04c7c9b4f211beecfc3cf5b5ef68ff63455974791984ceec9","observation_id":"1f2b5e8a-1168-448c-8847-71117e4f5691","resolution":{"observed_at":"2026-07-10T22:07:38.816773Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T22:07:39.103266Z","title":"Learning and 1-bit compressed sensing under asymmetric noise","venue":null,"work_id":"7bd02ece-04f8-4ad4-b25f-751e183681c0","year":2016},"citing_paper":{"arxiv_id":"2607.06750","last_updated":"2026-07-07T19:31:38Z","snapshot_observed_at":"2026-08-10T02:34:56.414549Z","submitted_at":"2026-07-07T19:31:38Z","title":"Near-Optimal Lower Bounds on One-Bit Compressed Sensing of Approximately Sparse Signals","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-07-10T22:06:56.239466Z"},"links":{"citing_paper":"/paper/2607.06750"},"observation_digest":"sha256:b73b8870d337b8fd9a2e9b3f44cd47a9817bb05760b15984bd79ece9c828d35b","observation_id":"6324281a-1d1f-477c-8b0d-ed0036373df4","resolution":{"observed_at":"2026-07-10T22:07:39.121932Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T22:07:39.103072Z","title":"1-bit compressive sensing","venue":null,"work_id":"fb441aef-713a-472c-a41d-f541b15d89f6","year":2008},"citing_paper":{"arxiv_id":"2607.06750","last_updated":"2026-07-07T19:31:38Z","snapshot_observed_at":"2026-08-10T02:34:56.414549Z","submitted_at":"2026-07-07T19:31:38Z","title":"Near-Optimal Lower Bounds on One-Bit Compressed Sensing of Approximately Sparse Signals","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-07-10T22:06:56.239466Z"},"links":{"citing_paper":"/paper/2607.06750"},"observation_digest":"sha256:a336b04a0e02fe826b30faca0027e1dbf4866706bd89082f301656096cd4e27d","observation_id":"ca4d547f-d15c-4548-a0f3-063815b8c445","resolution":{"observed_at":"2026-07-10T22:07:39.119323Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T22:07:39.219975Z","title":"Robust instance optimal phase-only com- pressed sensing.Information and Inference: A Journal of the IMA, 15(2):iaag014, 06 2026","venue":null,"work_id":"168375f3-f9e2-4fb8-8337-6a9009170865","year":2026},"citing_paper":{"arxiv_id":"2607.06750","last_updated":"2026-07-07T19:31:38Z","snapshot_observed_at":"2026-08-10T02:34:56.414549Z","submitted_at":"2026-07-07T19:31:38Z","title":"Near-Optimal Lower Bounds on One-Bit Compressed Sensing of Approximately Sparse Signals","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-07-10T22:06:56.239466Z"},"links":{"citing_paper":"/paper/2607.06750"},"observation_digest":"sha256:87be4c978eaf1c6557bfcf4fba9a392371bde8a5ed63212393454ef135a088f9","observation_id":"31e0eee2-0f81-47f0-b135-7369148ae3de","resolution":{"observed_at":"2026-07-10T22:07:39.243697Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.04951","last_updated":"2026-06-29T21:09:55Z","snapshot_observed_at":"2026-08-08T02:51:51.349366Z","submitted_at":"2024-07-06T04:06:36Z","title":"Optimal Quantized Compressed Sensing via Projected Gradient Descent","version":3},"cited_work":{"arxiv_id":"2407.04951","doi":null,"metadata_source":"pith","pith_arxiv_id":"2407.04951","snapshot_observed_at":"2026-07-10T22:07:37.075853Z","title":"Optimalquantizedcompressedsensingviaprojectedgradientdescent","venue":"cs.IT","work_id":"64c66a71-8afe-4410-a5bf-be1067d9b4c4","year":2024},"citing_paper":{"arxiv_id":"2607.06750","last_updated":"2026-07-07T19:31:38Z","snapshot_observed_at":"2026-08-10T02:34:56.414549Z","submitted_at":"2026-07-07T19:31:38Z","title":"Near-Optimal Lower Bounds on One-Bit Compressed Sensing of Approximately Sparse Signals","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-07-10T22:06:56.239466Z"},"links":{"cited_paper":"/paper/2407.04951","citing_paper":"/paper/2607.06750"},"observation_digest":"sha256:fc0b407810e78644f7176bed65686b4c000c19da6067b54783a659ecc900e3f0","observation_id":"9951afda-19f1-4bca-8d92-b5a94172f77d","resolution":{"observed_at":"2026-07-10T22:07:37.099138Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T22:07:38.762911Z","title":"One-bit phase retrieval: Optimal rates and efficient algorithms","venue":null,"work_id":"cdc12d2c-ccdf-4884-b411-21dd9392da33","year":2026},"citing_paper":{"arxiv_id":"2607.06750","last_updated":"2026-07-07T19:31:38Z","snapshot_observed_at":"2026-08-10T02:34:56.414549Z","submitted_at":"2026-07-07T19:31:38Z","title":"Near-Optimal Lower Bounds on One-Bit Compressed Sensing of Approximately Sparse Signals","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-07-10T22:06:56.239466Z"},"links":{"citing_paper":"/paper/2607.06750"},"observation_digest":"sha256:1a15d54dcbad341ab58faaee8c4023314cb9d76dba3f7dae0bf3e2285a9ef268","observation_id":"ccfd47db-c742-414b-8202-c4504d2f14a0","resolution":{"observed_at":"2026-07-10T22:07:38.779478Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T22:07:39.152332Z","title":"Adaboost and robust one-bit compressed sensing.Mathematical Statistics and Learning, 5(1):117–158, 2022","venue":null,"work_id":"921d5f2e-2162-437e-b78a-4412a351126e","year":2022},"citing_paper":{"arxiv_id":"2607.06750","last_updated":"2026-07-07T19:31:38Z","snapshot_observed_at":"2026-08-10T02:34:56.414549Z","submitted_at":"2026-07-07T19:31:38Z","title":"Near-Optimal Lower Bounds on One-Bit Compressed Sensing of Approximately Sparse Signals","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-07-10T22:06:56.239466Z"},"links":{"citing_paper":"/paper/2607.06750"},"observation_digest":"sha256:f0b905384ac70dd4e85efec31e7abc861b103c42c88e9a9931f69d3aa4437c6a","observation_id":"1add7a85-f7c8-4f02-a6ab-ddfbdceaaa1b","resolution":{"observed_at":"2026-07-10T22:07:39.181429Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T22:07:39.246426Z","title":"One-bit compressed sensing with partial gaussian circulant matrices.Information and Inference: A Journal of the IMA, 9(3):601– 626, 2020","venue":null,"work_id":"1f66323d-270e-46e0-94a4-2f0c7e99071c","year":2020},"citing_paper":{"arxiv_id":"2607.06750","last_updated":"2026-07-07T19:31:38Z","snapshot_observed_at":"2026-08-10T02:34:56.414549Z","submitted_at":"2026-07-07T19:31:38Z","title":"Near-Optimal Lower Bounds on One-Bit Compressed Sensing of Approximately Sparse Signals","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-07-10T22:06:56.239466Z"},"links":{"citing_paper":"/paper/2607.06750"},"observation_digest":"sha256:e2c58f92902d76766fb7052021f5f2eb6f7d9daa82440e90f730d360dc91808c","observation_id":"d0d98a22-f36b-4fc9-92f0-6e28200a8501","resolution":{"observed_at":"2026-07-10T22:07:39.267307Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T22:07:39.082633Z","title":"Non-gaussian hyperplane tessellations and robust one-bit compressed sensing.Journal of the European Mathematical Society, 23(9):2913–2947, 2021","venue":null,"work_id":"3ea9e087-3985-4fe5-9b4b-372b08228417","year":2021},"citing_paper":{"arxiv_id":"2607.06750","last_updated":"2026-07-07T19:31:38Z","snapshot_observed_at":"2026-08-10T02:34:56.414549Z","submitted_at":"2026-07-07T19:31:38Z","title":"Near-Optimal Lower Bounds on One-Bit Compressed Sensing of Approximately Sparse Signals","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-07-10T22:06:56.239466Z"},"links":{"citing_paper":"/paper/2607.06750"},"observation_digest":"sha256:c329f6e1e0861b2560d7e503662973ae41d005805a4f31e077e796dd8bf15d31","observation_id":"ddb6b41b-532e-4eff-9d7d-be7c1c964099","resolution":{"observed_at":"2026-07-10T22:07:39.100386Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T22:07:38.999430Z","title":"Robust one-bit compressed sensing with partial circulant matrices.The Annals of Applied Probability, 33(3):1874–1903, 2023","venue":null,"work_id":"7853e698-d9ba-4867-918b-ede632ec1786","year":1903},"citing_paper":{"arxiv_id":"2607.06750","last_updated":"2026-07-07T19:31:38Z","snapshot_observed_at":"2026-08-10T02:34:56.414549Z","submitted_at":"2026-07-07T19:31:38Z","title":"Near-Optimal Lower Bounds on One-Bit Compressed Sensing of Approximately Sparse Signals","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-07-10T22:06:56.239466Z"},"links":{"citing_paper":"/paper/2607.06750"},"observation_digest":"sha256:ddaa04da605301304a887139019a5b8fa7720bf0c23da33f0103738831f4a3ab","observation_id":"5dccd558-fc0a-4ff9-9a81-0b8b1f7df2df","resolution":{"observed_at":"2026-07-10T22:07:39.021577Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T22:07:39.063600Z","title":"Sharp estimates on random hyperplane tessellations.SIAM Journal on Mathematics of Data Science, 4(4):1396–1419, 2022","venue":null,"work_id":"cb502fe0-cd70-4a07-b55f-0d99dda725f2","year":2022},"citing_paper":{"arxiv_id":"2607.06750","last_updated":"2026-07-07T19:31:38Z","snapshot_observed_at":"2026-08-10T02:34:56.414549Z","submitted_at":"2026-07-07T19:31:38Z","title":"Near-Optimal Lower Bounds on One-Bit Compressed Sensing of Approximately Sparse Signals","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-07-10T22:06:56.239466Z"},"links":{"citing_paper":"/paper/2607.06750"},"observation_digest":"sha256:46c2e2b6c84647f5a9da695461e5c7c700c44500266e472f3dd802b836f06299","observation_id":"6e6fe5df-75a9-4125-9331-6cf5daad9047","resolution":{"observed_at":"2026-07-10T22:07:39.080199Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T22:07:38.998660Z","title":"A resolution of the gaussian hyperplane tessellation conjecture on the sphere.Applied and Computational Harmonic Analysis, page 101903, 2026","venue":null,"work_id":"0a792666-feb3-4d1b-a0c3-23a3a2163de5","year":2026},"citing_paper":{"arxiv_id":"2607.06750","last_updated":"2026-07-07T19:31:38Z","snapshot_observed_at":"2026-08-10T02:34:56.414549Z","submitted_at":"2026-07-07T19:31:38Z","title":"Near-Optimal Lower Bounds on One-Bit Compressed Sensing of Approximately Sparse Signals","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-07-10T22:06:56.239466Z"},"links":{"citing_paper":"/paper/2607.06750"},"observation_digest":"sha256:27024f0b6d6bd72be80f10e43ea0169f1e44aa56b8c10076293e6ab944ddb0b7","observation_id":"07be3377-ea21-46b0-8056-13f620aba56f","resolution":{"observed_at":"2026-07-10T22:07:39.021148Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T22:07:38.943366Z","title":"Nbiht: An efficient algorithm for 1-bit compressed sensing with optimal error decay rate.IEEE Transactions on Information Theory, 68(2):1157–1177, 2021","venue":null,"work_id":"ce4ea1d8-6a72-4595-9d16-31cbd6bf6829","year":2021},"citing_paper":{"arxiv_id":"2607.06750","last_updated":"2026-07-07T19:31:38Z","snapshot_observed_at":"2026-08-10T02:34:56.414549Z","submitted_at":"2026-07-07T19:31:38Z","title":"Near-Optimal Lower Bounds on One-Bit Compressed Sensing of Approximately Sparse Signals","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-07-10T22:06:56.239466Z"},"links":{"citing_paper":"/paper/2607.06750"},"observation_digest":"sha256:38be22d40a556c0db537e1a91c3c98c87494b4ca17725787fda6b57633c872ff","observation_id":"b8ab7809-a3e1-4546-bd8b-7c04d54c34ff","resolution":{"observed_at":"2026-07-10T22:07:38.966278Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T22:07:39.083024Z","title":"On the sample complexity of parameter estimation in logistic regression with normal design","venue":null,"work_id":"857da5f5-c022-4b1b-aa08-b2ddf6dac855","year":2024},"citing_paper":{"arxiv_id":"2607.06750","last_updated":"2026-07-07T19:31:38Z","snapshot_observed_at":"2026-08-10T02:34:56.414549Z","submitted_at":"2026-07-07T19:31:38Z","title":"Near-Optimal Lower Bounds on One-Bit Compressed Sensing of Approximately Sparse Signals","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-07-10T22:06:56.239466Z"},"links":{"citing_paper":"/paper/2607.06750"},"observation_digest":"sha256:10e5d36b32972d2315542d76bb5325e4592463466bc3522ca38a65646423286b","observation_id":"9d2de407-141d-40a3-a7c5-a31d40a14f82","resolution":{"observed_at":"2026-07-10T22:07:39.100669Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T22:07:39.023550Z","title":"Robust 1- bit compressive sensing via binary stable embeddings of sparse vectors.IEEE Transactions on Information Theory, 59(4):2082–2102, 2013","venue":null,"work_id":"23daa1e4-156f-4f95-a64c-574d520f2e6c","year":2082},"citing_paper":{"arxiv_id":"2607.06750","last_updated":"2026-07-07T19:31:38Z","snapshot_observed_at":"2026-08-10T02:34:56.414549Z","submitted_at":"2026-07-07T19:31:38Z","title":"Near-Optimal Lower Bounds on One-Bit Compressed Sensing of Approximately Sparse Signals","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-07-10T22:06:56.239466Z"},"links":{"citing_paper":"/paper/2607.06750"},"observation_digest":"sha256:416f057df26290631df752e6b6a58fb1a981607fd871d0a8c5dd55aea6cdc559","observation_id":"3a17f1b0-b1fe-4ba8-9386-f5ec9d242660","resolution":{"observed_at":"2026-07-10T22:07:39.040665Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T22:07:39.043482Z","title":"Quantized com- pressed sensing by rectified linear units.IEEE Transactions on Information Theory, 67(6):4125– 4149, 2021","venue":null,"work_id":"0768dd9c-9dff-4b0a-a52a-294ee6db9c5f","year":2021},"citing_paper":{"arxiv_id":"2607.06750","last_updated":"2026-07-07T19:31:38Z","snapshot_observed_at":"2026-08-10T02:34:56.414549Z","submitted_at":"2026-07-07T19:31:38Z","title":"Near-Optimal Lower Bounds on One-Bit Compressed Sensing of Approximately Sparse Signals","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-07-10T22:06:56.239466Z"},"links":{"citing_paper":"/paper/2607.06750"},"observation_digest":"sha256:280ef414bba5c498005ebd4634fd4f652684a97625f9c63499632176682ac524","observation_id":"68307ee1-a72a-48d2-9dbe-948c4a1dd822","resolution":{"observed_at":"2026-07-10T22:07:39.060829Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T22:07:39.298895Z","title":"Efficient learning of gener- alized linear and single index models with isotonic regression.Advances in Neural Information Processing Systems, 24, 2011","venue":null,"work_id":"c23580bd-d23e-429f-8458-ee4e56244b03","year":2011},"citing_paper":{"arxiv_id":"2607.06750","last_updated":"2026-07-07T19:31:38Z","snapshot_observed_at":"2026-08-10T02:34:56.414549Z","submitted_at":"2026-07-07T19:31:38Z","title":"Near-Optimal Lower Bounds on One-Bit Compressed Sensing of Approximately Sparse Signals","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-07-10T22:06:56.239466Z"},"links":{"citing_paper":"/paper/2607.06750"},"observation_digest":"sha256:82052d25af2c08854799618a4d64cc6d0000140b7403e2c33227d8cbf63cb7e9","observation_id":"daf2ced6-caa0-404f-bdf3-a3c8ae2c11c3","resolution":{"observed_at":"2026-07-10T22:07:39.318089Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T22:07:38.969647Z","title":"One-bit compressive sensing with norm estima- tion.IEEE Transactions on Information Theory, 62(5):2748–2758, 2016","venue":null,"work_id":"9260b08d-1612-4610-b274-e27a93ca89d6","year":2016},"citing_paper":{"arxiv_id":"2607.06750","last_updated":"2026-07-07T19:31:38Z","snapshot_observed_at":"2026-08-10T02:34:56.414549Z","submitted_at":"2026-07-07T19:31:38Z","title":"Near-Optimal Lower Bounds on One-Bit Compressed Sensing of Approximately Sparse Signals","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-07-10T22:06:56.239466Z"},"links":{"citing_paper":"/paper/2607.06750"},"observation_digest":"sha256:c9115c15726cdd7adcbb4b65724f006240e7edc58f84347a31e654850970ce42","observation_id":"817e1c2c-7878-4148-9f33-7ffd1f0f9e3c","resolution":{"observed_at":"2026-07-10T22:07:38.994578Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T22:07:38.598155Z","title":null,"venue":null,"work_id":"8c45a560-41ac-4a5f-8e8e-f76b4bb02779","year":2022},"citing_paper":{"arxiv_id":"2607.06750","last_updated":"2026-07-07T19:31:38Z","snapshot_observed_at":"2026-08-10T02:34:56.414549Z","submitted_at":"2026-07-07T19:31:38Z","title":"Near-Optimal Lower Bounds on One-Bit Compressed Sensing of Approximately Sparse Signals","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-07-10T22:06:56.239466Z"},"links":{"citing_paper":"/paper/2607.06750"},"observation_digest":"sha256:0a55898a5b1944cdcee6bdea4558a35ecf44653d162cbad70b3e85f45c5a9430","observation_id":"227f45f6-a460-4c15-be9e-db2f5a33a2ed","resolution":{"observed_at":"2026-07-10T22:07:38.630985Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T22:07:39.043553Z","title":"On the sample complexity of pac learning half-spaces against the uniform distribution.IEEE Transactions on Neural Networks, 6(6):1556–1559, 1995","venue":null,"work_id":"e143aedc-8da1-4138-93c5-fb72ff404cc6","year":1995},"citing_paper":{"arxiv_id":"2607.06750","last_updated":"2026-07-07T19:31:38Z","snapshot_observed_at":"2026-08-10T02:34:56.414549Z","submitted_at":"2026-07-07T19:31:38Z","title":"Near-Optimal Lower Bounds on One-Bit Compressed Sensing of Approximately Sparse Signals","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-07-10T22:06:56.239466Z"},"links":{"citing_paper":"/paper/2607.06750"},"observation_digest":"sha256:98bb330dd6d0ac4ebad09223ca0540544034e4b1d7533975f8465500e8e5fd0e","observation_id":"59cb065d-25f3-4c25-a5ae-85ef5c27f351","resolution":{"observed_at":"2026-07-10T22:07:39.060066Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T22:07:39.186299Z","title":"Binary iterative hard thresholding converges with optimal number of measurements for 1-bit compressed sensing.Journal of the ACM, 71(5):1–64, 2024","venue":null,"work_id":"5fea73d1-476f-407a-8fdd-da089f4efc46","year":2024},"citing_paper":{"arxiv_id":"2607.06750","last_updated":"2026-07-07T19:31:38Z","snapshot_observed_at":"2026-08-10T02:34:56.414549Z","submitted_at":"2026-07-07T19:31:38Z","title":"Near-Optimal Lower Bounds on One-Bit Compressed Sensing of Approximately Sparse Signals","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-07-10T22:06:56.239466Z"},"links":{"citing_paper":"/paper/2607.06750"},"observation_digest":"sha256:46aaa84a04db9e7b73ba8a5c6dc7d13ab1d9a39a58bd3e829d1974d90051b176","observation_id":"7cef824c-7dcb-4385-9a40-4bfd617d3b88","resolution":{"observed_at":"2026-07-10T22:07:39.216305Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T22:07:38.914113Z","title":"Robust 1-bit compressed sensing with iterative hard thresholding","venue":null,"work_id":"cb71bd3e-c5f4-47ab-a815-7f543cb08844","year":2024},"citing_paper":{"arxiv_id":"2607.06750","last_updated":"2026-07-07T19:31:38Z","snapshot_observed_at":"2026-08-10T02:34:56.414549Z","submitted_at":"2026-07-07T19:31:38Z","title":"Near-Optimal Lower Bounds on One-Bit Compressed Sensing of Approximately Sparse Signals","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-07-10T22:06:56.239466Z"},"links":{"citing_paper":"/paper/2607.06750"},"observation_digest":"sha256:dbd63202dfebd009ce87933de99920f9ef6c1c2b804bae90990779e74af17474","observation_id":"d54e8647-d3d7-4bad-8707-ed2006656d59","resolution":{"observed_at":"2026-07-10T22:07:38.939994Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1512.04433","last_updated":"2015-12-14T17:57:41Z","snapshot_observed_at":"2026-08-09T21:26:02.293430Z","submitted_at":"2015-12-14T17:57:41Z","title":"Near-Optimal Bounds for Binary Embeddings of Arbitrary Sets","version":1},"cited_work":{"arxiv_id":"1512.04433","doi":null,"metadata_source":"pith","pith_arxiv_id":"1512.04433","snapshot_observed_at":"2026-07-10T22:07:37.048243Z","title":"Near-Optimal Bounds for Binary Embeddings of Arbitrary Sets","venue":"cs.LG","work_id":"c242c358-7c15-45b3-b310-35ba79970d94","year":2015},"citing_paper":{"arxiv_id":"2607.06750","last_updated":"2026-07-07T19:31:38Z","snapshot_observed_at":"2026-08-10T02:34:56.414549Z","submitted_at":"2026-07-07T19:31:38Z","title":"Near-Optimal Lower Bounds on One-Bit Compressed Sensing of Approximately Sparse Signals","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-07-10T22:06:56.239466Z"},"links":{"cited_paper":"/paper/1512.04433","citing_paper":"/paper/2607.06750"},"observation_digest":"sha256:81045edfafdbcaeec7708aea1e5180839dec181e201709ac3e3953105330a055","observation_id":"f88bd443-9535-40fc-8586-3a295ca73b34","resolution":{"observed_at":"2026-07-10T22:07:37.070313Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T22:07:38.914510Z","title":"Robust 1-bit compressed sensing and sparse logistic regres- sion: A convex programming approach.IEEE Transactions on Information Theory, 59(1):482– 494, 2012","venue":null,"work_id":"73f7b824-549a-435f-82ca-ed5530d137bd","year":2012},"citing_paper":{"arxiv_id":"2607.06750","last_updated":"2026-07-07T19:31:38Z","snapshot_observed_at":"2026-08-10T02:34:56.414549Z","submitted_at":"2026-07-07T19:31:38Z","title":"Near-Optimal Lower Bounds on One-Bit Compressed Sensing of Approximately Sparse Signals","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-07-10T22:06:56.239466Z"},"links":{"citing_paper":"/paper/2607.06750"},"observation_digest":"sha256:a1e0c267e55307ffae0fcdbdd7698f97f379f204910586159742b5ed23097d22","observation_id":"009dd5cc-8d6c-4c46-a82c-43d8f20108a3","resolution":{"observed_at":"2026-07-10T22:07:38.940271Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T22:07:39.245469Z","title":"One-bit compressed sensing by linear programming.Com- munications on Pure and Applied Mathematics, 66(8):1275–1297, 2013","venue":null,"work_id":"7a99d7ba-ba71-4041-a0b3-b771afff6bd8","year":2013},"citing_paper":{"arxiv_id":"2607.06750","last_updated":"2026-07-07T19:31:38Z","snapshot_observed_at":"2026-08-10T02:34:56.414549Z","submitted_at":"2026-07-07T19:31:38Z","title":"Near-Optimal Lower Bounds on One-Bit Compressed Sensing of Approximately Sparse Signals","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-07-10T22:06:56.239466Z"},"links":{"citing_paper":"/paper/2607.06750"},"observation_digest":"sha256:715e8d9af75988726b885ac27cf34dfaf4a80da106b09ac4ed8685ff31d00051","observation_id":"d96f045c-7793-4101-beec-d4f638c78d17","resolution":{"observed_at":"2026-07-10T22:07:39.267023Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T22:07:38.820669Z","title":"Dimension reduction by random hyperplane tessellations","venue":null,"work_id":"f83fabe4-a4cb-45f3-aec7-84e5ede4c044","year":2014},"citing_paper":{"arxiv_id":"2607.06750","last_updated":"2026-07-07T19:31:38Z","snapshot_observed_at":"2026-08-10T02:34:56.414549Z","submitted_at":"2026-07-07T19:31:38Z","title":"Near-Optimal Lower Bounds on One-Bit Compressed Sensing of Approximately Sparse Signals","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-07-10T22:06:56.239466Z"},"links":{"citing_paper":"/paper/2607.06750"},"observation_digest":"sha256:9b65ff88ef6383f705aab41fba04d328a7e292fe3900f797c18e1d8badfccebd","observation_id":"1cc073b9-f18d-4139-9153-8676d55669a3","resolution":{"observed_at":"2026-07-10T22:07:38.840816Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T22:07:39.182186Z","title":"The generalized lasso for sub-gaussian measure- ments with dithered quantization.IEEE Transactions on Information Theory, 66(4):2487–2500, 2020","venue":null,"work_id":"5514d121-0112-47ee-aecd-0f0da365e2a5","year":2020},"citing_paper":{"arxiv_id":"2607.06750","last_updated":"2026-07-07T19:31:38Z","snapshot_observed_at":"2026-08-10T02:34:56.414549Z","submitted_at":"2026-07-07T19:31:38Z","title":"Near-Optimal Lower Bounds on One-Bit Compressed Sensing of Approximately Sparse Signals","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-07-10T22:06:56.239466Z"},"links":{"citing_paper":"/paper/2607.06750"},"observation_digest":"sha256:57fe70d7b615cae4bed4bda92bc234ac70447788c3bccec0cb0f1e1969fb212b","observation_id":"866f6435-364a-4edb-a87c-ad276c87fdf0","resolution":{"observed_at":"2026-07-10T22:07:39.211929Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T22:07:38.800851Z","title":"Quantized compressive sensing with rip matrices: The benefit of dithering.Information and Inference: A Journal of the IMA, 9(3):543–586, 2020","venue":null,"work_id":"4a2bcad1-2943-4832-b84c-5e0ef15e1d2a","year":2020},"citing_paper":{"arxiv_id":"2607.06750","last_updated":"2026-07-07T19:31:38Z","snapshot_observed_at":"2026-08-10T02:34:56.414549Z","submitted_at":"2026-07-07T19:31:38Z","title":"Near-Optimal Lower Bounds on One-Bit Compressed Sensing of Approximately Sparse Signals","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-07-10T22:06:56.239466Z"},"links":{"citing_paper":"/paper/2607.06750"},"observation_digest":"sha256:249c8a7f12ea89576a2e5a3579e4c9c789aaaeb698fe830e3ab9f3f1a34f9dd5","observation_id":"b3e25aaa-3638-4904-b15b-b153b7138203","resolution":{"observed_at":"2026-07-10T22:07:38.818218Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T22:07:39.270142Z","title":"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)⊤","venue":null,"work_id":"ac17da4b-e7f0-433e-bd4b-0a26daa0584c","year":null},"citing_paper":{"arxiv_id":"2607.06750","last_updated":"2026-07-07T19:31:38Z","snapshot_observed_at":"2026-08-10T02:34:56.414549Z","submitted_at":"2026-07-07T19:31:38Z","title":"Near-Optimal Lower Bounds on One-Bit Compressed Sensing of Approximately Sparse Signals","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-07-10T22:06:56.239466Z"},"links":{"citing_paper":"/paper/2607.06750"},"observation_digest":"sha256:cf226109eb7216eabc2987a9dc38ec881d9a644b349eca69fa5e4dc735c0d81b","observation_id":"02af0c46-d0d0-4549-b333-c8e317005692","resolution":{"observed_at":"2026-07-10T22:07:39.295848Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2607.06750","last_updated":"2026-07-07T19:31:38Z","latest_version":1,"primary_category":"cs.IT","snapshot_observed_at":"2026-08-10T02:34:56.414549Z","submitted_at":"2026-07-07T19:31:38Z","title":"Near-Optimal Lower Bounds on One-Bit Compressed Sensing of Approximately Sparse Signals"},"reference_resolution":{"displayed":30,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":1,"verified_exact":2,"verified_fuzzy":27},"total_outbound_references":30},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 30 of 30 outbound references and 0 inbound Pith citation observations for arXiv:2607.06750."}