{"as_of":"2026-08-16T20:31:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:54150d1087ddac7e88be26c911f4380e0298b3885a39b5fd464a3847c8649356","coverage":[{"denominator":83,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":83,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T15:14:01.621776Z","state":"measured"},{"denominator":83,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":83,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+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/2608.01357/citation-record","integrity":"/paper/2608.01357/integrity","json":"/paper/2608.01357/citation-record.json","paper":"/paper/2608.01357"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T15:14:01.327022Z","title":"Abramowitz and I","venue":null,"work_id":null,"year":1964},"citing_paper":{"arxiv_id":"2608.01357","last_updated":"2026-08-02T16:20:19Z","snapshot_observed_at":"2026-08-16T08:43:07.541073Z","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":1,"source":"pdf_text","source_observed_at":"2026-08-15T15:14:01.327022Z"},"links":{"citing_paper":"/paper/2608.01357"},"observation_digest":"sha256:9dd0c00b7033607ff81745cfe1fef128640cb94fbda1ae7730cfc20357f09a2a","observation_id":"49f2c36c-921d-4302-863f-764703f74f2b","resolution":{"observed_at":"2026-08-15T15:14:01.327022Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T15:14:01.331877Z","title":"Arcang´ eli, M","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2608.01357","last_updated":"2026-08-02T16:20:19Z","snapshot_observed_at":"2026-08-16T08:43:07.541073Z","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":2,"source":"pdf_text","source_observed_at":"2026-08-15T15:14:01.331877Z"},"links":{"citing_paper":"/paper/2608.01357"},"observation_digest":"sha256:4afffe628d393d7d69006b983ac4fc2ad1a96e870d05c745df6cc8fd5bf26d2f","observation_id":"fb493bb1-99fa-4634-ae96-c539f15f56cd","resolution":{"observed_at":"2026-08-15T15:14:01.331877Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T15:14:01.335344Z","title":null,"venue":null,"work_id":null,"year":1958},"citing_paper":{"arxiv_id":"2608.01357","last_updated":"2026-08-02T16:20:19Z","snapshot_observed_at":"2026-08-16T08:43:07.541073Z","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":3,"source":"pdf_text","source_observed_at":"2026-08-15T15:14:01.335344Z"},"links":{"citing_paper":"/paper/2608.01357"},"observation_digest":"sha256:44bf98a5a6dd7de6baf39ba6dc776ad15d18c661a179b5c59e812cd56a0496c8","observation_id":"dc80e775-9edb-482f-837a-07f2aaedb4de","resolution":{"observed_at":"2026-08-15T15:14:01.335344Z","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-15T15:14:02.597319Z","title":null,"venue":null,"work_id":"305d3557-a19d-425d-9024-33eb69eba1e2","year":1991},"citing_paper":{"arxiv_id":"2608.01357","last_updated":"2026-08-02T16:20:19Z","snapshot_observed_at":"2026-08-16T08:43:07.541073Z","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":4,"source":"pdf_text","source_observed_at":"2026-08-15T15:14:01.338934Z"},"links":{"citing_paper":"/paper/2608.01357"},"observation_digest":"sha256:514ab75b6ea544564380b9c13cbdbbc37a499c11a955778cd4cf9db9e2952d2e","observation_id":"eb612364-5c56-4cd6-b7af-a30efbe646ad","resolution":{"observed_at":"2026-08-15T15:14:02.600939Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T15:14:02.587654Z","title":null,"venue":null,"work_id":"b470172c-085a-4262-86ed-d67cb5b9499f","year":2008},"citing_paper":{"arxiv_id":"2608.01357","last_updated":"2026-08-02T16:20:19Z","snapshot_observed_at":"2026-08-16T08:43:07.541073Z","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":5,"source":"pdf_text","source_observed_at":"2026-08-15T15:14:01.342578Z"},"links":{"citing_paper":"/paper/2608.01357"},"observation_digest":"sha256:c2c933f1c91dc25d45b1892b94de72a29063d9a25b8fc16116074250b750470b","observation_id":"432e34ec-3e82-42f5-aa55-808ceb826411","resolution":{"observed_at":"2026-08-15T15:14:02.591124Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T15:14:02.575982Z","title":null,"venue":null,"work_id":"4ec2f18d-1f11-4a0a-a86f-493f8cf97c3e","year":1998},"citing_paper":{"arxiv_id":"2608.01357","last_updated":"2026-08-02T16:20:19Z","snapshot_observed_at":"2026-08-16T08:43:07.541073Z","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":6,"source":"pdf_text","source_observed_at":"2026-08-15T15:14:01.346051Z"},"links":{"citing_paper":"/paper/2608.01357"},"observation_digest":"sha256:bd81f6a5fb11ea18c676e04f2c71867b7406bdef9933f4c9894dd49e065a8587","observation_id":"b304a560-0541-49d1-9630-05cbce741c06","resolution":{"observed_at":"2026-08-15T15:14:02.580409Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T15:14:02.564113Z","title":null,"venue":null,"work_id":"a86e0e3e-037c-4b69-baa1-38a7a4083cf4","year":2002},"citing_paper":{"arxiv_id":"2608.01357","last_updated":"2026-08-02T16:20:19Z","snapshot_observed_at":"2026-08-16T08:43:07.541073Z","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":7,"source":"pdf_text","source_observed_at":"2026-08-15T15:14:01.350181Z"},"links":{"citing_paper":"/paper/2608.01357"},"observation_digest":"sha256:814c21343d45d85bb1cec6331cc20f06a7987956610e2ce5777cf84c5a93fb22","observation_id":"78e63a44-d7ef-4bbb-b760-a2763ff17231","resolution":{"observed_at":"2026-08-15T15:14:02.567753Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T15:14:02.553633Z","title":"Bathe,Finite Element Procedures, Klaus-Jurgen Bathe, 2006","venue":null,"work_id":"2ee7545e-6d42-4b96-bbc7-a71adf89be11","year":2006},"citing_paper":{"arxiv_id":"2608.01357","last_updated":"2026-08-02T16:20:19Z","snapshot_observed_at":"2026-08-16T08:43:07.541073Z","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":8,"source":"pdf_text","source_observed_at":"2026-08-15T15:14:01.353838Z"},"links":{"citing_paper":"/paper/2608.01357"},"observation_digest":"sha256:b031a0625702bf4ac02b60a364fd52f81acbe6ac7ddcddd34fc5951154122407","observation_id":"0f4d581e-588f-4259-9b4b-157d2978c66e","resolution":{"observed_at":"2026-08-15T15:14:02.557389Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T15:14:02.537838Z","title":"Bengio, Learning deep architectures for AI,Foundations and Trends in Machine Learning, 2(1) (2009), 1–127","venue":null,"work_id":"82bd4abb-9390-434f-8202-37f7adcedc3b","year":2009},"citing_paper":{"arxiv_id":"2608.01357","last_updated":"2026-08-02T16:20:19Z","snapshot_observed_at":"2026-08-16T08:43:07.541073Z","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":9,"source":"pdf_text","source_observed_at":"2026-08-15T15:14:01.357953Z"},"links":{"citing_paper":"/paper/2608.01357"},"observation_digest":"sha256:cb34a9bea30c8037e5feafee10a64fec100fa8b00111b67bad17e5f26724ef8b","observation_id":"91bffc4f-8e36-45e4-b17f-0fcf0f823a55","resolution":{"observed_at":"2026-08-15T15:14:02.546214Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T15:14:02.525719Z","title":"Bertoluzza, R","venue":null,"work_id":"147bce34-ebdc-427d-9530-b86fb666cfd5","year":2009},"citing_paper":{"arxiv_id":"2608.01357","last_updated":"2026-08-02T16:20:19Z","snapshot_observed_at":"2026-08-16T08:43:07.541073Z","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":10,"source":"pdf_text","source_observed_at":"2026-08-15T15:14:01.361399Z"},"links":{"citing_paper":"/paper/2608.01357"},"observation_digest":"sha256:77af519a950246ec04dcb308c8b5d83046439155b0c7a2c33a34b76ab93d5a8d","observation_id":"0874f619-755f-4bb2-ab29-7ef1529c27ef","resolution":{"observed_at":"2026-08-15T15:14:02.529703Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T15:14:02.513449Z","title":null,"venue":null,"work_id":"1dcb9559-6755-4c7d-80b2-b6ead12df768","year":2008},"citing_paper":{"arxiv_id":"2608.01357","last_updated":"2026-08-02T16:20:19Z","snapshot_observed_at":"2026-08-16T08:43:07.541073Z","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":11,"source":"pdf_text","source_observed_at":"2026-08-15T15:14:01.365258Z"},"links":{"citing_paper":"/paper/2608.01357"},"observation_digest":"sha256:91a011d048df5c313eab1e662f9f01dbe552120e730e99333c20eb7d12f9ef2f","observation_id":"9eb64b52-bada-473a-a32e-5f3ce5fce74c","resolution":{"observed_at":"2026-08-15T15:14:02.517028Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T15:14:02.503307Z","title":"Bungartz and M","venue":null,"work_id":"ddcc9b84-1ca7-4058-9b07-0cdb5cf6e477","year":2004},"citing_paper":{"arxiv_id":"2608.01357","last_updated":"2026-08-02T16:20:19Z","snapshot_observed_at":"2026-08-16T08:43:07.541073Z","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":12,"source":"pdf_text","source_observed_at":"2026-08-15T15:14:01.368861Z"},"links":{"citing_paper":"/paper/2608.01357"},"observation_digest":"sha256:74625a1d29b913a7215f778f0e2fee66bfc5315d87dab302e7c1f41dc135a265","observation_id":"a3beac65-126c-47e4-8122-7671095365f0","resolution":{"observed_at":"2026-08-15T15:14:02.506858Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T15:14:02.492419Z","title":null,"venue":null,"work_id":"6ec63920-b4f6-4251-842d-c75c263663ef","year":2004},"citing_paper":{"arxiv_id":"2608.01357","last_updated":"2026-08-02T16:20:19Z","snapshot_observed_at":"2026-08-16T08:43:07.541073Z","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":13,"source":"pdf_text","source_observed_at":"2026-08-15T15:14:01.372564Z"},"links":{"citing_paper":"/paper/2608.01357"},"observation_digest":"sha256:f3aa803c9e682229d4bbf22e2021e0006821c5b6f2a34fc25c204d38a6c59d6a","observation_id":"9d992c1b-6f3c-4aba-a953-f2ee9ee09002","resolution":{"observed_at":"2026-08-15T15:14:02.495938Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T15:14:02.481639Z","title":null,"venue":null,"work_id":"8d54a2f0-7c58-4003-b3c2-c96070f2ac67","year":2002},"citing_paper":{"arxiv_id":"2608.01357","last_updated":"2026-08-02T16:20:19Z","snapshot_observed_at":"2026-08-16T08:43:07.541073Z","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":14,"source":"pdf_text","source_observed_at":"2026-08-15T15:14:01.376065Z"},"links":{"citing_paper":"/paper/2608.01357"},"observation_digest":"sha256:cea69294863e8c99456c5f1253689d3577b4d67ddb75467f5a0a0e6dbabd3945","observation_id":"e31af6f5-495d-4250-bae6-cb834578c840","resolution":{"observed_at":"2026-08-15T15:14:02.485238Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T15:14:02.471015Z","title":"Cucker and S","venue":null,"work_id":"b61b5bbf-cd2d-438f-a624-2cb4f4428de3","year":2002},"citing_paper":{"arxiv_id":"2608.01357","last_updated":"2026-08-02T16:20:19Z","snapshot_observed_at":"2026-08-16T08:43:07.541073Z","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":15,"source":"pdf_text","source_observed_at":"2026-08-15T15:14:01.379879Z"},"links":{"citing_paper":"/paper/2608.01357"},"observation_digest":"sha256:af87bb99c40ec76c9f7bb482981b229fca1cad614f5213e379107088d32a4256","observation_id":"3da51618-5032-4bdc-b2ef-f07c6c534667","resolution":{"observed_at":"2026-08-15T15:14:02.474657Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T15:14:02.460174Z","title":"Cucker and D","venue":null,"work_id":"92d0c350-7534-4e18-9089-899d579f50b9","year":2007},"citing_paper":{"arxiv_id":"2608.01357","last_updated":"2026-08-02T16:20:19Z","snapshot_observed_at":"2026-08-16T08:43:07.541073Z","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":16,"source":"pdf_text","source_observed_at":"2026-08-15T15:14:01.382736Z"},"links":{"citing_paper":"/paper/2608.01357"},"observation_digest":"sha256:16e4dea095fcbcb7dafedc3144446854669e1075cbae949ff6ece22bca8f8d43","observation_id":"ce6f78d4-c713-4027-aeaa-af8ab35c5b18","resolution":{"observed_at":"2026-08-15T15:14:02.464170Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T15:14:02.449522Z","title":null,"venue":null,"work_id":"c4d5ef62-61f9-4934-b411-11e8b65d7b9d","year":1975},"citing_paper":{"arxiv_id":"2608.01357","last_updated":"2026-08-02T16:20:19Z","snapshot_observed_at":"2026-08-16T08:43:07.541073Z","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":17,"source":"pdf_text","source_observed_at":"2026-08-15T15:14:01.385868Z"},"links":{"citing_paper":"/paper/2608.01357"},"observation_digest":"sha256:ff2a02da24214dbf38ffa950c91c5c1c649846eef21277bf40746a5c5e865e28","observation_id":"67b7d4be-7d48-494c-82c1-324a9f40834e","resolution":{"observed_at":"2026-08-15T15:14:02.453369Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T15:14:02.437742Z","title":null,"venue":null,"work_id":"95146966-9fed-4d96-8fe3-3ee4be041d8a","year":1989},"citing_paper":{"arxiv_id":"2608.01357","last_updated":"2026-08-02T16:20:19Z","snapshot_observed_at":"2026-08-16T08:43:07.541073Z","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":18,"source":"pdf_text","source_observed_at":"2026-08-15T15:14:01.388786Z"},"links":{"citing_paper":"/paper/2608.01357"},"observation_digest":"sha256:e6ded9b7536a163e76b92e0a1ff37e12284356b93ed07db06a20969563a98f28","observation_id":"65b25045-49e6-4a45-b957-a79666121f1c","resolution":{"observed_at":"2026-08-15T15:14:02.441610Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T15:14:02.424665Z","title":null,"venue":null,"work_id":"62e67144-5500-497f-9a5a-0f99f7f7d9ba","year":1993},"citing_paper":{"arxiv_id":"2608.01357","last_updated":"2026-08-02T16:20:19Z","snapshot_observed_at":"2026-08-16T08:43:07.541073Z","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":19,"source":"pdf_text","source_observed_at":"2026-08-15T15:14:01.391923Z"},"links":{"citing_paper":"/paper/2608.01357"},"observation_digest":"sha256:1633e79a27b2626336ef7210ed7090b8be4eb7ae6f01b20191e0c1291fa7b307","observation_id":"18e50840-26cd-452c-8c31-258a9bb178dd","resolution":{"observed_at":"2026-08-15T15:14:02.429060Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T15:14:02.410402Z","title":null,"venue":null,"work_id":"59886734-0177-4e97-a80e-87bb855d2f30","year":1996},"citing_paper":{"arxiv_id":"2608.01357","last_updated":"2026-08-02T16:20:19Z","snapshot_observed_at":"2026-08-16T08:43:07.541073Z","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":20,"source":"pdf_text","source_observed_at":"2026-08-15T15:14:01.394599Z"},"links":{"citing_paper":"/paper/2608.01357"},"observation_digest":"sha256:8cc74dfc4531f999cdff6b97d0f0a7a32f5c1fd7af97d4dc9ceabe85a33bf17e","observation_id":"234a1ce5-83b2-4fcc-aa50-be09e6108b75","resolution":{"observed_at":"2026-08-15T15:14:02.415434Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T15:14:02.397660Z","title":"Eldan and O","venue":null,"work_id":"e5908f39-166c-4b36-8421-74f7cbffb327","year":2016},"citing_paper":{"arxiv_id":"2608.01357","last_updated":"2026-08-02T16:20:19Z","snapshot_observed_at":"2026-08-16T08:43:07.541073Z","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":21,"source":"pdf_text","source_observed_at":"2026-08-15T15:14:01.397632Z"},"links":{"citing_paper":"/paper/2608.01357"},"observation_digest":"sha256:ca7314a0b7d4251e7f9a6fb0ddb55f1385f90fdd71d732eed9bb4de884c16fb0","observation_id":"35cd0f17-ca8b-455d-a4b7-fbdd807d206e","resolution":{"observed_at":"2026-08-15T15:14:02.401856Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T15:14:02.382519Z","title":null,"venue":null,"work_id":"9d84ef32-859a-4fd6-a77f-843e5cd495f4","year":2021},"citing_paper":{"arxiv_id":"2608.01357","last_updated":"2026-08-02T16:20:19Z","snapshot_observed_at":"2026-08-16T08:43:07.541073Z","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":22,"source":"pdf_text","source_observed_at":"2026-08-15T15:14:01.400364Z"},"links":{"citing_paper":"/paper/2608.01357"},"observation_digest":"sha256:942e6f2cfbc06b5041f8d84319629784a23ad07fea1bc77a0141250f9d5fe32a","observation_id":"e4c352a5-4884-4ea2-99af-e2fb24fce5fa","resolution":{"observed_at":"2026-08-15T15:14:02.386958Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T15:14:02.371006Z","title":"Harvey, C","venue":null,"work_id":"901010da-13ff-40ad-9eec-55e78ae9da7a","year":2017},"citing_paper":{"arxiv_id":"2608.01357","last_updated":"2026-08-02T16:20:19Z","snapshot_observed_at":"2026-08-16T08:43:07.541073Z","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":23,"source":"pdf_text","source_observed_at":"2026-08-15T15:14:01.402919Z"},"links":{"citing_paper":"/paper/2608.01357"},"observation_digest":"sha256:bb0840f2916996b971d9ee6e33512a0647de0e7e16ccd32763a34b920ec9b1b1","observation_id":"921b60e6-fe0b-4edb-a736-8314e805592a","resolution":{"observed_at":"2026-08-15T15:14:02.374772Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2312.16483","last_updated":"2024-01-11T04:48:47Z","snapshot_observed_at":"2026-08-16T14:31:26.027304Z","submitted_at":"2023-12-27T09:11:14Z","title":"Expressivity and Approximation Properties of Deep Neural Networks with ReLU$^k$ Activation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.16483","snapshot_observed_at":"2026-08-15T15:14:01.405600Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2608.01357","last_updated":"2026-08-02T16:20:19Z","snapshot_observed_at":"2026-08-16T08:43:07.541073Z","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":24,"source":"pdf_text","source_observed_at":"2026-08-15T15:14:01.405600Z"},"links":{"cited_paper":"/paper/2312.16483","citing_paper":"/paper/2608.01357"},"observation_digest":"sha256:39df83da5f75b4161b76b3740a7c1e4260651229f95c39487dabdae348c0d613","observation_id":"72503e03-0bc8-4b26-aee1-15273f14d9a6","resolution":{"observed_at":"2026-08-15T15:14:01.405600Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2103.00542","last_updated":"2022-08-13T02:59:18Z","snapshot_observed_at":"2026-08-16T18:42:24.809071Z","submitted_at":"2021-02-28T15:57:42Z","title":"Deep Neural Networks with ReLU-Sine-Exponential Activations Break Curse of Dimensionality in Approximation on H\\\"older Class","version":6},"cited_work":{"arxiv_id":"2103.00542","doi":null,"metadata_source":"pith","pith_arxiv_id":"2103.00542","snapshot_observed_at":"2026-08-15T15:14:01.804121Z","title":"Deep Neural Networks with ReLU-Sine-Exponential Activations Break Curse of Dimensionality in Approximation on H\\\"older Class","venue":"cs.LG","work_id":"659dac10-b556-4eb3-8c6a-8bb36a6bde41","year":2021},"citing_paper":{"arxiv_id":"2608.01357","last_updated":"2026-08-02T16:20:19Z","snapshot_observed_at":"2026-08-16T08:43:07.541073Z","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":25,"source":"pdf_text","source_observed_at":"2026-08-15T15:14:01.410186Z"},"links":{"cited_paper":"/paper/2103.00542","citing_paper":"/paper/2608.01357"},"observation_digest":"sha256:e438223b25a6d4bb01d9f02770aa3dd16ce4d86fff4f388168238931b3d9ce28","observation_id":"7b299876-25f1-4f9a-a880-05546e1fd5f5","resolution":{"observed_at":"2026-08-15T15:14:01.808289Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T15:14:02.359647Z","title":"Jin,The Finite Element Method in Electromagnetics, John Wiley & Sons, 2015","venue":null,"work_id":"bac28b70-8c8e-4d2b-9b84-ca8331671437","year":2015},"citing_paper":{"arxiv_id":"2608.01357","last_updated":"2026-08-02T16:20:19Z","snapshot_observed_at":"2026-08-16T08:43:07.541073Z","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":26,"source":"pdf_text","source_observed_at":"2026-08-15T15:14:01.414352Z"},"links":{"citing_paper":"/paper/2608.01357"},"observation_digest":"sha256:3ac4a554f94858d1c2ac93b8f8690d5e1a9aab29ee0033d48b851d3c84064c23","observation_id":"fdbcd207-6981-46ef-bece-9e25c408f69b","resolution":{"observed_at":"2026-08-15T15:14:02.363995Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T15:14:02.345397Z","title":null,"venue":null,"work_id":"9a1fd9f2-0847-4e31-8c21-ea531cd7e10d","year":1992},"citing_paper":{"arxiv_id":"2608.01357","last_updated":"2026-08-02T16:20:19Z","snapshot_observed_at":"2026-08-16T08:43:07.541073Z","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":27,"source":"pdf_text","source_observed_at":"2026-08-15T15:14:01.418074Z"},"links":{"citing_paper":"/paper/2608.01357"},"observation_digest":"sha256:fda1ee26300c94b5087dbbde3566b166199b7822f7cda7db19f92fcf6dc54568","observation_id":"37f440d2-64b3-4c77-8ec3-092a3058ced3","resolution":{"observed_at":"2026-08-15T15:14:02.350063Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.11435","last_updated":"2025-05-16T16:54:34Z","snapshot_observed_at":"2026-08-15T20:50:47.350013Z","submitted_at":"2025-05-16T16:54:34Z","title":"General superconvergence for kernel-based approximation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.11435","snapshot_observed_at":"2026-08-15T15:14:01.421626Z","title":"Karvonen, G","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.01357","last_updated":"2026-08-02T16:20:19Z","snapshot_observed_at":"2026-08-16T08:43:07.541073Z","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":28,"source":"pdf_text","source_observed_at":"2026-08-15T15:14:01.421626Z"},"links":{"cited_paper":"/paper/2505.11435","citing_paper":"/paper/2608.01357"},"observation_digest":"sha256:6d5d4ab259603c1eaab5c580e38b9089ba6571c8064b490f36dfe7a512fad764","observation_id":"51612a28-29df-44af-bfa8-726b88223c6e","resolution":{"observed_at":"2026-08-15T15:14:01.421626Z","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-15T15:14:02.333867Z","title":null,"venue":null,"work_id":"0a06a9bb-b524-4081-9bfa-8a27e910f16b","year":2018},"citing_paper":{"arxiv_id":"2608.01357","last_updated":"2026-08-02T16:20:19Z","snapshot_observed_at":"2026-08-16T08:43:07.541073Z","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":29,"source":"pdf_text","source_observed_at":"2026-08-15T15:14:01.425543Z"},"links":{"citing_paper":"/paper/2608.01357"},"observation_digest":"sha256:90413d65cc2685c03dadae4765c9aa88407ab974f3273c68d453010e7728f9d4","observation_id":"547dbcdb-8f37-4772-a293-db9dcdb98c1a","resolution":{"observed_at":"2026-08-15T15:14:02.337818Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T15:14:02.323755Z","title":null,"venue":null,"work_id":"f9833bb3-c7b0-422f-931a-8944f6fc500f","year":1956},"citing_paper":{"arxiv_id":"2608.01357","last_updated":"2026-08-02T16:20:19Z","snapshot_observed_at":"2026-08-16T08:43:07.541073Z","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":30,"source":"pdf_text","source_observed_at":"2026-08-15T15:14:01.428828Z"},"links":{"citing_paper":"/paper/2608.01357"},"observation_digest":"sha256:dc54d9cb83338e167d5c06ed3e5b6932f88f6396c15fa9639cb3de89435a5da1","observation_id":"f91daaa0-0efe-4715-87cf-f6309431f1f5","resolution":{"observed_at":"2026-08-15T15:14:02.327705Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T15:14:02.313776Z","title":null,"venue":null,"work_id":"cf6588dd-0953-4e5a-a68f-546a916b4f52","year":1958},"citing_paper":{"arxiv_id":"2608.01357","last_updated":"2026-08-02T16:20:19Z","snapshot_observed_at":"2026-08-16T08:43:07.541073Z","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":31,"source":"pdf_text","source_observed_at":"2026-08-15T15:14:01.432663Z"},"links":{"citing_paper":"/paper/2608.01357"},"observation_digest":"sha256:8568a22d2b49fedc823d9715ec46a84c6f31808db8ded301eca6226e64139fc0","observation_id":"0d1650f8-3bea-41de-92ee-33d426c8c839","resolution":{"observed_at":"2026-08-15T15:14:02.317285Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T15:14:02.303692Z","title":"Koltchinskii, Rademacher penalties and structural risk minimization,IEEE Transactions on Information Theory,47(5) (2001), 1902–1914","venue":null,"work_id":"6f815061-fff1-4756-9383-6358f2446213","year":2001},"citing_paper":{"arxiv_id":"2608.01357","last_updated":"2026-08-02T16:20:19Z","snapshot_observed_at":"2026-08-16T08:43:07.541073Z","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":32,"source":"pdf_text","source_observed_at":"2026-08-15T15:14:01.435965Z"},"links":{"citing_paper":"/paper/2608.01357"},"observation_digest":"sha256:21efc23d6c87f069f3a86a180df56513533513fd683984d568c21b6ed75bf67d","observation_id":"de464df2-eab5-4828-9c53-b2e57da3bee0","resolution":{"observed_at":"2026-08-15T15:14:02.307341Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T15:14:02.293125Z","title":"K˚ urkov´ a and M","venue":null,"work_id":"22600e44-79a5-46e5-a3ed-a496d057f55f","year":2001},"citing_paper":{"arxiv_id":"2608.01357","last_updated":"2026-08-02T16:20:19Z","snapshot_observed_at":"2026-08-16T08:43:07.541073Z","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":33,"source":"pdf_text","source_observed_at":"2026-08-15T15:14:01.439276Z"},"links":{"citing_paper":"/paper/2608.01357"},"observation_digest":"sha256:99232839abf079dff632541979a8fe0fe6547612ac4462beeaf6a47b1ea4cf5d","observation_id":"85e85b82-c6ee-4f9c-960a-b38f408a5f26","resolution":{"observed_at":"2026-08-15T15:14:02.296827Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T15:14:02.281243Z","title":"K˚ urkov´ a and M","venue":null,"work_id":"362155e7-7fdd-459b-bf2f-fa2f77eb96f1","year":2002},"citing_paper":{"arxiv_id":"2608.01357","last_updated":"2026-08-02T16:20:19Z","snapshot_observed_at":"2026-08-16T08:43:07.541073Z","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":34,"source":"pdf_text","source_observed_at":"2026-08-15T15:14:01.442471Z"},"links":{"citing_paper":"/paper/2608.01357"},"observation_digest":"sha256:22a7454da286ebb137ebe9b43b6ffdd4a6f5a8548366869c99838e6bbeb522ad","observation_id":"8581f05a-47a3-4315-9c6c-3b43e1373c38","resolution":{"observed_at":"2026-08-15T15:14:02.285690Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T15:14:02.271268Z","title":null,"venue":null,"work_id":"182814ac-d85e-4e46-b76e-bb222ee0466f","year":1989},"citing_paper":{"arxiv_id":"2608.01357","last_updated":"2026-08-02T16:20:19Z","snapshot_observed_at":"2026-08-16T08:43:07.541073Z","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":35,"source":"pdf_text","source_observed_at":"2026-08-15T15:14:01.446428Z"},"links":{"citing_paper":"/paper/2608.01357"},"observation_digest":"sha256:3825d52471636c35a82e23fba9ebbf8047431594dad0e49ee319a6154420943b","observation_id":"2c9c5dcb-cdd3-4d11-924e-043e9d948451","resolution":{"observed_at":"2026-08-15T15:14:02.274756Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T15:14:02.260462Z","title":"Lewicki and G","venue":null,"work_id":"37ccb8e7-a3ad-474e-928c-32a1bf0941a5","year":2004},"citing_paper":{"arxiv_id":"2608.01357","last_updated":"2026-08-02T16:20:19Z","snapshot_observed_at":"2026-08-16T08:43:07.541073Z","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":36,"source":"pdf_text","source_observed_at":"2026-08-15T15:14:01.449820Z"},"links":{"citing_paper":"/paper/2608.01357"},"observation_digest":"sha256:9233a3c13b1ad485b9d4971249c3dd76b9a495705337d47cf3e667015498211b","observation_id":"6a544930-f0a1-4d68-9b13-588da45883c4","resolution":{"observed_at":"2026-08-15T15:14:02.264547Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T15:14:02.250126Z","title":null,"venue":null,"work_id":"4c1fa0f4-9998-43d6-9584-412f5a963486","year":2014},"citing_paper":{"arxiv_id":"2608.01357","last_updated":"2026-08-02T16:20:19Z","snapshot_observed_at":"2026-08-16T08:43:07.541073Z","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":37,"source":"pdf_text","source_observed_at":"2026-08-15T15:14:01.453306Z"},"links":{"citing_paper":"/paper/2608.01357"},"observation_digest":"sha256:1b3463a5475928a5377abfcc44543c96f1ded320b545dc479a32a0ae3a14db84","observation_id":"f2e488af-be4d-4bf4-8feb-f3cc76c65946","resolution":{"observed_at":"2026-08-15T15:14:02.253574Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.00351","last_updated":"2025-05-12T07:42:42Z","snapshot_observed_at":"2026-08-16T04:42:19.583536Z","submitted_at":"2025-05-01T06:50:41Z","title":"Integral Representations of Sobolev Spaces via ReLU$^k$ Activation Function and Optimal Error Estimates for Linearized Networks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.00351","snapshot_observed_at":"2026-08-15T15:14:01.456811Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.01357","last_updated":"2026-08-02T16:20:19Z","snapshot_observed_at":"2026-08-16T08:43:07.541073Z","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":38,"source":"pdf_text","source_observed_at":"2026-08-15T15:14:01.456811Z"},"links":{"cited_paper":"/paper/2505.00351","citing_paper":"/paper/2608.01357"},"observation_digest":"sha256:cf7dfc8aa498c0f76366f3298c45e96508d4abb9314bac9ab038250c6b262998","observation_id":"c5ea7eb1-6caf-400b-bef6-48cb52c7f067","resolution":{"observed_at":"2026-08-15T15:14:01.456811Z","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-15T15:14:02.239771Z","title":null,"venue":null,"work_id":"b9ab1687-b7d4-405d-bf5d-33a303043497","year":1996},"citing_paper":{"arxiv_id":"2608.01357","last_updated":"2026-08-02T16:20:19Z","snapshot_observed_at":"2026-08-16T08:43:07.541073Z","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":39,"source":"pdf_text","source_observed_at":"2026-08-15T15:14:01.460474Z"},"links":{"citing_paper":"/paper/2608.01357"},"observation_digest":"sha256:938c091168c9c26c12e658060a8578fac46c048851331e8493f155e13f9edb67","observation_id":"00d8785d-b656-4506-ad9d-afdcc1454de9","resolution":{"observed_at":"2026-08-15T15:14:02.243401Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T15:14:02.229625Z","title":null,"venue":null,"work_id":"11dfab29-c44f-4b68-9361-67349ccdfd3a","year":2022},"citing_paper":{"arxiv_id":"2608.01357","last_updated":"2026-08-02T16:20:19Z","snapshot_observed_at":"2026-08-16T08:43:07.541073Z","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":40,"source":"pdf_text","source_observed_at":"2026-08-15T15:14:01.463821Z"},"links":{"citing_paper":"/paper/2608.01357"},"observation_digest":"sha256:8fca4ba21efa3f463700485177c00adca505c7f37bfc091e5eb359633ec504e3","observation_id":"a63f6124-7376-4db0-8c77-67da60dca8f2","resolution":{"observed_at":"2026-08-15T15:14:02.233101Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T15:14:02.219219Z","title":"Maiorov and A","venue":null,"work_id":"1dd942c5-b40b-42c1-b03d-cca9ebaf7953","year":1999},"citing_paper":{"arxiv_id":"2608.01357","last_updated":"2026-08-02T16:20:19Z","snapshot_observed_at":"2026-08-16T08:43:07.541073Z","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":41,"source":"pdf_text","source_observed_at":"2026-08-15T15:14:01.467227Z"},"links":{"citing_paper":"/paper/2608.01357"},"observation_digest":"sha256:a168b83db3c2e00c37fc5cfab7a9b6ba41308ec0dcda5d9afcaf7a564e8a33d3","observation_id":"13da4122-bad2-43d6-ad42-1398cb662d67","resolution":{"observed_at":"2026-08-15T15:14:02.222715Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T15:14:02.208867Z","title":"Mao and D.-X","venue":null,"work_id":"fe49f2a4-996f-4af8-9e04-52288ba34988","year":2022},"citing_paper":{"arxiv_id":"2608.01357","last_updated":"2026-08-02T16:20:19Z","snapshot_observed_at":"2026-08-16T08:43:07.541073Z","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":42,"source":"pdf_text","source_observed_at":"2026-08-15T15:14:01.470651Z"},"links":{"citing_paper":"/paper/2608.01357"},"observation_digest":"sha256:1311df82a13b6be8e3ef93e7359365dcfe31eed4add03d3ac64b94305ed23d3f","observation_id":"05eb8b09-0272-4be6-ae16-ae7feb9511ce","resolution":{"observed_at":"2026-08-15T15:14:02.212358Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T15:14:02.196685Z","title":null,"venue":null,"work_id":"bf1c0bed-e325-4a51-9f6c-0cf84789ba4e","year":2004},"citing_paper":{"arxiv_id":"2608.01357","last_updated":"2026-08-02T16:20:19Z","snapshot_observed_at":"2026-08-16T08:43:07.541073Z","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":43,"source":"pdf_text","source_observed_at":"2026-08-15T15:14:01.474274Z"},"links":{"citing_paper":"/paper/2608.01357"},"observation_digest":"sha256:2078ee4f7cdcdcce7d706e0801f951343b2d0674f680abccdecf5ab6351835ad","observation_id":"16399f6a-1d92-4278-8d22-ee22e6a7279e","resolution":{"observed_at":"2026-08-15T15:14:02.200428Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T15:14:02.182241Z","title":null,"venue":null,"work_id":"18d4c3ca-d974-4416-b9cc-7d5fe4f54723","year":2010},"citing_paper":{"arxiv_id":"2608.01357","last_updated":"2026-08-02T16:20:19Z","snapshot_observed_at":"2026-08-16T08:43:07.541073Z","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":44,"source":"pdf_text","source_observed_at":"2026-08-15T15:14:01.477876Z"},"links":{"citing_paper":"/paper/2608.01357"},"observation_digest":"sha256:5cc4f418936d4d51cf73ca3fee265cb00b2b03928e1cec010b09bccc8146ac91","observation_id":"82f6f3f7-6e4a-4be2-ba5a-a089481a7afc","resolution":{"observed_at":"2026-08-15T15:14:02.187982Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T15:14:02.170777Z","title":null,"venue":null,"work_id":"1e262ab9-eddc-43d4-876b-b4d21c34dea4","year":2020},"citing_paper":{"arxiv_id":"2608.01357","last_updated":"2026-08-02T16:20:19Z","snapshot_observed_at":"2026-08-16T08:43:07.541073Z","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":45,"source":"pdf_text","source_observed_at":"2026-08-15T15:14:01.481565Z"},"links":{"citing_paper":"/paper/2608.01357"},"observation_digest":"sha256:2d793242b56b38d5682417f18d63d646dd6c9a00a39f618529230e3516e02207","observation_id":"42fc2396-7249-427c-87a4-60d7591c6d33","resolution":{"observed_at":"2026-08-15T15:14:02.174671Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T15:14:02.160959Z","title":null,"venue":null,"work_id":"5835bebb-f659-4ac2-9e48-20922fe9761e","year":1994},"citing_paper":{"arxiv_id":"2608.01357","last_updated":"2026-08-02T16:20:19Z","snapshot_observed_at":"2026-08-16T08:43:07.541073Z","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":46,"source":"pdf_text","source_observed_at":"2026-08-15T15:14:01.484956Z"},"links":{"citing_paper":"/paper/2608.01357"},"observation_digest":"sha256:3ca77d9438965243a3908537cbacc5fe68ba77d2725e733c293ff6ab9c09591f","observation_id":"06f0a1c5-27ba-45e4-b8c9-56a936b47b5b","resolution":{"observed_at":"2026-08-15T15:14:02.164203Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T15:14:02.151459Z","title":null,"venue":null,"work_id":"1edf7a88-572d-4a6c-b5d4-e2b27610d13d","year":1999},"citing_paper":{"arxiv_id":"2608.01357","last_updated":"2026-08-02T16:20:19Z","snapshot_observed_at":"2026-08-16T08:43:07.541073Z","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":47,"source":"pdf_text","source_observed_at":"2026-08-15T15:14:01.488589Z"},"links":{"citing_paper":"/paper/2608.01357"},"observation_digest":"sha256:271b93f8cad1f6b0baf8e6f1ffa56beefb61c412c602065f23654c8b187dcd18","observation_id":"a72357db-239b-4ba1-b901-35dfc3f8dce4","resolution":{"observed_at":"2026-08-15T15:14:02.154848Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T15:14:02.139947Z","title":"Moaveni,Finite Element Analysis: Theory and Application with ANSYS, 3rd ed., Pearson Education India, 2011","venue":null,"work_id":"babeb26f-4498-4649-971e-3531552cb269","year":2011},"citing_paper":{"arxiv_id":"2608.01357","last_updated":"2026-08-02T16:20:19Z","snapshot_observed_at":"2026-08-16T08:43:07.541073Z","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":48,"source":"pdf_text","source_observed_at":"2026-08-15T15:14:01.491438Z"},"links":{"citing_paper":"/paper/2608.01357"},"observation_digest":"sha256:f1efa8b18f0535405069d56bc23aba3ef93b04208b26bd2e20ccf58f718635bd","observation_id":"ea4f9546-0d03-4954-ae39-7ae5eca6ab08","resolution":{"observed_at":"2026-08-15T15:14:02.144222Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T15:14:02.128670Z","title":"Mohri, A","venue":null,"work_id":"74f264d6-9d91-4130-935d-38e1f0cca039","year":2018},"citing_paper":{"arxiv_id":"2608.01357","last_updated":"2026-08-02T16:20:19Z","snapshot_observed_at":"2026-08-16T08:43:07.541073Z","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":49,"source":"pdf_text","source_observed_at":"2026-08-15T15:14:01.494303Z"},"links":{"citing_paper":"/paper/2608.01357"},"observation_digest":"sha256:da5d9350529bde37b99d57f7a2e896fd24b658cf6cb420a3d79ea25b895d832f","observation_id":"a197e54b-9d20-4d89-aaee-8df31303aff5","resolution":{"observed_at":"2026-08-15T15:14:02.132792Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T15:14:02.117372Z","title":"Montanelli and Q","venue":null,"work_id":"86723f70-73b9-455d-b4eb-d69eeba7342b","year":2019},"citing_paper":{"arxiv_id":"2608.01357","last_updated":"2026-08-02T16:20:19Z","snapshot_observed_at":"2026-08-16T08:43:07.541073Z","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":50,"source":"pdf_text","source_observed_at":"2026-08-15T15:14:01.497157Z"},"links":{"citing_paper":"/paper/2608.01357"},"observation_digest":"sha256:188029785bde8c79625538cc06b1292a1cc552af8ab9499be928755e10a8c300","observation_id":"eee8f72d-534a-4b02-80c1-59f045b4d76a","resolution":{"observed_at":"2026-08-15T15:14:02.121147Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T15:14:02.107052Z","title":null,"venue":null,"work_id":"16acb112-d84d-4b32-b74a-0da1a7f2307f","year":2005},"citing_paper":{"arxiv_id":"2608.01357","last_updated":"2026-08-02T16:20:19Z","snapshot_observed_at":"2026-08-16T08:43:07.541073Z","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":51,"source":"pdf_text","source_observed_at":"2026-08-15T15:14:01.500108Z"},"links":{"citing_paper":"/paper/2608.01357"},"observation_digest":"sha256:85a6ab867a7cacf6b61326d7da1b6a7626a2a1d81f8737059d62c0f014e0fb03","observation_id":"02c87742-193b-42b7-a14a-5d608378e388","resolution":{"observed_at":"2026-08-15T15:14:02.110429Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T15:14:02.095494Z","title":null,"venue":null,"work_id":"e0c57ef7-455e-4398-abe5-5bd4f2eb3ab0","year":2006},"citing_paper":{"arxiv_id":"2608.01357","last_updated":"2026-08-02T16:20:19Z","snapshot_observed_at":"2026-08-16T08:43:07.541073Z","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":52,"source":"pdf_text","source_observed_at":"2026-08-15T15:14:01.502973Z"},"links":{"citing_paper":"/paper/2608.01357"},"observation_digest":"sha256:a8fa63a132b2e0a57441c0df52521152fe68da29575407ceb3d9769b9f2cbce4","observation_id":"16b351e9-0a1b-4405-b086-59c3d1a9be4f","resolution":{"observed_at":"2026-08-15T15:14:02.099318Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T15:14:02.082437Z","title":null,"venue":null,"work_id":"2b868679-83d8-443a-bb72-f32a0896c58b","year":1998},"citing_paper":{"arxiv_id":"2608.01357","last_updated":"2026-08-02T16:20:19Z","snapshot_observed_at":"2026-08-16T08:43:07.541073Z","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":53,"source":"pdf_text","source_observed_at":"2026-08-15T15:14:01.505669Z"},"links":{"citing_paper":"/paper/2608.01357"},"observation_digest":"sha256:4e883c7d387f09b2fe66bc9d976caed67d484123bdb7a6ad47aed3e4e509a4f1","observation_id":"c9664bbe-efdf-4a97-b066-bee16e70ea7c","resolution":{"observed_at":"2026-08-15T15:14:02.086296Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T15:14:02.069891Z","title":"Poggio, H","venue":null,"work_id":"4a0c06a7-1423-479e-b31c-f1f84f8f6483","year":2017},"citing_paper":{"arxiv_id":"2608.01357","last_updated":"2026-08-02T16:20:19Z","snapshot_observed_at":"2026-08-16T08:43:07.541073Z","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":54,"source":"pdf_text","source_observed_at":"2026-08-15T15:14:01.508724Z"},"links":{"citing_paper":"/paper/2608.01357"},"observation_digest":"sha256:a65d60b2ca818dca57fdd3e7a7f7bdcbbf1381caf752a63866ad187575e5afc1","observation_id":"bd3f6054-3f59-4db4-816d-14613233b707","resolution":{"observed_at":"2026-08-15T15:14:02.074599Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T15:14:02.057820Z","title":"Reddy,An Introduction to the Finite Element Method, 1993","venue":null,"work_id":"411d65c9-530d-413d-b0b6-5591fb06c0ed","year":1993},"citing_paper":{"arxiv_id":"2608.01357","last_updated":"2026-08-02T16:20:19Z","snapshot_observed_at":"2026-08-16T08:43:07.541073Z","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":55,"source":"pdf_text","source_observed_at":"2026-08-15T15:14:01.511471Z"},"links":{"citing_paper":"/paper/2608.01357"},"observation_digest":"sha256:4ea3e1cac3a1887b745d6cbe5717b5ad8d83ad58821b8b0c650e7c5438a6cf53","observation_id":"786aab64-a9c4-4c4d-be33-f2b2a721463d","resolution":{"observed_at":"2026-08-15T15:14:02.061748Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T15:14:02.045903Z","title":"Schaback, Improved error bounds for scattered data interpolation by radial basis functions, Mathematics of Computation,68(225) (1999), 201–216","venue":null,"work_id":"791b4c26-4908-4ea1-b47b-985a8419959d","year":1999},"citing_paper":{"arxiv_id":"2608.01357","last_updated":"2026-08-02T16:20:19Z","snapshot_observed_at":"2026-08-16T08:43:07.541073Z","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":56,"source":"pdf_text","source_observed_at":"2026-08-15T15:14:01.514117Z"},"links":{"citing_paper":"/paper/2608.01357"},"observation_digest":"sha256:0318883ca08dce93d8130aff4d6abade1f4cb2bf870320c9a8f3a57077091b54","observation_id":"9147bb7a-d091-43cc-9b50-68e14bd2a1a3","resolution":{"observed_at":"2026-08-15T15:14:02.049887Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T15:14:02.034184Z","title":"Schaback, Superconvergence of kernel-based interpolation,Journal of Approximation The- ory,235(2018), 1–19","venue":null,"work_id":"f5f05969-1076-4913-8f84-88b4a701c7d6","year":2018},"citing_paper":{"arxiv_id":"2608.01357","last_updated":"2026-08-02T16:20:19Z","snapshot_observed_at":"2026-08-16T08:43:07.541073Z","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":57,"source":"pdf_text","source_observed_at":"2026-08-15T15:14:01.517369Z"},"links":{"citing_paper":"/paper/2608.01357"},"observation_digest":"sha256:3a81473b1436032cb845c022e684d8aba0087c25f5b44be8634a67a2cb0f3b24","observation_id":"dbd8a644-8458-4b24-9230-98adc22a022c","resolution":{"observed_at":"2026-08-15T15:14:02.038494Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-16T17:50:05.818871Z","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-16T08:43:07.541073Z","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:7644859cf6fb863bd2b09fa33883dfa2c11ca42138a930c333f1bb9cabdf2923","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"}},{"citation":{"cited_paper":{"arxiv_id":"2006.12231","last_updated":"2020-10-27T01:51:52Z","snapshot_observed_at":"2026-07-06T09:31:23.540229Z","submitted_at":"2020-06-22T13:27:33Z","title":"Deep Network with Approximation Error Being Reciprocal of Width to Power of Square Root of Depth","version":6},"cited_work":{"arxiv_id":"2006.12231","doi":null,"metadata_source":"pith","pith_arxiv_id":"2006.12231","snapshot_observed_at":"2026-08-15T15:14:01.754873Z","title":"Deep Network with Approximation Error Being Reciprocal of Width to Power of Square Root of Depth","venue":"cs.LG","work_id":"85a0fee5-b19a-4766-a503-f9bb1162fa11","year":2020},"citing_paper":{"arxiv_id":"2608.01357","last_updated":"2026-08-02T16:20:19Z","snapshot_observed_at":"2026-08-16T08:43:07.541073Z","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":59,"source":"pdf_text","source_observed_at":"2026-08-15T15:14:01.526964Z"},"links":{"cited_paper":"/paper/2006.12231","citing_paper":"/paper/2608.01357"},"observation_digest":"sha256:75ce9cf42f9fd8f339bdc7f7c17070b42d7575c5d85ec5c7a8db627fd284d9b5","observation_id":"0b18ff21-6aae-4ec0-a39a-8f6a5111676d","resolution":{"observed_at":"2026-08-15T15:14:01.759042Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T15:14:02.021102Z","title":null,"venue":null,"work_id":"e9f37b3e-ba8a-453b-9df3-4b5e93f3bdb2","year":2021},"citing_paper":{"arxiv_id":"2608.01357","last_updated":"2026-08-02T16:20:19Z","snapshot_observed_at":"2026-08-16T08:43:07.541073Z","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":60,"source":"pdf_text","source_observed_at":"2026-08-15T15:14:01.531155Z"},"links":{"citing_paper":"/paper/2608.01357"},"observation_digest":"sha256:cb877548b4add6997e9e6a5f6dac53a39b0e067e80ef22a8f92222d4111fdd5a","observation_id":"033542be-cc05-449c-b0f9-80f05991f87f","resolution":{"observed_at":"2026-08-15T15:14:02.026196Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T15:14:02.007496Z","title":null,"venue":null,"work_id":"3414eb97-ce4c-4a7f-bdbf-62262ea62811","year":2022},"citing_paper":{"arxiv_id":"2608.01357","last_updated":"2026-08-02T16:20:19Z","snapshot_observed_at":"2026-08-16T08:43:07.541073Z","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":61,"source":"pdf_text","source_observed_at":"2026-08-15T15:14:01.535112Z"},"links":{"citing_paper":"/paper/2608.01357"},"observation_digest":"sha256:f9b418cef6733be24ddcb01da93d280d826384d2aa06702ba499dcd4be3c16e3","observation_id":"6ba1842e-135b-4bea-801e-429a564f9830","resolution":{"observed_at":"2026-08-15T15:14:02.011717Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2307.15285","last_updated":"2025-03-24T15:08:55Z","snapshot_observed_at":"2026-08-16T17:52:43.084909Z","submitted_at":"2023-07-28T03:43:17Z","title":"Optimal Approximation of Zonoids and Uniform Approximation by Shallow Neural Networks","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2307.15285","snapshot_observed_at":"2026-08-15T15:14:01.538697Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2608.01357","last_updated":"2026-08-02T16:20:19Z","snapshot_observed_at":"2026-08-16T08:43:07.541073Z","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":62,"source":"pdf_text","source_observed_at":"2026-08-15T15:14:01.538697Z"},"links":{"cited_paper":"/paper/2307.15285","citing_paper":"/paper/2608.01357"},"observation_digest":"sha256:6c3302f994d311f20248ad9fb5780c5f552d7baa6f1f6270c728b5c639fb329b","observation_id":"868c4cd2-1a19-472d-8349-5892e2e5831c","resolution":{"observed_at":"2026-08-15T15:14:01.538697Z","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-15T15:14:01.997490Z","title":null,"venue":null,"work_id":"864ca6ad-b686-4788-8e07-78d546ca81e2","year":2023},"citing_paper":{"arxiv_id":"2608.01357","last_updated":"2026-08-02T16:20:19Z","snapshot_observed_at":"2026-08-16T08:43:07.541073Z","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":63,"source":"pdf_text","source_observed_at":"2026-08-15T15:14:01.542227Z"},"links":{"citing_paper":"/paper/2608.01357"},"observation_digest":"sha256:8a817ada154f857ea73811917bcb0b44f4be19d0728fa8f802c9be7f7c3c44f0","observation_id":"433e8fb9-3496-4615-8384-1dcac5add4be","resolution":{"observed_at":"2026-08-15T15:14:02.000786Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T15:14:01.987080Z","title":null,"venue":null,"work_id":"de11d1bf-e91e-4f9f-aa5f-84eee3409621","year":2020},"citing_paper":{"arxiv_id":"2608.01357","last_updated":"2026-08-02T16:20:19Z","snapshot_observed_at":"2026-08-16T08:43:07.541073Z","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":64,"source":"pdf_text","source_observed_at":"2026-08-15T15:14:01.545620Z"},"links":{"citing_paper":"/paper/2608.01357"},"observation_digest":"sha256:ab03cdb9514b3e8aa30e5a3b5bcc2c90bdcec4cc481c8feaadeeb952daa6b1cf","observation_id":"b3ba7bb7-7b1a-4429-a777-9a3ab9760348","resolution":{"observed_at":"2026-08-15T15:14:01.991122Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T15:14:01.976862Z","title":null,"venue":null,"work_id":"e50e79de-2090-4085-bd14-cd3e576796c7","year":2022},"citing_paper":{"arxiv_id":"2608.01357","last_updated":"2026-08-02T16:20:19Z","snapshot_observed_at":"2026-08-16T08:43:07.541073Z","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":65,"source":"pdf_text","source_observed_at":"2026-08-15T15:14:01.549441Z"},"links":{"citing_paper":"/paper/2608.01357"},"observation_digest":"sha256:b431b8dab8f53d997f3b10929c0e2055377de121b4f2155cc5751ff79bac8458","observation_id":"9dbc038d-8331-4cbf-81ef-4ed70a3f6697","resolution":{"observed_at":"2026-08-15T15:14:01.980398Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T15:14:01.966722Z","title":null,"venue":null,"work_id":"63725bc5-bb4f-45c1-9706-773687e64326","year":2022},"citing_paper":{"arxiv_id":"2608.01357","last_updated":"2026-08-02T16:20:19Z","snapshot_observed_at":"2026-08-16T08:43:07.541073Z","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":66,"source":"pdf_text","source_observed_at":"2026-08-15T15:14:01.554753Z"},"links":{"citing_paper":"/paper/2608.01357"},"observation_digest":"sha256:3da84757c9205eb9a22027c8a1ddaa9e71c9c12bd1db54d0c3c0108e17364ea6","observation_id":"a6b53c54-5c5d-4990-922e-6fc5109ac1bb","resolution":{"observed_at":"2026-08-15T15:14:01.969879Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T15:14:01.956918Z","title":null,"venue":null,"work_id":"fdc67c9b-1b6a-4ee9-b210-684521f554dd","year":2023},"citing_paper":{"arxiv_id":"2608.01357","last_updated":"2026-08-02T16:20:19Z","snapshot_observed_at":"2026-08-16T08:43:07.541073Z","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":67,"source":"pdf_text","source_observed_at":"2026-08-15T15:14:01.558634Z"},"links":{"citing_paper":"/paper/2608.01357"},"observation_digest":"sha256:8bb941aea3133008db6c36acda596eb04f92fd9f876ed647a04332c4e275a6d6","observation_id":"eed532c4-4cce-4492-b9eb-d16dca4cfbe5","resolution":{"observed_at":"2026-08-15T15:14:01.960004Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T15:14:01.947513Z","title":"Sloan and V","venue":null,"work_id":"1beac618-c2bb-4eb9-a060-1c7a3a066f74","year":2025},"citing_paper":{"arxiv_id":"2608.01357","last_updated":"2026-08-02T16:20:19Z","snapshot_observed_at":"2026-08-16T08:43:07.541073Z","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":68,"source":"pdf_text","source_observed_at":"2026-08-15T15:14:01.562477Z"},"links":{"citing_paper":"/paper/2608.01357"},"observation_digest":"sha256:2522bf7f37c8ca86bfa6be1615926e090d33a4f962740c9c99f75b98cfa1c38b","observation_id":"d070e93b-1a89-4f1e-947c-343ea6596f07","resolution":{"observed_at":"2026-08-15T15:14:01.950719Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T15:14:01.938602Z","title":"Stoer, R","venue":null,"work_id":"1aa57ab7-d4d2-4fe2-a1b4-667ae20c4d2d","year":1980},"citing_paper":{"arxiv_id":"2608.01357","last_updated":"2026-08-02T16:20:19Z","snapshot_observed_at":"2026-08-16T08:43:07.541073Z","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":69,"source":"pdf_text","source_observed_at":"2026-08-15T15:14:01.566112Z"},"links":{"citing_paper":"/paper/2608.01357"},"observation_digest":"sha256:9ede30d176768eedaf0d25a374568a33d1da3b0dd1f981b0b8ca1d51cfc23f46","observation_id":"64176712-47d3-4c94-aa9f-79f74de6bcbb","resolution":{"observed_at":"2026-08-15T15:14:01.941788Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T15:14:01.928101Z","title":"S¨ uli and D","venue":null,"work_id":"29dd979e-828e-489f-a63b-ab3f9f3a8098","year":2003},"citing_paper":{"arxiv_id":"2608.01357","last_updated":"2026-08-02T16:20:19Z","snapshot_observed_at":"2026-08-16T08:43:07.541073Z","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":70,"source":"pdf_text","source_observed_at":"2026-08-15T15:14:01.570257Z"},"links":{"citing_paper":"/paper/2608.01357"},"observation_digest":"sha256:1548c13672ff84327f9eb8dd48ccbdfb6f003e84f2beec406b672ccdd8019399","observation_id":"69470c44-e779-4bc7-8002-fad89e432eed","resolution":{"observed_at":"2026-08-15T15:14:01.931773Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T15:14:01.917712Z","title":"Szeg˝ o,Orthogonal Polynomials, vol","venue":null,"work_id":"9f92be0e-b7ae-4d63-aaee-48b96b21c83b","year":1939},"citing_paper":{"arxiv_id":"2608.01357","last_updated":"2026-08-02T16:20:19Z","snapshot_observed_at":"2026-08-16T08:43:07.541073Z","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":71,"source":"pdf_text","source_observed_at":"2026-08-15T15:14:01.578433Z"},"links":{"citing_paper":"/paper/2608.01357"},"observation_digest":"sha256:1f3a2d0b103feaefb50034c725caafac3a3837d4ed82bb3442f462ce1ce2e433","observation_id":"16d6c833-80f4-4b5a-b64d-abbb2205bc10","resolution":{"observed_at":"2026-08-15T15:14:01.921365Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T15:14:01.907784Z","title":null,"venue":null,"work_id":"812a950a-cbd4-4aa9-a389-b04f8d547fc7","year":2008},"citing_paper":{"arxiv_id":"2608.01357","last_updated":"2026-08-02T16:20:19Z","snapshot_observed_at":"2026-08-16T08:43:07.541073Z","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":72,"source":"pdf_text","source_observed_at":"2026-08-15T15:14:01.582168Z"},"links":{"citing_paper":"/paper/2608.01357"},"observation_digest":"sha256:c1098a7256eef405b517a7a8d19ccf29059c2c0a11a3845c44b74f21ce454827","observation_id":"52f7024a-59de-43c4-bd32-31a1e449f7a6","resolution":{"observed_at":"2026-08-15T15:14:01.911241Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T15:14:01.893212Z","title":null,"venue":null,"work_id":"42c02bb5-08f1-475c-a39f-19c6f9cb4ff4","year":2014},"citing_paper":{"arxiv_id":"2608.01357","last_updated":"2026-08-02T16:20:19Z","snapshot_observed_at":"2026-08-16T08:43:07.541073Z","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":73,"source":"pdf_text","source_observed_at":"2026-08-15T15:14:01.586705Z"},"links":{"citing_paper":"/paper/2608.01357"},"observation_digest":"sha256:fd7ae28cfcd3db75d1c6c20b6f6a82972b2011888628ef1e5dacbe84f6a274c4","observation_id":"09ce994f-eafe-4bc0-8ace-bb0fe34d056d","resolution":{"observed_at":"2026-08-15T15:14:01.896650Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T15:14:01.881048Z","title":null,"venue":null,"work_id":"f12eab40-b50b-4261-8bdd-4f2900492d5f","year":2015},"citing_paper":{"arxiv_id":"2608.01357","last_updated":"2026-08-02T16:20:19Z","snapshot_observed_at":"2026-08-16T08:43:07.541073Z","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":74,"source":"pdf_text","source_observed_at":"2026-08-15T15:14:01.590084Z"},"links":{"citing_paper":"/paper/2608.01357"},"observation_digest":"sha256:583c39a774dd95a0d0bb82fbc9e1a74d8cf7676a150ee3b3b6786ddbebbf40ca","observation_id":"e53e5cdb-e873-41b2-87ab-af6f149afd8d","resolution":{"observed_at":"2026-08-15T15:14:01.885807Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T15:14:01.869593Z","title":"Wendland and C","venue":null,"work_id":"8100d9d8-b126-4943-b8c7-85617a81fa46","year":2005},"citing_paper":{"arxiv_id":"2608.01357","last_updated":"2026-08-02T16:20:19Z","snapshot_observed_at":"2026-08-16T08:43:07.541073Z","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":75,"source":"pdf_text","source_observed_at":"2026-08-15T15:14:01.593723Z"},"links":{"citing_paper":"/paper/2608.01357"},"observation_digest":"sha256:3b3be5ab042fae550f98d5e491bc3b8bc0bc2d32ac66293f413862375e01df71","observation_id":"cb8a23c0-b1e3-4926-becb-7739e5edb229","resolution":{"observed_at":"2026-08-15T15:14:01.873074Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T15:14:01.597147Z","title":"Wenzel, Sharp inverse statements for kernel approximation: superconvergence and satura- tion,arXiv preprint arXiv:2601.01808, 2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2608.01357","last_updated":"2026-08-02T16:20:19Z","snapshot_observed_at":"2026-08-16T08:43:07.541073Z","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":76,"source":"pdf_text","source_observed_at":"2026-08-15T15:14:01.597147Z"},"links":{"citing_paper":"/paper/2608.01357"},"observation_digest":"sha256:51bb3592516b7a5a42e4438ab9fe92f1e96bb6dc908868d227834aa4a2b21fb8","observation_id":"67b72d8d-ac71-493a-b846-b68f6d4868d7","resolution":{"observed_at":"2026-08-15T15:14:01.597147Z","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-15T15:14:01.858889Z","title":"Xu, Iterative methods by space decomposition and subspace correction,SIAM Review,34(4) (1992), 581–613","venue":null,"work_id":"5d16c463-a467-4769-9bfe-f4d343569d6f","year":1992},"citing_paper":{"arxiv_id":"2608.01357","last_updated":"2026-08-02T16:20:19Z","snapshot_observed_at":"2026-08-16T08:43:07.541073Z","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":77,"source":"pdf_text","source_observed_at":"2026-08-15T15:14:01.600457Z"},"links":{"citing_paper":"/paper/2608.01357"},"observation_digest":"sha256:094f0cd905f6102e3b9cbd4ccfc667b6f241c49b259a88be8961ab0b393d083c","observation_id":"162c109b-eb1f-437e-a571-6714d94373ee","resolution":{"observed_at":"2026-08-15T15:14:01.862737Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2010.01458","last_updated":"2020-10-04T01:15:30Z","snapshot_observed_at":"2026-08-16T19:16:06.297709Z","submitted_at":"2020-10-04T01:15:30Z","title":"The Finite Neuron Method and Convergence Analysis","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2010.01458","snapshot_observed_at":"2026-08-15T15:14:01.604888Z","title":"Xu, The finite neuron method and convergence analysis,arXiv preprint arXiv:2010.01458, 2020","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2608.01357","last_updated":"2026-08-02T16:20:19Z","snapshot_observed_at":"2026-08-16T08:43:07.541073Z","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":78,"source":"pdf_text","source_observed_at":"2026-08-15T15:14:01.604888Z"},"links":{"cited_paper":"/paper/2010.01458","citing_paper":"/paper/2608.01357"},"observation_digest":"sha256:98f4bdcb7971d3635f74bb14159550025b6493668a91975456ed42594281b9c5","observation_id":"34ac7f0c-acf1-4871-ac39-e4d3abd7e083","resolution":{"observed_at":"2026-08-15T15:14:01.604888Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.10766","last_updated":"2025-08-31T20:56:57Z","snapshot_observed_at":"2026-08-16T14:51:37.386779Z","submitted_at":"2023-10-16T19:00:28Z","title":"Nearly Optimal Approximation Rates for Deep Super ReLU Networks on Sobolev Spaces","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.10766","snapshot_observed_at":"2026-08-15T15:14:01.608610Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2608.01357","last_updated":"2026-08-02T16:20:19Z","snapshot_observed_at":"2026-08-16T08:43:07.541073Z","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":79,"source":"pdf_text","source_observed_at":"2026-08-15T15:14:01.608610Z"},"links":{"cited_paper":"/paper/2310.10766","citing_paper":"/paper/2608.01357"},"observation_digest":"sha256:f161607d4b53819f6cd066f2399b73516e704a61b658dd226a5c9766990325ce","observation_id":"35b66c45-bdae-49cc-9930-920cc05a868b","resolution":{"observed_at":"2026-08-15T15:14:01.608610Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2304.01561","last_updated":"2024-01-09T03:03:58Z","snapshot_observed_at":"2026-08-16T15:42:57.960296Z","submitted_at":"2023-04-04T06:35:02Z","title":"Optimal rates of approximation by shallow ReLU$^k$ neural networks and applications to nonparametric regression","version":3},"cited_work":{"arxiv_id":"2304.01561","doi":null,"metadata_source":"pith","pith_arxiv_id":"2304.01561","snapshot_observed_at":"2026-08-15T15:14:01.653015Z","title":"Optimal rates of approximation by shallow ReLU$^k$ neural networks and applications to nonparametric regression","venue":"stat.ML","work_id":"3a762dd3-5050-42c1-b0c9-b3be94ca61d8","year":2023},"citing_paper":{"arxiv_id":"2608.01357","last_updated":"2026-08-02T16:20:19Z","snapshot_observed_at":"2026-08-16T08:43:07.541073Z","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":80,"source":"pdf_text","source_observed_at":"2026-08-15T15:14:01.611692Z"},"links":{"cited_paper":"/paper/2304.01561","citing_paper":"/paper/2608.01357"},"observation_digest":"sha256:3cd3ab7a731a9d222ce9f837619643fb5b44c07a6ee88ea9072e8c2a2831112e","observation_id":"d3c705b8-5ec8-4e97-a307-cb4816e33f0b","resolution":{"observed_at":"2026-08-15T15:14:01.659841Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T15:14:01.848339Z","title":"Yarotsky, Optimal approximation of continuous functions by very deep ReLU networks, in Conference on Learning Theory, PMLR, 2018, 639–649","venue":null,"work_id":"48536a69-6527-4681-806e-9fa4fc472b43","year":2018},"citing_paper":{"arxiv_id":"2608.01357","last_updated":"2026-08-02T16:20:19Z","snapshot_observed_at":"2026-08-16T08:43:07.541073Z","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":81,"source":"pdf_text","source_observed_at":"2026-08-15T15:14:01.615059Z"},"links":{"citing_paper":"/paper/2608.01357"},"observation_digest":"sha256:74400964b7cbd8b333857b318a537771c6038243ede4b4c57cb5ce41905db759","observation_id":"0628b4a4-f128-430c-bc83-a9f9be61e083","resolution":{"observed_at":"2026-08-15T15:14:01.851936Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T15:14:01.837789Z","title":"Yarotsky and A","venue":null,"work_id":"dad9cca1-5ed5-4b60-8931-758e0c6e500e","year":2020},"citing_paper":{"arxiv_id":"2608.01357","last_updated":"2026-08-02T16:20:19Z","snapshot_observed_at":"2026-08-16T08:43:07.541073Z","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":82,"source":"pdf_text","source_observed_at":"2026-08-15T15:14:01.618291Z"},"links":{"citing_paper":"/paper/2608.01357"},"observation_digest":"sha256:779fcf0c0fd251e4313768e1a3e766adfa0d54506193cb3d604f3a8ebb98edb8","observation_id":"4bca685f-1aef-402f-9f13-221c48ac3213","resolution":{"observed_at":"2026-08-15T15:14:01.841342Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T15:14:01.826667Z","title":"Zhang, Z","venue":null,"work_id":"067f1359-b121-4941-9bf1-9c86dff91d9f","year":2022},"citing_paper":{"arxiv_id":"2608.01357","last_updated":"2026-08-02T16:20:19Z","snapshot_observed_at":"2026-08-16T08:43:07.541073Z","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":83,"source":"pdf_text","source_observed_at":"2026-08-15T15:14:01.621776Z"},"links":{"citing_paper":"/paper/2608.01357"},"observation_digest":"sha256:e8ddee7a166cd5c74f65c39f65072ce1140e4e322f2e4e71544f485fd1c0e469","observation_id":"ea5dc48c-a3df-4e42-9ca4-d506ff7f92f1","resolution":{"observed_at":"2026-08-15T15:14:01.830371Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2608.01357","last_updated":"2026-08-02T16:20:19Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-16T08:43:07.541073Z","submitted_at":"2026-08-02T16:20:19Z","title":"Do Neural Networks Really Beat the Curse of Dimensionality? A Bit-Complexity View"},"reference_resolution":{"displayed":83,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":49,"verified_exact":3,"verified_fuzzy":31},"total_outbound_references":83},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 83 of 83 outbound references and 0 inbound Pith citation observations for arXiv:2608.01357."}