{"as_of":"2026-08-09T20:22:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:2a45d06aa217184ed7267c3f08e5154d1e7d3a5361f3dc75e8d83bda271eac73","coverage":[{"denominator":17,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":17,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T20:41:55.794436Z","state":"measured"},{"denominator":17,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":17,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2507.03031/citation-record","integrity":"/paper/2507.03031/integrity","json":"/paper/2507.03031/citation-record.json","paper":"/paper/2507.03031"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"1412.6572","last_updated":"2015-03-20T20:19:16Z","snapshot_observed_at":"2026-07-06T04:04:16.777653Z","submitted_at":"2014-12-20T01:17:12Z","title":"Explaining and Harnessing Adversarial Examples","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1412.6572","snapshot_observed_at":"2026-08-06T20:41:54.199354Z","title":"Explaining and harnessing adver- sarial examples","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2507.03031","last_updated":"2025-07-03T01:05:24Z","snapshot_observed_at":"2026-08-09T04:21:06.565470Z","submitted_at":"2025-07-03T01:05:24Z","title":"On the Mathematical Impossibility of Safe Universal Approximators","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-06T20:41:54.199354Z"},"links":{"cited_paper":"/paper/1412.6572","citing_paper":"/paper/2507.03031"},"observation_digest":"sha256:ef5f8f88ff64ed57b1b9965dec6dbf43b6dfb1e671582db1546ba8c37b4d22dd","observation_id":"25ef7974-9a0f-476c-b91b-eaa4dc8435f0","resolution":{"observed_at":"2026-08-06T20:41:54.199354Z","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-06T20:41:58.251145Z","title":"Multilayer feedforward networks are universal approximators","venue":null,"work_id":"9d1cc977-e60f-4bc0-be52-55f4e43a061b","year":1989},"citing_paper":{"arxiv_id":"2507.03031","last_updated":"2025-07-03T01:05:24Z","snapshot_observed_at":"2026-08-09T04:21:06.565470Z","submitted_at":"2025-07-03T01:05:24Z","title":"On the Mathematical Impossibility of Safe Universal Approximators","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-06T20:41:54.345211Z"},"links":{"citing_paper":"/paper/2507.03031"},"observation_digest":"sha256:31835c17e5b20fe8976d8bafff2f5b41ab1c24e24062d043a09d661b1c77cab4","observation_id":"8b6fcaf1-eb8d-416b-95ea-59207a9ad078","resolution":{"observed_at":"2026-08-06T20:41:58.295823Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T20:41:58.002140Z","title":"Universal statistics of fisher information in deep neural networks: Mean field approach","venue":null,"work_id":"a424e8ce-47ee-4381-bdd0-84d23b27c44e","year":2019},"citing_paper":{"arxiv_id":"2507.03031","last_updated":"2025-07-03T01:05:24Z","snapshot_observed_at":"2026-08-09T04:21:06.565470Z","submitted_at":"2025-07-03T01:05:24Z","title":"On the Mathematical Impossibility of Safe Universal Approximators","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-06T20:41:54.408203Z"},"links":{"citing_paper":"/paper/2507.03031"},"observation_digest":"sha256:2eb2642d69d216ad71be1c4bd8e4e0cc7511ff1a5ef4834d9d2e963a46496d34","observation_id":"5c480be6-d116-4e01-a70e-852e96ba3dd4","resolution":{"observed_at":"2026-08-06T20:41:58.132222Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T20:41:57.804811Z","title":"Catastrophic forgetting in continual graph learning","venue":null,"work_id":"b1b19bd3-13dc-4500-a7ff-6b8ac205425a","year":2020},"citing_paper":{"arxiv_id":"2507.03031","last_updated":"2025-07-03T01:05:24Z","snapshot_observed_at":"2026-08-09T04:21:06.565470Z","submitted_at":"2025-07-03T01:05:24Z","title":"On the Mathematical Impossibility of Safe Universal Approximators","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-06T20:41:54.498677Z"},"links":{"citing_paper":"/paper/2507.03031"},"observation_digest":"sha256:7bb75a2b96155c337b566e9d7e19f8ca7b4cc1f4627df485a7265c4d8991ad23","observation_id":"0fab4f09-0c15-4e4b-892b-586f3a9bba19","resolution":{"observed_at":"2026-08-06T20:41:57.903201Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T20:41:57.567459Z","title":"Stability of c ∞ mappings, ii","venue":null,"work_id":"ebe1443e-da71-40af-89ea-80fb92eeb789","year":1969},"citing_paper":{"arxiv_id":"2507.03031","last_updated":"2025-07-03T01:05:24Z","snapshot_observed_at":"2026-08-09T04:21:06.565470Z","submitted_at":"2025-07-03T01:05:24Z","title":"On the Mathematical Impossibility of Safe Universal Approximators","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-06T20:41:54.586480Z"},"links":{"citing_paper":"/paper/2507.03031"},"observation_digest":"sha256:8559496db4aa0ef8ed132504807f8daf4643034e261327b6bcda632a6234c9f2","observation_id":"48bf4ec6-b7d0-459f-9b44-6a12b540c63d","resolution":{"observed_at":"2026-08-06T20:41:57.710878Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.01255","last_updated":"2024-06-03T12:11:34Z","snapshot_observed_at":"2026-08-09T08:21:47.381730Z","submitted_at":"2024-06-03T12:11:34Z","title":"On the Nonlinearity of Layer Normalization","version":1},"cited_work":{"arxiv_id":"2406.01255","doi":null,"metadata_source":"pith","pith_arxiv_id":"2406.01255","snapshot_observed_at":"2026-08-06T20:41:56.623897Z","title":"On the Nonlinearity of Layer Normalization","venue":"cs.LG","work_id":"fa3bdf27-112a-4fb8-bb04-1b5b9c9dc8d7","year":2024},"citing_paper":{"arxiv_id":"2507.03031","last_updated":"2025-07-03T01:05:24Z","snapshot_observed_at":"2026-08-09T04:21:06.565470Z","submitted_at":"2025-07-03T01:05:24Z","title":"On the Mathematical Impossibility of Safe Universal Approximators","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-06T20:41:54.923934Z"},"links":{"cited_paper":"/paper/2406.01255","citing_paper":"/paper/2507.03031"},"observation_digest":"sha256:2c22dd88b1140df14aeab98b1be5e5e7ef57c679a214067b1cd3ea570c7062af","observation_id":"b091529b-f704-4867-a2c0-bd5953d300c4","resolution":{"observed_at":"2026-08-06T20:41:56.698573Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T20:41:57.332635Z","title":"Graph neural networks exponentially lose expressive power for node classification","venue":null,"work_id":"186c10db-955b-45c4-ae7e-23aa085c7fff","year":2020},"citing_paper":{"arxiv_id":"2507.03031","last_updated":"2025-07-03T01:05:24Z","snapshot_observed_at":"2026-08-09T04:21:06.565470Z","submitted_at":"2025-07-03T01:05:24Z","title":"On the Mathematical Impossibility of Safe Universal Approximators","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-06T20:41:54.993741Z"},"links":{"citing_paper":"/paper/2507.03031"},"observation_digest":"sha256:badc34b1534d80df1659cd8b8af11ae68d43e53cd56fbf97ca3bf39909528cb3","observation_id":"5d92649f-ba75-4c80-aabf-33819e83cd30","resolution":{"observed_at":"2026-08-06T20:41:57.428383Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T20:41:57.044969Z","title":"Classes of recursively enumerable sets and their decision problems","venue":null,"work_id":"1763c417-7336-40d6-9870-dfa12d914c6d","year":1953},"citing_paper":{"arxiv_id":"2507.03031","last_updated":"2025-07-03T01:05:24Z","snapshot_observed_at":"2026-08-09T04:21:06.565470Z","submitted_at":"2025-07-03T01:05:24Z","title":"On the Mathematical Impossibility of Safe Universal Approximators","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T20:41:55.080644Z"},"links":{"citing_paper":"/paper/2507.03031"},"observation_digest":"sha256:7d07b61833d4f0ea745685d1f25b55965985e5af6e06f729a70b00f158a05b39","observation_id":"d17fc486-dda0-49dd-acb5-3bfba89e1e2e","resolution":{"observed_at":"2026-08-06T20:41:57.181817Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1804.08042","last_updated":"2018-04-21T23:27:24Z","snapshot_observed_at":"2026-07-06T06:34:41.441373Z","submitted_at":"2018-04-21T23:27:24Z","title":"Bridgeout: stochastic bridge regularization for deep neural networks","version":1},"cited_work":{"arxiv_id":"1804.08042","doi":null,"metadata_source":"pith","pith_arxiv_id":"1804.08042","snapshot_observed_at":"2026-08-06T20:41:56.444552Z","title":"Bridgeout: stochastic bridge regularization for deep neural networks","venue":"cs.NE","work_id":"8a28fb4a-6b64-4a61-858c-9de99431a4a6","year":2018},"citing_paper":{"arxiv_id":"2507.03031","last_updated":"2025-07-03T01:05:24Z","snapshot_observed_at":"2026-08-09T04:21:06.565470Z","submitted_at":"2025-07-03T01:05:24Z","title":"On the Mathematical Impossibility of Safe Universal Approximators","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-06T20:41:55.199747Z"},"links":{"cited_paper":"/paper/1804.08042","citing_paper":"/paper/2507.03031"},"observation_digest":"sha256:cdc1b0975a9d8d9e7b1fcc47c8df31b7d27d037cbfd8b9e9757a5c7524d2f459","observation_id":"8c4c67a7-aa15-4fef-a381-9a0916f24efb","resolution":{"observed_at":"2026-08-06T20:41:56.506714Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s10994-022-06192-x","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T20:41:55.911484Z","title":"Stabilize deep resnet with a sharp scaling factor τ","venue":null,"work_id":"718fd16b-1219-4cf2-aa2d-02852051b06e","year":2022},"citing_paper":{"arxiv_id":"2507.03031","last_updated":"2025-07-03T01:05:24Z","snapshot_observed_at":"2026-08-09T04:21:06.565470Z","submitted_at":"2025-07-03T01:05:24Z","title":"On the Mathematical Impossibility of Safe Universal Approximators","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-06T20:41:55.283043Z"},"links":{"citing_paper":"/paper/2507.03031"},"observation_digest":"sha256:9faa7fd3f703251243a38ce1539223c36dc767c8bea2d7cb7ddaf400ed4e3025","observation_id":"f7469bc5-cdd0-4071-a657-e369be604cd3","resolution":{"observed_at":"2026-08-06T20:41:55.987157Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2302.12444","last_updated":"2023-08-14T05:22:10Z","snapshot_observed_at":"2026-07-06T14:55:19.727805Z","submitted_at":"2023-02-24T04:10:54Z","title":"On the Training Instability of Shuffling SGD with Batch Normalization","version":3},"cited_work":{"arxiv_id":"2302.12444","doi":null,"metadata_source":"pith","pith_arxiv_id":"2302.12444","snapshot_observed_at":"2026-08-06T20:41:56.278941Z","title":"On the Training Instability of Shuffling SGD with Batch Normalization","venue":"cs.LG","work_id":"0e522692-ee04-42de-9b6a-5fb111556c2d","year":2023},"citing_paper":{"arxiv_id":"2507.03031","last_updated":"2025-07-03T01:05:24Z","snapshot_observed_at":"2026-08-09T04:21:06.565470Z","submitted_at":"2025-07-03T01:05:24Z","title":"On the Mathematical Impossibility of Safe Universal Approximators","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-06T20:41:55.361675Z"},"links":{"cited_paper":"/paper/2302.12444","citing_paper":"/paper/2507.03031"},"observation_digest":"sha256:d817f4a810f09b1e82fafc8e40be8ad4d097e8b1176c8de2e057da668da9068c","observation_id":"f329d0f7-1584-4276-ae40-0689fc99ebd5","resolution":{"observed_at":"2026-08-06T20:41:56.363546Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T20:41:56.798708Z","title":"On the equivalence between graph isomorphism testing and func- tion approximation with gnns","venue":null,"work_id":"3bd7a771-8d30-4c4d-9e7d-02290ad1253e","year":2019},"citing_paper":{"arxiv_id":"2507.03031","last_updated":"2025-07-03T01:05:24Z","snapshot_observed_at":"2026-08-09T04:21:06.565470Z","submitted_at":"2025-07-03T01:05:24Z","title":"On the Mathematical Impossibility of Safe Universal Approximators","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-06T20:41:55.460675Z"},"links":{"citing_paper":"/paper/2507.03031"},"observation_digest":"sha256:8f7ab2fd205da94e19c1a5a0470b9b2f9a90a3a96640ae2e8af705493c2b896f","observation_id":"e70b190b-5144-418e-a4ee-1a99270d50f4","resolution":{"observed_at":"2026-08-06T20:41:56.902642Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1912.10077","last_updated":"2020-02-25T03:12:57Z","snapshot_observed_at":"2026-07-06T08:46:09.705605Z","submitted_at":"2019-12-20T19:49:32Z","title":"Are Transformers universal approximators of sequence-to-sequence functions?","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1912.10077","snapshot_observed_at":"2026-08-06T20:41:55.587713Z","title":"Are transformers universal approximators of sequence-to-sequence functions? In Inter- national Conference on Learning Representations (ICLR), 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2507.03031","last_updated":"2025-07-03T01:05:24Z","snapshot_observed_at":"2026-08-09T04:21:06.565470Z","submitted_at":"2025-07-03T01:05:24Z","title":"On the Mathematical Impossibility of Safe Universal Approximators","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-06T20:41:55.587713Z"},"links":{"cited_paper":"/paper/1912.10077","citing_paper":"/paper/2507.03031"},"observation_digest":"sha256:3a8f0e57816d1acc43b04d568161777d3599cf35b475346c8e488f70e9e26fb6","observation_id":"36941140-0c54-4d2b-a716-20ac10fdcd4c","resolution":{"observed_at":"2026-08-06T20:41:55.587713Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2303.06296","last_updated":"2023-07-25T17:42:37Z","snapshot_observed_at":"2026-08-09T04:20:17.255137Z","submitted_at":"2023-03-11T03:30:47Z","title":"Stabilizing Transformer Training by Preventing Attention Entropy Collapse","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.06296","snapshot_observed_at":"2026-08-06T20:41:55.705061Z","title":"Stabilizing transformer training by preventing attention entropy collapse","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.03031","last_updated":"2025-07-03T01:05:24Z","snapshot_observed_at":"2026-08-09T04:21:06.565470Z","submitted_at":"2025-07-03T01:05:24Z","title":"On the Mathematical Impossibility of Safe Universal Approximators","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-06T20:41:55.705061Z"},"links":{"cited_paper":"/paper/2303.06296","citing_paper":"/paper/2507.03031"},"observation_digest":"sha256:6f700045c8c4863b6b57defcb97c4f265206e3e22638375e6564b2f25494938a","observation_id":"baa9a4d6-6462-48ae-86d5-143f7089f0ff","resolution":{"observed_at":"2026-08-06T20:41:55.705061Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2111.01022","last_updated":"2022-05-21T15:56:12Z","snapshot_observed_at":"2026-07-06T12:04:13.318841Z","submitted_at":"2021-11-01T15:26:19Z","title":"Dropout in Training Neural Networks: Flatness of Solution and Noise Structure","version":2},"cited_work":{"arxiv_id":"2111.01022","doi":null,"metadata_source":"pith","pith_arxiv_id":"2111.01022","snapshot_observed_at":"2026-08-06T20:41:56.088349Z","title":"Dropout in Training Neural Networks: Flatness of Solution and Noise Structure","venue":"cs.LG","work_id":"9b873ccb-5a58-4fbc-9155-64481dd0bc6e","year":2021},"citing_paper":{"arxiv_id":"2507.03031","last_updated":"2025-07-03T01:05:24Z","snapshot_observed_at":"2026-08-09T04:21:06.565470Z","submitted_at":"2025-07-03T01:05:24Z","title":"On the Mathematical Impossibility of Safe Universal Approximators","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-06T20:41:55.794436Z"},"links":{"cited_paper":"/paper/2111.01022","citing_paper":"/paper/2507.03031"},"observation_digest":"sha256:b3f29e1cba4f119daabaaadcc55e7ff3d3f5a4bc0bb24cb5b8cdc795adfb0f16","observation_id":"9e7155f2-7a28-4183-8cd5-813ff7b2c950","resolution":{"observed_at":"2026-08-06T20:41:56.185626Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2306.12929","last_updated":"2023-11-09T14:05:51Z","snapshot_observed_at":"2026-07-06T15:45:35.947502Z","submitted_at":"2023-06-22T14:39:04Z","title":"Quantizable Transformers: Removing Outliers by Helping Attention Heads Do Nothing","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.12929","snapshot_observed_at":"2026-08-06T20:41:54.104960Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.03031","last_updated":"2025-07-03T01:05:24Z","snapshot_observed_at":"2026-08-09T04:21:06.565470Z","submitted_at":"2025-07-03T01:05:24Z","title":"On the Mathematical Impossibility of Safe Universal Approximators","version":1},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-06T20:41:54.104960Z"},"links":{"cited_paper":"/paper/2306.12929","citing_paper":"/paper/2507.03031"},"observation_digest":"sha256:ac28a1dda281baf22c5d155fbc6150749b326448bc7400a0740b9c55ca75198d","observation_id":"97d43d9b-5efc-445c-b887-8668c52fb786","resolution":{"observed_at":"2026-08-06T20:41:54.104960Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.19399","last_updated":"2025-01-31T18:55:35Z","snapshot_observed_at":"2026-08-09T20:12:28.056249Z","submitted_at":"2025-01-31T18:55:35Z","title":"Scalable-Softmax Is Superior for Attention","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.19399","snapshot_observed_at":"2026-08-06T20:41:54.830690Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.03031","last_updated":"2025-07-03T01:05:24Z","snapshot_observed_at":"2026-08-09T04:21:06.565470Z","submitted_at":"2025-07-03T01:05:24Z","title":"On the Mathematical Impossibility of Safe Universal Approximators","version":1},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-06T20:41:54.830690Z"},"links":{"cited_paper":"/paper/2501.19399","citing_paper":"/paper/2507.03031"},"observation_digest":"sha256:73978a82506e57487a7efd0e4ff95a0a15fa4effe989c16a9369dbdde52a7134","observation_id":"6280ffc3-a12f-40fe-9030-78aab512c9ec","resolution":{"observed_at":"2026-08-06T20:41:54.830690Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2507.03031","last_updated":"2025-07-03T01:05:24Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-09T04:21:06.565470Z","submitted_at":"2025-07-03T01:05:24Z","title":"On the Mathematical Impossibility of Safe Universal Approximators"},"reference_resolution":{"displayed":17,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":5,"verified_exact":5,"verified_fuzzy":7},"total_outbound_references":17},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 17 of 17 outbound references and 0 inbound Pith citation observations for arXiv:2507.03031."}