{"as_of":"2026-08-15T18:48:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:cda41b8797b20aba4cfecf2a394e54fee2f96e0f1d59c7e522d0e9a3f16493af","coverage":[{"denominator":58,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":58,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-10T03:39:43.903099Z","state":"measured"},{"denominator":59,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":59,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-15T06:32:42.880941+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T07:14:37.475710Z","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":[{"citation":{"cited_paper":{"arxiv_id":"2607.08671","last_updated":"2026-07-09T16:36:06Z","snapshot_observed_at":"2026-08-06T17:17:01.740695Z","submitted_at":"2026-07-09T16:36:06Z","title":"Low-Rank Matrix Recovery via Heavy-Tailed Quadratic Sampling","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2607.08671","snapshot_observed_at":"2026-08-04T07:14:37.475710Z","title":"Low-rank matrix recovery via heavy-tailed quadratic sampling.arXiv preprint arXiv:2607.08671, 2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2608.02450","last_updated":"2026-08-03T16:25:17Z","snapshot_observed_at":"2026-08-15T10:15:45.918672Z","submitted_at":"2026-08-03T16:25:17Z","title":"PhaseLift for Coded Diffraction Patterns: Optimal Sampling Rate","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-04T07:14:37.475710Z"},"links":{"cited_paper":"/paper/2607.08671","citing_paper":"/paper/2608.02450"},"observation_digest":"sha256:7792dcd6ba0031b2a2fd966b54487085a964fe1e4715abd8886fcd14717c6f56","observation_id":"6ab2fe36-f94d-433b-b2df-b805edc7dbb9","resolution":{"observed_at":"2026-08-04T07:14:37.475710Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2607.08671/citation-record","integrity":"/paper/2607.08671/integrity","json":"/paper/2607.08671/citation-record.json","paper":"/paper/2607.08671"},"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-10T03:46:45.268919Z","title":"Dictionary-sparse recovery from heavy- tailed measurements.Information and Inference: A Journal of the IMA, 11(4):1501–1526, 2022","venue":null,"work_id":"9bb83581-2253-47e1-83c9-e154b9189ef4","year":2022},"citing_paper":{"arxiv_id":"2607.08671","last_updated":"2026-07-09T16:36:06Z","snapshot_observed_at":"2026-08-06T17:17:01.740695Z","submitted_at":"2026-07-09T16:36:06Z","title":"Low-Rank Matrix Recovery via Heavy-Tailed Quadratic Sampling","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-07-10T03:39:43.903099Z"},"links":{"citing_paper":"/paper/2607.08671"},"observation_digest":"sha256:92afcb146e39dc749185c306699c64a06b1ad9948a073ce4a879e18846df4e44","observation_id":"43a66db4-2687-4677-8bdb-a75ba6be1392","resolution":{"observed_at":"2026-07-10T03:46:45.270473Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T03:46:45.271001Z","title":null,"venue":null,"work_id":"409c59d6-04de-4e48-8a05-776f43e03d13","year":2026},"citing_paper":{"arxiv_id":"2607.08671","last_updated":"2026-07-09T16:36:06Z","snapshot_observed_at":"2026-08-06T17:17:01.740695Z","submitted_at":"2026-07-09T16:36:06Z","title":"Low-Rank Matrix Recovery via Heavy-Tailed Quadratic Sampling","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-07-10T03:39:43.903099Z"},"links":{"citing_paper":"/paper/2607.08671"},"observation_digest":"sha256:88af5b64be59e2bf23e280d9024b2de671823e7df689dae76dff8d8959a68e64","observation_id":"05a43c5b-2c2c-4af1-a87e-76d50a95bb41","resolution":{"observed_at":"2026-07-10T03:46:45.272044Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T03:46:45.272655Z","title":"Covariance estimation: Optimal dimension-free guarantees for adversarial corruption and heavy tails.Journal of the European Mathematical Society, 28(4):1809–1847, 2026","venue":null,"work_id":"bfe3f7a9-b3bf-4cdd-af39-59de9d8129be","year":2026},"citing_paper":{"arxiv_id":"2607.08671","last_updated":"2026-07-09T16:36:06Z","snapshot_observed_at":"2026-08-06T17:17:01.740695Z","submitted_at":"2026-07-09T16:36:06Z","title":"Low-Rank Matrix Recovery via Heavy-Tailed Quadratic Sampling","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-07-10T03:39:43.903099Z"},"links":{"citing_paper":"/paper/2607.08671"},"observation_digest":"sha256:a6a6ae59f90f4935c125ca72a10e2ba4d5f7d8c8b6a447bfb41c4f0fd41c912f","observation_id":"5782fab9-ccce-45da-9b2d-792567fa8711","resolution":{"observed_at":"2026-07-10T03:46:45.274136Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T03:46:45.279188Z","title":"Compressive multiplexing of correlated signals","venue":null,"work_id":"6b045338-1563-439f-b2ab-1db26b95a3cc","year":2014},"citing_paper":{"arxiv_id":"2607.08671","last_updated":"2026-07-09T16:36:06Z","snapshot_observed_at":"2026-08-06T17:17:01.740695Z","submitted_at":"2026-07-09T16:36:06Z","title":"Low-Rank Matrix Recovery via Heavy-Tailed Quadratic Sampling","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-07-10T03:39:43.903099Z"},"links":{"citing_paper":"/paper/2607.08671"},"observation_digest":"sha256:e1bb3fd6f2df85088b3ead04289115a20124cca6f03c87f5ebd3e6d841e131fc","observation_id":"da463dc5-8de5-4719-b90e-8279a1323473","resolution":{"observed_at":"2026-07-10T03:46:45.280653Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T03:46:45.283351Z","title":"Chiang, Imants D","venue":null,"work_id":"cfd31136-0803-4f73-94b6-149417bb71fc","year":2023},"citing_paper":{"arxiv_id":"2607.08671","last_updated":"2026-07-09T16:36:06Z","snapshot_observed_at":"2026-08-06T17:17:01.740695Z","submitted_at":"2026-07-09T16:36:06Z","title":"Low-Rank Matrix Recovery via Heavy-Tailed Quadratic Sampling","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-07-10T03:39:43.903099Z"},"links":{"citing_paper":"/paper/2607.08671"},"observation_digest":"sha256:1bcd677cfd3da13e2d4cfbdffc6261987edd1c7d2f9038c204ade7ad72d8de16","observation_id":"d7b36aa9-3a58-424a-a552-66d7e6ed847b","resolution":{"observed_at":"2026-07-10T03:46:45.284487Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T03:46:45.285123Z","title":"Reconstruction of signals from magnitudes of redundant representa- tions: The complex case.Foundations of Computational Mathematics, 16(3):677– 721, 2016","venue":null,"work_id":"74e2457b-4067-4c40-8c1e-547413410a01","year":2016},"citing_paper":{"arxiv_id":"2607.08671","last_updated":"2026-07-09T16:36:06Z","snapshot_observed_at":"2026-08-06T17:17:01.740695Z","submitted_at":"2026-07-09T16:36:06Z","title":"Low-Rank Matrix Recovery via Heavy-Tailed Quadratic Sampling","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-07-10T03:39:43.903099Z"},"links":{"citing_paper":"/paper/2607.08671"},"observation_digest":"sha256:36087d2f5b06098a0ebd59709010cc6f8fbcafe5f9192c7612f5f392dfab3746","observation_id":"265189aa-c18b-4757-b2da-59dfc74d7428","resolution":{"observed_at":"2026-07-10T03:46:45.286393Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T03:46:45.294878Z","title":"Painless reconstruction from magnitudes of frame coefficients.Journal of Fourier Analysis and Applications, 15(4):488–501, 2009","venue":null,"work_id":"e2edfc84-ebd3-4403-811c-2cd1457cfe56","year":2009},"citing_paper":{"arxiv_id":"2607.08671","last_updated":"2026-07-09T16:36:06Z","snapshot_observed_at":"2026-08-06T17:17:01.740695Z","submitted_at":"2026-07-09T16:36:06Z","title":"Low-Rank Matrix Recovery via Heavy-Tailed Quadratic Sampling","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-07-10T03:39:43.903099Z"},"links":{"citing_paper":"/paper/2607.08671"},"observation_digest":"sha256:42386433a0712d8754426232075396a38e6dc3aa8b2d130a9167cbadee036906","observation_id":"767ac07f-802f-49b1-8a0b-c5e393141bb9","resolution":{"observed_at":"2026-07-10T03:46:45.296287Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T03:46:45.263251Z","title":"Invertibility and robustness of phaseless reconstruc- tion.Applied and Computational Harmonic Analysis, 38(3):469–488, 2015","venue":null,"work_id":"4c8b77e6-079c-44b6-9d84-b5395706858b","year":2015},"citing_paper":{"arxiv_id":"2607.08671","last_updated":"2026-07-09T16:36:06Z","snapshot_observed_at":"2026-08-06T17:17:01.740695Z","submitted_at":"2026-07-09T16:36:06Z","title":"Low-Rank Matrix Recovery via Heavy-Tailed Quadratic Sampling","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-07-10T03:39:43.903099Z"},"links":{"citing_paper":"/paper/2607.08671"},"observation_digest":"sha256:b14c7d4b620ac63c1e873a0fc81fb87d7dbf0a6e4300f982151a2989b7e909db","observation_id":"71d6247d-615c-410d-8497-bdcdc4496b4e","resolution":{"observed_at":"2026-07-10T03:46:45.264644Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T03:46:45.267136Z","title":"Tony Cai and Anru Zhang","venue":null,"work_id":"8e7158f8-fa1b-494a-8017-517f2223c83f","year":2015},"citing_paper":{"arxiv_id":"2607.08671","last_updated":"2026-07-09T16:36:06Z","snapshot_observed_at":"2026-08-06T17:17:01.740695Z","submitted_at":"2026-07-09T16:36:06Z","title":"Low-Rank Matrix Recovery via Heavy-Tailed Quadratic Sampling","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-07-10T03:39:43.903099Z"},"links":{"citing_paper":"/paper/2607.08671"},"observation_digest":"sha256:190f5536dd33dfff8f5b18c489ab1910b2354419c819b99e594bd2eee09eff2d","observation_id":"9c390e44-8a0f-4986-b14b-9919c0f0e460","resolution":{"observed_at":"2026-07-10T03:46:45.268379Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T03:46:45.261400Z","title":"Phase retrieval via matrix completion.SIAM Review, 57(2):225–251, 2015","venue":null,"work_id":"3029197c-78f2-43c6-8bdf-184b79c535ab","year":2015},"citing_paper":{"arxiv_id":"2607.08671","last_updated":"2026-07-09T16:36:06Z","snapshot_observed_at":"2026-08-06T17:17:01.740695Z","submitted_at":"2026-07-09T16:36:06Z","title":"Low-Rank Matrix Recovery via Heavy-Tailed Quadratic Sampling","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-07-10T03:39:43.903099Z"},"links":{"citing_paper":"/paper/2607.08671"},"observation_digest":"sha256:4cf0511e9706daf0e17e575ab4ef62f1c19229f734f7413afe01b2459ea761e0","observation_id":"0f4f8bd4-46f0-4648-9e16-30b821738e66","resolution":{"observed_at":"2026-07-10T03:46:45.262724Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T03:46:45.253001Z","title":"Solving quadratic equations via PhaseLift when there are about as many equations as unknowns.Foundations of Computa- tional Mathematics, 14(5):1017–1026, 2014","venue":null,"work_id":"964d93a5-283b-49d6-a4df-cad2b1a399b6","year":2014},"citing_paper":{"arxiv_id":"2607.08671","last_updated":"2026-07-09T16:36:06Z","snapshot_observed_at":"2026-08-06T17:17:01.740695Z","submitted_at":"2026-07-09T16:36:06Z","title":"Low-Rank Matrix Recovery via Heavy-Tailed Quadratic Sampling","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-07-10T03:39:43.903099Z"},"links":{"citing_paper":"/paper/2607.08671"},"observation_digest":"sha256:78f882f67949efc33ce1d979dc69c511e69a44399718dfa741e4533e462fa906","observation_id":"765535c3-f769-42ef-83b9-699673429a32","resolution":{"observed_at":"2026-07-10T03:46:45.254471Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T03:46:45.257659Z","title":"Phase retrieval via Wirtinger flow: Theory and algorithms.IEEE Transactions on Information Theory, 61(4):1985–2007, 2015","venue":null,"work_id":"2f00d9bf-aec2-4819-9495-345c65b1d5d3","year":1985},"citing_paper":{"arxiv_id":"2607.08671","last_updated":"2026-07-09T16:36:06Z","snapshot_observed_at":"2026-08-06T17:17:01.740695Z","submitted_at":"2026-07-09T16:36:06Z","title":"Low-Rank Matrix Recovery via Heavy-Tailed Quadratic Sampling","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-07-10T03:39:43.903099Z"},"links":{"citing_paper":"/paper/2607.08671"},"observation_digest":"sha256:0eb431378efa39211614e0eb3026cdf7339dcd5ad246816835f0d72831fd8779","observation_id":"042d54a7-4abe-4172-a227-6d6c4f9b8acb","resolution":{"observed_at":"2026-07-10T03:46:45.258862Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T03:46:45.281324Z","title":"PhaseLift: Exact and stable signal recovery from magnitude measurements via convex pro- gramming.Communications on Pure and Applied Mathematics, 66(8):1241–1274, 2013","venue":null,"work_id":"db1296ed-0c17-45e8-baa7-7a22ecea8bcb","year":2013},"citing_paper":{"arxiv_id":"2607.08671","last_updated":"2026-07-09T16:36:06Z","snapshot_observed_at":"2026-08-06T17:17:01.740695Z","submitted_at":"2026-07-09T16:36:06Z","title":"Low-Rank Matrix Recovery via Heavy-Tailed Quadratic Sampling","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-07-10T03:39:43.903099Z"},"links":{"citing_paper":"/paper/2607.08671"},"observation_digest":"sha256:b151983900f678cc793b18f0bb692395ecfc2fec5f256319efe32498a38c82f2","observation_id":"b37d0454-b496-4e4c-9193-546f4f248789","resolution":{"observed_at":"2026-07-10T03:46:45.282760Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T03:46:45.265172Z","title":"The convex geometry of linear inverse problems.Foundations of Computational Mathematics, 12(6):805–849, 2012","venue":null,"work_id":"53ebb3e6-d9c3-4e94-86f2-5a4acf31a41a","year":2012},"citing_paper":{"arxiv_id":"2607.08671","last_updated":"2026-07-09T16:36:06Z","snapshot_observed_at":"2026-08-06T17:17:01.740695Z","submitted_at":"2026-07-09T16:36:06Z","title":"Low-Rank Matrix Recovery via Heavy-Tailed Quadratic Sampling","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-07-10T03:39:43.903099Z"},"links":{"citing_paper":"/paper/2607.08671"},"observation_digest":"sha256:8fbf9919e17e34d2646ea61dc9cbd5eca9305895644adb1a305a55de3dfdf642","observation_id":"6aaafd0d-e2bb-438a-a8c5-5152a2314cb1","resolution":{"observed_at":"2026-07-10T03:46:45.266549Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T03:46:45.247017Z","title":"Exact and stable covariance estimation from quadratic sampling via convex programming.IEEE Transactions on Information Theory, 61(7):4034–4059, 2015","venue":null,"work_id":"fc9b7331-a000-4b4b-9db3-1441795d43e3","year":2015},"citing_paper":{"arxiv_id":"2607.08671","last_updated":"2026-07-09T16:36:06Z","snapshot_observed_at":"2026-08-06T17:17:01.740695Z","submitted_at":"2026-07-09T16:36:06Z","title":"Low-Rank Matrix Recovery via Heavy-Tailed Quadratic Sampling","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-07-10T03:39:43.903099Z"},"links":{"citing_paper":"/paper/2607.08671"},"observation_digest":"sha256:c61ac7e14607a00db0020d965ff62f0c25bfcd516f97a674660dc9870db8d99c","observation_id":"891ee0df-82e1-4638-8476-0237dc0563cb","resolution":{"observed_at":"2026-07-10T03:46:45.248432Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T03:46:45.250979Z","title":"Stable optimizationless recovery from phaseless linear measurements.Journal of Fourier Analysis and Applications, 20(1):199–221, 2014","venue":null,"work_id":"877d0f11-89be-4eab-b215-344d03ded37d","year":2014},"citing_paper":{"arxiv_id":"2607.08671","last_updated":"2026-07-09T16:36:06Z","snapshot_observed_at":"2026-08-06T17:17:01.740695Z","submitted_at":"2026-07-09T16:36:06Z","title":"Low-Rank Matrix Recovery via Heavy-Tailed Quadratic Sampling","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-07-10T03:39:43.903099Z"},"links":{"citing_paper":"/paper/2607.08671"},"observation_digest":"sha256:934e2a4bb71c3359694d6ae10cc3ca52696f825c1f00fa45539267034f819ea3","observation_id":"f19b0922-7e84-41c5-bba7-d3ff59f6f03c","resolution":{"observed_at":"2026-07-10T03:46:45.252398Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T03:46:45.244741Z","title":"Solving (most) of a set of quadratic equalities: Composite optimization for robust phase retrieval.Information and Inference: A Journal of the IMA, 8(3):471–529, 2019","venue":null,"work_id":"d76f4970-e420-4868-be9f-9c76f385b3b2","year":2019},"citing_paper":{"arxiv_id":"2607.08671","last_updated":"2026-07-09T16:36:06Z","snapshot_observed_at":"2026-08-06T17:17:01.740695Z","submitted_at":"2026-07-09T16:36:06Z","title":"Low-Rank Matrix Recovery via Heavy-Tailed Quadratic Sampling","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-07-10T03:39:43.903099Z"},"links":{"citing_paper":"/paper/2607.08671"},"observation_digest":"sha256:af15173f93c34b0c40ed70bc17f26247a21873b1f950aae6b27831f2d539baf8","observation_id":"141d423d-4949-4d06-8044-5e883413f6df","resolution":{"observed_at":"2026-07-10T03:46:45.246451Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T03:46:45.240896Z","title":"Rieman- nian thresholding methods for row-sparse and low-rank matrix recovery.Numerical Algorithms, 93(2):669–693, 2023","venue":null,"work_id":"00247f33-450e-4b35-b0db-ca276beba28f","year":2023},"citing_paper":{"arxiv_id":"2607.08671","last_updated":"2026-07-09T16:36:06Z","snapshot_observed_at":"2026-08-06T17:17:01.740695Z","submitted_at":"2026-07-09T16:36:06Z","title":"Low-Rank Matrix Recovery via Heavy-Tailed Quadratic Sampling","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-07-10T03:39:43.903099Z"},"links":{"citing_paper":"/paper/2607.08671"},"observation_digest":"sha256:d8ca057fc01469f640f049696f33c656dc6607ed1c77a553df8ce9f84b0f83b0","observation_id":"506f143f-1a2b-4f02-b708-15601a0b88fc","resolution":{"observed_at":"2026-07-10T03:46:45.242123Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T03:46:45.242931Z","title":"Phase retrieval: Stability and recovery guarantees.Applied and Computational Harmonic Analysis, 36(3):473–494, 2014","venue":null,"work_id":"c3897bc3-ef3e-4e62-a3ad-8747db023687","year":2014},"citing_paper":{"arxiv_id":"2607.08671","last_updated":"2026-07-09T16:36:06Z","snapshot_observed_at":"2026-08-06T17:17:01.740695Z","submitted_at":"2026-07-09T16:36:06Z","title":"Low-Rank Matrix Recovery via Heavy-Tailed Quadratic Sampling","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-07-10T03:39:43.903099Z"},"links":{"citing_paper":"/paper/2607.08671"},"observation_digest":"sha256:5ebcbad358db9e32a23182e71a719c1982d71f3d702ab8c09d7100903da5828b","observation_id":"33c641c3-e5f3-478d-a92f-bda58c0f99c1","resolution":{"observed_at":"2026-07-10T03:46:45.244188Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T03:46:45.249011Z","title":"Quantum to- mography via compressed sensing: error bounds, sample complexity and efficient estimators.New Journal of Physics, 14(9):095022, 2012","venue":null,"work_id":"799f91c2-0dac-4660-b2f4-8e0b85caa69b","year":2012},"citing_paper":{"arxiv_id":"2607.08671","last_updated":"2026-07-09T16:36:06Z","snapshot_observed_at":"2026-08-06T17:17:01.740695Z","submitted_at":"2026-07-09T16:36:06Z","title":"Low-Rank Matrix Recovery via Heavy-Tailed Quadratic Sampling","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-07-10T03:39:43.903099Z"},"links":{"citing_paper":"/paper/2607.08671"},"observation_digest":"sha256:209f44b5891836eafd2f787a4b99d2a5d7b3079e90737ef04302002a0b78d2ab","observation_id":"0a13cf56-ed12-4601-b694-3ce87554048b","resolution":{"observed_at":"2026-07-10T03:46:45.250415Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T03:46:45.258603Z","title":"Iterative hard thresholding for low- rank recovery from rank-one projections.Linear Algebra and its Applications, 572:117–134, 2019","venue":null,"work_id":"3bf19ba5-ec48-40d1-8c70-918ca077a79d","year":2019},"citing_paper":{"arxiv_id":"2607.08671","last_updated":"2026-07-09T16:36:06Z","snapshot_observed_at":"2026-08-06T17:17:01.740695Z","submitted_at":"2026-07-09T16:36:06Z","title":"Low-Rank Matrix Recovery via Heavy-Tailed Quadratic Sampling","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-07-10T03:39:43.903099Z"},"links":{"citing_paper":"/paper/2607.08671"},"observation_digest":"sha256:98157b6a5851f1182fe9d43d8ad23cb39437717ee37a533602ea0efe71183fd0","observation_id":"4562f820-91c9-4c54-8616-4581cee8c084","resolution":{"observed_at":"2026-07-10T03:46:45.260025Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T03:46:45.233427Z","title":"Phase retrieval for sub-Gaussian mea- surements.Applied and Computational Harmonic Analysis, 53:95–115, 2021","venue":null,"work_id":"e20284a9-5746-4dee-a4db-18e96c6797ca","year":2021},"citing_paper":{"arxiv_id":"2607.08671","last_updated":"2026-07-09T16:36:06Z","snapshot_observed_at":"2026-08-06T17:17:01.740695Z","submitted_at":"2026-07-09T16:36:06Z","title":"Low-Rank Matrix Recovery via Heavy-Tailed Quadratic Sampling","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-07-10T03:39:43.903099Z"},"links":{"citing_paper":"/paper/2607.08671"},"observation_digest":"sha256:13554f39f71979d1783247063b044a79ccd659a10c368fe8097327a4f6393c39","observation_id":"d4dfc332-965f-43e1-a456-ca68c0bf1da0","resolution":{"observed_at":"2026-07-10T03:46:45.234661Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T03:46:45.235272Z","title":"Stable low-rank matrix recovery from 3-designs.Applied and Com- putational Harmonic Analysis, 84:101887, 2026","venue":null,"work_id":"0d4a9a5e-ad66-49f6-9f84-bde05f9484e0","year":2026},"citing_paper":{"arxiv_id":"2607.08671","last_updated":"2026-07-09T16:36:06Z","snapshot_observed_at":"2026-08-06T17:17:01.740695Z","submitted_at":"2026-07-09T16:36:06Z","title":"Low-Rank Matrix Recovery via Heavy-Tailed Quadratic Sampling","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-07-10T03:39:43.903099Z"},"links":{"citing_paper":"/paper/2607.08671"},"observation_digest":"sha256:b5777b4ed1159aef65f6afaa46539f9c09cb8166923fcfe98598aca531aa2306","observation_id":"86688f5d-85c5-45a8-b0bb-52cb06961e3b","resolution":{"observed_at":"2026-07-10T03:46:45.236568Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T03:46:45.302467Z","title":"A partial derandomization of PhaseLift using spherical designs.Journal of Fourier Analysis and Applications, 21(2):229–266, 2015","venue":null,"work_id":"82e30a76-01a6-4ee7-94af-94788dcf11b4","year":2015},"citing_paper":{"arxiv_id":"2607.08671","last_updated":"2026-07-09T16:36:06Z","snapshot_observed_at":"2026-08-06T17:17:01.740695Z","submitted_at":"2026-07-09T16:36:06Z","title":"Low-Rank Matrix Recovery via Heavy-Tailed Quadratic Sampling","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-07-10T03:39:43.903099Z"},"links":{"citing_paper":"/paper/2607.08671"},"observation_digest":"sha256:6c96298415181af9fa1cbc2a12e651f3c09e5cfe0966887248f7f15690434815","observation_id":"872dba62-037e-45f2-8286-a7c4b0ab4234","resolution":{"observed_at":"2026-07-10T03:46:45.303725Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T03:46:45.300634Z","title":"Quantum state tomography via compressed sensing.Physical Review Letters, 105(15):150401, 2010","venue":null,"work_id":"beab8bd5-b246-40d2-bb36-789fb2172c1f","year":2010},"citing_paper":{"arxiv_id":"2607.08671","last_updated":"2026-07-09T16:36:06Z","snapshot_observed_at":"2026-08-06T17:17:01.740695Z","submitted_at":"2026-07-09T16:36:06Z","title":"Low-Rank Matrix Recovery via Heavy-Tailed Quadratic Sampling","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-07-10T03:39:43.903099Z"},"links":{"citing_paper":"/paper/2607.08671"},"observation_digest":"sha256:4d640dfc7263a4ee4d7c635891acc06dd8a98d8c42109c012867af6e90b54cc8","observation_id":"0f2e5f2d-c6a2-4780-aa9f-b6cc05642b22","resolution":{"observed_at":"2026-07-10T03:46:45.301861Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T03:46:45.231610Z","title":"Low-rank Toeplitz matrix restoration: Descent cone anal- ysis and structured random matrix.IEEE Transactions on Information Theory, 71(5):3950–3956, 2025","venue":null,"work_id":"282e80a4-8be9-4f52-96b6-113f432e2f4f","year":2025},"citing_paper":{"arxiv_id":"2607.08671","last_updated":"2026-07-09T16:36:06Z","snapshot_observed_at":"2026-08-06T17:17:01.740695Z","submitted_at":"2026-07-09T16:36:06Z","title":"Low-Rank Matrix Recovery via Heavy-Tailed Quadratic Sampling","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-07-10T03:39:43.903099Z"},"links":{"citing_paper":"/paper/2607.08671"},"observation_digest":"sha256:218bac2f5211f9408d6dd260d5c93d2c205382fc4a8d8b3e1ef89bf0de9e9c98","observation_id":"48ef5c7a-3725-429e-8d64-4c3d9f14e133","resolution":{"observed_at":"2026-07-10T03:46:45.232940Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2510.00551","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T03:46:44.837810Z","title":"Stable phase retrieval: Optimal rates in Poisson and heavy-tailed models.arXiv preprint arXiv:2510.00551, 2025","venue":null,"work_id":"f245750c-4de5-4427-b074-7b866821f9bd","year":2025},"citing_paper":{"arxiv_id":"2607.08671","last_updated":"2026-07-09T16:36:06Z","snapshot_observed_at":"2026-08-06T17:17:01.740695Z","submitted_at":"2026-07-09T16:36:06Z","title":"Low-Rank Matrix Recovery via Heavy-Tailed Quadratic Sampling","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-07-10T03:39:43.903099Z"},"links":{"citing_paper":"/paper/2607.08671"},"observation_digest":"sha256:c9206e101cfefe8b76eca62e239b320d52f3d6ff36c513d563b5ebce4945f6d4","observation_id":"4c3d72f5-7257-4c8a-ac72-51f761ac8513","resolution":{"observed_at":"2026-07-10T03:46:44.839590Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T03:46:45.227756Z","title":"Robust outlier bound condition to phase retrieval with adversarial sparse outliers.Applied and Computational Harmonic Analysis, 80:101819, 2026","venue":null,"work_id":"2ed38c75-d607-431d-892f-76a4eaece51b","year":2026},"citing_paper":{"arxiv_id":"2607.08671","last_updated":"2026-07-09T16:36:06Z","snapshot_observed_at":"2026-08-06T17:17:01.740695Z","submitted_at":"2026-07-09T16:36:06Z","title":"Low-Rank Matrix Recovery via Heavy-Tailed Quadratic Sampling","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-07-10T03:39:43.903099Z"},"links":{"citing_paper":"/paper/2607.08671"},"observation_digest":"sha256:f63b393ff422541e8c6bd353f27ea0783be8d51a04008b0ce5da0d1eb56eb6f0","observation_id":"dbed8c63-b679-42ed-b8dc-095243ff1ec3","resolution":{"observed_at":"2026-07-10T03:46:45.229072Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T03:46:45.225948Z","title":"Concentration and moment inequalities for sums of independent heavy-tailed random matrices","venue":null,"work_id":"ed265540-cd10-4b37-83fc-37d41f23e5db","year":1917},"citing_paper":{"arxiv_id":"2607.08671","last_updated":"2026-07-09T16:36:06Z","snapshot_observed_at":"2026-08-06T17:17:01.740695Z","submitted_at":"2026-07-09T16:36:06Z","title":"Low-Rank Matrix Recovery via Heavy-Tailed Quadratic Sampling","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-07-10T03:39:43.903099Z"},"links":{"citing_paper":"/paper/2607.08671"},"observation_digest":"sha256:34bff3905c993ca9ded97bb2c07a2815d6e4d9d25eaef5c4f427050699486f28","observation_id":"970547fa-e210-4b3e-99f9-ce9e1c833415","resolution":{"observed_at":"2026-07-10T03:46:45.227218Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T03:46:45.276853Z","title":"Stable low-rank matrix recovery via null space properties.Information and Inference: A Journal of the IMA, 5(4):405–441, 2016","venue":null,"work_id":"324b75bd-f81b-48fa-bfbb-4f431aeb8287","year":2016},"citing_paper":{"arxiv_id":"2607.08671","last_updated":"2026-07-09T16:36:06Z","snapshot_observed_at":"2026-08-06T17:17:01.740695Z","submitted_at":"2026-07-09T16:36:06Z","title":"Low-Rank Matrix Recovery via Heavy-Tailed Quadratic Sampling","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-07-10T03:39:43.903099Z"},"links":{"citing_paper":"/paper/2607.08671"},"observation_digest":"sha256:bd21a62c04c34580a141b79ffba61e7a4f7dc0e8352e42d41dcd91e64e370ba4","observation_id":"15f77d96-3694-4d73-9a88-e59ca2ef7741","resolution":{"observed_at":"2026-07-10T03:46:45.278461Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T03:46:45.274673Z","title":"Cambridge University Press, 2 edition, 1985","venue":null,"work_id":"95af64cd-d9a3-41e6-bba5-c1a14ea2b54e","year":1985},"citing_paper":{"arxiv_id":"2607.08671","last_updated":"2026-07-09T16:36:06Z","snapshot_observed_at":"2026-08-06T17:17:01.740695Z","submitted_at":"2026-07-09T16:36:06Z","title":"Low-Rank Matrix Recovery via Heavy-Tailed Quadratic Sampling","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-07-10T03:39:43.903099Z"},"links":{"citing_paper":"/paper/2607.08671"},"observation_digest":"sha256:8be95d75365a041900332a7a17cd929a2a3461227f8bec34ca3667eff0dcc580","observation_id":"c0c8d574-b070-47be-bd14-1ede2f57b2d2","resolution":{"observed_at":"2026-07-10T03:46:45.276193Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T03:46:45.221949Z","title":"Robust phase retrieval by alternating minimization","venue":null,"work_id":"42bd4805-049b-491c-b03f-b45e1f15a611","year":2024},"citing_paper":{"arxiv_id":"2607.08671","last_updated":"2026-07-09T16:36:06Z","snapshot_observed_at":"2026-08-06T17:17:01.740695Z","submitted_at":"2026-07-09T16:36:06Z","title":"Low-Rank Matrix Recovery via Heavy-Tailed Quadratic Sampling","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-07-10T03:39:43.903099Z"},"links":{"citing_paper":"/paper/2607.08671"},"observation_digest":"sha256:b28e8322e58a8b54fee818ae95c1b557c886bf0fef0d252ea52136c7ac4a5e65","observation_id":"c48b62b4-07e0-4c71-839c-11e14f0f875f","resolution":{"observed_at":"2026-07-10T03:46:45.223188Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T03:46:45.224101Z","title":"Optimizing nonconfigurable, transversely displaced masks for illumination patterns in classical ghost imaging.Physical Re- view A, 107(2):023524, 2023","venue":null,"work_id":"47763a44-8f5d-44f2-bd3b-0768bde54301","year":2023},"citing_paper":{"arxiv_id":"2607.08671","last_updated":"2026-07-09T16:36:06Z","snapshot_observed_at":"2026-08-06T17:17:01.740695Z","submitted_at":"2026-07-09T16:36:06Z","title":"Low-Rank Matrix Recovery via Heavy-Tailed Quadratic Sampling","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-07-10T03:39:43.903099Z"},"links":{"citing_paper":"/paper/2607.08671"},"observation_digest":"sha256:ca81a9a4dfeb61ac141a2eb152196d357c081f46c5ad00f6e44bbf3df2c1c356","observation_id":"35b0a127-f38b-432f-9778-1e866956e9f7","resolution":{"observed_at":"2026-07-10T03:46:45.225378Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T03:46:45.229680Z","title":"Bounding the smallest singular value of a random matrix without concentration.International Mathematics Re- search Notices, 2015(23):12991–13008, 2015","venue":null,"work_id":"0e93ae06-86f2-4fb9-877c-1e8465af9b1e","year":2015},"citing_paper":{"arxiv_id":"2607.08671","last_updated":"2026-07-09T16:36:06Z","snapshot_observed_at":"2026-08-06T17:17:01.740695Z","submitted_at":"2026-07-09T16:36:06Z","title":"Low-Rank Matrix Recovery via Heavy-Tailed Quadratic Sampling","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-07-10T03:39:43.903099Z"},"links":{"citing_paper":"/paper/2607.08671"},"observation_digest":"sha256:fa635b0c023f096e26235d58fcc48b899ffee6dcfd8ab788774d730dcd718186","observation_id":"b5fdea67-03ce-47ed-b052-8ce5f55a4aaa","resolution":{"observed_at":"2026-07-10T03:46:45.230981Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T03:46:45.237242Z","title":"Matrix factorization techniques for recommender systems.Computer, 42(8):30–37, 2009","venue":null,"work_id":"9a75a476-c9c2-48d8-b036-2b54b021b18c","year":2009},"citing_paper":{"arxiv_id":"2607.08671","last_updated":"2026-07-09T16:36:06Z","snapshot_observed_at":"2026-08-06T17:17:01.740695Z","submitted_at":"2026-07-09T16:36:06Z","title":"Low-Rank Matrix Recovery via Heavy-Tailed Quadratic Sampling","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-07-10T03:39:43.903099Z"},"links":{"citing_paper":"/paper/2607.08671"},"observation_digest":"sha256:58bbca28762623f3e86a16837984eaf19dbcb340788dab5444241c66703d69c4","observation_id":"de9e0eeb-5d84-4adf-8c3d-f8ca0f2c5392","resolution":{"observed_at":"2026-07-10T03:46:45.238446Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T03:46:45.220038Z","title":"On the robustness of noise-blind low-rank recovery from rank-one measurements.Linear Algebra and its Applications, 652:37–81, 2022","venue":null,"work_id":"6092b987-99fd-4ad3-bd70-6ab0347004b0","year":2022},"citing_paper":{"arxiv_id":"2607.08671","last_updated":"2026-07-09T16:36:06Z","snapshot_observed_at":"2026-08-06T17:17:01.740695Z","submitted_at":"2026-07-09T16:36:06Z","title":"Low-Rank Matrix Recovery via Heavy-Tailed Quadratic Sampling","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-07-10T03:39:43.903099Z"},"links":{"citing_paper":"/paper/2607.08671"},"observation_digest":"sha256:c0e5244e747b3dafaca9e8134cfaf289d48a85126437f899558a9ac06142e70c","observation_id":"8365bce3-a01a-4d0c-9c28-55079de93e56","resolution":{"observed_at":"2026-07-10T03:46:45.221423Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T03:46:45.212174Z","title":"Complex phase retrieval from subgaussian measurements.Journal of Fourier Analysis and Applications, 26(6):89, 2020","venue":null,"work_id":"af586c37-7607-4ebf-a338-4d464fc13d0b","year":2020},"citing_paper":{"arxiv_id":"2607.08671","last_updated":"2026-07-09T16:36:06Z","snapshot_observed_at":"2026-08-06T17:17:01.740695Z","submitted_at":"2026-07-09T16:36:06Z","title":"Low-Rank Matrix Recovery via Heavy-Tailed Quadratic Sampling","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-07-10T03:39:43.903099Z"},"links":{"citing_paper":"/paper/2607.08671"},"observation_digest":"sha256:dc7ca8eaa9f42eda1b166aee484aa81d4cea7be07032eb59d412f41858b2fde4","observation_id":"eff982c7-05ee-47cc-b471-46295861307e","resolution":{"observed_at":"2026-07-10T03:46:45.213533Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T03:46:45.214109Z","title":"On the convex geometry of blind deconvolu- tion and matrix completion.Communications on Pure and Applied Mathematics, 74(4):790–832, 2021","venue":null,"work_id":"79657b7d-28b0-4801-988e-7cf72835a546","year":2021},"citing_paper":{"arxiv_id":"2607.08671","last_updated":"2026-07-09T16:36:06Z","snapshot_observed_at":"2026-08-06T17:17:01.740695Z","submitted_at":"2026-07-09T16:36:06Z","title":"Low-Rank Matrix Recovery via Heavy-Tailed Quadratic Sampling","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-07-10T03:39:43.903099Z"},"links":{"citing_paper":"/paper/2607.08671"},"observation_digest":"sha256:b3a6f56a523a37f9c734d3d02cf755381a190edb2e4ea7b20e0967668ac779ea","observation_id":"cf805a5b-178d-4a8c-bbc6-a79a9f6b4c17","resolution":{"observed_at":"2026-07-10T03:46:45.215501Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T03:46:45.216080Z","title":"Low rank matrix recovery from rank one measurements.Applied and Computational Harmonic Analysis, 42(1):88–116, 2017","venue":null,"work_id":"c51e9a5e-b6d6-4cdb-8bae-be29de384ec0","year":2017},"citing_paper":{"arxiv_id":"2607.08671","last_updated":"2026-07-09T16:36:06Z","snapshot_observed_at":"2026-08-06T17:17:01.740695Z","submitted_at":"2026-07-09T16:36:06Z","title":"Low-Rank Matrix Recovery via Heavy-Tailed Quadratic Sampling","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-07-10T03:39:43.903099Z"},"links":{"citing_paper":"/paper/2607.08671"},"observation_digest":"sha256:8fbf77c263434d2a0d349b2e040ac172caeac8679422f047921934932b3e8323","observation_id":"9b3005e9-8f1d-4131-9bfa-1445482ea689","resolution":{"observed_at":"2026-07-10T03:46:45.217486Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T03:46:45.218045Z","title":"Sparse recovery under weak moment assumptions.Journal of the European Mathematical Society, 19(3):881–904, 2017","venue":null,"work_id":"c8c022fc-0e67-4584-a6c0-86209cdb68cf","year":2017},"citing_paper":{"arxiv_id":"2607.08671","last_updated":"2026-07-09T16:36:06Z","snapshot_observed_at":"2026-08-06T17:17:01.740695Z","submitted_at":"2026-07-09T16:36:06Z","title":"Low-Rank Matrix Recovery via Heavy-Tailed Quadratic Sampling","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-07-10T03:39:43.903099Z"},"links":{"citing_paper":"/paper/2607.08671"},"observation_digest":"sha256:e21db71e0361d223bed808bd0952bc7e6655b8f1ad6c8c094cfeff5789297f1f","observation_id":"0b3ead72-9626-42b6-bb46-5094146bbe87","resolution":{"observed_at":"2026-07-10T03:46:45.219428Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T03:46:45.239253Z","title":"Truncated amplitude flow with coded diffraction patterns","venue":null,"work_id":"93d0a309-51ee-48db-82fb-af091c41138e","year":2025},"citing_paper":{"arxiv_id":"2607.08671","last_updated":"2026-07-09T16:36:06Z","snapshot_observed_at":"2026-08-06T17:17:01.740695Z","submitted_at":"2026-07-09T16:36:06Z","title":"Low-Rank Matrix Recovery via Heavy-Tailed Quadratic Sampling","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-07-10T03:39:43.903099Z"},"links":{"citing_paper":"/paper/2607.08671"},"observation_digest":"sha256:00d889963692b587606ae8e7c9912ceee54e5099827f51735f7d74d9434763db","observation_id":"7b07a4e6-92f2-4f31-8f75-7b56b1abc2c9","resolution":{"observed_at":"2026-07-10T03:46:45.240354Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T03:46:45.259428Z","title":"Nonconvex matrix factor- ization from rank-one measurements.IEEE Transactions on Information Theory, 67(3):1928–1950, 2021","venue":null,"work_id":"35ce841c-7a80-4efa-b0f2-d27660b77001","year":1928},"citing_paper":{"arxiv_id":"2607.08671","last_updated":"2026-07-09T16:36:06Z","snapshot_observed_at":"2026-08-06T17:17:01.740695Z","submitted_at":"2026-07-09T16:36:06Z","title":"Low-Rank Matrix Recovery via Heavy-Tailed Quadratic Sampling","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-07-10T03:39:43.903099Z"},"links":{"citing_paper":"/paper/2607.08671"},"observation_digest":"sha256:43dd992dd62c6ddb27d0ab21c1284d3b6b41619ceb2184aa92931922a2ade3f5","observation_id":"79e69e19-2f5d-4b2e-a8e3-0ceddbb9eda9","resolution":{"observed_at":"2026-07-10T03:46:45.260802Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T03:46:45.296967Z","title":"Interior-point method for nuclear norm approximation with application to system identification.SIAM Journal on Matrix Analysis and Applications, 31(3):1235–1256, 2010","venue":null,"work_id":"9bd6a1ed-804d-419c-8305-d7427d5fda64","year":2010},"citing_paper":{"arxiv_id":"2607.08671","last_updated":"2026-07-09T16:36:06Z","snapshot_observed_at":"2026-08-06T17:17:01.740695Z","submitted_at":"2026-07-09T16:36:06Z","title":"Low-Rank Matrix Recovery via Heavy-Tailed Quadratic Sampling","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-07-10T03:39:43.903099Z"},"links":{"citing_paper":"/paper/2607.08671"},"observation_digest":"sha256:147bf3fb2794b26de24ad84b8b5d625be231ab41efe29a763fafbd8b1c878962","observation_id":"cb59b677-28f2-4a63-9e57-58e353b3ecbc","resolution":{"observed_at":"2026-07-10T03:46:45.298231Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T04:06:45.510255Z","title":"Acceleration and implicit regulariza- tion in Gaussian phase retrieval","venue":null,"work_id":"d88dc146-01fe-47a4-8f77-962e0e43aba8","year":2024},"citing_paper":{"arxiv_id":"2607.08671","last_updated":"2026-07-09T16:36:06Z","snapshot_observed_at":"2026-08-06T17:17:01.740695Z","submitted_at":"2026-07-09T16:36:06Z","title":"Low-Rank Matrix Recovery via Heavy-Tailed Quadratic Sampling","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-07-10T03:39:43.903099Z"},"links":{"citing_paper":"/paper/2607.08671"},"observation_digest":"sha256:2f687e12067c84e495ddecec32119dfa7c426c5c6ce009095200042d29d4a0f5","observation_id":"6c6457c3-e60c-4663-bb20-6b7ad5b8baf7","resolution":{"observed_at":"2026-07-10T04:06:45.511431Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T03:46:45.308286Z","title":null,"venue":null,"work_id":"e181ed54-e44d-4d59-a87b-a6f639dc00a1","year":2026},"citing_paper":{"arxiv_id":"2607.08671","last_updated":"2026-07-09T16:36:06Z","snapshot_observed_at":"2026-08-06T17:17:01.740695Z","submitted_at":"2026-07-09T16:36:06Z","title":"Low-Rank Matrix Recovery via Heavy-Tailed Quadratic Sampling","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-07-10T03:39:43.903099Z"},"links":{"citing_paper":"/paper/2607.08671"},"observation_digest":"sha256:db500c25934701a63d9221208d94807f9812ee58635d3d3d691e408af791d822","observation_id":"5f096daf-70ca-4a04-a2d9-9e890b4f4e6b","resolution":{"observed_at":"2026-07-10T03:46:45.309284Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T03:46:45.300805Z","title":"Learning without concentration.Journal of the ACM (JACM), 62(3):1–25","venue":null,"work_id":"f20da897-8306-402c-8473-ebd69581b0f4","year":2015},"citing_paper":{"arxiv_id":"2607.08671","last_updated":"2026-07-09T16:36:06Z","snapshot_observed_at":"2026-08-06T17:17:01.740695Z","submitted_at":"2026-07-09T16:36:06Z","title":"Low-Rank Matrix Recovery via Heavy-Tailed Quadratic Sampling","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-07-10T03:39:43.903099Z"},"links":{"citing_paper":"/paper/2607.08671"},"observation_digest":"sha256:f7eff3634876f095d7375210012f4ebfe76d79f2aa1b5daececdf98389da0ffe","observation_id":"df8fdb50-0df3-416e-be69-27fd292020d5","resolution":{"observed_at":"2026-07-10T03:46:45.302030Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T03:46:45.302647Z","title":null,"venue":null,"work_id":"1c123cd1-80dc-4c1f-9252-95be648de91b","year":1990},"citing_paper":{"arxiv_id":"2607.08671","last_updated":"2026-07-09T16:36:06Z","snapshot_observed_at":"2026-08-06T17:17:01.740695Z","submitted_at":"2026-07-09T16:36:06Z","title":"Low-Rank Matrix Recovery via Heavy-Tailed Quadratic Sampling","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-07-10T03:39:43.903099Z"},"links":{"citing_paper":"/paper/2607.08671"},"observation_digest":"sha256:569c368ccd5509f2fb07623fb185f615276cdf857ff70912c0d4c7b50b01533b","observation_id":"103ab0c5-7a43-4ec8-9728-5c95763ca881","resolution":{"observed_at":"2026-07-10T03:46:45.303925Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T03:46:45.304572Z","title":"On lower bounds for tail probabilities.Journal of Statistical Planning and Inference, 137(8):2703–2705, 2007","venue":null,"work_id":"6dec7444-45ad-4314-b86d-d7350a378e59","year":2007},"citing_paper":{"arxiv_id":"2607.08671","last_updated":"2026-07-09T16:36:06Z","snapshot_observed_at":"2026-08-06T17:17:01.740695Z","submitted_at":"2026-07-09T16:36:06Z","title":"Low-Rank Matrix Recovery via Heavy-Tailed Quadratic Sampling","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-07-10T03:39:43.903099Z"},"links":{"citing_paper":"/paper/2607.08671"},"observation_digest":"sha256:0022bd572df582c316a28210c8399f42dc17e4a78d8eb7acf6c8d54941abdef2","observation_id":"29aade0c-3880-4994-b090-1e879d67fbb7","resolution":{"observed_at":"2026-07-10T03:46:45.305758Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T03:46:45.306621Z","title":"A general algorithm for solving rank- one matrix sensing","venue":null,"work_id":"c1675ee3-7901-474a-bc35-0c1f225acfaa","year":null},"citing_paper":{"arxiv_id":"2607.08671","last_updated":"2026-07-09T16:36:06Z","snapshot_observed_at":"2026-08-06T17:17:01.740695Z","submitted_at":"2026-07-09T16:36:06Z","title":"Low-Rank Matrix Recovery via Heavy-Tailed Quadratic Sampling","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-07-10T03:39:43.903099Z"},"links":{"citing_paper":"/paper/2607.08671"},"observation_digest":"sha256:b16442016ca8b57000685174ec8ba39a5ef986010432a60639cf7463a518df92","observation_id":"2a94f054-bf5e-4112-9862-968572fd8621","resolution":{"observed_at":"2026-07-10T03:46:45.307786Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T04:06:45.508570Z","title":"Eldar, and John Wright","venue":null,"work_id":"1494ee15-e8a5-43d1-beb0-d565891afe16","year":2020},"citing_paper":{"arxiv_id":"2607.08671","last_updated":"2026-07-09T16:36:06Z","snapshot_observed_at":"2026-08-06T17:17:01.740695Z","submitted_at":"2026-07-09T16:36:06Z","title":"Low-Rank Matrix Recovery via Heavy-Tailed Quadratic Sampling","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-07-10T03:39:43.903099Z"},"links":{"citing_paper":"/paper/2607.08671"},"observation_digest":"sha256:0053bd4acb80af40aa4ac0af6e89875cd950c82a3e1caf891af351b0c14a970e","observation_id":"4e70b81d-93cd-4feb-b389-b8978009a417","resolution":{"observed_at":"2026-07-10T04:06:45.509711Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T04:06:45.506833Z","title":"Low-rank matrix recovery via rank one tight frame measurements.Journal of Fourier Analysis and Applications, 25(2):588– 593, 2019","venue":null,"work_id":"5a60d2c7-0fad-42c1-970f-20e22ce52003","year":2019},"citing_paper":{"arxiv_id":"2607.08671","last_updated":"2026-07-09T16:36:06Z","snapshot_observed_at":"2026-08-06T17:17:01.740695Z","submitted_at":"2026-07-09T16:36:06Z","title":"Low-Rank Matrix Recovery via Heavy-Tailed Quadratic Sampling","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-07-10T03:39:43.903099Z"},"links":{"citing_paper":"/paper/2607.08671"},"observation_digest":"sha256:52ff1c4e925139267151fc4518452f844310e0357db2af1b8708582622de24fc","observation_id":"24c34ea3-4cb2-4a21-ae77-3f692142b3fd","resolution":{"observed_at":"2026-07-10T04:06:45.508063Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T04:06:45.504939Z","title":"Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization.SIAM Review, 52(3):471–501","venue":null,"work_id":"c3e2f2dc-340b-4682-9300-634b746a5559","year":2010},"citing_paper":{"arxiv_id":"2607.08671","last_updated":"2026-07-09T16:36:06Z","snapshot_observed_at":"2026-08-06T17:17:01.740695Z","submitted_at":"2026-07-09T16:36:06Z","title":"Low-Rank Matrix Recovery via Heavy-Tailed Quadratic Sampling","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-07-10T03:39:43.903099Z"},"links":{"citing_paper":"/paper/2607.08671"},"observation_digest":"sha256:f712d2312092a52c277cf5b62e0d9338098474c9ebb28a90c8e21737841f599d","observation_id":"c9a1eb61-0b67-4b74-9fc2-2fa28a2ba1ed","resolution":{"observed_at":"2026-07-10T04:06:45.506149Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T03:46:45.298982Z","title":"On the subspaces ofl p (p >2) spanned by sequences of independent random variables.Israel Journal of Mathematics, 8(3):273–303, 1970","venue":null,"work_id":"2a8c6413-3701-4fd2-a547-3e525bafa43c","year":1970},"citing_paper":{"arxiv_id":"2607.08671","last_updated":"2026-07-09T16:36:06Z","snapshot_observed_at":"2026-08-06T17:17:01.740695Z","submitted_at":"2026-07-09T16:36:06Z","title":"Low-Rank Matrix Recovery via Heavy-Tailed Quadratic Sampling","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-07-10T03:39:43.903099Z"},"links":{"citing_paper":"/paper/2607.08671"},"observation_digest":"sha256:d8e846e231a85f4ba76a30ec45c75cd9eab7d778ac4372d49b69ea89b654a983","observation_id":"a738ecef-3f59-4f2f-a064-24da729e4182","resolution":{"observed_at":"2026-07-10T03:46:45.300272Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T04:06:45.502607Z","title":"Hanson-Wright inequality and sub- Gaussian concentration.Electronic Communications in Probability, 18:1–9, 2013","venue":null,"work_id":"638d7fab-308a-41da-bd75-23164d0db29f","year":2013},"citing_paper":{"arxiv_id":"2607.08671","last_updated":"2026-07-09T16:36:06Z","snapshot_observed_at":"2026-08-06T17:17:01.740695Z","submitted_at":"2026-07-09T16:36:06Z","title":"Low-Rank Matrix Recovery via Heavy-Tailed Quadratic Sampling","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-07-10T03:39:43.903099Z"},"links":{"citing_paper":"/paper/2607.08671"},"observation_digest":"sha256:2dd48bdc95240726e68d9d7581599a9053c42d9869e5911900bb9972bca9307f","observation_id":"a6ff0dbb-4bec-47b3-be43-4b595a6fe07d","resolution":{"observed_at":"2026-07-10T04:06:45.504436Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T03:46:45.290528Z","title":"Phase retrieval with application to optical imaging: a contemporary overview.IEEE Signal Processing Magazine, 32(3):87–109, 2015","venue":null,"work_id":"e9725f9f-1727-4196-aa5c-1091e769580e","year":2015},"citing_paper":{"arxiv_id":"2607.08671","last_updated":"2026-07-09T16:36:06Z","snapshot_observed_at":"2026-08-06T17:17:01.740695Z","submitted_at":"2026-07-09T16:36:06Z","title":"Low-Rank Matrix Recovery via Heavy-Tailed Quadratic Sampling","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-07-10T03:39:43.903099Z"},"links":{"citing_paper":"/paper/2607.08671"},"observation_digest":"sha256:c93f6850af438a4886bc25206a8a4ebbf18ad43a515b89e5bcd8eef77cc5e32f","observation_id":"37a18035-3d15-4ab3-96c5-0e840c489fd8","resolution":{"observed_at":"2026-07-10T03:46:45.291948Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T03:46:45.292558Z","title":"Sample covariance matrices of heavy-tailed distributions","venue":null,"work_id":"9bcef864-c46d-4e44-9fd8-f467c1f821b8","year":2018},"citing_paper":{"arxiv_id":"2607.08671","last_updated":"2026-07-09T16:36:06Z","snapshot_observed_at":"2026-08-06T17:17:01.740695Z","submitted_at":"2026-07-09T16:36:06Z","title":"Low-Rank Matrix Recovery via Heavy-Tailed Quadratic Sampling","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-07-10T03:39:43.903099Z"},"links":{"citing_paper":"/paper/2607.08671"},"observation_digest":"sha256:7927b4b0eb8b359f52e933741f65b82bec2c139821a64aa6fcfac03a4515c0b9","observation_id":"a837cc57-49cd-40b4-a0f5-70c12337c57c","resolution":{"observed_at":"2026-07-10T03:46:45.294289Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T03:46:45.288785Z","title":null,"venue":null,"work_id":"0646f405-ea50-433b-be88-30c9fb838056","year":2015},"citing_paper":{"arxiv_id":"2607.08671","last_updated":"2026-07-09T16:36:06Z","snapshot_observed_at":"2026-08-06T17:17:01.740695Z","submitted_at":"2026-07-09T16:36:06Z","title":"Low-Rank Matrix Recovery via Heavy-Tailed Quadratic Sampling","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-07-10T03:39:43.903099Z"},"links":{"citing_paper":"/paper/2607.08671"},"observation_digest":"sha256:01286a9b4bef4f0e2001022daf6b2ef2f49f7607f3f60dccd2a4d7b51547b914","observation_id":"da1e13eb-ac9a-4b02-b893-c5a488564b42","resolution":{"observed_at":"2026-07-10T03:46:45.289900Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T03:46:45.286945Z","title":"Cambridge University Press, 2018","venue":null,"work_id":"04f9e804-01bb-4610-86f2-c91bf5f836ea","year":2018},"citing_paper":{"arxiv_id":"2607.08671","last_updated":"2026-07-09T16:36:06Z","snapshot_observed_at":"2026-08-06T17:17:01.740695Z","submitted_at":"2026-07-09T16:36:06Z","title":"Low-Rank Matrix Recovery via Heavy-Tailed Quadratic Sampling","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-07-10T03:39:43.903099Z"},"links":{"citing_paper":"/paper/2607.08671"},"observation_digest":"sha256:f33b819d9512f6b121cb8529da57b9c7095c9b7dfa473bb82cbd451c84d10da0","observation_id":"548de721-473e-405b-806f-7bf7342ffea1","resolution":{"observed_at":"2026-07-10T03:46:45.288221Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2607.08671","last_updated":"2026-07-09T16:36:06Z","latest_version":1,"primary_category":"math.ST","snapshot_observed_at":"2026-08-06T17:17:01.740695Z","submitted_at":"2026-07-09T16:36:06Z","title":"Low-Rank Matrix Recovery via Heavy-Tailed Quadratic Sampling"},"reference_resolution":{"displayed":58,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":4,"verified_exact":1,"verified_fuzzy":53},"total_outbound_references":58},"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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 58 of 58 outbound references and 1 inbound Pith citation observation for arXiv:2607.08671."}