{"as_of":"2026-08-08T06:20:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:2bd872b66e88055219401567cb1a20a777f0b5278afb05cdf64d4131bd1b2fba","coverage":[{"denominator":37,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":37,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T18:02:33.460580Z","state":"measured"},{"denominator":38,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":38,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T17:58:14.919609Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-05T17:58:15.059011Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2508.15394","last_updated":"2025-08-21T09:34:06Z","snapshot_observed_at":"2026-08-05T18:02:27.995938Z","submitted_at":"2025-08-21T09:34:06Z","title":"Hybrid Least Squares/Gradient Descent Methods for DeepONets","version":1},"cited_work":{"arxiv_id":"2508.15394","doi":null,"metadata_source":"pith","pith_arxiv_id":"2508.15394","snapshot_observed_at":"2026-08-05T17:58:15.059011Z","title":"Hybrid Least Squares/Gradient Descent Methods for DeepONets","venue":"cs.LG","work_id":"91c1114c-90fa-4c27-b817-fe63927c515b","year":2025},"citing_paper":{"arxiv_id":"2508.15397","last_updated":"2025-08-21T09:39:04Z","snapshot_observed_at":"2026-08-05T17:58:11.219790Z","submitted_at":"2025-08-21T09:39:04Z","title":"Multilateralism in the Global Governance of Artificial Intelligence","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-05T17:58:14.919609Z"},"links":{"cited_paper":"/paper/2508.15394","citing_paper":"/paper/2508.15397"},"observation_digest":"sha256:81b97899652be41d3edbc7a81fefac46412e7af1089bdea989b8e040fb1b70e9","observation_id":"5a2ae720-4a7f-4dc7-8517-d4f769393522","resolution":{"observed_at":"2026-08-05T17:58:15.140532Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2508.15394/citation-record","integrity":"/paper/2508.15394/integrity","json":"/paper/2508.15394/citation-record.json","paper":"/paper/2508.15394"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2407.12895","last_updated":"2024-07-17T13:21:53Z","snapshot_observed_at":"2026-07-06T18:48:04.031944Z","submitted_at":"2024-07-17T13:21:53Z","title":"A Survey on Universal Approximation Theorems","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.12895","snapshot_observed_at":"2026-08-05T18:02:28.727675Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.15394","last_updated":"2025-08-21T09:34:06Z","snapshot_observed_at":"2026-08-05T18:02:27.995938Z","submitted_at":"2025-08-21T09:34:06Z","title":"Hybrid Least Squares/Gradient Descent Methods for DeepONets","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-05T18:02:28.727675Z"},"links":{"cited_paper":"/paper/2407.12895","citing_paper":"/paper/2508.15394"},"observation_digest":"sha256:1005eed65fb2f0bf0235ebe47a3468a7c866479147010f89c8ee884504556170","observation_id":"3323c1b9-c3d9-4c21-9252-b89c3f1bdd76","resolution":{"observed_at":"2026-08-05T18:02:28.727675Z","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-05T18:02:40.146681Z","title":null,"venue":null,"work_id":"080c40d2-6f6e-431f-b152-daf8147cc587","year":1993},"citing_paper":{"arxiv_id":"2508.15394","last_updated":"2025-08-21T09:34:06Z","snapshot_observed_at":"2026-08-05T18:02:27.995938Z","submitted_at":"2025-08-21T09:34:06Z","title":"Hybrid Least Squares/Gradient Descent Methods for DeepONets","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-05T18:02:28.848076Z"},"links":{"citing_paper":"/paper/2508.15394"},"observation_digest":"sha256:29ab8f97ca28f7874cbfd19bbed470e91ab0a3775f52c9c099fda9d36dabd248","observation_id":"98a28db1-bbd0-4a64-a545-92d327ac6780","resolution":{"observed_at":"2026-08-05T18:02:40.276712Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T18:02:39.934557Z","title":null,"venue":null,"work_id":"67f059dc-4244-4ec2-8726-0119528ee17f","year":1972},"citing_paper":{"arxiv_id":"2508.15394","last_updated":"2025-08-21T09:34:06Z","snapshot_observed_at":"2026-08-05T18:02:27.995938Z","submitted_at":"2025-08-21T09:34:06Z","title":"Hybrid Least Squares/Gradient Descent Methods for DeepONets","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-05T18:02:28.994036Z"},"links":{"citing_paper":"/paper/2508.15394"},"observation_digest":"sha256:876e304d865c73196b727b0e75a80b26b1d7bd21e51ca9373cd39c019400b3af","observation_id":"0ef7d4b8-3ed0-4cde-b37f-f74a783b9585","resolution":{"observed_at":"2026-08-05T18:02:40.030536Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T18:02:39.744510Z","title":null,"venue":null,"work_id":"a9b0240d-faac-4389-9029-cdf60f2c0421","year":2018},"citing_paper":{"arxiv_id":"2508.15394","last_updated":"2025-08-21T09:34:06Z","snapshot_observed_at":"2026-08-05T18:02:27.995938Z","submitted_at":"2025-08-21T09:34:06Z","title":"Hybrid Least Squares/Gradient Descent Methods for DeepONets","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-05T18:02:29.109656Z"},"links":{"citing_paper":"/paper/2508.15394"},"observation_digest":"sha256:2f5065bec873454bb3acd7150bc24606e00258bc1ea4d24e59dda6953c9f182c","observation_id":"be1a4661-1110-40cd-be66-c3345049e8f4","resolution":{"observed_at":"2026-08-05T18:02:39.817529Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T18:02:39.504183Z","title":"Bradbury, R","venue":null,"work_id":"9f1ddf89-a188-43f2-8495-ec15ca5d75fd","year":2018},"citing_paper":{"arxiv_id":"2508.15394","last_updated":"2025-08-21T09:34:06Z","snapshot_observed_at":"2026-08-05T18:02:27.995938Z","submitted_at":"2025-08-21T09:34:06Z","title":"Hybrid Least Squares/Gradient Descent Methods for DeepONets","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-05T18:02:29.212471Z"},"links":{"citing_paper":"/paper/2508.15394"},"observation_digest":"sha256:dabc9dacd241ff9054f2a537745bc462a5eb9ec375f22a2cac70449e3d63cbfa","observation_id":"3652e21a-9106-416e-94ae-8b0d627baabd","resolution":{"observed_at":"2026-08-05T18:02:39.615844Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T18:02:39.266388Z","title":"Chen and H","venue":null,"work_id":"139dced4-dd5d-4164-9001-b7ca3c26ce01","year":1995},"citing_paper":{"arxiv_id":"2508.15394","last_updated":"2025-08-21T09:34:06Z","snapshot_observed_at":"2026-08-05T18:02:27.995938Z","submitted_at":"2025-08-21T09:34:06Z","title":"Hybrid Least Squares/Gradient Descent Methods for DeepONets","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-05T18:02:29.308139Z"},"links":{"citing_paper":"/paper/2508.15394"},"observation_digest":"sha256:a1f0240f410c32848b3854bfa5dfbdc529d6591da7ca07c528d0d751feac0f23","observation_id":"b26e3a93-1e98-4d5f-b92d-56845530b973","resolution":{"observed_at":"2026-08-05T18:02:39.373397Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T18:02:39.088131Z","title":null,"venue":null,"work_id":"0b78ec51-9cc8-4298-93be-d4f43c61edc2","year":1987},"citing_paper":{"arxiv_id":"2508.15394","last_updated":"2025-08-21T09:34:06Z","snapshot_observed_at":"2026-08-05T18:02:27.995938Z","submitted_at":"2025-08-21T09:34:06Z","title":"Hybrid Least Squares/Gradient Descent Methods for DeepONets","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-05T18:02:29.453275Z"},"links":{"citing_paper":"/paper/2508.15394"},"observation_digest":"sha256:10c43db76d2dc2fade0113ebe566294ebc2bc980e01aa3bed6f39e648cfb8738","observation_id":"c7a6d66c-b8de-4e9e-9f62-9b0d31f01e64","resolution":{"observed_at":"2026-08-05T18:02:39.163576Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T18:02:38.913086Z","title":"Cybenko, Approximation by superpositions of a sigmoidal function , Mathematics of Control, Signals and Systems, 2 (1989), pp","venue":null,"work_id":"8042e6a2-528d-476a-9f21-377e8846dd5a","year":1989},"citing_paper":{"arxiv_id":"2508.15394","last_updated":"2025-08-21T09:34:06Z","snapshot_observed_at":"2026-08-05T18:02:27.995938Z","submitted_at":"2025-08-21T09:34:06Z","title":"Hybrid Least Squares/Gradient Descent Methods for DeepONets","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-05T18:02:29.554280Z"},"links":{"citing_paper":"/paper/2508.15394"},"observation_digest":"sha256:91c61e4da57d81b58e5c1d466bec7430999f9f93a9453e016bc9db5ee93ca34e","observation_id":"6a724d75-2077-4ab9-82e6-11ba368c5159","resolution":{"observed_at":"2026-08-05T18:02:38.989731Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T18:02:38.710999Z","title":null,"venue":null,"work_id":"3d9755f0-f09f-4f5b-989c-769ed807ff84","year":2020},"citing_paper":{"arxiv_id":"2508.15394","last_updated":"2025-08-21T09:34:06Z","snapshot_observed_at":"2026-08-05T18:02:27.995938Z","submitted_at":"2025-08-21T09:34:06Z","title":"Hybrid Least Squares/Gradient Descent Methods for DeepONets","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-05T18:02:29.631024Z"},"links":{"citing_paper":"/paper/2508.15394"},"observation_digest":"sha256:8d575ad2736aa11b3f3dc0973d2a987c7b76ef3c6439ef6080305b954d53419b","observation_id":"c54dccf8-fc47-4f4c-939d-9f9b8337014b","resolution":{"observed_at":"2026-08-05T18:02:38.790537Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1907.04840","last_updated":"2019-08-23T18:30:16Z","snapshot_observed_at":"2026-07-06T08:06:52.501752Z","submitted_at":"2019-07-10T17:40:20Z","title":"Sparse Networks from Scratch: Faster Training without Losing Performance","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1907.04840","snapshot_observed_at":"2026-08-05T18:02:29.743385Z","title":"Dettmers and L","venue":null,"work_id":null,"year":1907},"citing_paper":{"arxiv_id":"2508.15394","last_updated":"2025-08-21T09:34:06Z","snapshot_observed_at":"2026-08-05T18:02:27.995938Z","submitted_at":"2025-08-21T09:34:06Z","title":"Hybrid Least Squares/Gradient Descent Methods for DeepONets","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-05T18:02:29.743385Z"},"links":{"cited_paper":"/paper/1907.04840","citing_paper":"/paper/2508.15394"},"observation_digest":"sha256:4976bd07f45abaaa3bbd4dd013b3848b5ac0f881cd8679c1312b6b62b0ec1b65","observation_id":"4d0450fb-c953-4cc6-b83f-f79876816ae7","resolution":{"observed_at":"2026-08-05T18:02:29.743385Z","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-05T18:02:38.499684Z","title":null,"venue":null,"work_id":"e4bd9bac-5abe-426f-b00f-3a4875ecfb1d","year":1999},"citing_paper":{"arxiv_id":"2508.15394","last_updated":"2025-08-21T09:34:06Z","snapshot_observed_at":"2026-08-05T18:02:27.995938Z","submitted_at":"2025-08-21T09:34:06Z","title":"Hybrid Least Squares/Gradient Descent Methods for DeepONets","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-05T18:02:29.881625Z"},"links":{"citing_paper":"/paper/2508.15394"},"observation_digest":"sha256:61b18a18c06592271b134b51812607e8daf45fcfc99178e8bc1c02c5cb355101","observation_id":"a5d548d6-31cb-46f0-b259-23f8805133f6","resolution":{"observed_at":"2026-08-05T18:02:38.594014Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T18:02:38.261119Z","title":null,"venue":null,"work_id":"9389d7b9-39ce-4f23-acee-f6d509e3c91e","year":2015},"citing_paper":{"arxiv_id":"2508.15394","last_updated":"2025-08-21T09:34:06Z","snapshot_observed_at":"2026-08-05T18:02:27.995938Z","submitted_at":"2025-08-21T09:34:06Z","title":"Hybrid Least Squares/Gradient Descent Methods for DeepONets","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-05T18:02:30.040161Z"},"links":{"citing_paper":"/paper/2508.15394"},"observation_digest":"sha256:8a51af54855b94619a5f85a0ce08856341fb1e72a8d18593ef2050b775bde24e","observation_id":"b6688705-1086-4b59-b1b6-056bb6ea0ca8","resolution":{"observed_at":"2026-08-05T18:02:38.401633Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T18:02:37.969984Z","title":"Heinecke, J","venue":null,"work_id":"f2f44dca-ed0c-4a8a-827f-c7d22e1bcaf9","year":2020},"citing_paper":{"arxiv_id":"2508.15394","last_updated":"2025-08-21T09:34:06Z","snapshot_observed_at":"2026-08-05T18:02:27.995938Z","submitted_at":"2025-08-21T09:34:06Z","title":"Hybrid Least Squares/Gradient Descent Methods for DeepONets","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-05T18:02:30.196211Z"},"links":{"citing_paper":"/paper/2508.15394"},"observation_digest":"sha256:b3cdbb9cf0a7a399261433ed2d6dc1349a7c82ff0ce40f66a22557dc4fccd888","observation_id":"5a4603fa-4e39-4c42-b049-7d6eebf4b32a","resolution":{"observed_at":"2026-08-05T18:02:38.107018Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T18:02:37.701776Z","title":"Hornik, M","venue":null,"work_id":"d47cabd8-827b-461e-a86c-05310ae2388f","year":1989},"citing_paper":{"arxiv_id":"2508.15394","last_updated":"2025-08-21T09:34:06Z","snapshot_observed_at":"2026-08-05T18:02:27.995938Z","submitted_at":"2025-08-21T09:34:06Z","title":"Hybrid Least Squares/Gradient Descent Methods for DeepONets","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-05T18:02:30.311670Z"},"links":{"citing_paper":"/paper/2508.15394"},"observation_digest":"sha256:68b151fb22c3752cfd77489fe8ec515f6f1c5684e208a14988ecb6ca15491879","observation_id":"c9757214-4109-42fa-8bef-7898f8aeafa3","resolution":{"observed_at":"2026-08-05T18:02:37.838413Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T18:02:37.419075Z","title":null,"venue":null,"work_id":"d5ce49bd-dedc-465b-9233-4a2c98b78741","year":2024},"citing_paper":{"arxiv_id":"2508.15394","last_updated":"2025-08-21T09:34:06Z","snapshot_observed_at":"2026-08-05T18:02:27.995938Z","submitted_at":"2025-08-21T09:34:06Z","title":"Hybrid Least Squares/Gradient Descent Methods for DeepONets","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-05T18:02:30.489789Z"},"links":{"citing_paper":"/paper/2508.15394"},"observation_digest":"sha256:13459221ad2ea836d4ff86149c654e5d55989dbb60c722c7cd219986859fa676","observation_id":"0733edb8-7356-4154-b3aa-383d165349b3","resolution":{"observed_at":"2026-08-05T18:02:37.576140Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T18:02:37.189592Z","title":null,"venue":null,"work_id":"dbc6440a-e537-4bab-a959-be7414919470","year":2022},"citing_paper":{"arxiv_id":"2508.15394","last_updated":"2025-08-21T09:34:06Z","snapshot_observed_at":"2026-08-05T18:02:27.995938Z","submitted_at":"2025-08-21T09:34:06Z","title":"Hybrid Least Squares/Gradient Descent Methods for DeepONets","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-05T18:02:30.664565Z"},"links":{"citing_paper":"/paper/2508.15394"},"observation_digest":"sha256:57f37a0dedee7e96de4a025b50656f99a472acf2947528db42e488d62cb8fbe8","observation_id":"5a779b5f-22a7-40f4-80e6-96e734787b15","resolution":{"observed_at":"2026-08-05T18:02:37.268660Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1412.6980","last_updated":"2017-01-30T01:27:54Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2014-12-22T13:54:29Z","title":"Adam: A Method for Stochastic Optimization","version":9},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1412.6980","snapshot_observed_at":"2026-08-05T18:02:30.844837Z","title":null,"venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2508.15394","last_updated":"2025-08-21T09:34:06Z","snapshot_observed_at":"2026-08-05T18:02:27.995938Z","submitted_at":"2025-08-21T09:34:06Z","title":"Hybrid Least Squares/Gradient Descent Methods for DeepONets","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-05T18:02:30.844837Z"},"links":{"cited_paper":"/paper/1412.6980","citing_paper":"/paper/2508.15394"},"observation_digest":"sha256:59aa4642af9b53199a20283e5d7cbda86960eddccc90afa2d43251d43965d84b","observation_id":"62802a80-e848-4efc-accf-2e36c13b5c5e","resolution":{"observed_at":"2026-08-05T18:02:30.844837Z","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-05T18:02:36.932116Z","title":null,"venue":null,"work_id":"c89066da-3fd4-428a-9101-3cdbcdc0e370","year":2022},"citing_paper":{"arxiv_id":"2508.15394","last_updated":"2025-08-21T09:34:06Z","snapshot_observed_at":"2026-08-05T18:02:27.995938Z","submitted_at":"2025-08-21T09:34:06Z","title":"Hybrid Least Squares/Gradient Descent Methods for DeepONets","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-05T18:02:31.003517Z"},"links":{"citing_paper":"/paper/2508.15394"},"observation_digest":"sha256:28ce0076c2f0fe15eadc053b855df33637f2585d5bc0b70eae3d2f0848e9a14c","observation_id":"231ac2a1-ff27-4fa7-bcd2-08dc53c182b2","resolution":{"observed_at":"2026-08-05T18:02:37.057143Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T18:02:36.613780Z","title":", IEEE Transactions on Neural Networks and Learning Systems, 35 (2024), pp","venue":null,"work_id":"bdef2f9c-e4aa-41ee-8156-4f87f2c712f0","year":2024},"citing_paper":{"arxiv_id":"2508.15394","last_updated":"2025-08-21T09:34:06Z","snapshot_observed_at":"2026-08-05T18:02:27.995938Z","submitted_at":"2025-08-21T09:34:06Z","title":"Hybrid Least Squares/Gradient Descent Methods for DeepONets","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-05T18:02:31.128791Z"},"links":{"citing_paper":"/paper/2508.15394"},"observation_digest":"sha256:4d76fa951947e4807ed871076b065391128e8ac9aa2cb3c5e57d5de4e7e7f1f4","observation_id":"b6a31c7e-9ef7-4909-95bb-e8a1327dc3d0","resolution":{"observed_at":"2026-08-05T18:02:36.752962Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2010.08895","last_updated":"2021-05-17T03:12:33Z","snapshot_observed_at":"2026-07-06T10:05:26.653366Z","submitted_at":"2020-10-18T00:34:21Z","title":"Fourier Neural Operator for Parametric Partial Differential Equations","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2010.08895","snapshot_observed_at":"2026-08-05T18:02:31.251203Z","title":null,"venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2508.15394","last_updated":"2025-08-21T09:34:06Z","snapshot_observed_at":"2026-08-05T18:02:27.995938Z","submitted_at":"2025-08-21T09:34:06Z","title":"Hybrid Least Squares/Gradient Descent Methods for DeepONets","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-05T18:02:31.251203Z"},"links":{"cited_paper":"/paper/2010.08895","citing_paper":"/paper/2508.15394"},"observation_digest":"sha256:c6c723a92394b436d49d0c6b06cc00be71807e5f2654771dc3171493a7dcd2d0","observation_id":"dc6227fc-5def-41cd-ae30-0acded8f62a2","resolution":{"observed_at":"2026-08-05T18:02:31.251203Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2003.03485","last_updated":"2020-03-07T01:56:20Z","snapshot_observed_at":"2026-08-03T02:26:02.483819Z","submitted_at":"2020-03-07T01:56:20Z","title":"Neural Operator: Graph Kernel Network for Partial Differential Equations","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2003.03485","snapshot_observed_at":"2026-08-05T18:02:31.386164Z","title":null,"venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2508.15394","last_updated":"2025-08-21T09:34:06Z","snapshot_observed_at":"2026-08-05T18:02:27.995938Z","submitted_at":"2025-08-21T09:34:06Z","title":"Hybrid Least Squares/Gradient Descent Methods for DeepONets","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-05T18:02:31.386164Z"},"links":{"cited_paper":"/paper/2003.03485","citing_paper":"/paper/2508.15394"},"observation_digest":"sha256:f52a6742a902f080f2c42619a5bd96ff7d5b9370c45f2426c3c89c0573186494","observation_id":"4c17eab3-7acd-47bc-b704-65ca0705b37d","resolution":{"observed_at":"2026-08-05T18:02:31.386164Z","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-05T18:02:36.375738Z","title":"Lin and S","venue":null,"work_id":"37e2aa2e-a931-487b-91f7-0009878da5b4","year":2018},"citing_paper":{"arxiv_id":"2508.15394","last_updated":"2025-08-21T09:34:06Z","snapshot_observed_at":"2026-08-05T18:02:27.995938Z","submitted_at":"2025-08-21T09:34:06Z","title":"Hybrid Least Squares/Gradient Descent Methods for DeepONets","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-05T18:02:31.487731Z"},"links":{"citing_paper":"/paper/2508.15394"},"observation_digest":"sha256:e4dd6b87a09ce875750c4899e746f1bf901168913b0f6e9452761706e2a452da","observation_id":"8eae6930-8fd8-4e77-9dc9-3b0da358998f","resolution":{"observed_at":"2026-08-05T18:02:36.489037Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T18:02:36.202937Z","title":null,"venue":null,"work_id":"031bdcb8-6275-4bb0-9c0e-3f22d005c169","year":1989},"citing_paper":{"arxiv_id":"2508.15394","last_updated":"2025-08-21T09:34:06Z","snapshot_observed_at":"2026-08-05T18:02:27.995938Z","submitted_at":"2025-08-21T09:34:06Z","title":"Hybrid Least Squares/Gradient Descent Methods for DeepONets","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-05T18:02:31.596030Z"},"links":{"citing_paper":"/paper/2508.15394"},"observation_digest":"sha256:15606c98a5ae31fabe0810971767065fda00f7646d69461ba64c58ec772d1760","observation_id":"9753d140-a2ff-4422-9c24-3d89ed957632","resolution":{"observed_at":"2026-08-05T18:02:36.293789Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T18:02:36.026896Z","title":null,"venue":null,"work_id":"20fc5509-6619-49a2-b839-3266fc839c89","year":2021},"citing_paper":{"arxiv_id":"2508.15394","last_updated":"2025-08-21T09:34:06Z","snapshot_observed_at":"2026-08-05T18:02:27.995938Z","submitted_at":"2025-08-21T09:34:06Z","title":"Hybrid Least Squares/Gradient Descent Methods for DeepONets","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-05T18:02:31.693306Z"},"links":{"citing_paper":"/paper/2508.15394"},"observation_digest":"sha256:352a4452418c6ce315bc0257677692142163369eb8f306e6e829823d5d83c532","observation_id":"80062ec6-1915-4deb-8445-6396c7881c8c","resolution":{"observed_at":"2026-08-05T18:02:36.111850Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T18:02:35.807883Z","title":null,"venue":null,"work_id":"9c9957a8-e500-4d64-9523-c0195465898d","year":2022},"citing_paper":{"arxiv_id":"2508.15394","last_updated":"2025-08-21T09:34:06Z","snapshot_observed_at":"2026-08-05T18:02:27.995938Z","submitted_at":"2025-08-21T09:34:06Z","title":"Hybrid Least Squares/Gradient Descent Methods for DeepONets","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-05T18:02:31.842515Z"},"links":{"citing_paper":"/paper/2508.15394"},"observation_digest":"sha256:735defcc229828cb4142fa7bfd323de73b0b9c8b7f6e5cd4d217972751cb7a5c","observation_id":"61402daf-cb04-46e2-bf65-f49ba89720f6","resolution":{"observed_at":"2026-08-05T18:02:35.913787Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T18:02:35.596446Z","title":null,"venue":null,"work_id":"2d003c2c-7955-42f5-a231-1d3487e12792","year":2017},"citing_paper":{"arxiv_id":"2508.15394","last_updated":"2025-08-21T09:34:06Z","snapshot_observed_at":"2026-08-05T18:02:27.995938Z","submitted_at":"2025-08-21T09:34:06Z","title":"Hybrid Least Squares/Gradient Descent Methods for DeepONets","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-05T18:02:31.968877Z"},"links":{"citing_paper":"/paper/2508.15394"},"observation_digest":"sha256:f0431a208cf3cb845a390ea6a4a32ebb2bac5b1df9011b2271bb152c53f09b60","observation_id":"8d7f5aef-6633-49ca-ac35-b8ee74fead96","resolution":{"observed_at":"2026-08-05T18:02:35.694913Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T18:02:35.327834Z","title":null,"venue":null,"work_id":"0c27cd56-440a-4b09-9be7-5ab6cbba9865","year":2024},"citing_paper":{"arxiv_id":"2508.15394","last_updated":"2025-08-21T09:34:06Z","snapshot_observed_at":"2026-08-05T18:02:27.995938Z","submitted_at":"2025-08-21T09:34:06Z","title":"Hybrid Least Squares/Gradient Descent Methods for DeepONets","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-05T18:02:32.131209Z"},"links":{"citing_paper":"/paper/2508.15394"},"observation_digest":"sha256:54961e4530f85bd3c48781fac2a312ee3156abf9f60bc6b714bc375ac47789c0","observation_id":"2e60fc6a-dd0e-4209-85ae-cece122595c0","resolution":{"observed_at":"2026-08-05T18:02:35.439229Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T18:02:35.142335Z","title":null,"venue":null,"work_id":"d76b49e1-4f39-4451-8794-a427d76ca2fe","year":1979},"citing_paper":{"arxiv_id":"2508.15394","last_updated":"2025-08-21T09:34:06Z","snapshot_observed_at":"2026-08-05T18:02:27.995938Z","submitted_at":"2025-08-21T09:34:06Z","title":"Hybrid Least Squares/Gradient Descent Methods for DeepONets","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-05T18:02:32.283469Z"},"links":{"citing_paper":"/paper/2508.15394"},"observation_digest":"sha256:cfabc3ff041798cae5832811af1b5c18c95c45aba9343e1978a05d8aa9b8f008","observation_id":"14c9f3a4-bc96-44c8-94ab-c960408a1e94","resolution":{"observed_at":"2026-08-05T18:02:35.221694Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T18:02:34.989223Z","title":"Neudecker, The Kronecker matrix product and some of its applications in econometrics, Statistica Neerlandica, 22 (1968), pp","venue":null,"work_id":"1c700d49-771c-4255-93ae-26b4fed34a78","year":1968},"citing_paper":{"arxiv_id":"2508.15394","last_updated":"2025-08-21T09:34:06Z","snapshot_observed_at":"2026-08-05T18:02:27.995938Z","submitted_at":"2025-08-21T09:34:06Z","title":"Hybrid Least Squares/Gradient Descent Methods for DeepONets","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-05T18:02:32.362634Z"},"links":{"citing_paper":"/paper/2508.15394"},"observation_digest":"sha256:25a661cd6167b4421ce15a0e17b56972eb1c3a3d885d4ced7bdf5bf6f32b3709","observation_id":"951c9afb-9040-4afd-a334-aaa3f7aa02fe","resolution":{"observed_at":"2026-08-05T18:02:35.069783Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T18:02:34.793701Z","title":"Raissi, P","venue":null,"work_id":"0cb1b82e-cc6e-445d-856a-699e0492475e","year":2019},"citing_paper":{"arxiv_id":"2508.15394","last_updated":"2025-08-21T09:34:06Z","snapshot_observed_at":"2026-08-05T18:02:27.995938Z","submitted_at":"2025-08-21T09:34:06Z","title":"Hybrid Least Squares/Gradient Descent Methods for DeepONets","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-05T18:02:32.506688Z"},"links":{"citing_paper":"/paper/2508.15394"},"observation_digest":"sha256:d6f59726170f31b84afc5061bb6a667e46c7c8f14f7d2f8d9aa4bf59e45837ce","observation_id":"1cc160fe-dff4-4505-b567-aa7683344404","resolution":{"observed_at":"2026-08-05T18:02:34.903345Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1710.05941","last_updated":"2017-10-27T17:45:21Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2017-10-16T18:05:45Z","title":"Searching for Activation Functions","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1710.05941","snapshot_observed_at":"2026-08-05T18:02:32.687399Z","title":"Ramachandran, B","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2508.15394","last_updated":"2025-08-21T09:34:06Z","snapshot_observed_at":"2026-08-05T18:02:27.995938Z","submitted_at":"2025-08-21T09:34:06Z","title":"Hybrid Least Squares/Gradient Descent Methods for DeepONets","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-05T18:02:32.687399Z"},"links":{"cited_paper":"/paper/1710.05941","citing_paper":"/paper/2508.15394"},"observation_digest":"sha256:af8f3243d48b0cfd5018473a95a90368809b28ead4917779fb34c7a1dad5ce33","observation_id":"322afa86-88f1-4f94-a253-e813c29ee3a9","resolution":{"observed_at":"2026-08-05T18:02:32.687399Z","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-05T18:02:34.596635Z","title":"Salimans and D","venue":null,"work_id":"adc2c39c-78fa-4591-9bf6-e5b44fb67b17","year":2016},"citing_paper":{"arxiv_id":"2508.15394","last_updated":"2025-08-21T09:34:06Z","snapshot_observed_at":"2026-08-05T18:02:27.995938Z","submitted_at":"2025-08-21T09:34:06Z","title":"Hybrid Least Squares/Gradient Descent Methods for DeepONets","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-05T18:02:32.806291Z"},"links":{"citing_paper":"/paper/2508.15394"},"observation_digest":"sha256:b53e5e22507a451003533345d0db461d71a85b665fc7f27061cdebd82112c14b","observation_id":"69bfef52-ca6c-4ecd-909a-a5ef520b9996","resolution":{"observed_at":"2026-08-05T18:02:34.664923Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T18:02:34.447050Z","title":"Son, ELM-DeepONets: Backpropagation-free training of deep operator networks via extreme learning machines , IEEE Access, 13 (2025), pp","venue":null,"work_id":"0bd9b0b5-16c0-4b9e-9830-89bdadcb87a7","year":2025},"citing_paper":{"arxiv_id":"2508.15394","last_updated":"2025-08-21T09:34:06Z","snapshot_observed_at":"2026-08-05T18:02:27.995938Z","submitted_at":"2025-08-21T09:34:06Z","title":"Hybrid Least Squares/Gradient Descent Methods for DeepONets","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-05T18:02:32.886790Z"},"links":{"citing_paper":"/paper/2508.15394"},"observation_digest":"sha256:5e19582e2ec9b7493e4cf0463c3f2f56c281c3d4ba6a9e47b6bf0e9de54a0a6a","observation_id":"a6e241bb-a64e-4b09-b570-6a756002cdf9","resolution":{"observed_at":"2026-08-05T18:02:34.497011Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T18:02:34.216973Z","title":null,"venue":null,"work_id":"62bce4db-e3e5-43b0-ac35-925c19de2384","year":1963},"citing_paper":{"arxiv_id":"2508.15394","last_updated":"2025-08-21T09:34:06Z","snapshot_observed_at":"2026-08-05T18:02:27.995938Z","submitted_at":"2025-08-21T09:34:06Z","title":"Hybrid Least Squares/Gradient Descent Methods for DeepONets","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-05T18:02:33.043398Z"},"links":{"citing_paper":"/paper/2508.15394"},"observation_digest":"sha256:7b49fac989ab3a1e82d2e1ddf313bb5add2493f27a00d5c287676d54cf7f2623","observation_id":"b17ba2f2-d730-406d-966e-edd9ce4c8238","resolution":{"observed_at":"2026-08-05T18:02:34.341851Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T18:02:34.037378Z","title":"W ang, H","venue":null,"work_id":"fd99836d-963d-49d0-b70f-6a761e25a970","year":2021},"citing_paper":{"arxiv_id":"2508.15394","last_updated":"2025-08-21T09:34:06Z","snapshot_observed_at":"2026-08-05T18:02:27.995938Z","submitted_at":"2025-08-21T09:34:06Z","title":"Hybrid Least Squares/Gradient Descent Methods for DeepONets","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-05T18:02:33.151387Z"},"links":{"citing_paper":"/paper/2508.15394"},"observation_digest":"sha256:abc3206a684b800ca92ded2f92f83be05ce70c177fed4909741ce76188841d6e","observation_id":"0245c864-afc5-4577-8ede-66ea653c02f3","resolution":{"observed_at":"2026-08-05T18:02:34.116649Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T18:02:33.814883Z","title":"Zheng, A","venue":null,"work_id":"7a084e37-bfe3-427c-9a89-2d91bd5bdb6d","year":2016},"citing_paper":{"arxiv_id":"2508.15394","last_updated":"2025-08-21T09:34:06Z","snapshot_observed_at":"2026-08-05T18:02:27.995938Z","submitted_at":"2025-08-21T09:34:06Z","title":"Hybrid Least Squares/Gradient Descent Methods for DeepONets","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-05T18:02:33.315841Z"},"links":{"citing_paper":"/paper/2508.15394"},"observation_digest":"sha256:45362da622c71109471d3b1fd4833de3fcc8677004d557629fcf645d68483d7c","observation_id":"2d986370-e50e-4bc0-9dd5-f0566db6d15d","resolution":{"observed_at":"2026-08-05T18:02:33.911227Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T18:02:33.628391Z","title":"Zhou, Universality of deep convolutional neural networks , Applied and Computa- tional Harmonic Analysis, 48 (2020), pp","venue":null,"work_id":"42fc9a8c-b15b-4c8e-b4ce-5c0736057612","year":2020},"citing_paper":{"arxiv_id":"2508.15394","last_updated":"2025-08-21T09:34:06Z","snapshot_observed_at":"2026-08-05T18:02:27.995938Z","submitted_at":"2025-08-21T09:34:06Z","title":"Hybrid Least Squares/Gradient Descent Methods for DeepONets","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-05T18:02:33.460580Z"},"links":{"citing_paper":"/paper/2508.15394"},"observation_digest":"sha256:6c0a13074785a1ef6c4ae9b65367ddaa64bd42afe67fce7ddc3ca9b679dc467b","observation_id":"532e2dc3-d1e3-450b-bfdb-c5b5cbd13c88","resolution":{"observed_at":"2026-08-05T18:02:33.725671Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2508.15394","last_updated":"2025-08-21T09:34:06Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-05T18:02:27.995938Z","submitted_at":"2025-08-21T09:34:06Z","title":"Hybrid Least Squares/Gradient Descent Methods for DeepONets"},"reference_resolution":{"displayed":37,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":23,"verified_exact":0,"verified_fuzzy":14},"total_outbound_references":37},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 37 of 37 outbound references and 1 inbound Pith citation observation for arXiv:2508.15394."}