{"as_of":"2026-08-10T17:47:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:4e009c25b6eae6bc406814da50240a7a448156547980dd1eba40ec81c3c2fa96","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T04:19:41.578374Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-07-03T00:47:30.228379Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2303.16317","last_updated":"2023-10-13T22:28:39Z","snapshot_observed_at":"2026-07-06T15:09:17.982917Z","submitted_at":"2023-03-28T21:27:36Z","title":"Operator learning with PCA-Net: upper and lower complexity bounds","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.16317","snapshot_observed_at":"2026-08-07T04:19:41.578374Z","title":"Operator learning with PCA-Net : upper and lower complexity bounds","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.10973","last_updated":"2025-06-12T17:59:31Z","snapshot_observed_at":"2026-08-10T15:25:53.062741Z","submitted_at":"2025-06-12T17:59:31Z","title":"Principled Approaches for Extending Neural Architectures to Function Spaces for Operator Learning","version":1},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-08-07T04:19:41.578374Z"},"links":{"cited_paper":"/paper/2303.16317","citing_paper":"/paper/2506.10973"},"observation_digest":"sha256:eb7436b8549ef8f38df532df60faba78cdfe0eaeed75c99db5bd8a8b3f0c25fb","observation_id":"7e5a229c-c081-4776-af03-aad85d120650","resolution":{"observed_at":"2026-08-07T04:19:41.578374Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2303.16317","last_updated":"2023-10-13T22:28:39Z","snapshot_observed_at":"2026-07-06T15:09:17.982917Z","submitted_at":"2023-03-28T21:27:36Z","title":"Operator learning with PCA-Net: upper and lower complexity bounds","version":5},"cited_work":{"arxiv_id":"2303.16317","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2303.16317","snapshot_observed_at":"2026-07-03T00:47:30.228379Z","title":"Operator learning with PCA-Net: upper and lower complexity bounds, October 2023","venue":null,"work_id":"403c1166-e31c-4903-8bc0-17be36eada97","year":2023},"citing_paper":{"arxiv_id":"2606.08956","last_updated":"2026-07-27T01:57:24Z","snapshot_observed_at":"2026-08-03T21:37:59.460585Z","submitted_at":"2026-06-08T02:58:15Z","title":"From inverse problems to neural operators: prediction, mechanism, and generalization of data-driven models","version":2},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-06-27T17:03:15.379147Z"},"links":{"cited_paper":"/paper/2303.16317","citing_paper":"/paper/2606.08956"},"observation_digest":"sha256:3c7d1200a25f9202ff8bc6a94d3a550267c94d797a8b5cfe791c9f45c491b51c","observation_id":"e880704e-54e8-42d4-9593-ffc291f645d4","resolution":{"observed_at":"2026-07-03T00:47:30.230055Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2303.16317","last_updated":"2023-10-13T22:28:39Z","snapshot_observed_at":"2026-07-06T15:09:17.982917Z","submitted_at":"2023-03-28T21:27:36Z","title":"Operator learning with PCA-Net: upper and lower complexity bounds","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.16317","snapshot_observed_at":"2026-08-02T12:05:40.376215Z","title":"Operator learning with PCA-Net: upper and lower complexity bounds, October 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.08956","last_updated":"2026-07-27T01:57:24Z","snapshot_observed_at":"2026-08-03T21:37:59.460585Z","submitted_at":"2026-06-08T02:58:15Z","title":"From inverse problems to neural operators: prediction, mechanism, and generalization of data-driven models","version":3},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-02T12:05:40.376215Z"},"links":{"cited_paper":"/paper/2303.16317","citing_paper":"/paper/2606.08956"},"observation_digest":"sha256:2019905dde30a391b44b1720d70b45ae65bff784a6cd6cd2f6c806740f7b3fd3","observation_id":"ebafb86f-d617-41ef-8eb0-bf7b8808d2b4","resolution":{"observed_at":"2026-08-02T12:05:40.376215Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2303.16317/citation-record","integrity":"/paper/2303.16317/integrity","json":"/paper/2303.16317/citation-record.json","paper":"/paper/2303.16317"},"outbound":[],"paper":{"arxiv_id":"2303.16317","last_updated":"2023-10-13T22:28:39Z","latest_version":5,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T15:09:17.982917Z","submitted_at":"2023-03-28T21:27:36Z","title":"Operator learning with PCA-Net: upper and lower complexity bounds"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2303.16317."}