{"as_of":"2026-08-10T05:59:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ea981a0ab6a8ad56b0aa2768ff89a6afcae111b1d66aac143ed30e21ea20ccdf","coverage":[{"denominator":42,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":42,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T22:07:01.691627Z","state":"measured"},{"denominator":42,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":42,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+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.22851/citation-record","integrity":"/paper/2506.22851/integrity","json":"/paper/2506.22851/citation-record.json","paper":"/paper/2506.22851"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2309.13722","last_updated":"2026-04-28T23:18:52Z","snapshot_observed_at":"2026-07-06T16:22:58.752949Z","submitted_at":"2023-09-24T18:58:18Z","title":"Deep neural networks with ReLU, leaky ReLU, and softplus activation provably overcome the curse of dimensionality for Kolmogorov partial differential equations with Lipschitz nonlinearities in the $L^p$-sense","version":3},"cited_work":{"arxiv_id":"2309.13722","doi":null,"metadata_source":"pith","pith_arxiv_id":"2309.13722","snapshot_observed_at":"2026-08-06T22:07:02.591291Z","title":"Deep neural networks with ReLU, leaky ReLU, and softplus activation provably overcome the curse of dimensionality for Kolmogorov partial differential equations with Lipschitz nonlinearities in the $L^p$-sense","venue":"math.NA","work_id":"8eeb3f7b-b1c3-476e-8cd4-7fba2a8a7db0","year":2023},"citing_paper":{"arxiv_id":"2506.22851","last_updated":"2025-06-28T11:25:44Z","snapshot_observed_at":"2026-08-06T21:54:50.140169Z","submitted_at":"2025-06-28T11:25:44Z","title":"Deep neural networks can provably solve Bellman equations for Markov decision processes without the curse of dimensionality","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-06T22:06:56.731948Z"},"links":{"cited_paper":"/paper/2309.13722","citing_paper":"/paper/2506.22851"},"observation_digest":"sha256:3172fb4e396dcb9e53fe4835c4cd277262ad835f0fcb638aec5e31bb826628c8","observation_id":"494c527a-8b8e-455d-ae06-4e8ef2b7ff1d","resolution":{"observed_at":"2026-08-06T22:07:02.700622Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.10876","last_updated":"2024-06-16T09:59:29Z","snapshot_observed_at":"2026-08-03T04:17:25.754792Z","submitted_at":"2024-06-16T09:59:29Z","title":"Deep neural networks with ReLU, leaky ReLU, and softplus activation provably overcome the curse of dimensionality for space-time solutions of semilinear partial differential equations","version":1},"cited_work":{"arxiv_id":"2406.10876","doi":null,"metadata_source":"pith","pith_arxiv_id":"2406.10876","snapshot_observed_at":"2026-08-06T22:07:02.381706Z","title":"Deep neural networks with ReLU, leaky ReLU, and softplus activation provably overcome the curse of dimensionality for space-time solutions of semilinear partial differential equations","venue":"cs.LG","work_id":"539cd4f9-2ae7-4ef4-8e68-d091bfea4fd9","year":2024},"citing_paper":{"arxiv_id":"2506.22851","last_updated":"2025-06-28T11:25:44Z","snapshot_observed_at":"2026-08-06T21:54:50.140169Z","submitted_at":"2025-06-28T11:25:44Z","title":"Deep neural networks can provably solve Bellman equations for Markov decision processes without the curse of dimensionality","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-06T22:06:56.825685Z"},"links":{"cited_paper":"/paper/2406.10876","citing_paper":"/paper/2506.22851"},"observation_digest":"sha256:1527422ebc6a9ad80d9dbd2340b3ef029dc3d3aae279a98702aeba6e578bd1c4","observation_id":"027dad35-6b5d-4b61-bf70-135743d01560","resolution":{"observed_at":"2026-08-06T22:07:02.480610Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T22:07:07.424552Z","title":"Overcoming the curse of dimensionality in the numerical approximation of high-dimensional semilinear elliptic partial differential equa- tions","venue":null,"work_id":"f0178ad2-da7d-4c13-b8eb-99b1844056cd","year":2024},"citing_paper":{"arxiv_id":"2506.22851","last_updated":"2025-06-28T11:25:44Z","snapshot_observed_at":"2026-08-06T21:54:50.140169Z","submitted_at":"2025-06-28T11:25:44Z","title":"Deep neural networks can provably solve Bellman equations for Markov decision processes without the curse of dimensionality","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-06T22:06:56.924839Z"},"links":{"citing_paper":"/paper/2506.22851"},"observation_digest":"sha256:c96227bbab5797dacf9a0c41633e943b5fd129ef2706844f31295ab945911d0d","observation_id":"a0c32c02-dc4a-4b79-8673-b9635e785876","resolution":{"observed_at":"2026-08-06T22:07:07.495228Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T22:07:07.245714Z","title":null,"venue":null,"work_id":"9aa43751-7836-4c62-92b5-5050a3a1fa44","year":2020},"citing_paper":{"arxiv_id":"2506.22851","last_updated":"2025-06-28T11:25:44Z","snapshot_observed_at":"2026-08-06T21:54:50.140169Z","submitted_at":"2025-06-28T11:25:44Z","title":"Deep neural networks can provably solve Bellman equations for Markov decision processes without the curse of dimensionality","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-06T22:06:57.014648Z"},"links":{"citing_paper":"/paper/2506.22851"},"observation_digest":"sha256:cd8e2596d036838c415c70dc73f47daa9f3d098ca9e6bc869b9dabe9313733df","observation_id":"bbed90e9-46fe-4a95-bf0e-9451f876f768","resolution":{"observed_at":"2026-08-06T22:07:07.350308Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T22:07:07.118254Z","title":"Nonlinear Monte Carlo methods with polynomial runtime for Bellman equations of discrete time high-dimensional stochastic optimal control problems.Appl","venue":null,"work_id":"60ee1046-bc59-44fa-96bf-e57916306caf","year":2025},"citing_paper":{"arxiv_id":"2506.22851","last_updated":"2025-06-28T11:25:44Z","snapshot_observed_at":"2026-08-06T21:54:50.140169Z","submitted_at":"2025-06-28T11:25:44Z","title":"Deep neural networks can provably solve Bellman equations for Markov decision processes without the curse of dimensionality","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-06T22:06:57.083541Z"},"links":{"citing_paper":"/paper/2506.22851"},"observation_digest":"sha256:c2588ae3d1b00b7bbed8d1fe2503c4c3ff9f45b7dcb12f3e88feeee9a650cffe","observation_id":"561510d4-256c-4135-80f5-298e50d18825","resolution":{"observed_at":"2026-08-06T22:07:07.178720Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2009.13989","last_updated":"2020-09-29T13:20:36Z","snapshot_observed_at":"2026-08-06T03:36:58.020672Z","submitted_at":"2020-09-29T13:20:36Z","title":"Nonlinear Monte Carlo methods with polynomial runtime for high-dimensional iterated nested expectations","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2009.13989","snapshot_observed_at":"2026-08-06T22:06:57.172342Z","title":"NonlinearMonteCarlomethodswithpolynomial runtime for high-dimensional iterated nested expectations.arXiv:2009.13989 (2020)","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2506.22851","last_updated":"2025-06-28T11:25:44Z","snapshot_observed_at":"2026-08-06T21:54:50.140169Z","submitted_at":"2025-06-28T11:25:44Z","title":"Deep neural networks can provably solve Bellman equations for Markov decision processes without the curse of dimensionality","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-06T22:06:57.172342Z"},"links":{"cited_paper":"/paper/2009.13989","citing_paper":"/paper/2506.22851"},"observation_digest":"sha256:75d5551f10ecca1dd8b4a39530d1f53ee2d80affb88ed825141bf2b1faee4a00","observation_id":"d79dcab7-2dbe-49ee-a009-5f062029d9ed","resolution":{"observed_at":"2026-08-06T22:06:57.172342Z","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-06T22:07:06.924159Z","title":"Numerical simulations for full history recursive multilevel Picard approximations for systems of high-dimensional partial differential equations","venue":null,"work_id":"0c76d26c-e3b1-4e81-ad28-3aa629e22c12","year":2020},"citing_paper":{"arxiv_id":"2506.22851","last_updated":"2025-06-28T11:25:44Z","snapshot_observed_at":"2026-08-06T21:54:50.140169Z","submitted_at":"2025-06-28T11:25:44Z","title":"Deep neural networks can provably solve Bellman equations for Markov decision processes without the curse of dimensionality","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-06T22:06:57.271660Z"},"links":{"citing_paper":"/paper/2506.22851"},"observation_digest":"sha256:bea00d4a67f88a2bc88c83adea211c172667e22de27a688f7529f619cdde378d","observation_id":"0ee38b32-e015-4bf0-973d-5411139f78c1","resolution":{"observed_at":"2026-08-06T22:07:07.024233Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T22:07:06.790740Z","title":"Dynamic programming","venue":null,"work_id":"d798044e-bc87-4a94-bc26-001fefff9ee1","year":2010},"citing_paper":{"arxiv_id":"2506.22851","last_updated":"2025-06-28T11:25:44Z","snapshot_observed_at":"2026-08-06T21:54:50.140169Z","submitted_at":"2025-06-28T11:25:44Z","title":"Deep neural networks can provably solve Bellman equations for Markov decision processes without the curse of dimensionality","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-06T22:06:57.363055Z"},"links":{"citing_paper":"/paper/2506.22851"},"observation_digest":"sha256:202b747bfa40d9e0fee1a1d751c88dd433a3d79daff9d1d99951fd1f4e41d488","observation_id":"c76d786e-349a-4bef-90cb-7595b907f874","resolution":{"observed_at":"2026-08-06T22:07:06.853661Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T22:07:06.618250Z","title":"Reinforcement learning and optimal control","venue":null,"work_id":"e9954430-66d6-44cd-9be2-45d7a0c151b3","year":2019},"citing_paper":{"arxiv_id":"2506.22851","last_updated":"2025-06-28T11:25:44Z","snapshot_observed_at":"2026-08-06T21:54:50.140169Z","submitted_at":"2025-06-28T11:25:44Z","title":"Deep neural networks can provably solve Bellman equations for Markov decision processes without the curse of dimensionality","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-06T22:06:57.455459Z"},"links":{"citing_paper":"/paper/2506.22851"},"observation_digest":"sha256:87167555f64c4e3c7fc4828b50ec81206a7e0ee90a1dc85d3b06336c820f73e0","observation_id":"b910f5c2-3ce8-4ec0-bd51-e57b2f6553be","resolution":{"observed_at":"2026-08-06T22:07:06.699093Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T22:07:06.446092Z","title":null,"venue":null,"work_id":"46ce804d-d9f7-4eaf-8f64-9286315e46a7","year":1996},"citing_paper":{"arxiv_id":"2506.22851","last_updated":"2025-06-28T11:25:44Z","snapshot_observed_at":"2026-08-06T21:54:50.140169Z","submitted_at":"2025-06-28T11:25:44Z","title":"Deep neural networks can provably solve Bellman equations for Markov decision processes without the curse of dimensionality","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T22:06:57.577449Z"},"links":{"citing_paper":"/paper/2506.22851"},"observation_digest":"sha256:45c17bca5ac0fcd0af65657d012626774b0ada043570a45425652748a066f600","observation_id":"af0a7946-216a-45fd-8e25-859f3604e90f","resolution":{"observed_at":"2026-08-06T22:07:06.523280Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T22:07:06.156724Z","title":null,"venue":null,"work_id":"bc02aad7-1d1a-404e-a9f0-9962f1c7fd03","year":1996},"citing_paper":{"arxiv_id":"2506.22851","last_updated":"2025-06-28T11:25:44Z","snapshot_observed_at":"2026-08-06T21:54:50.140169Z","submitted_at":"2025-06-28T11:25:44Z","title":"Deep neural networks can provably solve Bellman equations for Markov decision processes without the curse of dimensionality","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-06T22:06:57.814907Z"},"links":{"citing_paper":"/paper/2506.22851"},"observation_digest":"sha256:40db5f8c3e9bd823eb73178d8730fe4a01137b328fdc901fa1534233e861a754","observation_id":"7f0a7e42-7db2-42bf-8300-9144f8c06d44","resolution":{"observed_at":"2026-08-06T22:07:06.308272Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T22:07:05.954149Z","title":"D., and W ang, Z","venue":null,"work_id":"8eca96e6-fc3d-4131-af87-bb4921177873","year":2019},"citing_paper":{"arxiv_id":"2506.22851","last_updated":"2025-06-28T11:25:44Z","snapshot_observed_at":"2026-08-06T21:54:50.140169Z","submitted_at":"2025-06-28T11:25:44Z","title":"Deep neural networks can provably solve Bellman equations for Markov decision processes without the curse of dimensionality","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-06T22:06:57.988493Z"},"links":{"citing_paper":"/paper/2506.22851"},"observation_digest":"sha256:40cd43e00b42d85b47ae986be57f705665352e979918723a028c4eb40ef9a2ac","observation_id":"3be293e7-f406-4860-a0a5-28adc45a0ec7","resolution":{"observed_at":"2026-08-06T22:07:06.049661Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2205.14398","last_updated":"2022-05-28T11:03:35Z","snapshot_observed_at":"2026-07-06T13:14:59.462674Z","submitted_at":"2022-05-28T11:03:35Z","title":"Deep neural networks overcome the curse of dimensionality in the numerical approximation of semilinear partial differential equations","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2205.14398","snapshot_observed_at":"2026-08-06T22:06:58.128968Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.22851","last_updated":"2025-06-28T11:25:44Z","snapshot_observed_at":"2026-08-06T21:54:50.140169Z","submitted_at":"2025-06-28T11:25:44Z","title":"Deep neural networks can provably solve Bellman equations for Markov decision processes without the curse of dimensionality","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-06T22:06:58.128968Z"},"links":{"cited_paper":"/paper/2205.14398","citing_paper":"/paper/2506.22851"},"observation_digest":"sha256:20df71459bfdda930c8a65dc53b1948c06c29f89fb2c8bdee6a9e8550bc02452","observation_id":"7fc1e775-de8b-4e63-95b8-351c61298a7a","resolution":{"observed_at":"2026-08-06T22:06:58.128968Z","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-06T22:07:05.823971Z","title":null,"venue":null,"work_id":"6bd9f26a-b1df-4685-ac30-8df9d540e1d1","year":2019},"citing_paper":{"arxiv_id":"2506.22851","last_updated":"2025-06-28T11:25:44Z","snapshot_observed_at":"2026-08-06T21:54:50.140169Z","submitted_at":"2025-06-28T11:25:44Z","title":"Deep neural networks can provably solve Bellman equations for Markov decision processes without the curse of dimensionality","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-06T22:06:58.270180Z"},"links":{"citing_paper":"/paper/2506.22851"},"observation_digest":"sha256:ec331b97592538090b831669c76bf2f386bf18e7c713ca69dedd94a099d5df04","observation_id":"9fa12623-7a76-47de-9274-b7ac1df998cc","resolution":{"observed_at":"2026-08-06T22:07:05.870061Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T22:07:05.780683Z","title":"Multilevel Picard iterations for solving smooth semilinear parabolic heat equations","venue":null,"work_id":"e56260ba-07b7-4a26-8d2a-28d912b227ae","year":2021},"citing_paper":{"arxiv_id":"2506.22851","last_updated":"2025-06-28T11:25:44Z","snapshot_observed_at":"2026-08-06T21:54:50.140169Z","submitted_at":"2025-06-28T11:25:44Z","title":"Deep neural networks can provably solve Bellman equations for Markov decision processes without the curse of dimensionality","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-06T22:06:58.439741Z"},"links":{"citing_paper":"/paper/2506.22851"},"observation_digest":"sha256:34fd8cb0098a9fdecf0557d0147f73cad60b1824574d020189b0ae526fd31239","observation_id":"4f845859-8fd0-4435-8c63-7a47828a60ed","resolution":{"observed_at":"2026-08-06T22:07:05.815625Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T22:07:05.680979Z","title":"A theoretical analysis of deep Q-learning","venue":null,"work_id":"de01c9fe-fcfc-40e7-bab4-80d4aec22f31","year":2020},"citing_paper":{"arxiv_id":"2506.22851","last_updated":"2025-06-28T11:25:44Z","snapshot_observed_at":"2026-08-06T21:54:50.140169Z","submitted_at":"2025-06-28T11:25:44Z","title":"Deep neural networks can provably solve Bellman equations for Markov decision processes without the curse of dimensionality","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-06T22:06:58.616002Z"},"links":{"citing_paper":"/paper/2506.22851"},"observation_digest":"sha256:fe6d0674782c0bd547d54b3fff3b26274bc41de3326c3ba173723dfb6a6f58f9","observation_id":"223a9ac2-7bc9-4222-889b-1983c8f74eed","resolution":{"observed_at":"2026-08-06T22:07:05.729629Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1911.03188","last_updated":"2019-11-08T11:18:27Z","snapshot_observed_at":"2026-07-06T08:35:31.473523Z","submitted_at":"2019-11-08T11:18:27Z","title":"Generalised multilevel Picard approximations","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1911.03188","snapshot_observed_at":"2026-08-06T22:06:58.756639Z","title":"B., Jentzen, A., and Welti, T","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2506.22851","last_updated":"2025-06-28T11:25:44Z","snapshot_observed_at":"2026-08-06T21:54:50.140169Z","submitted_at":"2025-06-28T11:25:44Z","title":"Deep neural networks can provably solve Bellman equations for Markov decision processes without the curse of dimensionality","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-06T22:06:58.756639Z"},"links":{"cited_paper":"/paper/1911.03188","citing_paper":"/paper/2506.22851"},"observation_digest":"sha256:5143c95ed7fafaee6e43836ff3b5c2c9fdf2cbbb6250a3ddff0a53bd4e46f8a8","observation_id":"d251380b-03fa-4ca6-8a74-027a44a7f623","resolution":{"observed_at":"2026-08-06T22:06:58.756639Z","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-06T22:07:05.572038Z","title":"Space-time error estimates for deep neural network approximations for differential equations.Adv","venue":null,"work_id":"4ae3e799-ab7e-45a6-872c-273d73d94af7","year":2023},"citing_paper":{"arxiv_id":"2506.22851","last_updated":"2025-06-28T11:25:44Z","snapshot_observed_at":"2026-08-06T21:54:50.140169Z","submitted_at":"2025-06-28T11:25:44Z","title":"Deep neural networks can provably solve Bellman equations for Markov decision processes without the curse of dimensionality","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-06T22:06:58.957798Z"},"links":{"citing_paper":"/paper/2506.22851"},"observation_digest":"sha256:3f5dcd253c226de43d9282c9c234d173d6b797aab228d98323826a64150348d1","observation_id":"1279acbb-e947-415f-9600-56cd02ec3e06","resolution":{"observed_at":"2026-08-06T22:07:05.617656Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T22:07:05.448728Z","title":"Deep neural network approximations for solutions of PDEs based on Monte Carlo algorithms.Partial Differ","venue":null,"work_id":"616622f5-beb7-4acd-8ab8-699febe0f382","year":2022},"citing_paper":{"arxiv_id":"2506.22851","last_updated":"2025-06-28T11:25:44Z","snapshot_observed_at":"2026-08-06T21:54:50.140169Z","submitted_at":"2025-06-28T11:25:44Z","title":"Deep neural networks can provably solve Bellman equations for Markov decision processes without the curse of dimensionality","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-06T22:06:59.157205Z"},"links":{"citing_paper":"/paper/2506.22851"},"observation_digest":"sha256:67b480b287f2bdbcf598a7a42a53a71e9a3f95f985e67680e9cd80363aeaf880","observation_id":"8fc47961-fe8f-44b5-a8d3-3eef77fac971","resolution":{"observed_at":"2026-08-06T22:07:05.494212Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T22:07:05.326472Z","title":"Overcoming the curse of dimen- sionality in the numerical approximation of parabolic partial differential equations with gradient-dependent nonlinearities","venue":null,"work_id":"2007c4e8-36c3-4c4e-a49f-76708ac1ec16","year":2021},"citing_paper":{"arxiv_id":"2506.22851","last_updated":"2025-06-28T11:25:44Z","snapshot_observed_at":"2026-08-06T21:54:50.140169Z","submitted_at":"2025-06-28T11:25:44Z","title":"Deep neural networks can provably solve Bellman equations for Markov decision processes without the curse of dimensionality","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-06T22:06:59.307746Z"},"links":{"citing_paper":"/paper/2506.22851"},"observation_digest":"sha256:bc00da9215540aa6636888b89ee0e32727fa83568310b39410f25f53fbae3122","observation_id":"2603c8c3-bf2e-46f9-9d91-a1815ef78b38","resolution":{"observed_at":"2026-08-06T22:07:05.370770Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2009.02484","last_updated":"2020-10-09T07:05:53Z","snapshot_observed_at":"2026-08-09T16:26:50.317709Z","submitted_at":"2020-09-05T07:37:37Z","title":"Multilevel Picard approximations for high-dimensional semilinear second-order PDEs with Lipschitz nonlinearities","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2009.02484","snapshot_observed_at":"2026-08-06T22:06:59.435427Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2506.22851","last_updated":"2025-06-28T11:25:44Z","snapshot_observed_at":"2026-08-06T21:54:50.140169Z","submitted_at":"2025-06-28T11:25:44Z","title":"Deep neural networks can provably solve Bellman equations for Markov decision processes without the curse of dimensionality","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-06T22:06:59.435427Z"},"links":{"cited_paper":"/paper/2009.02484","citing_paper":"/paper/2506.22851"},"observation_digest":"sha256:4ea3ba683ec24184ebe0cf54e900bf6dd90f4ff666e89ff885cf1755a4fd5723","observation_id":"521de22b-32fb-474a-bc8d-fbfc0a666e64","resolution":{"observed_at":"2026-08-06T22:06:59.435427Z","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-06T22:07:05.223063Z","title":null,"venue":null,"work_id":"9249b932-a328-4e0e-b2ba-6d518f12bce3","year":2020},"citing_paper":{"arxiv_id":"2506.22851","last_updated":"2025-06-28T11:25:44Z","snapshot_observed_at":"2026-08-06T21:54:50.140169Z","submitted_at":"2025-06-28T11:25:44Z","title":"Deep neural networks can provably solve Bellman equations for Markov decision processes without the curse of dimensionality","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-06T22:06:59.575348Z"},"links":{"citing_paper":"/paper/2506.22851"},"observation_digest":"sha256:1ae13e2d66e0a8703eb1953c9ce9a210ca538ad3982bfe41549bf0afadf015f9","observation_id":"d192ffa9-8336-4b94-a8f5-97071fd0bc66","resolution":{"observed_at":"2026-08-06T22:07:05.264615Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T22:07:05.122426Z","title":"A., and von Wurstem- berger, P","venue":null,"work_id":"f34f7642-dbc3-4cd5-895e-cb6a3f791f97","year":2020},"citing_paper":{"arxiv_id":"2506.22851","last_updated":"2025-06-28T11:25:44Z","snapshot_observed_at":"2026-08-06T21:54:50.140169Z","submitted_at":"2025-06-28T11:25:44Z","title":"Deep neural networks can provably solve Bellman equations for Markov decision processes without the curse of dimensionality","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-06T22:06:59.739301Z"},"links":{"citing_paper":"/paper/2506.22851"},"observation_digest":"sha256:afb379c104c9eac273d54a3e910687a33c11d37f4aa00a2f52c5a48645213f79","observation_id":"39d4a3e4-4404-4f6f-8407-2152237efc8b","resolution":{"observed_at":"2026-08-06T22:07:05.167639Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T22:07:04.952328Z","title":"Overcoming the curse of dimensionality in the approximative pricing of financial derivatives with default risks","venue":null,"work_id":"383d08b5-1adb-4deb-b9c5-ce384d78ea93","year":2020},"citing_paper":{"arxiv_id":"2506.22851","last_updated":"2025-06-28T11:25:44Z","snapshot_observed_at":"2026-08-06T21:54:50.140169Z","submitted_at":"2025-06-28T11:25:44Z","title":"Deep neural networks can provably solve Bellman equations for Markov decision processes without the curse of dimensionality","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-06T22:06:59.887496Z"},"links":{"citing_paper":"/paper/2506.22851"},"observation_digest":"sha256:109c02ef0191684f8ca853468ae55373a5519a1eebfe06069352519ba15243d3","observation_id":"609f0b94-273f-4ea7-97e2-8de8f1a71e35","resolution":{"observed_at":"2026-08-06T22:07:05.052517Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:07:00.016108Z","title":"Overcoming the curse of dimensionality in the approximative pricing of financial derivatives with default risks","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2506.22851","last_updated":"2025-06-28T11:25:44Z","snapshot_observed_at":"2026-08-06T21:54:50.140169Z","submitted_at":"2025-06-28T11:25:44Z","title":"Deep neural networks can provably solve Bellman equations for Markov decision processes without the curse of dimensionality","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-06T22:07:00.016108Z"},"links":{"citing_paper":"/paper/2506.22851"},"observation_digest":"sha256:b5e31dbc6a087b6585ca8d311b69fa918a29cac2ca5a79afd9798f77c93157e5","observation_id":"cc510041-899f-4186-891b-c540a20cc023","resolution":{"observed_at":"2026-08-06T22:07:00.016108Z","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-06T22:07:04.827222Z","title":"Multilevel Picard approximations of high- dimensional semilinear parabolic differential equations with gradient-dependent nonlinear- ities","venue":null,"work_id":"7f67175d-84f2-4d5f-ba87-aad2f41584f2","year":2020},"citing_paper":{"arxiv_id":"2506.22851","last_updated":"2025-06-28T11:25:44Z","snapshot_observed_at":"2026-08-06T21:54:50.140169Z","submitted_at":"2025-06-28T11:25:44Z","title":"Deep neural networks can provably solve Bellman equations for Markov decision processes without the curse of dimensionality","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-06T22:07:00.095960Z"},"links":{"citing_paper":"/paper/2506.22851"},"observation_digest":"sha256:eb5edc48c97a4c5850a2ec2f9afae7726032ca774588e692daffa54f9814269e","observation_id":"d0c58614-b662-4682-b017-62d83df3d5ab","resolution":{"observed_at":"2026-08-06T22:07:04.892087Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T22:07:04.724309Z","title":"Mathematicalintroduction to deep learning: Methods, implementations, and theory, 2023","venue":null,"work_id":"76a76ae0-e97c-4a75-b9c7-5f5861f6b85c","year":2023},"citing_paper":{"arxiv_id":"2506.22851","last_updated":"2025-06-28T11:25:44Z","snapshot_observed_at":"2026-08-06T21:54:50.140169Z","submitted_at":"2025-06-28T11:25:44Z","title":"Deep neural networks can provably solve Bellman equations for Markov decision processes without the curse of dimensionality","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-06T22:07:00.176035Z"},"links":{"citing_paper":"/paper/2506.22851"},"observation_digest":"sha256:51e2025dc1bbcd9b422ec73e86edad2fe28cc33941be39ae8d4cfb6a3ab3a7f0","observation_id":"949d1f35-5920-4973-b5df-527a7f0e8eb6","resolution":{"observed_at":"2026-08-06T22:07:04.770798Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T22:07:04.582318Z","title":"Champion-level drone racing using deep reinforcement learning.Nature 620, 7976 (2023), 982–987","venue":null,"work_id":"21676379-02ef-42b3-9c0d-53bd27f51e71","year":2023},"citing_paper":{"arxiv_id":"2506.22851","last_updated":"2025-06-28T11:25:44Z","snapshot_observed_at":"2026-08-06T21:54:50.140169Z","submitted_at":"2025-06-28T11:25:44Z","title":"Deep neural networks can provably solve Bellman equations for Markov decision processes without the curse of dimensionality","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-06T22:07:00.264485Z"},"links":{"citing_paper":"/paper/2506.22851"},"observation_digest":"sha256:a65875a220a5acaf057d002ae49bbf2db5f5d714136e16992e2f0755ed3227fe","observation_id":"b36a07c3-2952-4a5b-a4f0-3bb514b15a11","resolution":{"observed_at":"2026-08-06T22:07:04.654138Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T22:07:04.444295Z","title":"P., Hunt, J","venue":null,"work_id":"97bee7d3-ec2d-48f9-9109-b7d8dbb58dbc","year":2016},"citing_paper":{"arxiv_id":"2506.22851","last_updated":"2025-06-28T11:25:44Z","snapshot_observed_at":"2026-08-06T21:54:50.140169Z","submitted_at":"2025-06-28T11:25:44Z","title":"Deep neural networks can provably solve Bellman equations for Markov decision processes without the curse of dimensionality","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-06T22:07:00.367629Z"},"links":{"citing_paper":"/paper/2506.22851"},"observation_digest":"sha256:60d1ef21b44d656797be984a299c974c742ef7317edda3ed9e9552ed16281255","observation_id":"6d7a02e4-6d94-4d8c-accb-acdda074686f","resolution":{"observed_at":"2026-08-06T22:07:04.509380Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T22:07:04.292308Z","title":"A., Veness, J., Bellemare, M","venue":null,"work_id":"0414c973-3c16-4e71-8eae-ef1ec74998da","year":2015},"citing_paper":{"arxiv_id":"2506.22851","last_updated":"2025-06-28T11:25:44Z","snapshot_observed_at":"2026-08-06T21:54:50.140169Z","submitted_at":"2025-06-28T11:25:44Z","title":"Deep neural networks can provably solve Bellman equations for Markov decision processes without the curse of dimensionality","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-06T22:07:00.453518Z"},"links":{"citing_paper":"/paper/2506.22851"},"observation_digest":"sha256:8ed9aa806f7acd7536014b8c5def54ffe8156c5b7329f7f42af68502b2f0073b","observation_id":"84672e67-622a-4e58-a393-559bf5f3dae5","resolution":{"observed_at":"2026-08-06T22:07:04.351010Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2409.20431","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:07:02.170822Z","title":null,"venue":null,"work_id":"946bcf28-7220-456c-8dc8-e8ea35f24849","year":2024},"citing_paper":{"arxiv_id":"2506.22851","last_updated":"2025-06-28T11:25:44Z","snapshot_observed_at":"2026-08-06T21:54:50.140169Z","submitted_at":"2025-06-28T11:25:44Z","title":"Deep neural networks can provably solve Bellman equations for Markov decision processes without the curse of dimensionality","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-06T22:07:00.529678Z"},"links":{"citing_paper":"/paper/2506.22851"},"observation_digest":"sha256:367d6ec4b848b8cb56450e4e34d1f489df8e25f0ef5e3cc572565fb763cfee94","observation_id":"ba30e527-90c4-41af-89d1-34e3d8cfc449","resolution":{"observed_at":"2026-08-06T22:07:02.247836Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.09200","last_updated":"2024-09-23T10:20:02Z","snapshot_observed_at":"2026-07-06T17:44:25.568933Z","submitted_at":"2024-03-14T09:14:12Z","title":"Rectified deep neural networks overcome the curse of dimensionality in the numerical approximation of gradient-dependent semilinear heat equations","version":2},"cited_work":{"arxiv_id":"2403.09200","doi":null,"metadata_source":"pith","pith_arxiv_id":"2403.09200","snapshot_observed_at":"2026-08-06T22:07:01.967222Z","title":"Rectified deep neural networks overcome the curse of dimensionality in the numerical approximation of gradient-dependent semilinear heat equations","venue":"math.NA","work_id":"18cac5dc-3ab1-4c31-8754-ee7323b162db","year":2024},"citing_paper":{"arxiv_id":"2506.22851","last_updated":"2025-06-28T11:25:44Z","snapshot_observed_at":"2026-08-06T21:54:50.140169Z","submitted_at":"2025-06-28T11:25:44Z","title":"Deep neural networks can provably solve Bellman equations for Markov decision processes without the curse of dimensionality","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-06T22:07:00.634653Z"},"links":{"cited_paper":"/paper/2403.09200","citing_paper":"/paper/2506.22851"},"observation_digest":"sha256:997f42c7852a2fc92e048f8f95a616d1cfab883c13af519eea86a30edd19088d","observation_id":"67b2a63a-0dcb-4508-9e3b-d16907ef56d9","resolution":{"observed_at":"2026-08-06T22:07:02.029498Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.15581","last_updated":"2025-01-20T17:43:37Z","snapshot_observed_at":"2026-08-04T18:34:50.128758Z","submitted_at":"2023-10-24T07:46:38Z","title":"Deep ReLU neural networks overcome the curse of dimensionality when approximating semilinear partial integro-differential equations","version":4},"cited_work":{"arxiv_id":"2310.15581","doi":null,"metadata_source":"pith","pith_arxiv_id":"2310.15581","snapshot_observed_at":"2026-08-06T22:07:01.820182Z","title":"Deep ReLU neural networks overcome the curse of dimensionality when approximating semilinear partial integro-differential equations","venue":"math.NA","work_id":"087ce6bb-2230-445d-a930-8d290712fd33","year":2023},"citing_paper":{"arxiv_id":"2506.22851","last_updated":"2025-06-28T11:25:44Z","snapshot_observed_at":"2026-08-06T21:54:50.140169Z","submitted_at":"2025-06-28T11:25:44Z","title":"Deep neural networks can provably solve Bellman equations for Markov decision processes without the curse of dimensionality","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-06T22:07:00.773926Z"},"links":{"cited_paper":"/paper/2310.15581","citing_paper":"/paper/2506.22851"},"observation_digest":"sha256:2572f184c49dbbd9f5072a185c6f0ce0a14ec2a8b296821660a78203a3210823","observation_id":"d65431af-8b4a-4ba3-a54f-e7220c5b50cd","resolution":{"observed_at":"2026-08-06T22:07:01.872809Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T22:07:04.109345Z","title":"A., and Wu, S","venue":null,"work_id":"c12da3be-1e43-4409-81cc-4fce41c9fa22","year":2025},"citing_paper":{"arxiv_id":"2506.22851","last_updated":"2025-06-28T11:25:44Z","snapshot_observed_at":"2026-08-06T21:54:50.140169Z","submitted_at":"2025-06-28T11:25:44Z","title":"Deep neural networks can provably solve Bellman equations for Markov decision processes without the curse of dimensionality","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-06T22:07:00.912490Z"},"links":{"citing_paper":"/paper/2506.22851"},"observation_digest":"sha256:a569216ac160033742c3a2b81461f1dd2f7febc7e091027466d71e323bc8f6e7","observation_id":"ac626f5b-2af1-4c0b-97c3-985c058a29a8","resolution":{"observed_at":"2026-08-06T22:07:04.193766Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T22:07:03.925197Z","title":null,"venue":null,"work_id":"c28d3e8e-3488-4e76-8e6c-26004103f4ba","year":2025},"citing_paper":{"arxiv_id":"2506.22851","last_updated":"2025-06-28T11:25:44Z","snapshot_observed_at":"2026-08-06T21:54:50.140169Z","submitted_at":"2025-06-28T11:25:44Z","title":"Deep neural networks can provably solve Bellman equations for Markov decision processes without the curse of dimensionality","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-06T22:07:01.001732Z"},"links":{"citing_paper":"/paper/2506.22851"},"observation_digest":"sha256:01db8f444c03ae7d83fd0ad86ddc10bb21bddbd1bf3072dcb5ccad1e61ee2ecb","observation_id":"05ead0d5-6eca-406c-878b-3c0afa052132","resolution":{"observed_at":"2026-08-06T22:07:04.027300Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T22:07:03.751048Z","title":"The curse of dimension and a universal method for numer- ical integration","venue":null,"work_id":"8122b946-d972-44df-a611-96f12065e9a7","year":1996},"citing_paper":{"arxiv_id":"2506.22851","last_updated":"2025-06-28T11:25:44Z","snapshot_observed_at":"2026-08-06T21:54:50.140169Z","submitted_at":"2025-06-28T11:25:44Z","title":"Deep neural networks can provably solve Bellman equations for Markov decision processes without the curse of dimensionality","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-06T22:07:01.110383Z"},"links":{"citing_paper":"/paper/2506.22851"},"observation_digest":"sha256:54ee9a04d31e5972940aa465577f0c6bcdbce9e6f2d771e06b71dfafee222e78","observation_id":"da857e18-169f-4537-bfda-7ffcdf316b42","resolution":{"observed_at":"2026-08-06T22:07:03.830990Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T22:07:03.567210Z","title":"Tractability of multivariate problems","venue":null,"work_id":"1bac2412-750a-411b-b628-2678f7421721","year":2008},"citing_paper":{"arxiv_id":"2506.22851","last_updated":"2025-06-28T11:25:44Z","snapshot_observed_at":"2026-08-06T21:54:50.140169Z","submitted_at":"2025-06-28T11:25:44Z","title":"Deep neural networks can provably solve Bellman equations for Markov decision processes without the curse of dimensionality","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-06T22:07:01.199993Z"},"links":{"citing_paper":"/paper/2506.22851"},"observation_digest":"sha256:8a5306ba3b526d9b61c377088b1cc0091cf7232477fc1fe2aae769326b97b0d4","observation_id":"05ca9c43-c641-48a2-86c2-7907511815a7","resolution":{"observed_at":"2026-08-06T22:07:03.637227Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T22:07:03.354970Z","title":null,"venue":null,"work_id":"0d03e6f0-b46c-4c3d-ac73-84099dfd97dd","year":2007},"citing_paper":{"arxiv_id":"2506.22851","last_updated":"2025-06-28T11:25:44Z","snapshot_observed_at":"2026-08-06T21:54:50.140169Z","submitted_at":"2025-06-28T11:25:44Z","title":"Deep neural networks can provably solve Bellman equations for Markov decision processes without the curse of dimensionality","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-06T22:07:01.284629Z"},"links":{"citing_paper":"/paper/2506.22851"},"observation_digest":"sha256:860b8030af4623a172b697f6a3c009a7062eeabb56bca616829e40170ec4e819","observation_id":"38286d60-dc36-44eb-b7ef-88629912526b","resolution":{"observed_at":"2026-08-06T22:07:03.471247Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:07:01.364417Z","title":null,"venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2506.22851","last_updated":"2025-06-28T11:25:44Z","snapshot_observed_at":"2026-08-06T21:54:50.140169Z","submitted_at":"2025-06-28T11:25:44Z","title":"Deep neural networks can provably solve Bellman equations for Markov decision processes without the curse of dimensionality","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-06T22:07:01.364417Z"},"links":{"citing_paper":"/paper/2506.22851"},"observation_digest":"sha256:c89f820dc366ed9294492a95a7c0fa8de94638df22a0217c37589dc3f72c5b8b","observation_id":"ec2b63dd-14aa-4189-8ebc-6d6317dd3610","resolution":{"observed_at":"2026-08-06T22:07:01.364417Z","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-06T22:07:03.182828Z","title":"J., Guez, A., Sifre, L., V an Den Driess- che, G., Schrittwieser, J., Antonoglou, I., Panneershel v am, V., Lanctot, M., et al","venue":null,"work_id":"f6e17b98-f571-4c79-8bdd-f2527d11e7e6","year":2016},"citing_paper":{"arxiv_id":"2506.22851","last_updated":"2025-06-28T11:25:44Z","snapshot_observed_at":"2026-08-06T21:54:50.140169Z","submitted_at":"2025-06-28T11:25:44Z","title":"Deep neural networks can provably solve Bellman equations for Markov decision processes without the curse of dimensionality","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-06T22:07:01.482317Z"},"links":{"citing_paper":"/paper/2506.22851"},"observation_digest":"sha256:3e723265225d39688441f5bb69edaee9b13520bbb59da761ec8615113ddde9bd","observation_id":"70269763-5f3d-4501-afa1-19a3dfbe7d18","resolution":{"observed_at":"2026-08-06T22:07:03.267558Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T22:07:02.999307Z","title":"S., and Barto, A","venue":null,"work_id":"0bb5bdaa-11c3-4cd9-9e53-8c22eba6c032","year":2018},"citing_paper":{"arxiv_id":"2506.22851","last_updated":"2025-06-28T11:25:44Z","snapshot_observed_at":"2026-08-06T21:54:50.140169Z","submitted_at":"2025-06-28T11:25:44Z","title":"Deep neural networks can provably solve Bellman equations for Markov decision processes without the curse of dimensionality","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-06T22:07:01.583226Z"},"links":{"citing_paper":"/paper/2506.22851"},"observation_digest":"sha256:eb6cd3ccfcedf68ef9ebb44bcf7cc643dff65040ab419ca1f537c1061a49a0b8","observation_id":"0a3d9598-3c9c-4441-8df7-8d0ae1181cd4","resolution":{"observed_at":"2026-08-06T22:07:03.109345Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T22:07:02.795875Z","title":"A finite-time analysis of Q-learning with neural network function approximation","venue":null,"work_id":"ed42e87c-1cab-4f64-a7f7-ae046107595f","year":2020},"citing_paper":{"arxiv_id":"2506.22851","last_updated":"2025-06-28T11:25:44Z","snapshot_observed_at":"2026-08-06T21:54:50.140169Z","submitted_at":"2025-06-28T11:25:44Z","title":"Deep neural networks can provably solve Bellman equations for Markov decision processes without the curse of dimensionality","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-06T22:07:01.691627Z"},"links":{"citing_paper":"/paper/2506.22851"},"observation_digest":"sha256:d886b40cbc21c300a38c7636ce7b016ff2200e2275d79a455b9a69c36c89b7ee","observation_id":"705f09db-dcd1-4cf1-b931-af982ca7cb33","resolution":{"observed_at":"2026-08-06T22:07:02.868743Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2506.22851","last_updated":"2025-06-28T11:25:44Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-06T21:54:50.140169Z","submitted_at":"2025-06-28T11:25:44Z","title":"Deep neural networks can provably solve Bellman equations for Markov decision processes without the curse of dimensionality"},"reference_resolution":{"displayed":42,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":13,"verified_exact":5,"verified_fuzzy":24},"total_outbound_references":42},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 42 of 42 outbound references and 0 inbound Pith citation observations for arXiv:2506.22851."}