{"as_of":"2026-08-10T10:54:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b3101c3a1a969183c14816c831c14dd1686ae44deacadba78f24ff93e7f3148f","coverage":[{"denominator":43,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":43,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T00:25:39.427571Z","state":"measured"},{"denominator":43,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":43,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2506.14263/citation-record","integrity":"/paper/2506.14263/integrity","json":"/paper/2506.14263/citation-record.json","paper":"/paper/2506.14263"},"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-07T00:25:46.918030Z","title":"Ada-lista: Learned solvers adaptive to varying models","venue":null,"work_id":"5d0e919f-4f3e-4401-a312-a1951d0b6077","year":2021},"citing_paper":{"arxiv_id":"2506.14263","last_updated":"2025-06-17T07:25:07Z","snapshot_observed_at":"2026-08-07T00:15:47.963965Z","submitted_at":"2025-06-17T07:25:07Z","title":"Towards Robust Learning to Optimize with Theoretical Guarantees","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T00:25:34.649753Z"},"links":{"citing_paper":"/paper/2506.14263"},"observation_digest":"sha256:9a191b6b4961c3d6258a7de0dc3710635b8ba5919d157ca7ccecba7b6683ed2f","observation_id":"37edb52a-6a2f-42f8-bf5d-44a148db661a","resolution":{"observed_at":"2026-08-07T00:25:47.005520Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2106.00958","last_updated":"2021-06-07T19:36:13Z","snapshot_observed_at":"2026-08-08T05:06:04.564653Z","submitted_at":"2021-06-02T06:03:18Z","title":"A Generalizable Approach to Learning Optimizers","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2106.00958","snapshot_observed_at":"2026-08-07T00:25:34.723979Z","title":"A generalizable approach to learning optimizers","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.14263","last_updated":"2025-06-17T07:25:07Z","snapshot_observed_at":"2026-08-07T00:15:47.963965Z","submitted_at":"2025-06-17T07:25:07Z","title":"Towards Robust Learning to Optimize with Theoretical Guarantees","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T00:25:34.723979Z"},"links":{"cited_paper":"/paper/2106.00958","citing_paper":"/paper/2506.14263"},"observation_digest":"sha256:ae5f4a5dbe9fbf2e1d9cedd9a5f43ed31e75021f261269329675ecd843e1865f","observation_id":"b1ada911-54b0-4002-9353-178cefe2b08b","resolution":{"observed_at":"2026-08-07T00:25:34.723979Z","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-07T00:25:46.741737Z","title":"Learning to learn by gradient descent by gradient descent","venue":null,"work_id":"c1965fea-8958-46e1-b09d-9515e0f98043","year":2016},"citing_paper":{"arxiv_id":"2506.14263","last_updated":"2025-06-17T07:25:07Z","snapshot_observed_at":"2026-08-07T00:15:47.963965Z","submitted_at":"2025-06-17T07:25:07Z","title":"Towards Robust Learning to Optimize with Theoretical Guarantees","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T00:25:34.775037Z"},"links":{"citing_paper":"/paper/2506.14263"},"observation_digest":"sha256:411e51b8520f66e4d5bfb75f1c30cfdc2d2e0feecb2018a12cbc18eb5b3dc1ca","observation_id":"6a703a6c-d102-4f50-8489-467cd4d98107","resolution":{"observed_at":"2026-08-07T00:25:46.827104Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1703.04782","last_updated":"2018-02-26T01:36:49Z","snapshot_observed_at":"2026-08-04T14:42:32.650275Z","submitted_at":"2017-03-14T22:28:27Z","title":"Online Learning Rate Adaptation with Hypergradient Descent","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1703.04782","snapshot_observed_at":"2026-08-07T00:25:34.857654Z","title":"Online learning rate adaptation with hypergradient descent","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2506.14263","last_updated":"2025-06-17T07:25:07Z","snapshot_observed_at":"2026-08-07T00:15:47.963965Z","submitted_at":"2025-06-17T07:25:07Z","title":"Towards Robust Learning to Optimize with Theoretical Guarantees","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T00:25:34.857654Z"},"links":{"cited_paper":"/paper/1703.04782","citing_paper":"/paper/2506.14263"},"observation_digest":"sha256:b2bb33c0b535cc2737263de69b658b2f98326adcf4e6268668fa9780dd33c622","observation_id":"e25adb11-2abf-4604-b14d-499bd8364fd2","resolution":{"observed_at":"2026-08-07T00:25:34.857654Z","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-07T00:25:46.586294Z","title":"A fast iterative shrinkage- thresholding algorithm for linear inverse problems","venue":null,"work_id":"da77e074-4fa8-4ece-8d59-f0c989c770eb","year":2009},"citing_paper":{"arxiv_id":"2506.14263","last_updated":"2025-06-17T07:25:07Z","snapshot_observed_at":"2026-08-07T00:15:47.963965Z","submitted_at":"2025-06-17T07:25:07Z","title":"Towards Robust Learning to Optimize with Theoretical Guarantees","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T00:25:34.952611Z"},"links":{"citing_paper":"/paper/2506.14263"},"observation_digest":"sha256:a9f0c117b414df94ead0b95e4efb8537f66c11ba25affccef602916a3ca83d4b","observation_id":"e616fe86-d5a6-45de-b0e8-a6444ec12688","resolution":{"observed_at":"2026-08-07T00:25:46.657710Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:25:46.444205Z","title":"A Deep Q-Network Based-Resource Allocation Scheme for Massive MIMO-NOMA","venue":null,"work_id":"cd41c49b-e152-48b9-82d5-1ef017a8f4c1","year":2021},"citing_paper":{"arxiv_id":"2506.14263","last_updated":"2025-06-17T07:25:07Z","snapshot_observed_at":"2026-08-07T00:15:47.963965Z","submitted_at":"2025-06-17T07:25:07Z","title":"Towards Robust Learning to Optimize with Theoretical Guarantees","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T00:25:35.059940Z"},"links":{"citing_paper":"/paper/2506.14263"},"observation_digest":"sha256:6bf83b6752c01ba667c58ea172da66d9ebe41732186eff5d6937a9a601bea7b0","observation_id":"ae36220a-6c61-46f9-8bfa-37a0210b2a21","resolution":{"observed_at":"2026-08-07T00:25:46.513343Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:25:46.291107Z","title":"Learning to optimize: A primer and a benchmark","venue":null,"work_id":"9fa69cf3-403e-4bab-8a14-59ac6b0771ab","year":2022},"citing_paper":{"arxiv_id":"2506.14263","last_updated":"2025-06-17T07:25:07Z","snapshot_observed_at":"2026-08-07T00:15:47.963965Z","submitted_at":"2025-06-17T07:25:07Z","title":"Towards Robust Learning to Optimize with Theoretical Guarantees","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T00:25:35.146637Z"},"links":{"citing_paper":"/paper/2506.14263"},"observation_digest":"sha256:69851f7537eff414d751a0e43158052682fe64b3d8772ef48f7fd6d493ad9277","observation_id":"77e792fb-688d-47ef-8c8a-257a67d5f7b6","resolution":{"observed_at":"2026-08-07T00:25:46.358189Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:25:46.102949Z","title":"Learning Fast Approxima- tions of Sparse Coding","venue":null,"work_id":"58ed6e16-74b0-4d25-8044-7b0c108aae35","year":2010},"citing_paper":{"arxiv_id":"2506.14263","last_updated":"2025-06-17T07:25:07Z","snapshot_observed_at":"2026-08-07T00:15:47.963965Z","submitted_at":"2025-06-17T07:25:07Z","title":"Towards Robust Learning to Optimize with Theoretical Guarantees","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T00:25:35.251341Z"},"links":{"citing_paper":"/paper/2506.14263"},"observation_digest":"sha256:f9ad72c170531d75f00cee44a437c39722b7fc86597de8d00b0440e291e6359a","observation_id":"048169ff-b510-459c-8bd6-1a35dbd7e8dd","resolution":{"observed_at":"2026-08-07T00:25:46.192594Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:25:45.925227Z","title":"Safeguarded learned convex optimization","venue":null,"work_id":"c315524d-cd38-4842-80f3-1b11a118ac07","year":2023},"citing_paper":{"arxiv_id":"2506.14263","last_updated":"2025-06-17T07:25:07Z","snapshot_observed_at":"2026-08-07T00:15:47.963965Z","submitted_at":"2025-06-17T07:25:07Z","title":"Towards Robust Learning to Optimize with Theoretical Guarantees","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T00:25:35.360439Z"},"links":{"citing_paper":"/paper/2506.14263"},"observation_digest":"sha256:472f08680e7aa5bbed296b333f11ddc1c0c3aad46e25665047b898249e5d654c","observation_id":"aa668d11-ccfc-4e68-bc81-385fb2093854","resolution":{"observed_at":"2026-08-07T00:25:46.010199Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"q/1303325","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:25:39.630788Z","title":"Proof of convergence for the proximal point al- gorithm","venue":null,"work_id":"1385d74f-ae2e-4153-8123-fcdf846254a4","year":2015},"citing_paper":{"arxiv_id":"2506.14263","last_updated":"2025-06-17T07:25:07Z","snapshot_observed_at":"2026-08-07T00:15:47.963965Z","submitted_at":"2025-06-17T07:25:07Z","title":"Towards Robust Learning to Optimize with Theoretical Guarantees","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T00:25:35.475197Z"},"links":{"citing_paper":"/paper/2506.14263"},"observation_digest":"sha256:b541f0c3691a2b7019149bceb2dd5810dce18055ff5d59d98655accfa0f34b9a","observation_id":"3ff38687-2e22-4fd3-84a8-8d2a3eb2f2ec","resolution":{"observed_at":"2026-08-07T00:25:39.720600Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:25:45.729685Z","title":"Iterative Algorithm Induced Deep- Unfolding Neural Networks: Precoding Design for Mul- tiuser MIMO Systems","venue":null,"work_id":"d650cc86-a6f8-4b38-b4b5-56ec68eac30c","year":2020},"citing_paper":{"arxiv_id":"2506.14263","last_updated":"2025-06-17T07:25:07Z","snapshot_observed_at":"2026-08-07T00:15:47.963965Z","submitted_at":"2025-06-17T07:25:07Z","title":"Towards Robust Learning to Optimize with Theoretical Guarantees","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T00:25:35.549569Z"},"links":{"citing_paper":"/paper/2506.14263"},"observation_digest":"sha256:de9f8792b6af2f916615af77284754514a62e53586a04660bb01b298e453df44","observation_id":"66b65831-23a9-47a4-ad86-1165392398a9","resolution":{"observed_at":"2026-08-07T00:25:45.851084Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:25:45.541850Z","title":"Kalman and S.C","venue":null,"work_id":"626b7099-3e0a-4057-9a60-4bb6182f1c51","year":1992},"citing_paper":{"arxiv_id":"2506.14263","last_updated":"2025-06-17T07:25:07Z","snapshot_observed_at":"2026-08-07T00:15:47.963965Z","submitted_at":"2025-06-17T07:25:07Z","title":"Towards Robust Learning to Optimize with Theoretical Guarantees","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T00:25:35.630211Z"},"links":{"citing_paper":"/paper/2506.14263"},"observation_digest":"sha256:1b8e5a09f887e51b178f535345b7c30a457fbb09ee67d562e9085155548ca43e","observation_id":"c1ab93cf-8126-4e47-b550-0a687eedcb8e","resolution":{"observed_at":"2026-08-07T00:25:45.634867Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:25:45.356167Z","title":"A method for stochastic optimization","venue":null,"work_id":"f221c556-631e-49df-867e-6c88e9bfd7c7","year":2015},"citing_paper":{"arxiv_id":"2506.14263","last_updated":"2025-06-17T07:25:07Z","snapshot_observed_at":"2026-08-07T00:15:47.963965Z","submitted_at":"2025-06-17T07:25:07Z","title":"Towards Robust Learning to Optimize with Theoretical Guarantees","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T00:25:35.731826Z"},"links":{"citing_paper":"/paper/2506.14263"},"observation_digest":"sha256:c1a8eca39a164ad51f6b9461221eea155a5aeade1788e16c67947377aa8e464f","observation_id":"8914988a-017e-4136-8b25-9ad14a20cbfc","resolution":{"observed_at":"2026-08-07T00:25:45.459193Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:25:45.164773Z","title":"Towards Constituting Mathematical Structures for Learning to Optimize","venue":null,"work_id":"4675c79e-3dda-47b1-ae18-ccd440b69afa","year":2023},"citing_paper":{"arxiv_id":"2506.14263","last_updated":"2025-06-17T07:25:07Z","snapshot_observed_at":"2026-08-07T00:15:47.963965Z","submitted_at":"2025-06-17T07:25:07Z","title":"Towards Robust Learning to Optimize with Theoretical Guarantees","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T00:25:35.810586Z"},"links":{"citing_paper":"/paper/2506.14263"},"observation_digest":"sha256:7d4bf96aae0b645adfcd4d458b25c72cfa316d73e71d37d45fd23cceb9cd6f7c","observation_id":"e99f992c-ec5a-4a2f-9a0a-f102066c2215","resolution":{"observed_at":"2026-08-07T00:25:45.247234Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:25:44.913045Z","title":"Learning gradient descent: Better generalization and longer horizons","venue":null,"work_id":"a63e2265-63e0-408f-a538-ff4002177863","year":2017},"citing_paper":{"arxiv_id":"2506.14263","last_updated":"2025-06-17T07:25:07Z","snapshot_observed_at":"2026-08-07T00:15:47.963965Z","submitted_at":"2025-06-17T07:25:07Z","title":"Towards Robust Learning to Optimize with Theoretical Guarantees","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T00:25:35.888830Z"},"links":{"citing_paper":"/paper/2506.14263"},"observation_digest":"sha256:2ab14d2f23a179fa628cf03e7114cc2126dd43162aac346778e8bde059e7c724","observation_id":"72d5122e-83cb-42d0-b1e5-5d9cb3dd8760","resolution":{"observed_at":"2026-08-07T00:25:45.018914Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:25:44.685986Z","title":"Learning gradient descent: Better generalization and longer horizons","venue":null,"work_id":"e85eac36-bec9-4ed9-97b2-c0f1510fa291","year":2017},"citing_paper":{"arxiv_id":"2506.14263","last_updated":"2025-06-17T07:25:07Z","snapshot_observed_at":"2026-08-07T00:15:47.963965Z","submitted_at":"2025-06-17T07:25:07Z","title":"Towards Robust Learning to Optimize with Theoretical Guarantees","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T00:25:35.982649Z"},"links":{"citing_paper":"/paper/2506.14263"},"observation_digest":"sha256:1cbf045d64d9099bdb29a2ae1f2113f661529f30ab09f3e2290b1c21361c1383","observation_id":"815451f4-487e-4e51-9dd2-1c4488aee8a2","resolution":{"observed_at":"2026-08-07T00:25:44.797921Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:25:44.451632Z","title":"The generalized sigmoid activation func- tion: Competitive supervised learning","venue":null,"work_id":"87c8367f-2bd2-4800-aeb5-12c106a966ab","year":1997},"citing_paper":{"arxiv_id":"2506.14263","last_updated":"2025-06-17T07:25:07Z","snapshot_observed_at":"2026-08-07T00:15:47.963965Z","submitted_at":"2025-06-17T07:25:07Z","title":"Towards Robust Learning to Optimize with Theoretical Guarantees","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T00:25:36.098707Z"},"links":{"citing_paper":"/paper/2506.14263"},"observation_digest":"sha256:d5403696077ae377aca08db7ed9e56a89e0480ff210052348fab41dc6c930e2f","observation_id":"e327f22a-6f3c-4ffa-8d36-a8cd175c09e5","resolution":{"observed_at":"2026-08-07T00:25:44.543308Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:25:44.247966Z","title":"Monotone operators and the proximal point algorithm","venue":null,"work_id":"cf0c4588-fdb3-4773-9d44-c3b758b25dd5","year":1976},"citing_paper":{"arxiv_id":"2506.14263","last_updated":"2025-06-17T07:25:07Z","snapshot_observed_at":"2026-08-07T00:15:47.963965Z","submitted_at":"2025-06-17T07:25:07Z","title":"Towards Robust Learning to Optimize with Theoretical Guarantees","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T00:25:36.164211Z"},"links":{"citing_paper":"/paper/2506.14263"},"observation_digest":"sha256:f83b2b6a9d1892a8e466be539be8b01f8560d80040b4f4cf947bffb153d37f8d","observation_id":"917e0046-e878-4fa7-89be-d5f6175e104f","resolution":{"observed_at":"2026-08-07T00:25:44.328877Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1609.04747","last_updated":"2017-06-15T13:21:04Z","snapshot_observed_at":"2026-08-04T02:05:40.539691Z","submitted_at":"2016-09-15T17:32:34Z","title":"An overview of gradient descent optimization algorithms","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1609.04747","snapshot_observed_at":"2026-08-07T00:25:36.242961Z","title":"An overview of gradient descent optimiza- tion algorithms","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2506.14263","last_updated":"2025-06-17T07:25:07Z","snapshot_observed_at":"2026-08-07T00:15:47.963965Z","submitted_at":"2025-06-17T07:25:07Z","title":"Towards Robust Learning to Optimize with Theoretical Guarantees","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T00:25:36.242961Z"},"links":{"cited_paper":"/paper/1609.04747","citing_paper":"/paper/2506.14263"},"observation_digest":"sha256:c88d4923ad604c96d62ac2d03a3010e378a120d892da023a560cb5e802b61434","observation_id":"3779ace9-ec79-421e-8994-d2395df8d281","resolution":{"observed_at":"2026-08-07T00:25:36.242961Z","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-07T00:25:44.066790Z","title":null,"venue":null,"work_id":"ed0e0ac4-c4f8-4156-b1d8-3bbd15020279","year":1976},"citing_paper":{"arxiv_id":"2506.14263","last_updated":"2025-06-17T07:25:07Z","snapshot_observed_at":"2026-08-07T00:15:47.963965Z","submitted_at":"2025-06-17T07:25:07Z","title":"Towards Robust Learning to Optimize with Theoretical Guarantees","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T00:25:36.310890Z"},"links":{"citing_paper":"/paper/2506.14263"},"observation_digest":"sha256:6ffe518ca69bce7181675269ff162dffc0918b7312f91f81cbce92c7f862f76e","observation_id":"a608095f-6bda-45dc-bec4-2fdeb893b975","resolution":{"observed_at":"2026-08-07T00:25:44.149529Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:25:43.855023Z","title":"Coordinated Sum- Rate Maximization in Multicell MU-MIMO With Deep Un- rolling","venue":null,"work_id":"216ee265-4a08-4a3f-8a7f-76d90bbd7d8c","year":2023},"citing_paper":{"arxiv_id":"2506.14263","last_updated":"2025-06-17T07:25:07Z","snapshot_observed_at":"2026-08-07T00:15:47.963965Z","submitted_at":"2025-06-17T07:25:07Z","title":"Towards Robust Learning to Optimize with Theoretical Guarantees","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T00:25:36.420155Z"},"links":{"citing_paper":"/paper/2506.14263"},"observation_digest":"sha256:0f2a65e66d0c5f6354756fcf5c54518db3cc977708aefd71e9bcc2ca255dbcb8","observation_id":"1cd8b78d-8ea3-48bb-8c18-eea9f390d0f0","resolution":{"observed_at":"2026-08-07T00:25:43.959053Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:25:43.633502Z","title":null,"venue":null,"work_id":"747181de-b8ed-43e5-95da-8ca53cbe1870","year":2021},"citing_paper":{"arxiv_id":"2506.14263","last_updated":"2025-06-17T07:25:07Z","snapshot_observed_at":"2026-08-07T00:15:47.963965Z","submitted_at":"2025-06-17T07:25:07Z","title":"Towards Robust Learning to Optimize with Theoretical Guarantees","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T00:25:36.525978Z"},"links":{"citing_paper":"/paper/2506.14263"},"observation_digest":"sha256:d12296954544f22598a0fad03ed51324491503b6aa72d3f5997e2897d3a07027","observation_id":"8621f347-30f7-4c92-bae0-983928b71026","resolution":{"observed_at":"2026-08-07T00:25:43.739297Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2108.13624","last_updated":"2023-07-27T13:13:11Z","snapshot_observed_at":"2026-08-08T15:51:26.409443Z","submitted_at":"2021-08-31T05:28:42Z","title":"Towards Out-Of-Distribution Generalization: A Survey","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2108.13624","snapshot_observed_at":"2026-08-07T00:25:36.611573Z","title":"Towards out-of-distribution generalization: A survey","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.14263","last_updated":"2025-06-17T07:25:07Z","snapshot_observed_at":"2026-08-07T00:15:47.963965Z","submitted_at":"2025-06-17T07:25:07Z","title":"Towards Robust Learning to Optimize with Theoretical Guarantees","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T00:25:36.611573Z"},"links":{"cited_paper":"/paper/2108.13624","citing_paper":"/paper/2506.14263"},"observation_digest":"sha256:8904baef5b4c47008867179e68831e7fbf8efc3f7a212d9bc1f37831efe37510","observation_id":"7dbde3cf-8e14-4876-9c31-795800713c08","resolution":{"observed_at":"2026-08-07T00:25:36.611573Z","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-07T00:25:43.402206Z","title":"Prac- tical bayesian optimization of machine learning algorithms","venue":null,"work_id":"dbb44a9c-c135-4e8f-91e4-76fcd523f405","year":null},"citing_paper":{"arxiv_id":"2506.14263","last_updated":"2025-06-17T07:25:07Z","snapshot_observed_at":"2026-08-07T00:15:47.963965Z","submitted_at":"2025-06-17T07:25:07Z","title":"Towards Robust Learning to Optimize with Theoretical Guarantees","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T00:25:36.678452Z"},"links":{"citing_paper":"/paper/2506.14263"},"observation_digest":"sha256:782e8fface1a76ad9f40504e690ee3267b21328dabecd5e185cb75508156610a","observation_id":"aeb703ca-2e3e-49a4-be93-a729ecc83311","resolution":{"observed_at":"2026-08-07T00:25:43.533082Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:25:43.181596Z","title":"Subgradient Methods","venue":null,"work_id":"e00c630d-4234-43d7-ae20-dc4e13b15d1a","year":2003},"citing_paper":{"arxiv_id":"2506.14263","last_updated":"2025-06-17T07:25:07Z","snapshot_observed_at":"2026-08-07T00:15:47.963965Z","submitted_at":"2025-06-17T07:25:07Z","title":"Towards Robust Learning to Optimize with Theoretical Guarantees","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T00:25:36.762335Z"},"links":{"citing_paper":"/paper/2506.14263"},"observation_digest":"sha256:fa872bcc21529ed125a02990e18b7a0687033fc1198acd8242963311734d91ef","observation_id":"2bea536b-8360-489e-a90b-2c6d4d8696da","resolution":{"observed_at":"2026-08-07T00:25:43.282321Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:25:42.929203Z","title":"Learning to optimize: Training deep neural networks for interference management","venue":null,"work_id":"8cbfa5ae-5e14-4c54-add4-e9b141a0b5df","year":2018},"citing_paper":{"arxiv_id":"2506.14263","last_updated":"2025-06-17T07:25:07Z","snapshot_observed_at":"2026-08-07T00:15:47.963965Z","submitted_at":"2025-06-17T07:25:07Z","title":"Towards Robust Learning to Optimize with Theoretical Guarantees","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-07T00:25:36.819385Z"},"links":{"citing_paper":"/paper/2506.14263"},"observation_digest":"sha256:0a11650d75530486a3e96fa7885926c9d434996688d7967b560ece961a3a5cfa","observation_id":"7d27990e-87ed-4f0a-822c-b62c4985a834","resolution":{"observed_at":"2026-08-07T00:25:43.045536Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:25:42.706642Z","title":"Lecture 6: September 12","venue":null,"work_id":"3d396167-d8c3-4772-a6ae-b8a17a7e9218","year":2013},"citing_paper":{"arxiv_id":"2506.14263","last_updated":"2025-06-17T07:25:07Z","snapshot_observed_at":"2026-08-07T00:15:47.963965Z","submitted_at":"2025-06-17T07:25:07Z","title":"Towards Robust Learning to Optimize with Theoretical Guarantees","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-07T00:25:36.928094Z"},"links":{"citing_paper":"/paper/2506.14263"},"observation_digest":"sha256:ce1a432160fb9a1d835b0a477315dafd14d87db309e69216a3f677d76015494b","observation_id":"fb49f6ae-5d03-49bb-bf41-e319bda20049","resolution":{"observed_at":"2026-08-07T00:25:42.831163Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:25:42.465614Z","title":"Vandenberghe","venue":null,"work_id":"e65f97e5-8c7c-472e-8eb3-479765367bf6","year":2022},"citing_paper":{"arxiv_id":"2506.14263","last_updated":"2025-06-17T07:25:07Z","snapshot_observed_at":"2026-08-07T00:15:47.963965Z","submitted_at":"2025-06-17T07:25:07Z","title":"Towards Robust Learning to Optimize with Theoretical Guarantees","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-07T00:25:37.084499Z"},"links":{"citing_paper":"/paper/2506.14263"},"observation_digest":"sha256:c1fd2d3c471ebae4a624128a5095fa7f6b4464d9053a8e19cbef52d17254d15c","observation_id":"ef8dee43-dbba-4871-9810-f76ace1aca95","resolution":{"observed_at":"2026-08-07T00:25:42.603738Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:25:42.168498Z","title":"Learned optimizers that scale and generalize","venue":null,"work_id":"79553f74-4246-4f12-ae6d-081fd8c0ea27","year":null},"citing_paper":{"arxiv_id":"2506.14263","last_updated":"2025-06-17T07:25:07Z","snapshot_observed_at":"2026-08-07T00:15:47.963965Z","submitted_at":"2025-06-17T07:25:07Z","title":"Towards Robust Learning to Optimize with Theoretical Guarantees","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-07T00:25:37.253673Z"},"links":{"citing_paper":"/paper/2506.14263"},"observation_digest":"sha256:b4d0a2c93730a93f30553c5538847b8d8cacef0e46fb6fe2b0b48d69ec856ba8","observation_id":"b3fdb892-0cb2-46cb-87d0-a96a880f4c94","resolution":{"observed_at":"2026-08-07T00:25:42.340964Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:25:41.941233Z","title":"Learn- ing to Generalize Provably in Learning to Optimize","venue":null,"work_id":"307e16fb-8c3a-4eb1-bd4f-8b7c0510f7cb","year":2023},"citing_paper":{"arxiv_id":"2506.14263","last_updated":"2025-06-17T07:25:07Z","snapshot_observed_at":"2026-08-07T00:15:47.963965Z","submitted_at":"2025-06-17T07:25:07Z","title":"Towards Robust Learning to Optimize with Theoretical Guarantees","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-07T00:25:37.363007Z"},"links":{"citing_paper":"/paper/2506.14263"},"observation_digest":"sha256:d7bc78339be8da430631a16fca944728c4a939e2410e7cf3274e4dc8a935e179","observation_id":"578c972d-d6a9-4aa7-a9b2-886aba2b8401","resolution":{"observed_at":"2026-08-07T00:25:42.012852Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:25:41.771987Z","title":"Niemegeers, and Sonia M.Heemstra De Groot","venue":null,"work_id":"f656846b-34ac-4d90-8475-a0ea2be9adc9","year":2021},"citing_paper":{"arxiv_id":"2506.14263","last_updated":"2025-06-17T07:25:07Z","snapshot_observed_at":"2026-08-07T00:15:47.963965Z","submitted_at":"2025-06-17T07:25:07Z","title":"Towards Robust Learning to Optimize with Theoretical Guarantees","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-07T00:25:37.537710Z"},"links":{"citing_paper":"/paper/2506.14263"},"observation_digest":"sha256:526983086557aff30b149af072a000f2c84db696c96a7464da18063d81ea0cc2","observation_id":"675868eb-55c2-4fa4-afbe-85818a67a194","resolution":{"observed_at":"2026-08-07T00:25:41.835976Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1803.06573","last_updated":"2018-03-17T21:29:20Z","snapshot_observed_at":"2026-07-06T06:28:49.951458Z","submitted_at":"2018-03-17T21:29:20Z","title":"On the Fenchel Duality between Strong Convexity and Lipschitz Continuous Gradient","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1803.06573","snapshot_observed_at":"2026-08-07T00:25:37.710919Z","title":"On the fenchel duality between strong con- vexity and lipschitz continuous gradient","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2506.14263","last_updated":"2025-06-17T07:25:07Z","snapshot_observed_at":"2026-08-07T00:15:47.963965Z","submitted_at":"2025-06-17T07:25:07Z","title":"Towards Robust Learning to Optimize with Theoretical Guarantees","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-07T00:25:37.710919Z"},"links":{"cited_paper":"/paper/1803.06573","citing_paper":"/paper/2506.14263"},"observation_digest":"sha256:27c84fab4c1e1184ef7d5280c3834339730571c9c4aac1e53fac44c2f0d3a540","observation_id":"5e9a38be-a643-4c5f-9faf-256e19d859af","resolution":{"observed_at":"2026-08-07T00:25:37.710919Z","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-07T00:25:41.576748Z","title":"Learn- ing to beamform in heterogeneous massive MIMO networks","venue":null,"work_id":"cd3c7066-78dd-4ca1-ac20-0bdefd33e820","year":2022},"citing_paper":{"arxiv_id":"2506.14263","last_updated":"2025-06-17T07:25:07Z","snapshot_observed_at":"2026-08-07T00:15:47.963965Z","submitted_at":"2025-06-17T07:25:07Z","title":"Towards Robust Learning to Optimize with Theoretical Guarantees","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-07T00:25:37.809748Z"},"links":{"citing_paper":"/paper/2506.14263"},"observation_digest":"sha256:aa44c0453259d53b1f0c811709f01c4e6323f31146c261f77c8c2d5ec44cb1a2","observation_id":"6a30a417-be5c-4c9e-89cd-37438cbc6434","resolution":{"observed_at":"2026-08-07T00:25:41.701009Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:25:41.418188Z","title":"well-trained","venue":null,"work_id":"6fde0885-0854-4173-b6d9-0e3aed1a3f2c","year":null},"citing_paper":{"arxiv_id":"2506.14263","last_updated":"2025-06-17T07:25:07Z","snapshot_observed_at":"2026-08-07T00:15:47.963965Z","submitted_at":"2025-06-17T07:25:07Z","title":"Towards Robust Learning to Optimize with Theoretical Guarantees","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-07T00:25:37.926344Z"},"links":{"citing_paper":"/paper/2506.14263"},"observation_digest":"sha256:1301f14845e50fdec4791a7bb3effcb5b08f9d58f7e43d97e83e7926198f3f1e","observation_id":"f2fa6c09-997f-469b-9304-4ef2e9b78c9c","resolution":{"observed_at":"2026-08-07T00:25:41.481649Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:25:41.208246Z","title":"Similar to the results in the smooth case of main pages, we derive several theorems and corollaries on per iteration and multi-iteration convergence of the L2O model","venue":null,"work_id":"382c215d-410c-4ac4-a58a-ac8f6b723f20","year":null},"citing_paper":{"arxiv_id":"2506.14263","last_updated":"2025-06-17T07:25:07Z","snapshot_observed_at":"2026-08-07T00:15:47.963965Z","submitted_at":"2025-06-17T07:25:07Z","title":"Towards Robust Learning to Optimize with Theoretical Guarantees","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-07T00:25:38.095836Z"},"links":{"citing_paper":"/paper/2506.14263"},"observation_digest":"sha256:0db5958951b11c0e06ebd58e3c4caea8297013e9a0b1ef2f4fc96edf00944d4e","observation_id":"25ba5475-23c8-4204-94af-76812f65bbbe","resolution":{"observed_at":"2026-08-07T00:25:41.288629Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:25:41.013341Z","title":"Based on the definition, r(x) is proper and convex, where the “proper” means r(x) is trivially solvable for any x","venue":null,"work_id":"2c4a04f6-7122-429d-ac34-dcbbc24c74d8","year":null},"citing_paper":{"arxiv_id":"2506.14263","last_updated":"2025-06-17T07:25:07Z","snapshot_observed_at":"2026-08-07T00:15:47.963965Z","submitted_at":"2025-06-17T07:25:07Z","title":"Towards Robust Learning to Optimize with Theoretical Guarantees","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-07T00:25:38.267070Z"},"links":{"citing_paper":"/paper/2506.14263"},"observation_digest":"sha256:2f8daecb749674a7a94e312e8b5d5086099bacc72882e858f0e3bd50721584f7","observation_id":"b196d616-f9be-4b34-b0f9-00370e768b47","resolution":{"observed_at":"2026-08-07T00:25:41.128947Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:25:40.832930Z","title":null,"venue":null,"work_id":"7a853840-fb83-4dc7-8a0a-5cbd3f0697bd","year":null},"citing_paper":{"arxiv_id":"2506.14263","last_updated":"2025-06-17T07:25:07Z","snapshot_observed_at":"2026-08-07T00:15:47.963965Z","submitted_at":"2025-06-17T07:25:07Z","title":"Towards Robust Learning to Optimize with Theoretical Guarantees","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-07T00:25:38.435047Z"},"links":{"citing_paper":"/paper/2506.14263"},"observation_digest":"sha256:97422aa05edcab23b422f4711353340bdb19481f18c3994ca9af5d90ec973371","observation_id":"e9e08bbb-7699-49c5-bead-0c190b7c2be0","resolution":{"observed_at":"2026-08-07T00:25:40.895063Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:25:40.634005Z","title":"The gradient-based longer horizon modeling method is more robust in OOD scenarios","venue":null,"work_id":"7b6abf95-cc79-432b-9156-6c7128a0331b","year":null},"citing_paper":{"arxiv_id":"2506.14263","last_updated":"2025-06-17T07:25:07Z","snapshot_observed_at":"2026-08-07T00:15:47.963965Z","submitted_at":"2025-06-17T07:25:07Z","title":"Towards Robust Learning to Optimize with Theoretical Guarantees","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-07T00:25:38.623808Z"},"links":{"citing_paper":"/paper/2506.14263"},"observation_digest":"sha256:2fa6f8d68ab900b7a44e2ec017e46710a83d42b5bd7d406a0b5c08acdb493448","observation_id":"48ddfe4e-7578-4ab2-8c45-59d58ceeabfc","resolution":{"observed_at":"2026-08-07T00:25:40.712371Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:25:40.454173Z","title":"By setting C g 4 ≤ C v 4 /(L2), the gradient-based longer horizon modeling method is more robust in OOD scenarios","venue":null,"work_id":"fe0addc3-389f-403f-b8f5-c0fde20ad7e8","year":null},"citing_paper":{"arxiv_id":"2506.14263","last_updated":"2025-06-17T07:25:07Z","snapshot_observed_at":"2026-08-07T00:15:47.963965Z","submitted_at":"2025-06-17T07:25:07Z","title":"Towards Robust Learning to Optimize with Theoretical Guarantees","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-07T00:25:38.791959Z"},"links":{"citing_paper":"/paper/2506.14263"},"observation_digest":"sha256:5e1b3fecd829ec3232de506ac73d2865c992dbf8c24ec7477c8a73746ccf461a","observation_id":"d08af1be-cb3d-4810-8aa6-0998fdd9716d","resolution":{"observed_at":"2026-08-07T00:25:40.542202Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:25:40.274768Z","title":"Implementation Details Our implementation is conducted with PyTorch based on the open-source code provided by the official implementation of","venue":null,"work_id":"5e4f3b22-fcc3-4a59-ba6b-12df21b6bc4d","year":null},"citing_paper":{"arxiv_id":"2506.14263","last_updated":"2025-06-17T07:25:07Z","snapshot_observed_at":"2026-08-07T00:15:47.963965Z","submitted_at":"2025-06-17T07:25:07Z","title":"Towards Robust Learning to Optimize with Theoretical Guarantees","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-07T00:25:38.960084Z"},"links":{"citing_paper":"/paper/2506.14263"},"observation_digest":"sha256:00321241d4186cd481f6e378e7bb117deacfa47bb229e3374622e4534572ae8a","observation_id":"63d88d5f-1675-457d-bff9-efa2f9e5b41b","resolution":{"observed_at":"2026-08-07T00:25:40.341827Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:25:40.107119Z","title":"BP Frequency","venue":null,"work_id":"207832d6-f49c-4139-beb8-c1075a35cf19","year":null},"citing_paper":{"arxiv_id":"2506.14263","last_updated":"2025-06-17T07:25:07Z","snapshot_observed_at":"2026-08-07T00:15:47.963965Z","submitted_at":"2025-06-17T07:25:07Z","title":"Towards Robust Learning to Optimize with Theoretical Guarantees","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-07T00:25:39.160512Z"},"links":{"citing_paper":"/paper/2506.14263"},"observation_digest":"sha256:438ea22adeb0344404e7f63d1c70bb84ba60d181cf50ab297cd111d2b6d84d76","observation_id":"b67304dd-5414-4dff-8ae6-7084f30def7d","resolution":{"observed_at":"2026-08-07T00:25:40.192055Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:25:39.958064Z","title":"1,000 patches are chosen from the BSDS500 dataset","venue":null,"work_id":"02265cff-5425-4bbd-90f1-fcdecde54846","year":null},"citing_paper":{"arxiv_id":"2506.14263","last_updated":"2025-06-17T07:25:07Z","snapshot_observed_at":"2026-08-07T00:15:47.963965Z","submitted_at":"2025-06-17T07:25:07Z","title":"Towards Robust Learning to Optimize with Theoretical Guarantees","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-07T00:25:39.298807Z"},"links":{"citing_paper":"/paper/2506.14263"},"observation_digest":"sha256:c2f3a1dcf028110933279fc403f92fd2728b37ab6e2cf3ed015f5dc2d7ce3461","observation_id":"8c28fde5-fb9a-463d-a351-28f964393f1c","resolution":{"observed_at":"2026-08-07T00:25:40.020828Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:25:39.798176Z","title":"Ionoshpere dataset contains 4,601 ai, bi ∈ R34 for each sample","venue":null,"work_id":"fda96d6b-3180-4474-881e-1035d5a2dc9a","year":null},"citing_paper":{"arxiv_id":"2506.14263","last_updated":"2025-06-17T07:25:07Z","snapshot_observed_at":"2026-08-07T00:15:47.963965Z","submitted_at":"2025-06-17T07:25:07Z","title":"Towards Robust Learning to Optimize with Theoretical Guarantees","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-07T00:25:39.427571Z"},"links":{"citing_paper":"/paper/2506.14263"},"observation_digest":"sha256:349dfb912ac1e0987c8fa8df147cbaf0be26201de3e340843b53c7d03035e9a4","observation_id":"f599ddb1-6b5c-477e-baec-e8beb3445458","resolution":{"observed_at":"2026-08-07T00:25:39.868298Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2506.14263","last_updated":"2025-06-17T07:25:07Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-07T00:15:47.963965Z","submitted_at":"2025-06-17T07:25:07Z","title":"Towards Robust Learning to Optimize with Theoretical Guarantees"},"reference_resolution":{"displayed":43,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":8,"verified_exact":1,"verified_fuzzy":34},"total_outbound_references":43},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 43 of 43 outbound references and 0 inbound Pith citation observations for arXiv:2506.14263."}