{"as_of":"2026-08-20T12:53:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:20c1f66deac91f42a06de85d4c55535dd1460a4563c478e5200e0fa3cbc65ee3","coverage":[{"denominator":36,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":36,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T13:47:06.041556Z","state":"measured"},{"denominator":36,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":36,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-20T06:33:59.587034+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/1908.04433/citation-record","integrity":"/paper/1908.04433/integrity","json":"/paper/1908.04433/citation-record.json","paper":"/paper/1908.04433"},"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-14T13:47:06.467282Z","title":"Monotonic central limit theorem for densities","venue":null,"work_id":"e78c43fb-29a7-4b44-8da0-e878ac2ec0cb","year":1984},"citing_paper":{"arxiv_id":"1908.04433","last_updated":"2020-01-23T19:54:10Z","snapshot_observed_at":"2026-08-20T07:18:28.769055Z","submitted_at":"2019-08-12T22:51:06Z","title":"Sharp Guarantees for Solving Random Equations with One-Bit Information","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T13:47:05.909282Z"},"links":{"citing_paper":"/paper/1908.04433"},"observation_digest":"sha256:4d4840b6ab34f0ef17dc26b13a7d62754d289f43aa362deace534c10fb4fd81f","observation_id":"eafa51eb-3c5b-46c7-80b0-4b8b13a330ca","resolution":{"observed_at":"2026-08-14T13:47:06.471160Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-14T13:47:06.456201Z","title":"The dynamics of message passing on dense graphs, with applications to compressed sensing","venue":null,"work_id":"e56fc5af-547c-44f9-bc0b-093ee8876e8c","year":2011},"citing_paper":{"arxiv_id":"1908.04433","last_updated":"2020-01-23T19:54:10Z","snapshot_observed_at":"2026-08-20T07:18:28.769055Z","submitted_at":"2019-08-12T22:51:06Z","title":"Sharp Guarantees for Solving Random Equations with One-Bit Information","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T13:47:05.913818Z"},"links":{"citing_paper":"/paper/1908.04433"},"observation_digest":"sha256:b16007f9dd02cdc504eea5fb8b4c4ccf7451146dc740a3b3007f8272b61124d2","observation_id":"3c3e4798-420b-4adb-b353-d656bc897e4d","resolution":{"observed_at":"2026-08-14T13:47:06.460355Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-14T13:47:06.445031Z","title":"The lasso risk for gaussian matrices","venue":null,"work_id":"078410fb-fe04-4526-a83d-6ebcf6e4a6df","year":1997},"citing_paper":{"arxiv_id":"1908.04433","last_updated":"2020-01-23T19:54:10Z","snapshot_observed_at":"2026-08-20T07:18:28.769055Z","submitted_at":"2019-08-12T22:51:06Z","title":"Sharp Guarantees for Solving Random Equations with One-Bit Information","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T13:47:05.917675Z"},"links":{"citing_paper":"/paper/1908.04433"},"observation_digest":"sha256:63b99265bf75015b488bbdb5c4bbaeca114f1498cb8b9a1212c6bdf477309f79","observation_id":"ea33f551-94ce-4805-bf7b-98e040a903e0","resolution":{"observed_at":"2026-08-14T13:47:06.448753Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1304.2488","last_updated":"2013-04-09T08:29:02Z","snapshot_observed_at":"2026-08-19T11:59:12.406705Z","submitted_at":"2013-04-09T08:29:02Z","title":"Log-Quadratic Bounds for the Gaussian Q-function","version":1},"cited_work":{"arxiv_id":"1304.2488","doi":null,"metadata_source":"pith","pith_arxiv_id":"1304.2488","snapshot_observed_at":"2026-08-14T13:47:06.198192Z","title":"Log-Quadratic Bounds for the Gaussian Q-function","venue":"math.PR","work_id":"0858fa18-2362-48b9-94ee-e54d8270f28b","year":2013},"citing_paper":{"arxiv_id":"1908.04433","last_updated":"2020-01-23T19:54:10Z","snapshot_observed_at":"2026-08-20T07:18:28.769055Z","submitted_at":"2019-08-12T22:51:06Z","title":"Sharp Guarantees for Solving Random Equations with One-Bit Information","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T13:47:05.921615Z"},"links":{"cited_paper":"/paper/1304.2488","citing_paper":"/paper/1908.04433"},"observation_digest":"sha256:ab3aa90ea2ac60a148a8d3614edb1c32e52df496c58608d413327f9fa9a03593","observation_id":"2f0b3398-56b1-4752-a1d5-38b305192cfe","resolution":{"observed_at":"2026-08-14T13:47:06.202289Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-14T13:47:06.434226Z","title":"1-bit compressive sensing","venue":null,"work_id":"3f8491dc-65c4-49d2-8e8b-e10e0f11f740","year":2008},"citing_paper":{"arxiv_id":"1908.04433","last_updated":"2020-01-23T19:54:10Z","snapshot_observed_at":"2026-08-20T07:18:28.769055Z","submitted_at":"2019-08-12T22:51:06Z","title":"Sharp Guarantees for Solving Random Equations with One-Bit Information","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T13:47:05.925908Z"},"links":{"citing_paper":"/paper/1908.04433"},"observation_digest":"sha256:ccf3dd3e88660ad4f67f7ab3bf7b270c4ecf3a37646432bc1b08c5b616a191e9","observation_id":"1cd3dac0-eb6d-4a43-bd4c-01a8ed9469d7","resolution":{"observed_at":"2026-08-14T13:47:06.437928Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-14T13:47:06.422995Z","title":"A generalized linear model with” gaussian” regressor variables","venue":null,"work_id":"fdcbd4a9-5925-4aa6-bd2e-417a1b079729","year":1982},"citing_paper":{"arxiv_id":"1908.04433","last_updated":"2020-01-23T19:54:10Z","snapshot_observed_at":"2026-08-20T07:18:28.769055Z","submitted_at":"2019-08-12T22:51:06Z","title":"Sharp Guarantees for Solving Random Equations with One-Bit Information","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T13:47:05.929619Z"},"links":{"citing_paper":"/paper/1908.04433"},"observation_digest":"sha256:7e29a39f040d1d75f9238694ea6c77029ae06ee5a0e1a6fb90f4ff07bb55fd39","observation_id":"2470964b-3b83-4c22-8f60-56d26328a68d","resolution":{"observed_at":"2026-08-14T13:47:06.426941Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1804.09753","last_updated":"2018-04-25T18:53:11Z","snapshot_observed_at":"2026-08-14T19:21:55.065588Z","submitted_at":"2018-04-25T18:53:11Z","title":"The phase transition for the existence of the maximum likelihood estimate in high-dimensional logistic regression","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1804.09753","snapshot_observed_at":"2026-08-14T13:47:05.933446Z","title":"The phase transition for the existence of the maximum likelihood estimate in high-dimensional logistic regression","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"1908.04433","last_updated":"2020-01-23T19:54:10Z","snapshot_observed_at":"2026-08-20T07:18:28.769055Z","submitted_at":"2019-08-12T22:51:06Z","title":"Sharp Guarantees for Solving Random Equations with One-Bit Information","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T13:47:05.933446Z"},"links":{"cited_paper":"/paper/1804.09753","citing_paper":"/paper/1908.04433"},"observation_digest":"sha256:e77f3eb2fcd9ba147f3d63e58fed8c4580f1462638f957e03cfc3289dc4985fa","observation_id":"6c9b69f7-b32e-4b23-bd32-da62dab2eb09","resolution":{"observed_at":"2026-08-14T13:47:05.933446Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:47:06.412349Z","title":"The convex geometry of linear inverse problems.Foundations of Computational Mathematics , 12(6):805–849, 2012","venue":null,"work_id":"76463f9a-d5a4-4c43-b9ed-3dfdf7e6de5f","year":2012},"citing_paper":{"arxiv_id":"1908.04433","last_updated":"2020-01-23T19:54:10Z","snapshot_observed_at":"2026-08-20T07:18:28.769055Z","submitted_at":"2019-08-12T22:51:06Z","title":"Sharp Guarantees for Solving Random Equations with One-Bit Information","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T13:47:05.937330Z"},"links":{"citing_paper":"/paper/1908.04433"},"observation_digest":"sha256:fb4c878ca9f3b1dc05bebe3c1259faa91c2009e812a5d0b184203453b87f502c","observation_id":"bfd4311a-f9b1-491b-b328-e8d292b4ab44","resolution":{"observed_at":"2026-08-14T13:47:06.416080Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1805.09555","last_updated":"2018-05-24T08:58:28Z","snapshot_observed_at":"2026-08-14T19:11:40.618541Z","submitted_at":"2018-05-24T08:58:28Z","title":"Phase Retrieval via Polytope Optimization: Geometry, Phase Transitions, and New Algorithms","version":1},"cited_work":{"arxiv_id":"1805.09555","doi":null,"metadata_source":"pith","pith_arxiv_id":"1805.09555","snapshot_observed_at":"2026-08-14T13:47:06.174071Z","title":"Phase Retrieval via Polytope Optimization: Geometry, Phase Transitions, and New Algorithms","venue":"cs.IT","work_id":"889dc03d-3a04-4e7c-b736-bd355600b22a","year":2018},"citing_paper":{"arxiv_id":"1908.04433","last_updated":"2020-01-23T19:54:10Z","snapshot_observed_at":"2026-08-20T07:18:28.769055Z","submitted_at":"2019-08-12T22:51:06Z","title":"Sharp Guarantees for Solving Random Equations with One-Bit Information","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T13:47:05.940702Z"},"links":{"cited_paper":"/paper/1805.09555","citing_paper":"/paper/1908.04433"},"observation_digest":"sha256:8bf3a9c4c732c0326c196baaf1b04ddc653b0432c9f1402cb76e72d7c767e943","observation_id":"362fcf7b-b6fb-4177-8aae-55276595918e","resolution":{"observed_at":"2026-08-14T13:47:06.177968Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-14T13:47:06.401767Z","title":"High dimensional robust m- estimation: Asymptotic variance via approximate message passing","venue":null,"work_id":"2fd25dcb-cb11-48a2-9573-9c00a23d597a","year":2016},"citing_paper":{"arxiv_id":"1908.04433","last_updated":"2020-01-23T19:54:10Z","snapshot_observed_at":"2026-08-20T07:18:28.769055Z","submitted_at":"2019-08-12T22:51:06Z","title":"Sharp Guarantees for Solving Random Equations with One-Bit Information","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-14T13:47:05.944401Z"},"links":{"citing_paper":"/paper/1908.04433"},"observation_digest":"sha256:a0ec985abb7717450d53ff1c1c8a62b3252827e45232c6e9192535005ed739f4","observation_id":"351c38b0-d17f-4a02-861b-c4f5e0e0c364","resolution":{"observed_at":"2026-08-14T13:47:06.405491Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-14T13:47:06.390850Z","title":"Message- passing algorithms for compressed sensing","venue":null,"work_id":"b1d92ea9-c717-48da-96a7-49f6b57d1fd9","year":2009},"citing_paper":{"arxiv_id":"1908.04433","last_updated":"2020-01-23T19:54:10Z","snapshot_observed_at":"2026-08-20T07:18:28.769055Z","submitted_at":"2019-08-12T22:51:06Z","title":"Sharp Guarantees for Solving Random Equations with One-Bit Information","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-14T13:47:05.949562Z"},"links":{"citing_paper":"/paper/1908.04433"},"observation_digest":"sha256:7e80e108366ded328004d2f86f9508c305cf536f899fdb92791da379e14ce148","observation_id":"33b87a80-de9f-429b-8bad-e93d28645aad","resolution":{"observed_at":"2026-08-14T13:47:06.394696Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-14T13:47:06.379133Z","title":"The noise- sensitivity phase transition in compressed sensing","venue":null,"work_id":"5b29af3d-2d64-43e7-a3dc-3eff9454d17b","year":2011},"citing_paper":{"arxiv_id":"1908.04433","last_updated":"2020-01-23T19:54:10Z","snapshot_observed_at":"2026-08-20T07:18:28.769055Z","submitted_at":"2019-08-12T22:51:06Z","title":"Sharp Guarantees for Solving Random Equations with One-Bit Information","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T13:47:05.953408Z"},"links":{"citing_paper":"/paper/1908.04433"},"observation_digest":"sha256:2ce2abaef98b1151b7cd37c5f455a2f305ab967a2a8b43de7875e33b9a90e2df","observation_id":"eea96e55-7064-4c3d-8679-d0504f37aaa5","resolution":{"observed_at":"2026-08-14T13:47:06.383374Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-14T13:47:06.367952Z","title":"On the impact of predictor geometry on the performance on high-dimensional ridge-regularized generalized robust regression estimators","venue":null,"work_id":"bcd4100f-e8b3-4f4b-b017-c5431b5675bf","year":2015},"citing_paper":{"arxiv_id":"1908.04433","last_updated":"2020-01-23T19:54:10Z","snapshot_observed_at":"2026-08-20T07:18:28.769055Z","submitted_at":"2019-08-12T22:51:06Z","title":"Sharp Guarantees for Solving Random Equations with One-Bit Information","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-14T13:47:05.956906Z"},"links":{"citing_paper":"/paper/1908.04433"},"observation_digest":"sha256:3e71a8ffeb32a50683eddcce8a94f99078734ead59b9adfad9d8b5f79f336d79","observation_id":"b0c0bc32-849e-4a2d-8300-cd147edfdb67","resolution":{"observed_at":"2026-08-14T13:47:06.372086Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-14T13:47:06.356864Z","title":"High-dimensional estimation of structured signals from non-linear observations with general convex loss functions","venue":null,"work_id":"8f057b26-3852-463f-a1de-58545bab2eed","year":2017},"citing_paper":{"arxiv_id":"1908.04433","last_updated":"2020-01-23T19:54:10Z","snapshot_observed_at":"2026-08-20T07:18:28.769055Z","submitted_at":"2019-08-12T22:51:06Z","title":"Sharp Guarantees for Solving Random Equations with One-Bit Information","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-14T13:47:05.960234Z"},"links":{"citing_paper":"/paper/1908.04433"},"observation_digest":"sha256:411af4cca9d48b8f253640fb1127b2ab226caf7631e22965dc02536a6818b7f3","observation_id":"40e4e489-65f4-42ad-a8e5-38db5df0f637","resolution":{"observed_at":"2026-08-14T13:47:06.360790Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1708.07451","last_updated":"2020-01-08T16:28:47Z","snapshot_observed_at":"2026-08-14T20:39:17.977920Z","submitted_at":"2017-08-24T15:16:00Z","title":"Recovering Structured Data From Superimposed Non-Linear Measurements","version":2},"cited_work":{"arxiv_id":"1708.07451","doi":null,"metadata_source":"pith","pith_arxiv_id":"1708.07451","snapshot_observed_at":"2026-08-14T13:47:06.158609Z","title":"Recovering Structured Data From Superimposed Non-Linear Measurements","venue":"cs.IT","work_id":"ad128ac6-79c9-4acf-8af7-97f766b07fe2","year":2017},"citing_paper":{"arxiv_id":"1908.04433","last_updated":"2020-01-23T19:54:10Z","snapshot_observed_at":"2026-08-20T07:18:28.769055Z","submitted_at":"2019-08-12T22:51:06Z","title":"Sharp Guarantees for Solving Random Equations with One-Bit Information","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-14T13:47:05.963830Z"},"links":{"cited_paper":"/paper/1708.07451","citing_paper":"/paper/1908.04433"},"observation_digest":"sha256:4532ca0e99e19cd703dbb40974d126f087fc8c400c4bf1bdaaa28aacb0b26399","observation_id":"14d63ed5-b4b9-46fb-9749-84a331abec4c","resolution":{"observed_at":"2026-08-14T13:47:06.162547Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-14T13:47:06.345450Z","title":"Structured signal recovery from non-linear and heavy-tailed measurements","venue":null,"work_id":"c3623d0f-219c-4e58-b843-d0ab01801083","year":2018},"citing_paper":{"arxiv_id":"1908.04433","last_updated":"2020-01-23T19:54:10Z","snapshot_observed_at":"2026-08-20T07:18:28.769055Z","submitted_at":"2019-08-12T22:51:06Z","title":"Sharp Guarantees for Solving Random Equations with One-Bit Information","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-14T13:47:05.967969Z"},"links":{"citing_paper":"/paper/1908.04433"},"observation_digest":"sha256:2dd06f914a9928ae18375e52c7b50ac97af9298212e9d7b795ad5b14f3bf5e58","observation_id":"8d543ccd-1d36-4c53-8a0f-85b2c7036587","resolution":{"observed_at":"2026-08-14T13:47:06.349463Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-14T13:47:06.333622Z","title":"On Milman’s inequality and random subspaces which escape through a mesh in Rn","venue":null,"work_id":"d3c2a478-c9cf-4887-bf33-14a1fefc2b20","year":1988},"citing_paper":{"arxiv_id":"1908.04433","last_updated":"2020-01-23T19:54:10Z","snapshot_observed_at":"2026-08-20T07:18:28.769055Z","submitted_at":"2019-08-12T22:51:06Z","title":"Sharp Guarantees for Solving Random Equations with One-Bit Information","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-14T13:47:05.971571Z"},"links":{"citing_paper":"/paper/1908.04433"},"observation_digest":"sha256:176313ed8ecf30944908d80f9e34bf8d0d4265bb750b3a626cafedc2b4224471","observation_id":"0629d3e3-f30d-4f97-8487-25cbe72512c7","resolution":{"observed_at":"2026-08-14T13:47:06.337510Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-14T13:47:06.322332Z","title":"Robust 1-bit compressive sensing via binary stable embed- dings of sparse vectors","venue":null,"work_id":"b45b3c6a-da94-44a8-828c-814238322eb2","year":2013},"citing_paper":{"arxiv_id":"1908.04433","last_updated":"2020-01-23T19:54:10Z","snapshot_observed_at":"2026-08-20T07:18:28.769055Z","submitted_at":"2019-08-12T22:51:06Z","title":"Sharp Guarantees for Solving Random Equations with One-Bit Information","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-14T13:47:05.975411Z"},"links":{"citing_paper":"/paper/1908.04433"},"observation_digest":"sha256:ca7641e57a50a8aee160a8f03d5fc3da33ad15ca71d33e4c9478718bd0cda953","observation_id":"c20e7dcf-41a9-439b-b36d-d0d5e228d6a8","resolution":{"observed_at":"2026-08-14T13:47:06.326454Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1311.2445","last_updated":"2013-11-11T14:04:06Z","snapshot_observed_at":"2026-08-19T17:41:02.013427Z","submitted_at":"2013-11-11T14:04:06Z","title":"Asymptotic behavior of unregularized and ridge-regularized high-dimensional robust regression estimators : rigorous results","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1311.2445","snapshot_observed_at":"2026-08-14T13:47:05.979003Z","title":"Asymptotic behavior of unregularized and ridge-regularized high-dimensional robust regression estimators: rig- orous results","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"1908.04433","last_updated":"2020-01-23T19:54:10Z","snapshot_observed_at":"2026-08-20T07:18:28.769055Z","submitted_at":"2019-08-12T22:51:06Z","title":"Sharp Guarantees for Solving Random Equations with One-Bit Information","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-14T13:47:05.979003Z"},"links":{"cited_paper":"/paper/1311.2445","citing_paper":"/paper/1908.04433"},"observation_digest":"sha256:95b34332c8202d9667f26a24e6e8e93dbfeb2d75b0d720c11b258e4de7b24548","observation_id":"bd0c2959-0690-47d1-9a7c-ad66b9e0d0db","resolution":{"observed_at":"2026-08-14T13:47:05.979003Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1311.0830","last_updated":"2013-11-06T03:33:46Z","snapshot_observed_at":"2026-08-16T16:59:45.566219Z","submitted_at":"2013-11-04T20:06:44Z","title":"The Squared-Error of Generalized LASSO: A Precise Analysis","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1311.0830","snapshot_observed_at":"2026-08-14T13:47:05.983479Z","title":"The squared-error of generalized lasso: A precise analysis","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"1908.04433","last_updated":"2020-01-23T19:54:10Z","snapshot_observed_at":"2026-08-20T07:18:28.769055Z","submitted_at":"2019-08-12T22:51:06Z","title":"Sharp Guarantees for Solving Random Equations with One-Bit Information","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-14T13:47:05.983479Z"},"links":{"cited_paper":"/paper/1311.0830","citing_paper":"/paper/1908.04433"},"observation_digest":"sha256:ea29959b25f32182cd7f6c5a8ab30d52e5f17c0ffd86a3eca205ec0dc3da7db5","observation_id":"18350267-abef-4963-ab96-4807d51cd35d","resolution":{"observed_at":"2026-08-14T13:47:05.983479Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:47:06.310487Z","title":"Robust 1-bit compressed sensing and sparse logistic regression: A convex programming approach","venue":null,"work_id":"49f34203-fb5a-4045-ab3f-e0dd5c73b299","year":2012},"citing_paper":{"arxiv_id":"1908.04433","last_updated":"2020-01-23T19:54:10Z","snapshot_observed_at":"2026-08-20T07:18:28.769055Z","submitted_at":"2019-08-12T22:51:06Z","title":"Sharp Guarantees for Solving Random Equations with One-Bit Information","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-14T13:47:05.987539Z"},"links":{"citing_paper":"/paper/1908.04433"},"observation_digest":"sha256:c0d0559634bbd3c64e15d956f6e937043e7e1f12123fb0c34d84cca740aa449b","observation_id":"e5978ff7-9fad-4e01-ad2d-87831b95bffa","resolution":{"observed_at":"2026-08-14T13:47:06.314573Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-14T13:47:06.298925Z","title":"One-bit compressed sensing by linear programming","venue":null,"work_id":"c2322a4f-b779-4e1f-a92c-d99b7aef1521","year":2013},"citing_paper":{"arxiv_id":"1908.04433","last_updated":"2020-01-23T19:54:10Z","snapshot_observed_at":"2026-08-20T07:18:28.769055Z","submitted_at":"2019-08-12T22:51:06Z","title":"Sharp Guarantees for Solving Random Equations with One-Bit Information","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-14T13:47:05.990923Z"},"links":{"citing_paper":"/paper/1908.04433"},"observation_digest":"sha256:1e2483d07cc3755df4dc06f87e33f5dd2eef3dd2f193c64df9ac8a35a00a891b","observation_id":"2bc8eaa5-322c-45a3-993a-7e9cb03bb4aa","resolution":{"observed_at":"2026-08-14T13:47:06.302860Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-14T13:47:06.287473Z","title":"The generalized lasso with non-linear observations","venue":null,"work_id":"1487d739-dbd1-49a8-8587-1f68a02c71e0","year":2016},"citing_paper":{"arxiv_id":"1908.04433","last_updated":"2020-01-23T19:54:10Z","snapshot_observed_at":"2026-08-20T07:18:28.769055Z","submitted_at":"2019-08-12T22:51:06Z","title":"Sharp Guarantees for Solving Random Equations with One-Bit Information","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-14T13:47:05.994286Z"},"links":{"citing_paper":"/paper/1908.04433"},"observation_digest":"sha256:ebc3c5be92ec7bcf640f0fbf8f331070b0658ab5d525cbfc247d24660b5bea3a","observation_id":"ada58688-0542-4ecb-a33d-f6199b34743e","resolution":{"observed_at":"2026-08-14T13:47:06.291461Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:47:05.997783Z","title":"Variational analysis , volume 317","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"1908.04433","last_updated":"2020-01-23T19:54:10Z","snapshot_observed_at":"2026-08-20T07:18:28.769055Z","submitted_at":"2019-08-12T22:51:06Z","title":"Sharp Guarantees for Solving Random Equations with One-Bit Information","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-14T13:47:05.997783Z"},"links":{"citing_paper":"/paper/1908.04433"},"observation_digest":"sha256:abca475b83c0bc6f6ca2492fd0ed15f7ef903cbf129cad122c187c5a55a2215a","observation_id":"14ca3b6e-14ad-43c0-8946-f305940294d4","resolution":{"observed_at":"2026-08-14T13:47:05.997783Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1906.03761","last_updated":"2019-11-13T07:10:57Z","snapshot_observed_at":"2026-08-16T21:12:35.099526Z","submitted_at":"2019-06-10T01:45:00Z","title":"The Impact of Regularization on High-dimensional Logistic Regression","version":4},"cited_work":{"arxiv_id":"1906.03761","doi":null,"metadata_source":"pith","pith_arxiv_id":"1906.03761","snapshot_observed_at":"2026-08-14T13:47:06.122330Z","title":"The Impact of Regularization on High-dimensional Logistic Regression","venue":"stat.ML","work_id":"44b2f337-3650-4c45-8288-b17517c30f78","year":2019},"citing_paper":{"arxiv_id":"1908.04433","last_updated":"2020-01-23T19:54:10Z","snapshot_observed_at":"2026-08-20T07:18:28.769055Z","submitted_at":"2019-08-12T22:51:06Z","title":"Sharp Guarantees for Solving Random Equations with One-Bit Information","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-14T13:47:06.001280Z"},"links":{"cited_paper":"/paper/1906.03761","citing_paper":"/paper/1908.04433"},"observation_digest":"sha256:10170d52d439eb3824618e5ee94938e77af998056ddbe65c06753a44b47f6b51","observation_id":"1a21d813-0d77-4e70-b19d-708bdd722c4d","resolution":{"observed_at":"2026-08-14T13:47:06.126552Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"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-14T13:47:06.005195Z","title":"Various thresholds for 𝓁1-optimization in compressed sensing","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"1908.04433","last_updated":"2020-01-23T19:54:10Z","snapshot_observed_at":"2026-08-20T07:18:28.769055Z","submitted_at":"2019-08-12T22:51:06Z","title":"Sharp Guarantees for Solving Random Equations with One-Bit Information","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-14T13:47:06.005195Z"},"links":{"cited_paper":"/paper/0907.3666","citing_paper":"/paper/1908.04433"},"observation_digest":"sha256:208a0c514a501ecd7af5bc05f37587df763e7b00be14eb631aa6d2c5dcab5319","observation_id":"4aabf36a-0e62-41a6-b191-be7bab489b1c","resolution":{"observed_at":"2026-08-14T13:47:06.005195Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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-14T13:47:06.009138Z","title":"A framework to characterize performance of lasso algorithms","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"1908.04433","last_updated":"2020-01-23T19:54:10Z","snapshot_observed_at":"2026-08-20T07:18:28.769055Z","submitted_at":"2019-08-12T22:51:06Z","title":"Sharp Guarantees for Solving Random Equations with One-Bit Information","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-14T13:47:06.009138Z"},"links":{"cited_paper":"/paper/1303.7291","citing_paper":"/paper/1908.04433"},"observation_digest":"sha256:63d4f087ae5423bb2c2ec5c8edc6f4723939f013146d80103bb1a3c4ced3be5d","observation_id":"64abfe64-ec19-4506-a00e-4a39187b20d1","resolution":{"observed_at":"2026-08-14T13:47:06.009138Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:47:06.269725Z","title":"A modern maximum-likelihood theory for high-dimensional logistic regression","venue":null,"work_id":"50d11202-05de-4ab3-8d3b-32998728ae74","year":2019},"citing_paper":{"arxiv_id":"1908.04433","last_updated":"2020-01-23T19:54:10Z","snapshot_observed_at":"2026-08-20T07:18:28.769055Z","submitted_at":"2019-08-12T22:51:06Z","title":"Sharp Guarantees for Solving Random Equations with One-Bit Information","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-14T13:47:06.013280Z"},"links":{"citing_paper":"/paper/1908.04433"},"observation_digest":"sha256:85cb093b42f1d9212932498e4a9dea9080ceefc68ca234013bd82b74ba1e14f7","observation_id":"cc16d374-8472-4ac4-ab03-a4c27e7b7ff4","resolution":{"observed_at":"2026-08-14T13:47:06.273939Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-14T13:47:06.258737Z","title":"Lasso with non-linear measurements is equivalent to one with linear mea- surements","venue":null,"work_id":"882cfe64-0e76-4412-b103-782ded96e837","year":2015},"citing_paper":{"arxiv_id":"1908.04433","last_updated":"2020-01-23T19:54:10Z","snapshot_observed_at":"2026-08-20T07:18:28.769055Z","submitted_at":"2019-08-12T22:51:06Z","title":"Sharp Guarantees for Solving Random Equations with One-Bit Information","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-14T13:47:06.016707Z"},"links":{"citing_paper":"/paper/1908.04433"},"observation_digest":"sha256:f2dbbcb1b3c2ca2f2f7c75969b211161344dcf79c50ebb7cf1bbc3b53fab0d74","observation_id":"79225a94-b726-496f-b209-824a7cefd91e","resolution":{"observed_at":"2026-08-14T13:47:06.262479Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:47:06.019991Z","title":"Precise error analysis of regularized m-estimators in high dimensions","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"1908.04433","last_updated":"2020-01-23T19:54:10Z","snapshot_observed_at":"2026-08-20T07:18:28.769055Z","submitted_at":"2019-08-12T22:51:06Z","title":"Sharp Guarantees for Solving Random Equations with One-Bit Information","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-14T13:47:06.019991Z"},"links":{"citing_paper":"/paper/1908.04433"},"observation_digest":"sha256:e627bec0c681047086000739b2185e30de1d3521a10aaed76124d7b92cf640fb","observation_id":"f55eedee-8499-4fff-b291-ef23b56861d6","resolution":{"observed_at":"2026-08-14T13:47:06.019991Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:47:06.241319Z","title":"Regu- larized linear regression: A precise analysis of the estimation error","venue":null,"work_id":"16095330-a828-4733-a73f-ebbae0bb925e","year":2015},"citing_paper":{"arxiv_id":"1908.04433","last_updated":"2020-01-23T19:54:10Z","snapshot_observed_at":"2026-08-20T07:18:28.769055Z","submitted_at":"2019-08-12T22:51:06Z","title":"Sharp Guarantees for Solving Random Equations with One-Bit Information","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-14T13:47:06.023302Z"},"links":{"citing_paper":"/paper/1908.04433"},"observation_digest":"sha256:be79d523fb35fa1e0b5fbaf5e72e2985dd288ca34e788837129292c708394b24","observation_id":"c6b26c0d-6b11-4bc8-8099-2b9c8c4b07ca","resolution":{"observed_at":"2026-08-14T13:47:06.245067Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1807.06976","last_updated":"2018-07-18T14:37:49Z","snapshot_observed_at":"2026-08-16T19:29:59.419726Z","submitted_at":"2018-07-18T14:37:49Z","title":"The Generalized Lasso for Sub-gaussian Measurements with Dithered Quantization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1807.06976","snapshot_observed_at":"2026-08-14T13:47:06.026710Z","title":"The generalized lasso for sub-gaussian measurements with dithered quantization","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"1908.04433","last_updated":"2020-01-23T19:54:10Z","snapshot_observed_at":"2026-08-20T07:18:28.769055Z","submitted_at":"2019-08-12T22:51:06Z","title":"Sharp Guarantees for Solving Random Equations with One-Bit Information","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-14T13:47:06.026710Z"},"links":{"cited_paper":"/paper/1807.06976","citing_paper":"/paper/1908.04433"},"observation_digest":"sha256:650fa091b71d0896be7f7a8c53cc0b47ad99bce46cb8d4abd2fa81b6e247015a","observation_id":"bb7a32de-0cae-4f08-afb7-40a3540d2404","resolution":{"observed_at":"2026-08-14T13:47:06.026710Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1602.03436","last_updated":"2016-08-29T12:52:57Z","snapshot_observed_at":"2026-08-20T10:41:53.363962Z","submitted_at":"2016-02-10T16:35:36Z","title":"High-Dimensional Estimation of Structured Signals from Non-Linear Observations with General Convex Loss Functions","version":3},"cited_work":{"arxiv_id":"1602.03436","doi":null,"metadata_source":"pith","pith_arxiv_id":"1602.03436","snapshot_observed_at":"2026-08-14T13:47:06.072411Z","title":"High-Dimensional Estimation of Structured Signals from Non-Linear Observations with General Convex Loss Functions","venue":"math.ST","work_id":"25e70a05-3e87-4818-a7d3-9ecdd45d5b8c","year":2016},"citing_paper":{"arxiv_id":"1908.04433","last_updated":"2020-01-23T19:54:10Z","snapshot_observed_at":"2026-08-20T07:18:28.769055Z","submitted_at":"2019-08-12T22:51:06Z","title":"Sharp Guarantees for Solving Random Equations with One-Bit Information","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-14T13:47:06.030344Z"},"links":{"cited_paper":"/paper/1602.03436","citing_paper":"/paper/1908.04433"},"observation_digest":"sha256:bec76c72796a6c3467fda665ecc760eaa8db23625509d020155ce2fed11dbceb","observation_id":"bb67a154-9309-4356-b14d-16e2127b32d6","resolution":{"observed_at":"2026-08-14T13:47:06.078543Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-14T13:47:06.230954Z","title":"Optimal M-estimation in high-dimensional regression","venue":null,"work_id":"23cd2ed2-0ac3-45ac-9b03-4cc4c9d2bf8c","year":2013},"citing_paper":{"arxiv_id":"1908.04433","last_updated":"2020-01-23T19:54:10Z","snapshot_observed_at":"2026-08-20T07:18:28.769055Z","submitted_at":"2019-08-12T22:51:06Z","title":"Sharp Guarantees for Solving Random Equations with One-Bit Information","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-14T13:47:06.033958Z"},"links":{"citing_paper":"/paper/1908.04433"},"observation_digest":"sha256:163ad0568078942c94bf16f60ea534a03e8e859967a073693d14b16884975ae2","observation_id":"6d41596b-10c2-40f2-b7f4-15ef970bf479","resolution":{"observed_at":"2026-08-14T13:47:06.234462Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-14T13:47:06.220142Z","title":null,"venue":null,"work_id":"5effe62c-bedc-4d7f-9de1-f152b3dfe2ce","year":null},"citing_paper":{"arxiv_id":"1908.04433","last_updated":"2020-01-23T19:54:10Z","snapshot_observed_at":"2026-08-20T07:18:28.769055Z","submitted_at":"2019-08-12T22:51:06Z","title":"Sharp Guarantees for Solving Random Equations with One-Bit Information","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-14T13:47:06.037496Z"},"links":{"citing_paper":"/paper/1908.04433"},"observation_digest":"sha256:ce1e4c701dee32f3d59e94a309570c8cecf7d9f118a42e7712128d6054df573d","observation_id":"89554b58-6906-4cbc-a462-09b94dbb8a98","resolution":{"observed_at":"2026-08-14T13:47:06.223689Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-14T13:47:06.209530Z","title":null,"venue":null,"work_id":"4c4645a7-305e-43ba-9201-f7179779fd4f","year":null},"citing_paper":{"arxiv_id":"1908.04433","last_updated":"2020-01-23T19:54:10Z","snapshot_observed_at":"2026-08-20T07:18:28.769055Z","submitted_at":"2019-08-12T22:51:06Z","title":"Sharp Guarantees for Solving Random Equations with One-Bit Information","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-14T13:47:06.041556Z"},"links":{"citing_paper":"/paper/1908.04433"},"observation_digest":"sha256:eed49bf7c0ecf35a8f3895c5ec2b189ab78b59f24406ec9cbec36ab880602d21","observation_id":"acbe86ec-cc01-444d-8a4e-09d83a892b0b","resolution":{"observed_at":"2026-08-14T13:47:06.213238Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"1908.04433","last_updated":"2020-01-23T19:54:10Z","latest_version":2,"primary_category":"math.ST","snapshot_observed_at":"2026-08-20T07:18:28.769055Z","submitted_at":"2019-08-12T22:51:06Z","title":"Sharp Guarantees for Solving Random Equations with One-Bit Information"},"reference_resolution":{"displayed":36,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":10,"verified_exact":5,"verified_fuzzy":21},"total_outbound_references":36},"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-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"thesis":"As of 20 August 2026, this Paper Citation Record lists 36 of 36 outbound references and 0 inbound Pith citation observations for arXiv:1908.04433."}