{"as_of":"2026-08-17T13:05:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:789138caecbca951f285baacf743fc50b2b49689d62a57b5b430c71013852bcd","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-17T06:30:58.91139+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-17T00:58:47.899109Z","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-17T00:59:31.441156Z","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:920cbed312456f6f073657a3c78a7ac4c5dc23bba4bae855409a2060181e0126","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-08-16T17:07:45.948194Z","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-17T00:58:47.899109Z","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:8414f9405c96b7882e8bc2694b2ad55ddc28cd89719163a5f949f6e12d799bb0","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-17T00:58:47.899109Z","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:091807cc9a4ff4ef781ca1673b86e418683892e5aafd14f68aa32c0b30af08fe","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-17T00:58:47.899109Z","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:bf33b1611dbff9fc0a616b27eea6a4b2b72bee427e27a7b24519134c7461c510","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-17T00:58:47.899109Z","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:49c6a1c3a979bd61acbab800ef94b8bb619f835f5b657ff0eaeb4bfa2c38c3a1","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-17T00:58:47.899109Z","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:e6d808f4a4c5eec54ad6d02b4e7862a238407b4ff39de0b0dd32f2320bd59fe0","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-17T00:58:47.899109Z","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:8ad05ee1079524ced07b369601c2c7b09a9623d632838aa317d04d8f0c732484","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-17T00:58:47.899109Z","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:3f29736166b6a0f52d0fc1c12205ce936e6607047a6287608a748e0812badc40","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-17T00:58:47.899109Z","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:ac3b96480eb59e8e899d471bb858c25d709f249e868029bbbac23b9d3f390c47","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-17T00:58:47.899109Z","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:0be94d74688f08ed77bb82042ecefb478528597d81f80a60c55d5e1b6d893a0d","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-08-14T21:54:21.093715Z","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-17T00:58:47.899109Z","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:fc6fd118002e543d8e56a4e06a3d48315c5b4bc4f7db113cec5652200022ea77","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-17T00:58:47.899109Z","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:7918d82324eb996752cd8ba934923cb843d60c515404437a2f0b188f33ef7b95","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-17T00:58:47.899109Z","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:924d74933739df1584f0b3bfbda0da267c174e78109fb4ff5b7e86b8e27966d1","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-17T00:58:47.899109Z","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:caa727a1d8a40e72801f6a1f501160227e00f159c4a75bd08340de34e37226df","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-17T00:58:47.899109Z","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:6bc20b6df87f63129ae7ab4ab25e0444d1cafb810885c0c7eda66bb3213b4600","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-17T00:58:47.899109Z","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:3ed00cf6d77c39aecec3b74877b30cfe7395db937e9964f7f8757fc054afdfef","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-17T00:58:47.899109Z","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:92245aecdf576ad2401a42355a69b869b231338ded429e632fd9cb8028770aba","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-08-14T18:51:16.666127Z","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-17T00:58:47.899109Z","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:910d5904d1a72262e0b251b4b0e5e5b4872f297a0b9db6472188c6dac692f743","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-17T00:58:47.899109Z","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:b7fdde1cba0d546f97d99017e5babdf2f81a2c74fc2c83109f60014065b6ed35","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-17T00:58:47.899109Z","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:041122214d68a42b5aef6980a7259dede836ef9330b41e1c109ed01b413dfc13","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-08-14T20:53:04.124337Z","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-17T00:58:47.899109Z","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:ceea875b33432fec978cd7a7f3d3f1cfe84c29c6f94d22eb4fbe4557f5f487ab","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-15T17:57:12.049079Z","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-17T00:58:47.899109Z","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:a6fb9eec0718c6116c41677dc519d8da0377f7773fca32eb66d242733d1cfeb5","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-17T00:58:47.899109Z","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:8bc52468d3aeb1e8505810b9091918971c6fa9a81b52a02396bd154e2e04f785","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-17T00:58:47.899109Z","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:23d5417e02ac33e3186dc93e0e5530ec4a72ee9af1b2cece3c85651a4a118ef0","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-17T00:58:47.899109Z","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:50bd6cece07f575a748cec16f6dde958ae6777e8f31ba6dba3775e11a5920351","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-17T00:58:47.899109Z","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:fe8e0403257a86f60a746c4ecb1f300760ae791f7707c437fe12a90285e80865","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-17T00:58:47.899109Z","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:51a946e21be8956acfa5b095b4a0a6a57fb07dd0a4f153f3d5159670f3a9c4d7","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-17T00:58:47.899109Z","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:4450705845ac4c6a15247db40ed279d6456b1e2d966266eabef3579e9f050236","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-17T00:58:47.899109Z","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:91a69a0c1bd631553b3d3b1657ad517118d07a7fdcdf5731d4b93864c8abd971","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-17T00:58:47.899109Z","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:5705bc8735454986434d148e46c76aff2e8a05a5c161107908d2a8c86a7ce19d","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-17T00:58:47.899109Z","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:bfa3e9d25cf280160d0157bb5e828aaace56b8fd86552728bd163df93ad43373","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-08-08T18:23:31.977872Z","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-17T00:58:47.899109Z","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:54810fe8ea115b565a66711ed4e70b20f0d23ea64883ab9cf032cee4b7f0d677","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-17T00:58:47.899109Z","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:93f8c4315f8c0ef34a4995166bb7a679f40a13c1b3349c0dd003ab17e28d7bb9","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-17T00:58:47.899109Z","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:6aa0ea2ca7ce61999c91c65d8252847145b39cedfe3bc3179dbf5bcb2f4acd10","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-17T00:58:47.899109Z","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:bc7e7c1c0cf2668807ef994a4de4fbc73eec31bbdc8a0915ec34361877d1ab4d","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-17T00:58:47.899109Z","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:d809ef5b11826f1246dc6db126867646efa972c97103ce320cbc1a7f4a306006","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-17T00:58:47.899109Z","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:94c5779a11a404894df45ecb3949d26213d6c86a0d9f645afd3f832ba9d79d96","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-17T00:58:47.899109Z","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:8ffb77046f28e5fc14b166c5bf8b4ba080ce48c974e5b241affc9d8e5db4da9d","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-17T00:58:47.899109Z","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-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 37 of 37 outbound references and 1 inbound Pith citation observation for arXiv:2508.15394."}