{"as_of":"2026-08-18T22:32:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e15b20bda644a96e024c95619bab46db4d48c256db074dccfaa7989a0de5bbdf","coverage":[{"denominator":27,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":27,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T05:30:13.806188Z","state":"measured"},{"denominator":27,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":27,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+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/1909.01190/citation-record","integrity":"/paper/1909.01190/integrity","json":"/paper/1909.01190/citation-record.json","paper":"/paper/1909.01190"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:30:14.345666Z","title":"Bunea, A","venue":null,"work_id":"65ef322d-52f5-4844-8dca-f2000efa4a22","year":2007},"citing_paper":{"arxiv_id":"1909.01190","last_updated":"2019-09-04T11:14:52Z","snapshot_observed_at":"2026-08-17T11:46:17.513019Z","submitted_at":"2019-09-03T13:59:06Z","title":"Complexity analysis of the Controlled Loosening-up (CLuP) algorithm","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T05:30:13.671057Z"},"links":{"citing_paper":"/paper/1909.01190"},"observation_digest":"sha256:99cc644c6583ac1a3f89f75daa798a7502f4e993b4cfbff7cf96fdde2cf7f54b","observation_id":"a52a5e93-d036-4dc8-aed3-7b6bf8884d6a","resolution":{"observed_at":"2026-08-14T05:30:14.350472Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-08-14T05:30:14.329639Z","title":"Chen and D","venue":null,"work_id":"525ac98e-87b2-4d2c-aa65-ac2711e71dd1","year":1995},"citing_paper":{"arxiv_id":"1909.01190","last_updated":"2019-09-04T11:14:52Z","snapshot_observed_at":"2026-08-17T11:46:17.513019Z","submitted_at":"2019-09-03T13:59:06Z","title":"Complexity analysis of the Controlled Loosening-up (CLuP) algorithm","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T05:30:13.676530Z"},"links":{"citing_paper":"/paper/1909.01190"},"observation_digest":"sha256:7ad03dc71a2f85cc039c7a71ece278eb5f28a1dc2088fc87a50b7b7b03d293ec","observation_id":"f1d0ddb2-7a94-4a27-997a-ed2ee888846a","resolution":{"observed_at":"2026-08-14T05:30:14.334636Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1004.1218","last_updated":"2010-04-08T01:53:11Z","snapshot_observed_at":"2026-08-15T05:22:15.696171Z","submitted_at":"2010-04-08T01:53:11Z","title":"The Noise-Sensitivity Phase Transition in Compressed Sensing","version":1},"cited_work":{"arxiv_id":"1004.1218","doi":null,"metadata_source":"pith","pith_arxiv_id":"1004.1218","snapshot_observed_at":"2026-08-14T05:30:14.065992Z","title":"The Noise-Sensitivity Phase Transition in Compressed Sensing","venue":"math.ST","work_id":"930dbf95-b307-4a44-8ffd-55c389437e10","year":2010},"citing_paper":{"arxiv_id":"1909.01190","last_updated":"2019-09-04T11:14:52Z","snapshot_observed_at":"2026-08-17T11:46:17.513019Z","submitted_at":"2019-09-03T13:59:06Z","title":"Complexity analysis of the Controlled Loosening-up (CLuP) algorithm","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T05:30:13.681637Z"},"links":{"cited_paper":"/paper/1004.1218","citing_paper":"/paper/1909.01190"},"observation_digest":"sha256:bb659f1d05c856c42a98ceb6040c44bade2dfc98cc9d1e2341213d8ee15294e0","observation_id":"02e51a78-5a60-4700-9085-9551603292d2","resolution":{"observed_at":"2026-08-14T05:30:14.072138Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-08-14T05:30:14.313104Z","title":"Fincke and M","venue":null,"work_id":"127bccd9-6fbf-4413-b05a-0244e5a291dd","year":1985},"citing_paper":{"arxiv_id":"1909.01190","last_updated":"2019-09-04T11:14:52Z","snapshot_observed_at":"2026-08-17T11:46:17.513019Z","submitted_at":"2019-09-03T13:59:06Z","title":"Complexity analysis of the Controlled Loosening-up (CLuP) algorithm","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T05:30:13.687019Z"},"links":{"citing_paper":"/paper/1909.01190"},"observation_digest":"sha256:bd14c9b2f42f71f031b2f4011e821c86ab1cb9baacafb75f1ec312d3912c665e","observation_id":"1a2c4191-c873-4362-86c1-af1e7373ba0b","resolution":{"observed_at":"2026-08-14T05:30:14.318326Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-08-14T05:30:14.294661Z","title":"Goemans and D","venue":null,"work_id":"a1aa39a2-ea1a-47d2-9e39-c9ffed35759c","year":1995},"citing_paper":{"arxiv_id":"1909.01190","last_updated":"2019-09-04T11:14:52Z","snapshot_observed_at":"2026-08-17T11:46:17.513019Z","submitted_at":"2019-09-03T13:59:06Z","title":"Complexity analysis of the Controlled Loosening-up (CLuP) algorithm","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T05:30:13.692173Z"},"links":{"citing_paper":"/paper/1909.01190"},"observation_digest":"sha256:d1fea591c8ba99a691b4a0ba6900b08e68cac13d46152e8aa09cc79c26a57962","observation_id":"7ebe2fef-89ca-46f7-9691-7040eced1fdf","resolution":{"observed_at":"2026-08-14T05:30:14.300259Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-08-14T05:30:14.276298Z","title":"Golub and C","venue":null,"work_id":"cc479358-d2fe-41bf-aa91-24600e598536","year":1996},"citing_paper":{"arxiv_id":"1909.01190","last_updated":"2019-09-04T11:14:52Z","snapshot_observed_at":"2026-08-17T11:46:17.513019Z","submitted_at":"2019-09-03T13:59:06Z","title":"Complexity analysis of the Controlled Loosening-up (CLuP) algorithm","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T05:30:13.696916Z"},"links":{"citing_paper":"/paper/1909.01190"},"observation_digest":"sha256:fe4db2b4bd93a0586f05d8189942384a3774e10d3d81a25a19a9256574b3f35d","observation_id":"449cb732-06a1-4a85-92cf-6b57fa312ba8","resolution":{"observed_at":"2026-08-14T05:30:14.281834Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-08-14T05:30:14.259309Z","title":"Hassibi and H","venue":null,"work_id":"d7e1c048-7300-4351-aab6-16d28d746e67","year":2005},"citing_paper":{"arxiv_id":"1909.01190","last_updated":"2019-09-04T11:14:52Z","snapshot_observed_at":"2026-08-17T11:46:17.513019Z","submitted_at":"2019-09-03T13:59:06Z","title":"Complexity analysis of the Controlled Loosening-up (CLuP) algorithm","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T05:30:13.701862Z"},"links":{"citing_paper":"/paper/1909.01190"},"observation_digest":"sha256:fc9fbe1e98bd09ac6367caf25372a18814eab5f4c7ada5df4cf2bfa4d04b42b8","observation_id":"5474eb38-3087-4017-9b11-e7e890b17275","resolution":{"observed_at":"2026-08-14T05:30:14.264137Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-08-14T05:30:14.243298Z","title":"Jalden and B","venue":null,"work_id":"b9e7ef8e-daa7-43f3-900f-250a9bbb46c7","year":2005},"citing_paper":{"arxiv_id":"1909.01190","last_updated":"2019-09-04T11:14:52Z","snapshot_observed_at":"2026-08-17T11:46:17.513019Z","submitted_at":"2019-09-03T13:59:06Z","title":"Complexity analysis of the Controlled Loosening-up (CLuP) algorithm","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T05:30:13.707753Z"},"links":{"citing_paper":"/paper/1909.01190"},"observation_digest":"sha256:4113d623edb871abe55b26bec25ec47292b45af5f25564b0aed80bcd79cc9eb5","observation_id":"da144bc8-cce1-4a81-b1e2-7651c9e61656","resolution":{"observed_at":"2026-08-14T05:30:14.248410Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-08-14T05:30:14.225111Z","title":"Lovasz M","venue":null,"work_id":"905757e6-3f56-4c13-8955-4491bf1e58c1","year":1993},"citing_paper":{"arxiv_id":"1909.01190","last_updated":"2019-09-04T11:14:52Z","snapshot_observed_at":"2026-08-17T11:46:17.513019Z","submitted_at":"2019-09-03T13:59:06Z","title":"Complexity analysis of the Controlled Loosening-up (CLuP) algorithm","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T05:30:13.712986Z"},"links":{"citing_paper":"/paper/1909.01190"},"observation_digest":"sha256:1a6a625b87ad3bf5ac531105f6db926132265a55aeb2f7ec5f2afd8f02d4fe77","observation_id":"74edb202-43fa-4163-9afd-28924520abe1","resolution":{"observed_at":"2026-08-14T05:30:14.231784Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-08-14T05:30:14.199112Z","title":"Meinshausen and B","venue":null,"work_id":"c358fd75-785b-415b-8987-ed7e3fefeb8b","year":2009},"citing_paper":{"arxiv_id":"1909.01190","last_updated":"2019-09-04T11:14:52Z","snapshot_observed_at":"2026-08-17T11:46:17.513019Z","submitted_at":"2019-09-03T13:59:06Z","title":"Complexity analysis of the Controlled Loosening-up (CLuP) algorithm","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-14T05:30:13.718047Z"},"links":{"citing_paper":"/paper/1909.01190"},"observation_digest":"sha256:d9013d8d11821ff27bf39312d32aec88916458797efa3e8e5a46b1f925775d1d","observation_id":"11158137-c4a8-4d17-b79f-10b0afad44e3","resolution":{"observed_at":"2026-08-14T05:30:14.204838Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"0907.3679","last_updated":"2009-07-21T15:13:07Z","snapshot_observed_at":"2026-08-17T21:26:31.669386Z","submitted_at":"2009-07-21T15:13:07Z","title":"Block-length dependent thresholds in block-sparse compressed sensing","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"0907.3679","snapshot_observed_at":"2026-08-14T05:30:13.722919Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"1909.01190","last_updated":"2019-09-04T11:14:52Z","snapshot_observed_at":"2026-08-17T11:46:17.513019Z","submitted_at":"2019-09-03T13:59:06Z","title":"Complexity analysis of the Controlled Loosening-up (CLuP) algorithm","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-14T05:30:13.722919Z"},"links":{"cited_paper":"/paper/0907.3679","citing_paper":"/paper/1909.01190"},"observation_digest":"sha256:647dca12063c7572077541bd568ce14d8e6b36ef10566d899f27d8fa67b83a01","observation_id":"f58fe506-f59b-49ec-bcf6-2391e13f5ed3","resolution":{"observed_at":"2026-08-14T05:30:13.722919Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1306.4375","last_updated":"2013-06-17T11:05:26Z","snapshot_observed_at":"2026-08-15T00:13:51.911150Z","submitted_at":"2013-06-17T11:05:26Z","title":"Discrete perceptrons","version":1},"cited_work":{"arxiv_id":"1306.4375","doi":null,"metadata_source":"pith","pith_arxiv_id":"1306.4375","snapshot_observed_at":"2026-08-14T05:30:14.024015Z","title":"Discrete perceptrons","venue":"math.PR","work_id":"dd8eb333-baed-4a41-9b31-63370fdd79eb","year":2013},"citing_paper":{"arxiv_id":"1909.01190","last_updated":"2019-09-04T11:14:52Z","snapshot_observed_at":"2026-08-17T11:46:17.513019Z","submitted_at":"2019-09-03T13:59:06Z","title":"Complexity analysis of the Controlled Loosening-up (CLuP) algorithm","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T05:30:13.729031Z"},"links":{"cited_paper":"/paper/1306.4375","citing_paper":"/paper/1909.01190"},"observation_digest":"sha256:a6ede2c3e0caa33da8b8ba22db87c0b8fcadb78a3e519ad751894e00406dec34","observation_id":"f2af7308-b179-4fa0-91bb-a7ec6d311923","resolution":{"observed_at":"2026-08-14T05:30:14.030041Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1303.7291","last_updated":"2013-03-29T03:55:09Z","snapshot_observed_at":"2026-08-15T00:23:19.411775Z","submitted_at":"2013-03-29T03:55:09Z","title":"A framework to characterize performance of LASSO algorithms","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1303.7291","snapshot_observed_at":"2026-08-14T05:30:13.734548Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"1909.01190","last_updated":"2019-09-04T11:14:52Z","snapshot_observed_at":"2026-08-17T11:46:17.513019Z","submitted_at":"2019-09-03T13:59:06Z","title":"Complexity analysis of the Controlled Loosening-up (CLuP) algorithm","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-14T05:30:13.734548Z"},"links":{"cited_paper":"/paper/1303.7291","citing_paper":"/paper/1909.01190"},"observation_digest":"sha256:fd0e190540d27a39e276fcb819c6d4db9f581173696d2b03cbdfae057be333e7","observation_id":"87d82a13-eca8-4ba0-bb97-aab232875810","resolution":{"observed_at":"2026-08-14T05:30:13.734548Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1304.0002","last_updated":"2013-03-29T04:00:23Z","snapshot_observed_at":"2026-08-15T00:23:17.929006Z","submitted_at":"2013-03-29T04:00:23Z","title":"A performance analysis framework for SOCP algorithms in noisy compressed sensing","version":1},"cited_work":{"arxiv_id":"1304.0002","doi":null,"metadata_source":"pith","pith_arxiv_id":"1304.0002","snapshot_observed_at":"2026-08-14T05:30:13.978106Z","title":"A performance analysis framework for SOCP algorithms in noisy compressed sensing","venue":"cs.IT","work_id":"5463cd46-2b99-4a45-b37f-d2098f71371e","year":2013},"citing_paper":{"arxiv_id":"1909.01190","last_updated":"2019-09-04T11:14:52Z","snapshot_observed_at":"2026-08-17T11:46:17.513019Z","submitted_at":"2019-09-03T13:59:06Z","title":"Complexity analysis of the Controlled Loosening-up (CLuP) algorithm","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-14T05:30:13.739834Z"},"links":{"cited_paper":"/paper/1304.0002","citing_paper":"/paper/1909.01190"},"observation_digest":"sha256:f6cc133d822d8911022bcf0406e4995589a842ba501b58b19711409439c21304","observation_id":"0d238931-2d72-46c4-b556-dabd33f62ccc","resolution":{"observed_at":"2026-08-14T05:30:13.983922Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1304.0480","last_updated":"2013-03-29T04:35:58Z","snapshot_observed_at":"2026-08-15T00:23:17.661012Z","submitted_at":"2013-03-29T04:35:58Z","title":"A problem dependent analysis of SOCP algorithms in noisy compressed sensing","version":1},"cited_work":{"arxiv_id":"1304.0480","doi":null,"metadata_source":"pith","pith_arxiv_id":"1304.0480","snapshot_observed_at":"2026-08-14T05:30:13.952765Z","title":"A problem dependent analysis of SOCP algorithms in noisy compressed sensing","venue":"cs.IT","work_id":"b8b91071-bf54-49a5-83e1-297e0326fa07","year":2013},"citing_paper":{"arxiv_id":"1909.01190","last_updated":"2019-09-04T11:14:52Z","snapshot_observed_at":"2026-08-17T11:46:17.513019Z","submitted_at":"2019-09-03T13:59:06Z","title":"Complexity analysis of the Controlled Loosening-up (CLuP) algorithm","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-14T05:30:13.745112Z"},"links":{"cited_paper":"/paper/1304.0480","citing_paper":"/paper/1909.01190"},"observation_digest":"sha256:de824483b08d09c9f6c27b23709d142ba7f9c629c0c89cddc18644662c1d139e","observation_id":"563a1f37-2a5b-4687-ad71-68ddb733c1a8","resolution":{"observed_at":"2026-08-14T05:30:13.958926Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1303.7295","last_updated":"2013-03-29T04:41:51Z","snapshot_observed_at":"2026-08-15T00:23:17.723018Z","submitted_at":"2013-03-29T04:41:51Z","title":"Regularly random duality","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1303.7295","snapshot_observed_at":"2026-08-14T05:30:13.750683Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"1909.01190","last_updated":"2019-09-04T11:14:52Z","snapshot_observed_at":"2026-08-17T11:46:17.513019Z","submitted_at":"2019-09-03T13:59:06Z","title":"Complexity analysis of the Controlled Loosening-up (CLuP) algorithm","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-14T05:30:13.750683Z"},"links":{"cited_paper":"/paper/1303.7295","citing_paper":"/paper/1909.01190"},"observation_digest":"sha256:e961620710fa944e49fbb098dff88d5816655ebb3196ace5cc7658167294270e","observation_id":"332e266d-7f59-4c3d-beca-a4a81a0bf3ed","resolution":{"observed_at":"2026-08-14T05:30:13.750683Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1303.7289","last_updated":"2013-03-29T03:44:53Z","snapshot_observed_at":"2026-08-15T00:23:19.619200Z","submitted_at":"2013-03-29T03:44:53Z","title":"Upper-bounding $\\ell_1$-optimization weak thresholds","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1303.7289","snapshot_observed_at":"2026-08-14T05:30:13.755439Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"1909.01190","last_updated":"2019-09-04T11:14:52Z","snapshot_observed_at":"2026-08-17T11:46:17.513019Z","submitted_at":"2019-09-03T13:59:06Z","title":"Complexity analysis of the Controlled Loosening-up (CLuP) algorithm","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-14T05:30:13.755439Z"},"links":{"cited_paper":"/paper/1303.7289","citing_paper":"/paper/1909.01190"},"observation_digest":"sha256:63f5df32cb7782332047d804e6bc1c8feeff6f88f368409c8c20804d655d4238","observation_id":"c7dd10fe-483d-4331-b243-0f94b39cb115","resolution":{"observed_at":"2026-08-14T05:30:13.755439Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"0907.3666","last_updated":"2009-07-21T14:40:27Z","snapshot_observed_at":"2026-08-15T05:43:12.751026Z","submitted_at":"2009-07-21T14:40:27Z","title":"Various thresholds for $\\ell_1$-optimization in compressed sensing","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"0907.3666","snapshot_observed_at":"2026-08-14T05:30:13.759994Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"1909.01190","last_updated":"2019-09-04T11:14:52Z","snapshot_observed_at":"2026-08-17T11:46:17.513019Z","submitted_at":"2019-09-03T13:59:06Z","title":"Complexity analysis of the Controlled Loosening-up (CLuP) algorithm","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-14T05:30:13.759994Z"},"links":{"cited_paper":"/paper/0907.3666","citing_paper":"/paper/1909.01190"},"observation_digest":"sha256:bc49bf6f65e9ad0e8bb8796ac7b4c267714759d6f623fb59fd192b1a14cfad14","observation_id":"50233c42-6212-4782-8e4f-23ca59fc219c","resolution":{"observed_at":"2026-08-14T05:30:13.759994Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:30:13.764782Z","title":null,"venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"1909.01190","last_updated":"2019-09-04T11:14:52Z","snapshot_observed_at":"2026-08-17T11:46:17.513019Z","submitted_at":"2019-09-03T13:59:06Z","title":"Complexity analysis of the Controlled Loosening-up (CLuP) algorithm","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-14T05:30:13.764782Z"},"links":{"citing_paper":"/paper/1909.01190"},"observation_digest":"sha256:9b4391e53fdb9958b40d7affec2810ab04b43312201eac4c95492f43cfc55b07","observation_id":"76cfcbc1-bc27-4c29-89e1-160ebebfcabe","resolution":{"observed_at":"2026-08-14T05:30:13.764782Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1612.06835","last_updated":"2016-12-20T20:23:38Z","snapshot_observed_at":"2026-08-14T21:24:27.798308Z","submitted_at":"2016-12-20T20:23:38Z","title":"Box constrained $\\ell_1$ optimization in random linear systems -- asymptotics","version":1},"cited_work":{"arxiv_id":"1612.06835","doi":null,"metadata_source":"pith","pith_arxiv_id":"1612.06835","snapshot_observed_at":"2026-08-14T05:30:13.871886Z","title":"Box constrained $\\ell_1$ optimization in random linear systems -- asymptotics","venue":"math.PR","work_id":"6d353126-5baa-4580-8564-40e3757f4bd2","year":2016},"citing_paper":{"arxiv_id":"1909.01190","last_updated":"2019-09-04T11:14:52Z","snapshot_observed_at":"2026-08-17T11:46:17.513019Z","submitted_at":"2019-09-03T13:59:06Z","title":"Complexity analysis of the Controlled Loosening-up (CLuP) algorithm","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-14T05:30:13.769731Z"},"links":{"cited_paper":"/paper/1612.06835","citing_paper":"/paper/1909.01190"},"observation_digest":"sha256:81990f3db59d51ca7c2caed7068d921d137405beb9ce7c2d085c757fed95c6a7","observation_id":"2b508b8a-1017-433f-96fa-bd7a4b6c96f1","resolution":{"observed_at":"2026-08-14T05:30:13.878587Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1612.06839","last_updated":"2016-12-20T20:34:01Z","snapshot_observed_at":"2026-08-14T21:24:27.461970Z","submitted_at":"2016-12-20T20:34:01Z","title":"Box constrained $\\ell_1$ optimization in random linear systems -- finite dimensions","version":1},"cited_work":{"arxiv_id":"1612.06839","doi":null,"metadata_source":"pith","pith_arxiv_id":"1612.06839","snapshot_observed_at":"2026-08-14T05:30:13.844249Z","title":"Box constrained $\\ell_1$ optimization in random linear systems -- finite dimensions","venue":"math.OC","work_id":"a4ff75b0-297b-4a1c-8af1-4cc778e19c4f","year":2016},"citing_paper":{"arxiv_id":"1909.01190","last_updated":"2019-09-04T11:14:52Z","snapshot_observed_at":"2026-08-17T11:46:17.513019Z","submitted_at":"2019-09-03T13:59:06Z","title":"Complexity analysis of the Controlled Loosening-up (CLuP) algorithm","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-14T05:30:13.775895Z"},"links":{"cited_paper":"/paper/1612.06839","citing_paper":"/paper/1909.01190"},"observation_digest":"sha256:9c68b8913e107473dc9e5fda3de2782494f2fe02a3756835d889e7522ac6c1ac","observation_id":"3861c092-ab72-4978-9ec7-90aa399ae457","resolution":{"observed_at":"2026-08-14T05:30:13.851849Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-08-14T05:30:14.169722Z","title":null,"venue":null,"work_id":"2f47f29b-4ef2-4273-a06f-0ece3103abda","year":2019},"citing_paper":{"arxiv_id":"1909.01190","last_updated":"2019-09-04T11:14:52Z","snapshot_observed_at":"2026-08-17T11:46:17.513019Z","submitted_at":"2019-09-03T13:59:06Z","title":"Complexity analysis of the Controlled Loosening-up (CLuP) algorithm","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-14T05:30:13.781781Z"},"links":{"citing_paper":"/paper/1909.01190"},"observation_digest":"sha256:c802af572eb9fd18bab569dd97b288ad2d662d145f1923b1f14fdc4b54fa332f","observation_id":"df41fbd1-13d4-4876-ad7e-298b0baa069e","resolution":{"observed_at":"2026-08-14T05:30:14.174936Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-08-14T05:30:14.151217Z","title":"Stojnic, Haris Vikalo, and Babak Hassibi","venue":null,"work_id":"49793d41-17ea-45af-80b5-256df41df29f","year":2005},"citing_paper":{"arxiv_id":"1909.01190","last_updated":"2019-09-04T11:14:52Z","snapshot_observed_at":"2026-08-17T11:46:17.513019Z","submitted_at":"2019-09-03T13:59:06Z","title":"Complexity analysis of the Controlled Loosening-up (CLuP) algorithm","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-14T05:30:13.786798Z"},"links":{"citing_paper":"/paper/1909.01190"},"observation_digest":"sha256:46235cd99a38887849fee9734da01f8a5ad9ebabccb9349996e61e02dff9acfa","observation_id":"18c5ade2-e5b6-465e-afdb-2bdf2a343790","resolution":{"observed_at":"2026-08-14T05:30:14.157209Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-08-14T05:30:14.134663Z","title":"Stojnic, Haris Vikalo, and Babak Hassibi","venue":null,"work_id":"84467180-fe7a-41ec-858b-32bd465b0fba","year":2008},"citing_paper":{"arxiv_id":"1909.01190","last_updated":"2019-09-04T11:14:52Z","snapshot_observed_at":"2026-08-17T11:46:17.513019Z","submitted_at":"2019-09-03T13:59:06Z","title":"Complexity analysis of the Controlled Loosening-up (CLuP) algorithm","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-14T05:30:13.791647Z"},"links":{"citing_paper":"/paper/1909.01190"},"observation_digest":"sha256:419446bd48704b2f226459e3767b801c4b4d6e9d518aa98121e1751d9e64ecc5","observation_id":"70005b7e-f5ff-4dca-be33-0d4a27dc0fe9","resolution":{"observed_at":"2026-08-14T05:30:14.139922Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-08-14T05:30:14.117905Z","title":"Tibshirani","venue":null,"work_id":"88b74713-7b08-4735-862f-662cb614e1e2","year":1996},"citing_paper":{"arxiv_id":"1909.01190","last_updated":"2019-09-04T11:14:52Z","snapshot_observed_at":"2026-08-17T11:46:17.513019Z","submitted_at":"2019-09-03T13:59:06Z","title":"Complexity analysis of the Controlled Loosening-up (CLuP) algorithm","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-14T05:30:13.796352Z"},"links":{"citing_paper":"/paper/1909.01190"},"observation_digest":"sha256:07a21c8948f79f70744f137dfedc15ae2ce0f70c26b0a7c40ec0c76f2442eac4","observation_id":"7f431aaa-bf73-41e5-bb75-61dbd5022d98","resolution":{"observed_at":"2026-08-14T05:30:14.123483Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-08-14T05:30:14.100074Z","title":"van de Geer","venue":null,"work_id":"f43d5b57-c95a-4916-8bac-a874c0ed39af","year":2008},"citing_paper":{"arxiv_id":"1909.01190","last_updated":"2019-09-04T11:14:52Z","snapshot_observed_at":"2026-08-17T11:46:17.513019Z","submitted_at":"2019-09-03T13:59:06Z","title":"Complexity analysis of the Controlled Loosening-up (CLuP) algorithm","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-14T05:30:13.801225Z"},"links":{"citing_paper":"/paper/1909.01190"},"observation_digest":"sha256:7e8309e7427c8234014b9932ffbd24dbd24db488c3f409e13a1ff7ecf29113b4","observation_id":"200479e5-4dd1-4adc-94cb-15a050a4ce5d","resolution":{"observed_at":"2026-08-14T05:30:14.105332Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-08-14T05:30:14.083782Z","title":"van Maaren and J.P","venue":null,"work_id":"47b21678-8fb2-46df-ba58-fca90a4a33bc","year":2000},"citing_paper":{"arxiv_id":"1909.01190","last_updated":"2019-09-04T11:14:52Z","snapshot_observed_at":"2026-08-17T11:46:17.513019Z","submitted_at":"2019-09-03T13:59:06Z","title":"Complexity analysis of the Controlled Loosening-up (CLuP) algorithm","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-14T05:30:13.806188Z"},"links":{"citing_paper":"/paper/1909.01190"},"observation_digest":"sha256:582eb38509ece04e3902dc1bf813cad1c7446bbc9cfafdcfaa2fc16748baebf1","observation_id":"760c10b4-cbf1-4391-9e14-69a6b6b050d9","resolution":{"observed_at":"2026-08-14T05:30:14.088978Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"1909.01190","last_updated":"2019-09-04T11:14:52Z","latest_version":2,"primary_category":"cs.IT","snapshot_observed_at":"2026-08-17T11:46:17.513019Z","submitted_at":"2019-09-03T13:59:06Z","title":"Complexity analysis of the Controlled Loosening-up (CLuP) algorithm"},"reference_resolution":{"displayed":27,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":7,"verified_exact":6,"verified_fuzzy":14},"total_outbound_references":27},"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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 27 of 27 outbound references and 0 inbound Pith citation observations for arXiv:1909.01190."}