{"as_of":"2026-08-16T05:26:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:bd5a9a3575676de42a128bddd58046aa1e8064f8588a7d59697382f4c7fa65e8","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":8,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":8,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-15T06:32:42.880941+00:00","state":"measured"},{"denominator":8,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":8,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T23:22:06.134775Z","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-06-30T17:14:57.082537Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1906.05497","last_updated":"2021-01-14T08:08:22Z","snapshot_observed_at":"2026-08-14T16:16:22.565147Z","submitted_at":"2019-06-13T06:15:15Z","title":"Deep Network Approximation Characterized by Number of Neurons","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1906.05497","snapshot_observed_at":"2026-08-14T15:11:57.579746Z","title":", Yang, H","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"1908.01842","last_updated":"2022-02-22T23:41:01Z","snapshot_observed_at":"2026-08-15T18:35:27.221140Z","submitted_at":"2019-08-05T20:22:29Z","title":"Nonparametric Regression on Low-Dimensional Manifolds using Deep ReLU Networks : Function Approximation and Statistical Recovery","version":5},"reference_index":64,"source":"arxiv_source","source_observed_at":"2026-08-14T15:11:57.579746Z"},"links":{"cited_paper":"/paper/1906.05497","citing_paper":"/paper/1908.01842"},"observation_digest":"sha256:8fd6840881421b1db81783ab195f5be0aed1321abbf5569066733e6b49b7613f","observation_id":"fadc2d8e-24e3-4bdb-b6ed-b2fd5a0803b8","resolution":{"observed_at":"2026-08-14T15:11:57.579746Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1906.05497","last_updated":"2021-01-14T08:08:22Z","snapshot_observed_at":"2026-08-14T16:16:22.565147Z","submitted_at":"2019-06-13T06:15:15Z","title":"Deep Network Approximation Characterized by Number of Neurons","version":5},"cited_work":{"arxiv_id":"1906.05497","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1906.05497","snapshot_observed_at":"2026-06-30T17:14:57.082537Z","title":"Deep network approximation characterized by number of neurons","venue":null,"work_id":"1f4cbfe4-847f-4431-95fd-aa75226dd3f6","year":1906},"citing_paper":{"arxiv_id":"2503.02129","last_updated":"2026-04-08T09:14:02Z","snapshot_observed_at":"2026-08-02T17:02:46.297669Z","submitted_at":"2025-03-03T23:34:12Z","title":"Path Regularization: A Near-Complete and Optimal Nonasymptotic Generalization Theory for Multilayer Neural Networks and Double Descent Phenomenon","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-23T01:03:39.897679Z"},"links":{"cited_paper":"/paper/1906.05497","citing_paper":"/paper/2503.02129"},"observation_digest":"sha256:9d08a80dab900488fc683fc3e90f1d9983bab0ef4355c4f1dc0e04fea39ebe6c","observation_id":"2982187a-b80e-41de-91fa-c7dd37743f3a","resolution":{"observed_at":"2026-05-23T01:05:16.080558Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1906.05497","last_updated":"2021-01-14T08:08:22Z","snapshot_observed_at":"2026-08-14T16:16:22.565147Z","submitted_at":"2019-06-13T06:15:15Z","title":"Deep Network Approximation Characterized by Number of Neurons","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1906.05497","snapshot_observed_at":"2026-08-15T23:22:06.134775Z","title":"Deep network approximation charac- terized by number of neurons","venue":null,"work_id":null,"year":1906},"citing_paper":{"arxiv_id":"2505.04992","last_updated":"2025-05-08T06:55:22Z","snapshot_observed_at":"2026-08-15T23:13:51.674619Z","submitted_at":"2025-05-08T06:55:22Z","title":"Boosting Statistic Learning with Synthetic Data from Pretrained Large Models","version":1},"reference_index":145,"source":"pdf_text","source_observed_at":"2026-08-15T23:22:06.134775Z"},"links":{"cited_paper":"/paper/1906.05497","citing_paper":"/paper/2505.04992"},"observation_digest":"sha256:39fca2227841bcc0aa8b1a9a3a044bb63b803a900da1c54376f8f62ed736e505","observation_id":"2b828041-c78a-4ada-9437-f12dda0dff64","resolution":{"observed_at":"2026-08-15T23:22:06.134775Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1906.05497","last_updated":"2021-01-14T08:08:22Z","snapshot_observed_at":"2026-08-14T16:16:22.565147Z","submitted_at":"2019-06-13T06:15:15Z","title":"Deep Network Approximation Characterized by Number of Neurons","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1906.05497","snapshot_observed_at":"2026-08-15T16:40:43.265938Z","title":"Deep network approximation characterized by number of neurons","venue":null,"work_id":null,"year":1906},"citing_paper":{"arxiv_id":"2509.02735","last_updated":"2025-09-02T18:30:39Z","snapshot_observed_at":"2026-08-15T18:35:28.103550Z","submitted_at":"2025-09-02T18:30:39Z","title":"Calibration Prediction Interval for Non-parametric Regression and Neural Networks","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-15T16:40:43.265938Z"},"links":{"cited_paper":"/paper/1906.05497","citing_paper":"/paper/2509.02735"},"observation_digest":"sha256:98d7c8630329b09e50d88183845cae1e01089cfe77046b8a011e829a202d7e94","observation_id":"2b1a639c-2ed2-4535-abcc-92faa2d45545","resolution":{"observed_at":"2026-08-15T16:40:43.265938Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1906.05497","last_updated":"2021-01-14T08:08:22Z","snapshot_observed_at":"2026-08-14T16:16:22.565147Z","submitted_at":"2019-06-13T06:15:15Z","title":"Deep Network Approximation Characterized by Number of Neurons","version":5},"cited_work":{"arxiv_id":"1906.05497","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1906.05497","snapshot_observed_at":"2026-06-30T17:14:57.082537Z","title":"Deep network approximation characterized by number of neurons","venue":null,"work_id":"1f4cbfe4-847f-4431-95fd-aa75226dd3f6","year":1906},"citing_paper":{"arxiv_id":"2605.22557","last_updated":"2026-05-26T09:40:19Z","snapshot_observed_at":"2026-08-15T07:26:21.420875Z","submitted_at":"2026-05-21T14:39:43Z","title":"Neural Flow Operators can Approximate any Operator: Abstract Frameworks and Universal Approximations","version":1},"reference_index":166,"source":"arxiv_source","source_observed_at":"2026-05-22T07:28:49.152516Z"},"links":{"cited_paper":"/paper/1906.05497","citing_paper":"/paper/2605.22557"},"observation_digest":"sha256:baa9102dd2705a719e2950703c91a925b2067b55d59f28c2ee5773e1f35d1a15","observation_id":"6072599a-a113-47ed-bb51-55d30d4c498a","resolution":{"observed_at":"2026-05-22T07:31:13.972364Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1906.05497","last_updated":"2021-01-14T08:08:22Z","snapshot_observed_at":"2026-08-14T16:16:22.565147Z","submitted_at":"2019-06-13T06:15:15Z","title":"Deep Network Approximation Characterized by Number of Neurons","version":5},"cited_work":{"arxiv_id":"1906.05497","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1906.05497","snapshot_observed_at":"2026-06-30T17:14:57.082537Z","title":"Deep network approximation characterized by number of neurons","venue":null,"work_id":"1f4cbfe4-847f-4431-95fd-aa75226dd3f6","year":1906},"citing_paper":{"arxiv_id":"2605.22557","last_updated":"2026-05-26T09:40:19Z","snapshot_observed_at":"2026-08-15T07:26:21.420875Z","submitted_at":"2026-05-21T14:39:43Z","title":"Neural Flow Operators can Approximate any Operator: Abstract Frameworks and Universal Approximations","version":2},"reference_index":70,"source":"arxiv_source","source_observed_at":"2026-06-30T17:08:54.066574Z"},"links":{"cited_paper":"/paper/1906.05497","citing_paper":"/paper/2605.22557"},"observation_digest":"sha256:026fbd0e88d62c8414d9dce83ecaff136ef0b40e0b56f5e7bc1a589806f36721","observation_id":"a9424a94-b615-4e59-8d1a-79de0b13d58c","resolution":{"observed_at":"2026-06-30T17:14:57.084144Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1906.05497","last_updated":"2021-01-14T08:08:22Z","snapshot_observed_at":"2026-08-14T16:16:22.565147Z","submitted_at":"2019-06-13T06:15:15Z","title":"Deep Network Approximation Characterized by Number of Neurons","version":5},"cited_work":{"arxiv_id":"1906.05497","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1906.05497","snapshot_observed_at":"2026-06-30T17:14:57.082537Z","title":"Deep network approximation characterized by number of neurons","venue":null,"work_id":"1f4cbfe4-847f-4431-95fd-aa75226dd3f6","year":1906},"citing_paper":{"arxiv_id":"2605.25608","last_updated":"2026-05-25T09:02:13Z","snapshot_observed_at":"2026-08-06T13:35:50.904852Z","submitted_at":"2026-05-25T09:02:13Z","title":"Learning Sparse Compositional Functions with Norm-Constrained Neural Networks","version":1},"reference_index":72,"source":"pdf_text","source_observed_at":"2026-06-29T20:33:03.854188Z"},"links":{"cited_paper":"/paper/1906.05497","citing_paper":"/paper/2605.25608"},"observation_digest":"sha256:d20ba17dc2b97fcb1e2f508e0bf293dd873b0f692f1fc3135354e76d6eda0c5e","observation_id":"f7ac491d-49e6-4d00-a3f6-72d7b53d291c","resolution":{"observed_at":"2026-06-29T20:33:58.299170Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1906.05497","last_updated":"2021-01-14T08:08:22Z","snapshot_observed_at":"2026-08-14T16:16:22.565147Z","submitted_at":"2019-06-13T06:15:15Z","title":"Deep Network Approximation Characterized by Number of Neurons","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1906.05497","snapshot_observed_at":"2026-08-15T15:14:01.521184Z","title":null,"venue":null,"work_id":null,"year":1906},"citing_paper":{"arxiv_id":"2608.01357","last_updated":"2026-08-02T16:20:19Z","snapshot_observed_at":"2026-08-15T15:05:17.565046Z","submitted_at":"2026-08-02T16:20:19Z","title":"Do Neural Networks Really Beat the Curse of Dimensionality? A Bit-Complexity View","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-15T15:14:01.521184Z"},"links":{"cited_paper":"/paper/1906.05497","citing_paper":"/paper/2608.01357"},"observation_digest":"sha256:fed177a4b9d00b2a4b1ca23036bb62ecbec07c27165a9c0cf553d3aa82ffb1c5","observation_id":"c40e4fe8-6a1e-403d-8588-1f29fecff3c7","resolution":{"observed_at":"2026-08-15T15:14:01.521184Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1906.05497/citation-record","integrity":"/paper/1906.05497/integrity","json":"/paper/1906.05497/citation-record.json","paper":"/paper/1906.05497"},"outbound":[],"paper":{"arxiv_id":"1906.05497","last_updated":"2021-01-14T08:08:22Z","latest_version":5,"primary_category":"math.NA","snapshot_observed_at":"2026-08-14T16:16:22.565147Z","submitted_at":"2019-06-13T06:15:15Z","title":"Deep Network Approximation Characterized by Number of Neurons"},"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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 8 inbound Pith citation observations for arXiv:1906.05497."}