{"as_of":"2026-08-10T22:38:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:80382b3df212cc08852a645c87bd30499da1b3ab7cab844279d59961a416b764","coverage":[{"denominator":73,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":73,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-16T09:34:00.409455Z","state":"measured"},{"denominator":76,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":76,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-02T12:16:44.426478Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-07-02T16:07:08.511499Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2601.22409","last_updated":"2026-05-12T23:48:38Z","snapshot_observed_at":"2026-08-02T15:20:04.793342Z","submitted_at":"2026-01-29T23:43:26Z","title":"Optimization, Generalization and Differential Privacy Bounds for Gradient Descent on Kolmogorov-Arnold Networks","version":3},"cited_work":{"arxiv_id":"2601.22409","doi":null,"metadata_source":"pith","pith_arxiv_id":"2601.22409","snapshot_observed_at":"2026-07-02T16:07:08.511499Z","title":"Optimization, Generalization and Differential Privacy Bounds for Gradient Descent on Kolmogorov-Arnold Networks","venue":"cs.LG","work_id":"bbb82464-dc16-45bb-83a0-200287792629","year":2026},"citing_paper":{"arxiv_id":"2606.06764","last_updated":"2026-06-04T23:04:49Z","snapshot_observed_at":"2026-08-02T11:33:40.895435Z","submitted_at":"2026-06-04T23:04:49Z","title":"Optimal Rates for Generalization of Gradient Descent Methods with Deep Neural Networks","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-06-27T23:06:23.042883Z"},"links":{"cited_paper":"/paper/2601.22409","citing_paper":"/paper/2606.06764"},"observation_digest":"sha256:0ed18d960faf01b8112ff1fdcdcf6375144ef814b367e97aaeec2abef5b4927f","observation_id":"9400ffbd-034b-4d8e-9850-df0d1e20b773","resolution":{"observed_at":"2026-07-02T15:57:07.404045Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2601.22409","last_updated":"2026-05-12T23:48:38Z","snapshot_observed_at":"2026-08-02T15:20:04.793342Z","submitted_at":"2026-01-29T23:43:26Z","title":"Optimization, Generalization and Differential Privacy Bounds for Gradient Descent on Kolmogorov-Arnold Networks","version":3},"cited_work":{"arxiv_id":"2601.22409","doi":null,"metadata_source":"pith","pith_arxiv_id":"2601.22409","snapshot_observed_at":"2026-07-02T16:07:08.511499Z","title":"Optimization, Generalization and Differential Privacy Bounds for Gradient Descent on Kolmogorov-Arnold Networks","venue":"cs.LG","work_id":"bbb82464-dc16-45bb-83a0-200287792629","year":2026},"citing_paper":{"arxiv_id":"2606.06772","last_updated":"2026-07-29T13:42:12Z","snapshot_observed_at":"2026-08-07T13:57:17.299323Z","submitted_at":"2026-06-04T23:31:52Z","title":"Minimax-Optimal Generalization Bounds for Smooth Deep Neural Networks Trained by (Stochastic) Gradient Descent","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-06-27T23:03:52.889955Z"},"links":{"cited_paper":"/paper/2601.22409","citing_paper":"/paper/2606.06772"},"observation_digest":"sha256:9dcc3af41a1f27d48ff6f52e710ce94c1498505e37af90bb13be55d5b6fa7232","observation_id":"7d6f61fc-4b7f-4108-86f9-d57ce599eb7b","resolution":{"observed_at":"2026-07-02T16:07:08.512676Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2601.22409","last_updated":"2026-05-12T23:48:38Z","snapshot_observed_at":"2026-08-02T15:20:04.793342Z","submitted_at":"2026-01-29T23:43:26Z","title":"Optimization, Generalization and Differential Privacy Bounds for Gradient Descent on Kolmogorov-Arnold Networks","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2601.22409","snapshot_observed_at":"2026-08-02T12:16:44.426478Z","title":"Optimization, generalization and differential privacy bounds for gradient descent on kolmogorov-arnold networks.arXiv preprint arXiv:2601.22409, 2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2606.06772","last_updated":"2026-07-29T13:42:12Z","snapshot_observed_at":"2026-08-07T13:57:17.299323Z","submitted_at":"2026-06-04T23:31:52Z","title":"Minimax-Optimal Generalization Bounds for Smooth Deep Neural Networks Trained by (Stochastic) Gradient Descent","version":2},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-02T12:16:44.426478Z"},"links":{"cited_paper":"/paper/2601.22409","citing_paper":"/paper/2606.06772"},"observation_digest":"sha256:690e164492adab89803695bc46fefdb6766088b6593d55542906450b1937ebd0","observation_id":"c1567103-02cb-460b-a37d-a13222c32d1a","resolution":{"observed_at":"2026-08-02T12:16:44.426478Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2601.22409/citation-record","integrity":"/paper/2601.22409/integrity","json":"/paper/2601.22409/citation-record.json","paper":"/paper/2601.22409"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-07T01:13:15.225264Z","title":"Deep learning with differential privacy","venue":null,"work_id":"a7375ed4-55e8-4d83-a877-6694ddafac56","year":2016},"citing_paper":{"arxiv_id":"2601.22409","last_updated":"2026-05-12T23:48:38Z","snapshot_observed_at":"2026-08-02T15:20:04.793342Z","submitted_at":"2026-01-29T23:43:26Z","title":"Optimization, Generalization and Differential Privacy Bounds for Gradient Descent on Kolmogorov-Arnold Networks","version":3},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-16T09:34:00.409455Z"},"links":{"citing_paper":"/paper/2601.22409"},"observation_digest":"sha256:28bd18315936d7cc7b70426c5f8f9f40b181fbd3e59305a9e21f239950d5d558","observation_id":"ac0fc6b1-669f-43c6-946e-c8a06bcae21d","resolution":{"observed_at":"2026-05-16T09:52:42.078529Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"A convergence theory for deep learning via over- parameterization","venue":null,"work_id":"2a252a94-ee15-4740-ac95-48e4c0bfa182","year":2019},"citing_paper":{"arxiv_id":"2601.22409","last_updated":"2026-05-12T23:48:38Z","snapshot_observed_at":"2026-08-02T15:20:04.793342Z","submitted_at":"2026-01-29T23:43:26Z","title":"Optimization, Generalization and Differential Privacy Bounds for Gradient Descent on Kolmogorov-Arnold Networks","version":3},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-16T09:34:00.409455Z"},"links":{"citing_paper":"/paper/2601.22409"},"observation_digest":"sha256:437c29040b5dbcd403a7ed028117d4d2745e4ffb1c9a7454f75d1c7d1090bacf","observation_id":"fd534ad5-a13e-4377-91eb-60f435198bac","resolution":{"observed_at":"2026-05-16T09:52:42.095403Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"On functions of three variables","venue":null,"work_id":"c0039bc8-c8ed-4375-a027-1d4f381c914c","year":1957},"citing_paper":{"arxiv_id":"2601.22409","last_updated":"2026-05-12T23:48:38Z","snapshot_observed_at":"2026-08-02T15:20:04.793342Z","submitted_at":"2026-01-29T23:43:26Z","title":"Optimization, Generalization and Differential Privacy Bounds for Gradient Descent on Kolmogorov-Arnold Networks","version":3},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-16T09:34:00.409455Z"},"links":{"citing_paper":"/paper/2601.22409"},"observation_digest":"sha256:26a82df1a453d56b87ffed8e8010d972473c82874a586946bbe3bf4635a03d34","observation_id":"ea7f3152-42ec-4bfb-933e-c4aa19a918d8","resolution":{"observed_at":"2026-05-16T09:52:42.147274Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Fine-grained analysis of optimization and generalization for overparameterized two-layer neural networks","venue":null,"work_id":"2f8744c1-d98b-482b-acc4-22e10362f492","year":2019},"citing_paper":{"arxiv_id":"2601.22409","last_updated":"2026-05-12T23:48:38Z","snapshot_observed_at":"2026-08-02T15:20:04.793342Z","submitted_at":"2026-01-29T23:43:26Z","title":"Optimization, Generalization and Differential Privacy Bounds for Gradient Descent on Kolmogorov-Arnold Networks","version":3},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-16T09:34:00.409455Z"},"links":{"citing_paper":"/paper/2601.22409"},"observation_digest":"sha256:c436ddfadc51e46e1398794fb96d63ca070bc9a9c10a479324a524a41fb7a53d","observation_id":"ca69f3b6-2e73-438b-9a11-f9c5ee5487ab","resolution":{"observed_at":"2026-05-16T09:52:42.066909Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Spectrally-normalized margin bounds for neural networks.Advances in Neural Information Processing Systems, 30","venue":null,"work_id":"a70878f5-c8e2-48e1-8326-8c6c656e02dc","year":2017},"citing_paper":{"arxiv_id":"2601.22409","last_updated":"2026-05-12T23:48:38Z","snapshot_observed_at":"2026-08-02T15:20:04.793342Z","submitted_at":"2026-01-29T23:43:26Z","title":"Optimization, Generalization and Differential Privacy Bounds for Gradient Descent on Kolmogorov-Arnold Networks","version":3},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-16T09:34:00.409455Z"},"links":{"citing_paper":"/paper/2601.22409"},"observation_digest":"sha256:1268cedb90aff9e2ec4ca6baff299e70cc5e9bbe53444f755656e7276ae8ee40","observation_id":"b682d088-9b6c-4a70-8c97-fe8b871fa15d","resolution":{"observed_at":"2026-05-16T09:52:42.101964Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Private stochastic convex optimization with optimal rates","venue":null,"work_id":"2bb9fa4d-3954-48da-bfce-d47cc1b143f5","year":2019},"citing_paper":{"arxiv_id":"2601.22409","last_updated":"2026-05-12T23:48:38Z","snapshot_observed_at":"2026-08-02T15:20:04.793342Z","submitted_at":"2026-01-29T23:43:26Z","title":"Optimization, Generalization and Differential Privacy Bounds for Gradient Descent on Kolmogorov-Arnold Networks","version":3},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-16T09:34:00.409455Z"},"links":{"citing_paper":"/paper/2601.22409"},"observation_digest":"sha256:4bc25720685164f29c62e98a1c5c09a1c9cc470778543426d08725e46598c9b6","observation_id":"9e7ca4db-87ad-40b7-9ad3-5546881fee8e","resolution":{"observed_at":"2026-05-16T09:52:42.183073Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Differentially private stochastic optimization: New results in convex and non-convex settings","venue":null,"work_id":"8c8a7c0b-6ce0-437d-835b-359abdc11542","year":2021},"citing_paper":{"arxiv_id":"2601.22409","last_updated":"2026-05-12T23:48:38Z","snapshot_observed_at":"2026-08-02T15:20:04.793342Z","submitted_at":"2026-01-29T23:43:26Z","title":"Optimization, Generalization and Differential Privacy Bounds for Gradient Descent on Kolmogorov-Arnold Networks","version":3},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-16T09:34:00.409455Z"},"links":{"citing_paper":"/paper/2601.22409"},"observation_digest":"sha256:479ae3e4514fc1bf395f0f31effc1521daed6a3dd9aa3f5ed3477445173482d2","observation_id":"47837a76-f811-4fb4-b210-448e4d83e4d4","resolution":{"observed_at":"2026-05-16T09:52:42.209426Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.13155","last_updated":"2025-03-31T12:55:11Z","snapshot_observed_at":"2026-07-06T18:33:24.206083Z","submitted_at":"2024-06-19T02:09:44Z","title":"Convolutional Kolmogorov-Arnold Networks","version":3},"cited_work":{"arxiv_id":"2406.13155","doi":"10.48550/arxiv.2406.13155","metadata_source":"pith","pith_arxiv_id":"2406.13155","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Convolutional kolmogorov- arnold networks","venue":"cs.CV","work_id":"e7be91f8-d060-4546-ac48-c56acec2871a","year":2024},"citing_paper":{"arxiv_id":"2601.22409","last_updated":"2026-05-12T23:48:38Z","snapshot_observed_at":"2026-08-02T15:20:04.793342Z","submitted_at":"2026-01-29T23:43:26Z","title":"Optimization, Generalization and Differential Privacy Bounds for Gradient Descent on Kolmogorov-Arnold Networks","version":3},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-16T09:34:00.409455Z"},"links":{"cited_paper":"/paper/2406.13155","citing_paper":"/paper/2601.22409"},"observation_digest":"sha256:f441450bd48f1ab9ada32bcdbb999ec635bc747582401f7551f046c381dd3ba8","observation_id":"ed4875cf-f11a-4e11-a7dc-adecc2694444","resolution":{"observed_at":"2026-05-16T09:37:41.898196Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"On a constructive proof of kolmogorov’s superposition theorem","venue":null,"work_id":"e3e57bba-94c9-4deb-aa61-64bbdca9fdb4","year":2009},"citing_paper":{"arxiv_id":"2601.22409","last_updated":"2026-05-12T23:48:38Z","snapshot_observed_at":"2026-08-02T15:20:04.793342Z","submitted_at":"2026-01-29T23:43:26Z","title":"Optimization, Generalization and Differential Privacy Bounds for Gradient Descent on Kolmogorov-Arnold Networks","version":3},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-16T09:34:00.409455Z"},"links":{"citing_paper":"/paper/2601.22409"},"observation_digest":"sha256:b3f6ba45e9fb44fdc74b9e9693bbed5d2ac6038705d329d78f92926b935fb443","observation_id":"3a819f6a-d280-455e-875d-77ff7d97b807","resolution":{"observed_at":"2026-05-16T09:52:42.200562Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"On the convergence and calibration of deep learning with differential privacy.Transactions on machine learning research, 2023:https–openreview","venue":null,"work_id":"f83dda76-0bb8-4584-a177-d4f21dab7e3f","year":2023},"citing_paper":{"arxiv_id":"2601.22409","last_updated":"2026-05-12T23:48:38Z","snapshot_observed_at":"2026-08-02T15:20:04.793342Z","submitted_at":"2026-01-29T23:43:26Z","title":"Optimization, Generalization and Differential Privacy Bounds for Gradient Descent on Kolmogorov-Arnold Networks","version":3},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-16T09:34:00.409455Z"},"links":{"citing_paper":"/paper/2601.22409"},"observation_digest":"sha256:511a389c29603d32761adf73be5bb09f8b60029c41496dcb68f6a25994bad627","observation_id":"213a7a6b-671d-458e-a4e8-a280d278d7a0","resolution":{"observed_at":"2026-05-16T09:52:42.093194Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Generalization bounds of stochastic gradient descent for wide and deep neural networks","venue":null,"work_id":"a7d70666-ed87-4850-9a0b-23965e982e94","year":2019},"citing_paper":{"arxiv_id":"2601.22409","last_updated":"2026-05-12T23:48:38Z","snapshot_observed_at":"2026-08-02T15:20:04.793342Z","submitted_at":"2026-01-29T23:43:26Z","title":"Optimization, Generalization and Differential Privacy Bounds for Gradient Descent on Kolmogorov-Arnold Networks","version":3},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-16T09:34:00.409455Z"},"links":{"citing_paper":"/paper/2601.22409"},"observation_digest":"sha256:bbf1c19876aedb6b968ddb855f34359eb8bc37c63e5aa714ca7ec3e4e3c7f924","observation_id":"397ef064-5176-4a29-bc60-41f0021ae8a7","resolution":{"observed_at":"2026-05-16T09:52:42.108623Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"How much over-parameterization is sufficient to learn deep relu networks? InInternational Conference on Learning Representation","venue":null,"work_id":"175b7f93-c256-4b91-9368-a015dde4113d","year":2021},"citing_paper":{"arxiv_id":"2601.22409","last_updated":"2026-05-12T23:48:38Z","snapshot_observed_at":"2026-08-02T15:20:04.793342Z","submitted_at":"2026-01-29T23:43:26Z","title":"Optimization, Generalization and Differential Privacy Bounds for Gradient Descent on Kolmogorov-Arnold Networks","version":3},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-16T09:34:00.409455Z"},"links":{"citing_paper":"/paper/2601.22409"},"observation_digest":"sha256:65d517bdd45c6c7b73b26fab37c008a098fa7ea415ee5b2be84067b263b21c91","observation_id":"713c0616-ee78-4d7b-a1b8-af05abfb2115","resolution":{"observed_at":"2026-05-16T09:52:42.080936Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Poptsova","venue":null,"work_id":"2b5fe90b-03cd-4b61-8a7b-3799ae49238f","year":2025},"citing_paper":{"arxiv_id":"2601.22409","last_updated":"2026-05-12T23:48:38Z","snapshot_observed_at":"2026-08-02T15:20:04.793342Z","submitted_at":"2026-01-29T23:43:26Z","title":"Optimization, Generalization and Differential Privacy Bounds for Gradient Descent on Kolmogorov-Arnold Networks","version":3},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-16T09:34:00.409455Z"},"links":{"citing_paper":"/paper/2601.22409"},"observation_digest":"sha256:4d25afa86f5aa3c9c2e47a692dcda129a9b4e28f142caa467d2b5d501e7b6479","observation_id":"e0937f15-f9ac-4c35-ae8e-35db5f521a81","resolution":{"observed_at":"2026-05-16T09:52:42.144752Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"The MNIST database of handwritten digit images for machine learning research.IEEE Signal Processing Magazine, 29(6):141–142","venue":null,"work_id":"81d0699a-fbaa-4a77-82c2-d07ea6bdac03","year":2012},"citing_paper":{"arxiv_id":"2601.22409","last_updated":"2026-05-12T23:48:38Z","snapshot_observed_at":"2026-08-02T15:20:04.793342Z","submitted_at":"2026-01-29T23:43:26Z","title":"Optimization, Generalization and Differential Privacy Bounds for Gradient Descent on Kolmogorov-Arnold Networks","version":3},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-16T09:34:00.409455Z"},"links":{"citing_paper":"/paper/2601.22409"},"observation_digest":"sha256:c6158fb5d13918def89a521d4cdb3cf8ef5abb7a5b2be7f9ff8678e3602781a1","observation_id":"7cecbdca-e173-4148-a022-11246eb48e46","resolution":{"observed_at":"2026-05-16T09:52:42.118937Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Gradient descent finds global minima of deep neural networks","venue":null,"work_id":"f15a66de-9e41-40d0-a18e-34e44e033212","year":2019},"citing_paper":{"arxiv_id":"2601.22409","last_updated":"2026-05-12T23:48:38Z","snapshot_observed_at":"2026-08-02T15:20:04.793342Z","submitted_at":"2026-01-29T23:43:26Z","title":"Optimization, Generalization and Differential Privacy Bounds for Gradient Descent on Kolmogorov-Arnold Networks","version":3},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-05-16T09:34:00.409455Z"},"links":{"citing_paper":"/paper/2601.22409"},"observation_digest":"sha256:111900c3eb9582903ae5eb93dd1001060c8dbc72446f09b6957583ce4c877d0d","observation_id":"2ac01eaf-e2f4-44d1-8307-da372dfbf0f8","resolution":{"observed_at":"2026-05-16T09:52:42.136191Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Calibrating noise to sensitivity in private data analysis","venue":null,"work_id":"80d79bc2-f4b4-406b-a16b-f2de8e63888a","year":2006},"citing_paper":{"arxiv_id":"2601.22409","last_updated":"2026-05-12T23:48:38Z","snapshot_observed_at":"2026-08-02T15:20:04.793342Z","submitted_at":"2026-01-29T23:43:26Z","title":"Optimization, Generalization and Differential Privacy Bounds for Gradient Descent on Kolmogorov-Arnold Networks","version":3},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-16T09:34:00.409455Z"},"links":{"citing_paper":"/paper/2601.22409"},"observation_digest":"sha256:8bfe4eaa70eae4969c0ea257e6fa5a5c31833cec1c62cc27191033416abec6ea","observation_id":"71eb2418-c181-47ef-98e8-740cfa6e3221","resolution":{"observed_at":"2026-05-16T09:52:42.180927Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"The algorithmic foundations of differential privacy.Foundations and Trends®in Theoretical Computer Science, 9(3–4):211–407","venue":null,"work_id":"b60a8b92-6008-403b-98fb-a9b086cd47b3","year":2014},"citing_paper":{"arxiv_id":"2601.22409","last_updated":"2026-05-12T23:48:38Z","snapshot_observed_at":"2026-08-02T15:20:04.793342Z","submitted_at":"2026-01-29T23:43:26Z","title":"Optimization, Generalization and Differential Privacy Bounds for Gradient Descent on Kolmogorov-Arnold Networks","version":3},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-16T09:34:00.409455Z"},"links":{"citing_paper":"/paper/2601.22409"},"observation_digest":"sha256:0031890d157f02d12bd7539edeba71ed6e0d40f469445b5c506048ad89c77f9b","observation_id":"26646c2d-6547-48d0-947c-8e1b4d4e889d","resolution":{"observed_at":"2026-05-16T09:52:42.126918Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Kan we improve on hep classification tasks? kolmogorov–arnold networks applied to an lhc physics example.Computing and Software for Big Science, 9(1):9","venue":null,"work_id":"310e7d13-3fce-4c9e-a461-40c084dbb84e","year":2025},"citing_paper":{"arxiv_id":"2601.22409","last_updated":"2026-05-12T23:48:38Z","snapshot_observed_at":"2026-08-02T15:20:04.793342Z","submitted_at":"2026-01-29T23:43:26Z","title":"Optimization, Generalization and Differential Privacy Bounds for Gradient Descent on Kolmogorov-Arnold Networks","version":3},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-05-16T09:34:00.409455Z"},"links":{"citing_paper":"/paper/2601.22409"},"observation_digest":"sha256:d646701b50cc8db74dd54a01d5fcbc909aae40dee7483d8824f07ba8692db361","observation_id":"f405f4e0-ff1e-4dcf-bbb5-c8906b70e481","resolution":{"observed_at":"2026-05-16T09:52:42.179001Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Kanice: Kolmogorov-arnold networks with interactive convolutional elements","venue":null,"work_id":"ce0248f3-28d9-4d62-b52f-803ce1b9dfd1","year":2024},"citing_paper":{"arxiv_id":"2601.22409","last_updated":"2026-05-12T23:48:38Z","snapshot_observed_at":"2026-08-02T15:20:04.793342Z","submitted_at":"2026-01-29T23:43:26Z","title":"Optimization, Generalization and Differential Privacy Bounds for Gradient Descent on Kolmogorov-Arnold Networks","version":3},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-05-16T09:34:00.409455Z"},"links":{"citing_paper":"/paper/2601.22409"},"observation_digest":"sha256:81618ce2acfc6eaccc4e63db3dd1066d0f220d68f96728ff2acbe481f34b5a73","observation_id":"79870c22-b1fd-4aa2-97d2-78e540e094b4","resolution":{"observed_at":"2026-05-16T09:52:42.076133Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Random feature amplification: Feature learning and generalization in neural networks.Journal of Machine Learning Research, 24(303):1–49","venue":null,"work_id":"ec893af6-6669-4f21-b0a1-ca7335294131","year":2023},"citing_paper":{"arxiv_id":"2601.22409","last_updated":"2026-05-12T23:48:38Z","snapshot_observed_at":"2026-08-02T15:20:04.793342Z","submitted_at":"2026-01-29T23:43:26Z","title":"Optimization, Generalization and Differential Privacy Bounds for Gradient Descent on Kolmogorov-Arnold Networks","version":3},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-05-16T09:34:00.409455Z"},"links":{"citing_paper":"/paper/2601.22409"},"observation_digest":"sha256:efdba732f37200b50ba2cdb9ec10d15a3115db7179a56cc9b976cd49aefb95e0","observation_id":"4e04f7af-c487-4cdb-861a-a30d8f09ac8d","resolution":{"observed_at":"2026-05-16T09:52:42.121478Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"On the convergence of (stochastic) gradient descent for kolmogorov– arnold networks.IEEE Transactions on Information Theory","venue":null,"work_id":"091e482c-80e8-4dcf-bbda-db0855fb244d","year":2025},"citing_paper":{"arxiv_id":"2601.22409","last_updated":"2026-05-12T23:48:38Z","snapshot_observed_at":"2026-08-02T15:20:04.793342Z","submitted_at":"2026-01-29T23:43:26Z","title":"Optimization, Generalization and Differential Privacy Bounds for Gradient Descent on Kolmogorov-Arnold Networks","version":3},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-05-16T09:34:00.409455Z"},"links":{"citing_paper":"/paper/2601.22409"},"observation_digest":"sha256:57d8658ba3130e9994ad7a7010cae578435ebe66110a6810193da0b9a5801c71","observation_id":"b399f294-169d-4311-ba82-78d8f6236e45","resolution":{"observed_at":"2026-05-16T09:52:42.113391Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.02486","last_updated":"2024-06-05T16:32:16Z","snapshot_observed_at":"2026-08-10T09:12:59.071659Z","submitted_at":"2024-06-04T16:55:42Z","title":"A Temporal Kolmogorov-Arnold Transformer for Time Series Forecasting","version":2},"cited_work":{"arxiv_id":"2406.02486","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2406.02486","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Genet and H","venue":null,"work_id":"41bdccc8-f201-4b9f-8b5d-24c56ff7f37a","year":2024},"citing_paper":{"arxiv_id":"2601.22409","last_updated":"2026-05-12T23:48:38Z","snapshot_observed_at":"2026-08-02T15:20:04.793342Z","submitted_at":"2026-01-29T23:43:26Z","title":"Optimization, Generalization and Differential Privacy Bounds for Gradient Descent on Kolmogorov-Arnold Networks","version":3},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-05-16T09:34:00.409455Z"},"links":{"cited_paper":"/paper/2406.02486","citing_paper":"/paper/2601.22409"},"observation_digest":"sha256:4178bb675441abf6e742b4cda7f2f1253d0fdff84338cdef5bc3ac75ebb98e44","observation_id":"099c2980-f851-4210-b2c8-678cd39450d9","resolution":{"observed_at":"2026-05-16T09:37:41.902465Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Neural tangent kernel: Convergence and generaliza- tion in neural networks.Advances in Neural Information Processing Systems, 31","venue":null,"work_id":"8c75551a-ab13-4e48-80de-f7f5f8f1873b","year":2018},"citing_paper":{"arxiv_id":"2601.22409","last_updated":"2026-05-12T23:48:38Z","snapshot_observed_at":"2026-08-02T15:20:04.793342Z","submitted_at":"2026-01-29T23:43:26Z","title":"Optimization, Generalization and Differential Privacy Bounds for Gradient Descent on Kolmogorov-Arnold Networks","version":3},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-05-16T09:34:00.409455Z"},"links":{"citing_paper":"/paper/2601.22409"},"observation_digest":"sha256:acaf05438261c8717f00b126b833dc3f46f885f0edbb154b380e5079b6f88413","observation_id":"67f16b3d-c195-45b2-b126-1bbf74715f75","resolution":{"observed_at":"2026-05-16T09:52:42.124211Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Polylogarithmic width suffices for gradient descent to achieve arbitrarily small test error with shallow relu networks","venue":null,"work_id":"d54fb09d-f187-406a-be15-2d48b7b2bca3","year":2020},"citing_paper":{"arxiv_id":"2601.22409","last_updated":"2026-05-12T23:48:38Z","snapshot_observed_at":"2026-08-02T15:20:04.793342Z","submitted_at":"2026-01-29T23:43:26Z","title":"Optimization, Generalization and Differential Privacy Bounds for Gradient Descent on Kolmogorov-Arnold Networks","version":3},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-05-16T09:34:00.409455Z"},"links":{"citing_paper":"/paper/2601.22409"},"observation_digest":"sha256:4fa2cfcb34081fe10ffa892162b6f43eeaac0f581c3ac220f244ab322517dfe2","observation_id":"46a3c3cc-8b31-4f89-bd0d-1deb6bb0f9a0","resolution":{"observed_at":"2026-05-16T09:52:42.099775Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"db9ce4c1-92e9-4aaf-8142-46648e09ec9f","year":1963},"citing_paper":{"arxiv_id":"2601.22409","last_updated":"2026-05-12T23:48:38Z","snapshot_observed_at":"2026-08-02T15:20:04.793342Z","submitted_at":"2026-01-29T23:43:26Z","title":"Optimization, Generalization and Differential Privacy Bounds for Gradient Descent on Kolmogorov-Arnold Networks","version":3},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-05-16T09:34:00.409455Z"},"links":{"citing_paper":"/paper/2601.22409"},"observation_digest":"sha256:29fbfc4cba55dd3ca6e5351cd023aeb56565e72fac45d1833a3b1f9a2ef1a6b6","observation_id":"a372b194-10d1-428e-bdc2-e9f2b55e3520","resolution":{"observed_at":"2026-05-16T09:52:42.222018Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Stability and generalization analysis of gradient methods for shallow neural networks","venue":null,"work_id":"dde6ca43-9ac4-4ad9-8f24-f56fb76ada95","year":2022},"citing_paper":{"arxiv_id":"2601.22409","last_updated":"2026-05-12T23:48:38Z","snapshot_observed_at":"2026-08-02T15:20:04.793342Z","submitted_at":"2026-01-29T23:43:26Z","title":"Optimization, Generalization and Differential Privacy Bounds for Gradient Descent on Kolmogorov-Arnold Networks","version":3},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-05-16T09:34:00.409455Z"},"links":{"citing_paper":"/paper/2601.22409"},"observation_digest":"sha256:ee7ebbb18a7d15a48a173fa7d6c5f0dc5414992fcb10ed404b3bc14827b4d76e","observation_id":"19327125-b764-46de-8b9d-890673a86394","resolution":{"observed_at":"2026-05-16T09:52:42.090761Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Fine-grained analysis of stability and generalization for stochastic gradient descent","venue":null,"work_id":"a5293930-5918-4a03-806d-283ea2fd52e5","year":2020},"citing_paper":{"arxiv_id":"2601.22409","last_updated":"2026-05-12T23:48:38Z","snapshot_observed_at":"2026-08-02T15:20:04.793342Z","submitted_at":"2026-01-29T23:43:26Z","title":"Optimization, Generalization and Differential Privacy Bounds for Gradient Descent on Kolmogorov-Arnold Networks","version":3},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-05-16T09:34:00.409455Z"},"links":{"citing_paper":"/paper/2601.22409"},"observation_digest":"sha256:999b685d11681bdb0cf9ff60e62bdfa7bfff14934c82ba2444b889a184be8eb0","observation_id":"861e1f41-e1df-4c31-a1f8-a6e2baef0dd1","resolution":{"observed_at":"2026-05-16T09:52:42.104106Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Kolmogorov–arnold graph neural networks for molecular property prediction.Nature Machine Intelligence, 7:1346–1354, 08 2025","venue":null,"work_id":"bb896d27-1033-44da-b32e-83328248fcbf","year":2025},"citing_paper":{"arxiv_id":"2601.22409","last_updated":"2026-05-12T23:48:38Z","snapshot_observed_at":"2026-08-02T15:20:04.793342Z","submitted_at":"2026-01-29T23:43:26Z","title":"Optimization, Generalization and Differential Privacy Bounds for Gradient Descent on Kolmogorov-Arnold Networks","version":3},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-05-16T09:34:00.409455Z"},"links":{"citing_paper":"/paper/2601.22409"},"observation_digest":"sha256:75817b25fe01362c6d932ec99852a6bea703962f1f190e1c6eb0729734e7a9c3","observation_id":"c127d226-7745-4915-bc7b-ea3ee9dde625","resolution":{"observed_at":"2026-05-16T09:52:42.142780Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Generalization bounds for kolmogorov- arnold networks (kans) and enhanced kans with lower lipschitz complexity","venue":null,"work_id":"34986436-f1c4-4531-8707-fbae6d7b29ca","year":2025},"citing_paper":{"arxiv_id":"2601.22409","last_updated":"2026-05-12T23:48:38Z","snapshot_observed_at":"2026-08-02T15:20:04.793342Z","submitted_at":"2026-01-29T23:43:26Z","title":"Optimization, Generalization and Differential Privacy Bounds for Gradient Descent on Kolmogorov-Arnold Networks","version":3},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-05-16T09:34:00.409455Z"},"links":{"citing_paper":"/paper/2601.22409"},"observation_digest":"sha256:441271449e73bb95ad09963e6aa2ffb140fd8c7bab28e7df26b32b4c6ecf3278","observation_id":"dcf92e30-d272-4cc2-a354-222dc1f6d926","resolution":{"observed_at":"2026-05-16T09:52:42.193326Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2509.19830","last_updated":"2026-07-30T07:35:07Z","snapshot_observed_at":"2026-08-09T19:58:47.736942Z","submitted_at":"2025-09-24T07:22:03Z","title":"On the Rate of Convergence of Kolmogorov-Arnold Network Regression Estimators","version":3},"cited_work":{"arxiv_id":"2509.19830","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2509.19830","snapshot_observed_at":"2026-07-31T02:03:00.293982Z","title":"On the rate of convergence of K olmogorov-Arnold Network regression estimators","venue":null,"work_id":"d57a91d2-8cdc-418f-b1ba-8a79d77e8fec","year":2025},"citing_paper":{"arxiv_id":"2601.22409","last_updated":"2026-05-12T23:48:38Z","snapshot_observed_at":"2026-08-02T15:20:04.793342Z","submitted_at":"2026-01-29T23:43:26Z","title":"Optimization, Generalization and Differential Privacy Bounds for Gradient Descent on Kolmogorov-Arnold Networks","version":3},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-05-16T09:34:00.409455Z"},"links":{"cited_paper":"/paper/2509.19830","citing_paper":"/paper/2601.22409"},"observation_digest":"sha256:1af88c7359224e6ffdf484a7cdd9cb4e403de0914362ce98b351a26d906d51c5","observation_id":"68f036c3-db79-4c60-bd48-1125364bc01c","resolution":{"observed_at":"2026-07-31T02:03:00.293982Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Kan: Kolmogorov-arnold networks","venue":null,"work_id":"b9ee82db-96e9-4855-abb3-e07fe60d8213","year":2025},"citing_paper":{"arxiv_id":"2601.22409","last_updated":"2026-05-12T23:48:38Z","snapshot_observed_at":"2026-08-02T15:20:04.793342Z","submitted_at":"2026-01-29T23:43:26Z","title":"Optimization, Generalization and Differential Privacy Bounds for Gradient Descent on Kolmogorov-Arnold Networks","version":3},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-05-16T09:34:00.409455Z"},"links":{"citing_paper":"/paper/2601.22409"},"observation_digest":"sha256:32df12dd7425915aa7995874a69de2b7a4387222159b4616275732d90bd28846","observation_id":"737ff09d-97a4-4f0a-bd77-5b82484a17b1","resolution":{"observed_at":"2026-05-16T09:52:42.217385Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"How to make the gradients small privately: Improved rates for differentially private non-convex optimization","venue":null,"work_id":"4adcce33-e39b-4fc6-a166-1c46dc84a67f","year":2024},"citing_paper":{"arxiv_id":"2601.22409","last_updated":"2026-05-12T23:48:38Z","snapshot_observed_at":"2026-08-02T15:20:04.793342Z","submitted_at":"2026-01-29T23:43:26Z","title":"Optimization, Generalization and Differential Privacy Bounds for Gradient Descent on Kolmogorov-Arnold Networks","version":3},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-05-16T09:34:00.409455Z"},"links":{"citing_paper":"/paper/2601.22409"},"observation_digest":"sha256:d38fa815a48b351c983f03683756aab2f816f953fe023b32cb78d84d67e8c301","observation_id":"c65de89a-245e-4b26-8043-bfe44115ab7b","resolution":{"observed_at":"2026-05-16T09:52:42.083338Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"R´ enyi differential privacy","venue":null,"work_id":"adf2f0c9-dade-49e1-a0bf-51cdd841bdf6","year":2017},"citing_paper":{"arxiv_id":"2601.22409","last_updated":"2026-05-12T23:48:38Z","snapshot_observed_at":"2026-08-02T15:20:04.793342Z","submitted_at":"2026-01-29T23:43:26Z","title":"Optimization, Generalization and Differential Privacy Bounds for Gradient Descent on Kolmogorov-Arnold Networks","version":3},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-05-16T09:34:00.409455Z"},"links":{"citing_paper":"/paper/2601.22409"},"observation_digest":"sha256:dde54271ab61c9b8648257f55175f541e4f1706c78c28dda87b1b75c16704ae1","observation_id":"92b20790-f2ca-456e-a6c0-39b1fcae6d05","resolution":{"observed_at":"2026-05-16T09:52:42.106274Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"How many neurons do we need? a refined analysis for shallow networks trained with gradient descent.Journal of Statistical Planning and Inference, page 106169","venue":null,"work_id":"0b0bf7b6-d3d7-4827-bfb2-4886ccb9cc93","year":2024},"citing_paper":{"arxiv_id":"2601.22409","last_updated":"2026-05-12T23:48:38Z","snapshot_observed_at":"2026-08-02T15:20:04.793342Z","submitted_at":"2026-01-29T23:43:26Z","title":"Optimization, Generalization and Differential Privacy Bounds for Gradient Descent on Kolmogorov-Arnold Networks","version":3},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-05-16T09:34:00.409455Z"},"links":{"citing_paper":"/paper/2601.22409"},"observation_digest":"sha256:82bd401285157ca1cca7d38de511f2c42f68d2cfb26f1408644315c7e95171ae","observation_id":"49062ed0-cb55-4764-8b77-6ded77e2f443","resolution":{"observed_at":"2026-05-16T09:52:42.140626Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1905.09870","last_updated":"2020-03-18T13:59:10Z","snapshot_observed_at":"2026-07-06T07:55:05.948249Z","submitted_at":"2019-05-23T18:57:35Z","title":"Gradient Descent can Learn Less Over-parameterized Two-layer Neural Networks on Classification Problems","version":3},"cited_work":{"arxiv_id":"1905.09870","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1905.09870","snapshot_observed_at":"2026-07-04T14:49:54.902609Z","title":"Gradient descent can learn less over-parameterized two-layer neural networks on classification problems","venue":null,"work_id":"3c14153d-16cf-45c5-92f8-fd04a748489e","year":1905},"citing_paper":{"arxiv_id":"2601.22409","last_updated":"2026-05-12T23:48:38Z","snapshot_observed_at":"2026-08-02T15:20:04.793342Z","submitted_at":"2026-01-29T23:43:26Z","title":"Optimization, Generalization and Differential Privacy Bounds for Gradient Descent on Kolmogorov-Arnold Networks","version":3},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-05-16T09:34:00.409455Z"},"links":{"cited_paper":"/paper/1905.09870","citing_paper":"/paper/2601.22409"},"observation_digest":"sha256:85f964c5c054d8e39b196bef2ae8be4dad7829863b48bc0bd5be94a16d311dc7","observation_id":"6dba53df-2264-4032-b059-820247e2d77d","resolution":{"observed_at":"2026-05-16T09:37:41.914956Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Optimal rates for averaged stochastic gradient descent under neural tangent kernel regime","venue":null,"work_id":"4a2ffa78-9281-4437-83ea-c64aae144c3c","year":2021},"citing_paper":{"arxiv_id":"2601.22409","last_updated":"2026-05-12T23:48:38Z","snapshot_observed_at":"2026-08-02T15:20:04.793342Z","submitted_at":"2026-01-29T23:43:26Z","title":"Optimization, Generalization and Differential Privacy Bounds for Gradient Descent on Kolmogorov-Arnold Networks","version":3},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-05-16T09:34:00.409455Z"},"links":{"citing_paper":"/paper/2601.22409"},"observation_digest":"sha256:f49ce83f3bbeaeef8016e664a48fb30a636eab84dfaeb037db1cf46bdbfc6c3e","observation_id":"970775ab-d3fe-4ac2-a7e8-7aa17c2611d8","resolution":{"observed_at":"2026-05-16T09:52:42.149567Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Overparameterized nonlinear learning: Gradient descent takes the shortest path? InInternational Conference on Machine Learning, pages 4951–4960","venue":null,"work_id":"30b12925-61b0-4299-8955-382298941363","year":2019},"citing_paper":{"arxiv_id":"2601.22409","last_updated":"2026-05-12T23:48:38Z","snapshot_observed_at":"2026-08-02T15:20:04.793342Z","submitted_at":"2026-01-29T23:43:26Z","title":"Optimization, Generalization and Differential Privacy Bounds for Gradient Descent on Kolmogorov-Arnold Networks","version":3},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-05-16T09:34:00.409455Z"},"links":{"citing_paper":"/paper/2601.22409"},"observation_digest":"sha256:fae040b8c40c217a80a6d1d2a7f6ac64ba1c0563d274f90b3fd803792c34398b","observation_id":"08f02bac-75aa-49b3-97b2-3e55ba3bcd10","resolution":{"observed_at":"2026-05-16T09:52:42.154205Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Physics informed kolmogorov-arnold neural networks for dynamical analysis via efficient-kan and wav-kan.Journal of Machine Learning Research, 26(233):1–39","venue":null,"work_id":"52fbe06d-3c95-43f4-be60-af3018bcf2aa","year":2025},"citing_paper":{"arxiv_id":"2601.22409","last_updated":"2026-05-12T23:48:38Z","snapshot_observed_at":"2026-08-02T15:20:04.793342Z","submitted_at":"2026-01-29T23:43:26Z","title":"Optimization, Generalization and Differential Privacy Bounds for Gradient Descent on Kolmogorov-Arnold Networks","version":3},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-05-16T09:34:00.409455Z"},"links":{"citing_paper":"/paper/2601.22409"},"observation_digest":"sha256:4d74e0c810d82e517ed814e632185326b2ba384ad2475890ab4d428c7a2152f8","observation_id":"6393429e-6c10-4771-b8fd-08f38dd21563","resolution":{"observed_at":"2026-05-16T09:52:42.071243Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Finding local diffusion schrodinger bridge using kolmogorov-arnold network","venue":null,"work_id":"544eaa74-019b-4ccc-86ba-e7794d3800e7","year":2025},"citing_paper":{"arxiv_id":"2601.22409","last_updated":"2026-05-12T23:48:38Z","snapshot_observed_at":"2026-08-02T15:20:04.793342Z","submitted_at":"2026-01-29T23:43:26Z","title":"Optimization, Generalization and Differential Privacy Bounds for Gradient Descent on Kolmogorov-Arnold Networks","version":3},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-05-16T09:34:00.409455Z"},"links":{"citing_paper":"/paper/2601.22409"},"observation_digest":"sha256:e46c4ed1ef648acb8561857bea325795eca5d3bc1c444d41ba1c986c03d13378","observation_id":"67fd5b45-ecdd-4379-ac6e-03c29b9cfd75","resolution":{"observed_at":"2026-05-16T09:52:42.219775Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2408.14780","last_updated":"2024-08-28T15:48:31Z","snapshot_observed_at":"2026-08-08T18:56:24.956121Z","submitted_at":"2024-08-27T04:57:53Z","title":"GINN-KAN: Interpretability pipelining with applications in Physics Informed Neural Networks","version":2},"cited_work":{"arxiv_id":"2408.14780","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2408.14780","snapshot_observed_at":"2026-07-04T11:49:50.826554Z","title":"GI NN-KAN: Interpretability pipelining with applications in physics-informed neural networks","venue":null,"work_id":"22474590-cdfe-4e7f-aed1-14ed09077af7","year":2024},"citing_paper":{"arxiv_id":"2601.22409","last_updated":"2026-05-12T23:48:38Z","snapshot_observed_at":"2026-08-02T15:20:04.793342Z","submitted_at":"2026-01-29T23:43:26Z","title":"Optimization, Generalization and Differential Privacy Bounds for Gradient Descent on Kolmogorov-Arnold Networks","version":3},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-05-16T09:34:00.409455Z"},"links":{"cited_paper":"/paper/2408.14780","citing_paper":"/paper/2601.22409"},"observation_digest":"sha256:bca838afae8bc9834f7be5e8c3744bab713ac15da2c479e10693de577637bad0","observation_id":"106ba418-0ff1-4def-ac35-5eaa346e815a","resolution":{"observed_at":"2026-05-16T09:37:41.919196Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Stability & generalisation of gradient descent for shallow neural networks without the neural tangent kernel","venue":null,"work_id":"6543c4ab-a287-4ab4-aaef-e04ea620fc2c","year":2021},"citing_paper":{"arxiv_id":"2601.22409","last_updated":"2026-05-12T23:48:38Z","snapshot_observed_at":"2026-08-02T15:20:04.793342Z","submitted_at":"2026-01-29T23:43:26Z","title":"Optimization, Generalization and Differential Privacy Bounds for Gradient Descent on Kolmogorov-Arnold Networks","version":3},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-05-16T09:34:00.409455Z"},"links":{"citing_paper":"/paper/2601.22409"},"observation_digest":"sha256:72c364cdffed64f2b2a7c7075a064c9bfd008732414cf12d8fbd9bd46f91e66b","observation_id":"8add594f-0662-4cbe-bc1b-4a7621164aac","resolution":{"observed_at":"2026-05-16T09:52:42.166811Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Convex approximation of two-layer relu networks for hidden state differential privacy","venue":null,"work_id":"30dcf9e9-40f7-41b2-8098-dd483698f70d","year":2025},"citing_paper":{"arxiv_id":"2601.22409","last_updated":"2026-05-12T23:48:38Z","snapshot_observed_at":"2026-08-02T15:20:04.793342Z","submitted_at":"2026-01-29T23:43:26Z","title":"Optimization, Generalization and Differential Privacy Bounds for Gradient Descent on Kolmogorov-Arnold Networks","version":3},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-05-16T09:34:00.409455Z"},"links":{"citing_paper":"/paper/2601.22409"},"observation_digest":"sha256:14ea34853191458e29902a56604f8dd3e21f3691e933d845395ee2a501d4b4fb","observation_id":"cb75175d-905e-4b0f-9e67-ed62b0c2db93","resolution":{"observed_at":"2026-05-16T09:52:42.138282Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Stability vs implicit bias of gradient methods on separable data and beyond","venue":null,"work_id":"20b36fe4-78f8-49ad-ba62-4f139027c987","year":2022},"citing_paper":{"arxiv_id":"2601.22409","last_updated":"2026-05-12T23:48:38Z","snapshot_observed_at":"2026-08-02T15:20:04.793342Z","submitted_at":"2026-01-29T23:43:26Z","title":"Optimization, Generalization and Differential Privacy Bounds for Gradient Descent on Kolmogorov-Arnold Networks","version":3},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-05-16T09:34:00.409455Z"},"links":{"citing_paper":"/paper/2601.22409"},"observation_digest":"sha256:dc523133038638e7b1244031c0f257849d8392a0577d7e503708df00daafc5c9","observation_id":"52be2ace-eeee-4eb1-96ef-a5880d9231e2","resolution":{"observed_at":"2026-05-16T09:52:42.164865Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Towards understanding generalization in dp-gd: A case study in training two-layer cnns","venue":null,"work_id":"bc61713a-223a-4019-906a-07e9aa732a20","year":2026},"citing_paper":{"arxiv_id":"2601.22409","last_updated":"2026-05-12T23:48:38Z","snapshot_observed_at":"2026-08-02T15:20:04.793342Z","submitted_at":"2026-01-29T23:43:26Z","title":"Optimization, Generalization and Differential Privacy Bounds for Gradient Descent on Kolmogorov-Arnold Networks","version":3},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-05-16T09:34:00.409455Z"},"links":{"citing_paper":"/paper/2601.22409"},"observation_digest":"sha256:8ed4ad13a88e92c51ce873a0b6f99bfc426752b1af43cc7c0901512998a01f54","observation_id":"54ab6267-76c1-4bd1-acc9-8b4150b3f875","resolution":{"observed_at":"2026-05-16T09:52:42.160762Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"9cf6de4e-7130-4e05-9ae7-0034c9bb4375","year":2024},"citing_paper":{"arxiv_id":"2601.22409","last_updated":"2026-05-12T23:48:38Z","snapshot_observed_at":"2026-08-02T15:20:04.793342Z","submitted_at":"2026-01-29T23:43:26Z","title":"Optimization, Generalization and Differential Privacy Bounds for Gradient Descent on Kolmogorov-Arnold Networks","version":3},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-05-16T09:34:00.409455Z"},"links":{"citing_paper":"/paper/2601.22409"},"observation_digest":"sha256:3e507e8e6517ea68f09bda9eda5a39bfdb97dde3cdf7f7ba0646aa5d3c683282","observation_id":"2cb0cfbe-9f10-43ff-be24-9576d067199d","resolution":{"observed_at":"2026-05-16T09:52:42.211935Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"A survey on kolmogorov-arnold network.ACM Computing Surveys, 58(2):1–35","venue":null,"work_id":"ec279199-dfa2-4144-b922-1b8464cf6a2b","year":2025},"citing_paper":{"arxiv_id":"2601.22409","last_updated":"2026-05-12T23:48:38Z","snapshot_observed_at":"2026-08-02T15:20:04.793342Z","submitted_at":"2026-01-29T23:43:26Z","title":"Optimization, Generalization and Differential Privacy Bounds for Gradient Descent on Kolmogorov-Arnold Networks","version":3},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-05-16T09:34:00.409455Z"},"links":{"citing_paper":"/paper/2601.22409"},"observation_digest":"sha256:78c3b9bbd1874f8517c4dee63c9d0a38c8f85604ca8db3c17df30b36311eceaf","observation_id":"e7b34884-16e5-429c-9577-cdaa8fa6a9c8","resolution":{"observed_at":"2026-05-16T09:52:42.110910Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Stochastic gradient descent with differentially private updates","venue":null,"work_id":"e98cd9e7-8cb8-46aa-8d53-07f801e6bd59","year":2013},"citing_paper":{"arxiv_id":"2601.22409","last_updated":"2026-05-12T23:48:38Z","snapshot_observed_at":"2026-08-02T15:20:04.793342Z","submitted_at":"2026-01-29T23:43:26Z","title":"Optimization, Generalization and Differential Privacy Bounds for Gradient Descent on Kolmogorov-Arnold Networks","version":3},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-05-16T09:34:00.409455Z"},"links":{"citing_paper":"/paper/2601.22409"},"observation_digest":"sha256:413be1beeb9ae6674f01f77473b68c13c3eee0b19f22c8fa91d8155fb1e5e7db","observation_id":"eee27ccd-aafc-4b8e-8121-2b0503dda13d","resolution":{"observed_at":"2026-05-16T09:52:42.205867Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Kan-ddpm: Kolmogorov-arnold networks with diffusion denoising probabilistic models for mri-to-ct synthesis","venue":null,"work_id":"b6cd27fa-7040-47db-b761-0c9fd40550c0","year":2025},"citing_paper":{"arxiv_id":"2601.22409","last_updated":"2026-05-12T23:48:38Z","snapshot_observed_at":"2026-08-02T15:20:04.793342Z","submitted_at":"2026-01-29T23:43:26Z","title":"Optimization, Generalization and Differential Privacy Bounds for Gradient Descent on Kolmogorov-Arnold Networks","version":3},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-05-16T09:34:00.409455Z"},"links":{"citing_paper":"/paper/2601.22409"},"observation_digest":"sha256:f1eb05298c6dd33dde7d6ad0f0c40ab3e404a6bd325803da4068dc03cb27d1b8","observation_id":"6e200242-ba94-4725-9a27-8ca88193107a","resolution":{"observed_at":"2026-05-16T09:52:42.185514Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Generalization and stability of interpolating neural networks with minimal width.Journal of Machine Learning Research, 25(156):1–41","venue":null,"work_id":"1c9b110e-5b7b-4c51-8063-4b219eb82eaf","year":2024},"citing_paper":{"arxiv_id":"2601.22409","last_updated":"2026-05-12T23:48:38Z","snapshot_observed_at":"2026-08-02T15:20:04.793342Z","submitted_at":"2026-01-29T23:43:26Z","title":"Optimization, Generalization and Differential Privacy Bounds for Gradient Descent on Kolmogorov-Arnold Networks","version":3},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-05-16T09:34:00.409455Z"},"links":{"citing_paper":"/paper/2601.22409"},"observation_digest":"sha256:39e1ef3a0d2309615b75512886f03b6965164c375801733ebdcb5473e353ee68","observation_id":"5d822cd8-05fc-44c0-864f-fe02745c353e","resolution":{"observed_at":"2026-05-16T09:52:42.162978Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Sharper guarantees for learning neural network classifiers with gradient methods","venue":null,"work_id":"f73c19e2-e881-4bbb-b276-2159f47c06fc","year":2025},"citing_paper":{"arxiv_id":"2601.22409","last_updated":"2026-05-12T23:48:38Z","snapshot_observed_at":"2026-08-02T15:20:04.793342Z","submitted_at":"2026-01-29T23:43:26Z","title":"Optimization, Generalization and Differential Privacy Bounds for Gradient Descent on Kolmogorov-Arnold Networks","version":3},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-05-16T09:34:00.409455Z"},"links":{"citing_paper":"/paper/2601.22409"},"observation_digest":"sha256:0f6ec9f5c921d6828614400912d79685672f353328a3375e2c4b1637bcd755ef","observation_id":"dd70a752-fd68-4f61-bd2e-fd3727143a1c","resolution":{"observed_at":"2026-05-16T09:52:42.073706Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2405.08790","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Kolmogorov-arnold networks (kans) for time series analysis","venue":null,"work_id":"a57e8c23-04de-430f-b6c8-d7f0c40701e8","year":2024},"citing_paper":{"arxiv_id":"2601.22409","last_updated":"2026-05-12T23:48:38Z","snapshot_observed_at":"2026-08-02T15:20:04.793342Z","submitted_at":"2026-01-29T23:43:26Z","title":"Optimization, Generalization and Differential Privacy Bounds for Gradient Descent on Kolmogorov-Arnold Networks","version":3},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-05-16T09:34:00.409455Z"},"links":{"citing_paper":"/paper/2601.22409"},"observation_digest":"sha256:7aea6a7ef62f0f1c380a1aed568b010ef55da8c53ef43e0c605e74788ba4e153","observation_id":"6ec38a25-9694-4fb2-a290-e78cfe35d668","resolution":{"observed_at":"2026-05-16T09:37:41.910943Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Cambridge university press","venue":null,"work_id":"78653c9b-dc41-4584-9640-a0e0fa4b1feb","year":2018},"citing_paper":{"arxiv_id":"2601.22409","last_updated":"2026-05-12T23:48:38Z","snapshot_observed_at":"2026-08-02T15:20:04.793342Z","submitted_at":"2026-01-29T23:43:26Z","title":"Optimization, Generalization and Differential Privacy Bounds for Gradient Descent on Kolmogorov-Arnold Networks","version":3},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-05-16T09:34:00.409455Z"},"links":{"citing_paper":"/paper/2601.22409"},"observation_digest":"sha256:31b460333b77e65543d7eb54a04a01b2f812d0f40c4d152acc0b3791b91fe882","observation_id":"16f968e4-7d40-400e-be09-0e100db8d989","resolution":{"observed_at":"2026-05-16T09:52:42.116779Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T18:37:31.770062Z","title":"Cambridge university press","venue":null,"work_id":"b0eea950-365e-42de-8c6f-7fef77c08aba","year":2019},"citing_paper":{"arxiv_id":"2601.22409","last_updated":"2026-05-12T23:48:38Z","snapshot_observed_at":"2026-08-02T15:20:04.793342Z","submitted_at":"2026-01-29T23:43:26Z","title":"Optimization, Generalization and Differential Privacy Bounds for Gradient Descent on Kolmogorov-Arnold Networks","version":3},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-05-16T09:34:00.409455Z"},"links":{"citing_paper":"/paper/2601.22409"},"observation_digest":"sha256:6e884139bb108c394fdd13fdd444465ffba45834c6082f9c92cd0d6c61eee8e1","observation_id":"434ea447-d3bc-42d9-a204-aa0b695eacb0","resolution":{"observed_at":"2026-05-16T09:52:42.168620Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Differentially private empirical risk minimization with non-convex loss functions","venue":null,"work_id":"25964e50-a3ab-47ca-9c3c-b6bb66cd0dde","year":2019},"citing_paper":{"arxiv_id":"2601.22409","last_updated":"2026-05-12T23:48:38Z","snapshot_observed_at":"2026-08-02T15:20:04.793342Z","submitted_at":"2026-01-29T23:43:26Z","title":"Optimization, Generalization and Differential Privacy Bounds for Gradient Descent on Kolmogorov-Arnold Networks","version":3},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-05-16T09:34:00.409455Z"},"links":{"citing_paper":"/paper/2601.22409"},"observation_digest":"sha256:407526a9189e8b1f6e5199fa6884c1b97bb1d3b707910443492ca027acb06ccd","observation_id":"be5d6442-cc8c-46fe-9fc5-b933e09e2b35","resolution":{"observed_at":"2026-05-16T09:52:42.195744Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Optimal utility bounds for differentially private gradient descent in three-layer neural networks","venue":null,"work_id":"8887bc3f-3a32-4c09-8ee2-6a4bd9ca950f","year":2025},"citing_paper":{"arxiv_id":"2601.22409","last_updated":"2026-05-12T23:48:38Z","snapshot_observed_at":"2026-08-02T15:20:04.793342Z","submitted_at":"2026-01-29T23:43:26Z","title":"Optimization, Generalization and Differential Privacy Bounds for Gradient Descent on Kolmogorov-Arnold Networks","version":3},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-05-16T09:34:00.409455Z"},"links":{"citing_paper":"/paper/2601.22409"},"observation_digest":"sha256:0b1f0efdd00f5fcc997a4634f6a5bc5faae1e53d4b7e04b7f60d5594fb4f9a54","observation_id":"742a6f20-263f-4cec-bbf2-7ba4a1af9246","resolution":{"observed_at":"2026-05-16T09:52:42.214629Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Generalization guarantees of gradient descent for shallow neural networks.Neural Computation, 37(2):344–402","venue":null,"work_id":"ab729d33-8a38-491c-b60f-7c2f868c15a2","year":2025},"citing_paper":{"arxiv_id":"2601.22409","last_updated":"2026-05-12T23:48:38Z","snapshot_observed_at":"2026-08-02T15:20:04.793342Z","submitted_at":"2026-01-29T23:43:26Z","title":"Optimization, Generalization and Differential Privacy Bounds for Gradient Descent on Kolmogorov-Arnold Networks","version":3},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-05-16T09:34:00.409455Z"},"links":{"citing_paper":"/paper/2601.22409"},"observation_digest":"sha256:db64a5d35daf1140d3059feedc79f5866a3b1413a1cebf964a76496e6a5552d9","observation_id":"e24d8f26-4b07-44d7-b3bb-faf104fdc6ff","resolution":{"observed_at":"2026-05-16T09:52:42.156494Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"On the expressiveness and spectral bias of kans","venue":null,"work_id":"d335e67e-8b7e-4f4f-aadc-bec7eebcc535","year":2025},"citing_paper":{"arxiv_id":"2601.22409","last_updated":"2026-05-12T23:48:38Z","snapshot_observed_at":"2026-08-02T15:20:04.793342Z","submitted_at":"2026-01-29T23:43:26Z","title":"Optimization, Generalization and Differential Privacy Bounds for Gradient Descent on Kolmogorov-Arnold Networks","version":3},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-05-16T09:34:00.409455Z"},"links":{"citing_paper":"/paper/2601.22409"},"observation_digest":"sha256:a8578ac2b28689386db468665239ee39a929d87e711c6897cd55675b571b5f4a","observation_id":"64c63eb1-ef50-4933-930d-fa205f2b88a5","resolution":{"observed_at":"2026-05-16T09:52:42.088450Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Kolmogorov–arnold-informed neural network: A physics-informed deep learning framework for solving forward and inverse problems based on kolmogorov–arnold networks","venue":null,"work_id":"81a9f43d-9346-4a9a-9dbd-e4f537985b16","year":2025},"citing_paper":{"arxiv_id":"2601.22409","last_updated":"2026-05-12T23:48:38Z","snapshot_observed_at":"2026-08-02T15:20:04.793342Z","submitted_at":"2026-01-29T23:43:26Z","title":"Optimization, Generalization and Differential Privacy Bounds for Gradient Descent on Kolmogorov-Arnold Networks","version":3},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-05-16T09:34:00.409455Z"},"links":{"citing_paper":"/paper/2601.22409"},"observation_digest":"sha256:d29187bf0f9829d642f64411cd958cc0750d7a83b048cded428aad1a6d240093","observation_id":"8e97bf44-1f32-4958-86f0-e3197086ee50","resolution":{"observed_at":"2026-05-16T09:52:42.152021Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"A conditional kan diffusion network for human activity recognition with missing sensor signal series","venue":null,"work_id":"80203cd0-4d9c-491e-92c5-13ac2d4e869f","year":2025},"citing_paper":{"arxiv_id":"2601.22409","last_updated":"2026-05-12T23:48:38Z","snapshot_observed_at":"2026-08-02T15:20:04.793342Z","submitted_at":"2026-01-29T23:43:26Z","title":"Optimization, Generalization and Differential Privacy Bounds for Gradient Descent on Kolmogorov-Arnold Networks","version":3},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-05-16T09:34:00.409455Z"},"links":{"citing_paper":"/paper/2601.22409"},"observation_digest":"sha256:355cfeda977b027209928a01832a6fd2d6e6b3fe691e2b1467e5ecc3545f426a","observation_id":"48523ba6-c387-4408-86d1-22a2f34f989c","resolution":{"observed_at":"2026-05-16T09:52:42.097571Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Efficient private erm for smooth objectives","venue":null,"work_id":"9887f44c-9424-4218-abe5-82d73e858d1f","year":2017},"citing_paper":{"arxiv_id":"2601.22409","last_updated":"2026-05-12T23:48:38Z","snapshot_observed_at":"2026-08-02T15:20:04.793342Z","submitted_at":"2026-01-29T23:43:26Z","title":"Optimization, Generalization and Differential Privacy Bounds for Gradient Descent on Kolmogorov-Arnold Networks","version":3},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-05-16T09:34:00.409455Z"},"links":{"citing_paper":"/paper/2601.22409"},"observation_digest":"sha256:803225a45f6be81ad92661788b115e67ec6bccb09d12576c37931036ad0bdb17","observation_id":"a98f590c-5738-4fc3-a5ea-1afeb6e99a15","resolution":{"observed_at":"2026-05-16T09:52:42.198058Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Generalization bounds and model complexity for kolmogorov-arnold networks","venue":null,"work_id":"01879160-4584-4360-a140-1d0d403dcf88","year":2025},"citing_paper":{"arxiv_id":"2601.22409","last_updated":"2026-05-12T23:48:38Z","snapshot_observed_at":"2026-08-02T15:20:04.793342Z","submitted_at":"2026-01-29T23:43:26Z","title":"Optimization, Generalization and Differential Privacy Bounds for Gradient Descent on Kolmogorov-Arnold Networks","version":3},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-05-16T09:34:00.409455Z"},"links":{"citing_paper":"/paper/2601.22409"},"observation_digest":"sha256:803895d1d3f462c768f0454fd5d319f23c9b8263c35db7f49ea468f3fe4e8d60","observation_id":"1ae61529-86c7-464f-aeb0-9b630b2777a7","resolution":{"observed_at":"2026-05-16T09:52:42.174434Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"with probability at least 1−δ","venue":null,"work_id":"c0c536eb-20d4-44a8-af66-de28aba77606","year":2020},"citing_paper":{"arxiv_id":"2601.22409","last_updated":"2026-05-12T23:48:38Z","snapshot_observed_at":"2026-08-02T15:20:04.793342Z","submitted_at":"2026-01-29T23:43:26Z","title":"Optimization, Generalization and Differential Privacy Bounds for Gradient Descent on Kolmogorov-Arnold Networks","version":3},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-05-16T09:34:00.409455Z"},"links":{"citing_paper":"/paper/2601.22409"},"observation_digest":"sha256:7e03100f6898adaa087e6af49ead7a27821be024d9d8031d790c04cbce49ba04","observation_id":"2a97004d-bfbd-4fd2-8135-889d70e54c24","resolution":{"observed_at":"2026-05-16T09:52:42.190258Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"λmin ∇2LS(Θα,t) ≥ − cmax√m LS(Θα,t).(19) wherec max =C σ,b p 3 2 p log( m δ ) + √p+ 3 Θ(0)−Θ ∗ 2","venue":null,"work_id":"59a5cc5c-9f7c-4d85-9d13-52b166585dd3","year":null},"citing_paper":{"arxiv_id":"2601.22409","last_updated":"2026-05-12T23:48:38Z","snapshot_observed_at":"2026-08-02T15:20:04.793342Z","submitted_at":"2026-01-29T23:43:26Z","title":"Optimization, Generalization and Differential Privacy Bounds for Gradient Descent on Kolmogorov-Arnold Networks","version":3},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-05-16T09:34:00.409455Z"},"links":{"citing_paper":"/paper/2601.22409"},"observation_digest":"sha256:3147a0e473c07b46dfd6872a28ca743ba72757347c17bdc5f98e039d7836f1e9","observation_id":"f9872b5d-85a0-4c52-b487-edb00d1b7ed1","resolution":{"observed_at":"2026-05-16T09:52:42.202791Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"175612ed-79e3-4420-a71e-b3d64fdb46aa","year":null},"citing_paper":{"arxiv_id":"2601.22409","last_updated":"2026-05-12T23:48:38Z","snapshot_observed_at":"2026-08-02T15:20:04.793342Z","submitted_at":"2026-01-29T23:43:26Z","title":"Optimization, Generalization and Differential Privacy Bounds for Gradient Descent on Kolmogorov-Arnold Networks","version":3},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-05-16T09:34:00.409455Z"},"links":{"citing_paper":"/paper/2601.22409"},"observation_digest":"sha256:ec8f8af023f281295318d42f6fd7e8629ea7b05e26688b8f5eefab3703403ca3","observation_id":"81f408fe-33ea-4693-89fe-e43d639c4404","resolution":{"observed_at":"2026-05-16T09:52:42.134079Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"with probability at least 1 −δ","venue":null,"work_id":"2f57148a-41ac-45c5-a83a-1184e125f5b6","year":null},"citing_paper":{"arxiv_id":"2601.22409","last_updated":"2026-05-12T23:48:38Z","snapshot_observed_at":"2026-08-02T15:20:04.793342Z","submitted_at":"2026-01-29T23:43:26Z","title":"Optimization, Generalization and Differential Privacy Bounds for Gradient Descent on Kolmogorov-Arnold Networks","version":3},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-05-16T09:34:00.409455Z"},"links":{"citing_paper":"/paper/2601.22409"},"observation_digest":"sha256:ab575e3847c5a484e5cfe365cc2edf9f668a5e2c8498ff7dbc02dcf5043afa58","observation_id":"88681a79-2e79-4cae-b426-1002023d82a4","resolution":{"observed_at":"2026-05-16T09:52:42.085854Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"with probability at least 1−δ","venue":null,"work_id":"78891a95-7236-4682-9953-66eafb84661e","year":null},"citing_paper":{"arxiv_id":"2601.22409","last_updated":"2026-05-12T23:48:38Z","snapshot_observed_at":"2026-08-02T15:20:04.793342Z","submitted_at":"2026-01-29T23:43:26Z","title":"Optimization, Generalization and Differential Privacy Bounds for Gradient Descent on Kolmogorov-Arnold Networks","version":3},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-05-16T09:34:00.409455Z"},"links":{"citing_paper":"/paper/2601.22409"},"observation_digest":"sha256:86d6c01bc48283f698eccaf80a9b058914e1185ed270295628057ca15fc57ea8","observation_id":"393c8e7c-a239-42db-87e4-88733849e826","resolution":{"observed_at":"2026-05-16T09:52:42.129202Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Then, it holds that ES L(Θ(T))− L S(Θ(T)) ≤C σ,bp2 p+p∥Θ ∗ −Θ(0)∥ 2 2 η n ES h TX t=0 LS Θ(t) i","venue":null,"work_id":"aa53f570-32bc-4236-a7d5-7ab26e388ee9","year":null},"citing_paper":{"arxiv_id":"2601.22409","last_updated":"2026-05-12T23:48:38Z","snapshot_observed_at":"2026-08-02T15:20:04.793342Z","submitted_at":"2026-01-29T23:43:26Z","title":"Optimization, Generalization and Differential Privacy Bounds for Gradient Descent on Kolmogorov-Arnold Networks","version":3},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-05-16T09:34:00.409455Z"},"links":{"citing_paper":"/paper/2601.22409"},"observation_digest":"sha256:c5ee98617d66da5b2fc5dc55cd1db4121ec430451610d83d7a440cdbc119eb51","observation_id":"170887eb-9d1f-4bf0-bf73-a8a83243cb38","resolution":{"observed_at":"2026-05-16T09:52:42.068846Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"By further noting that (7) holds with probability at least 1 −δ over initialization c(0), this completes the proof of the theorem","venue":null,"work_id":"6b29a250-0e98-422d-878d-dcffab27e1c8","year":null},"citing_paper":{"arxiv_id":"2601.22409","last_updated":"2026-05-12T23:48:38Z","snapshot_observed_at":"2026-08-02T15:20:04.793342Z","submitted_at":"2026-01-29T23:43:26Z","title":"Optimization, Generalization and Differential Privacy Bounds for Gradient Descent on Kolmogorov-Arnold Networks","version":3},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-05-16T09:34:00.409455Z"},"links":{"citing_paper":"/paper/2601.22409"},"observation_digest":"sha256:70b4437a85203c598764b49cf5b209c5f8170f4c4cb7d8c039cdfa492595070d","observation_id":"1d8329da-a25c-4bf7-a503-25b67c327325","resolution":{"observed_at":"2026-05-16T09:52:42.131973Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Note Lemma A.2 implies ∥c(0)∥2 ≤ 4√pm + 2 p log(2/δ) with probability at least 1 −δ/ 2","venue":null,"work_id":"9cf666e4-22bf-45d1-bae8-b2b47c301a25","year":null},"citing_paper":{"arxiv_id":"2601.22409","last_updated":"2026-05-12T23:48:38Z","snapshot_observed_at":"2026-08-02T15:20:04.793342Z","submitted_at":"2026-01-29T23:43:26Z","title":"Optimization, Generalization and Differential Privacy Bounds for Gradient Descent on Kolmogorov-Arnold Networks","version":3},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-05-16T09:34:00.409455Z"},"links":{"citing_paper":"/paper/2601.22409"},"observation_digest":"sha256:b5cc4d764115cdf328113896a3447ec76ca24ff923e2fdb51aec2fd5f227a38e","observation_id":"387f05b8-16ee-4c36-97a9-7741473a1be1","resolution":{"observed_at":"2026-05-16T09:52:42.188005Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Combining (37) and the above equality and dividing byηyield g,Θ ∗ −Θ + ≥ 1 2η ∥Θ+ −Θ ∗∥2 2 +∥Θ−Θ +∥2 2 − ∥Θ−Θ ∗∥2 2","venue":null,"work_id":"a4e2b1cc-4efe-4ea2-9be6-5f13a6635187","year":null},"citing_paper":{"arxiv_id":"2601.22409","last_updated":"2026-05-12T23:48:38Z","snapshot_observed_at":"2026-08-02T15:20:04.793342Z","submitted_at":"2026-01-29T23:43:26Z","title":"Optimization, Generalization and Differential Privacy Bounds for Gradient Descent on Kolmogorov-Arnold Networks","version":3},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-05-16T09:34:00.409455Z"},"links":{"citing_paper":"/paper/2601.22409"},"observation_digest":"sha256:4540abd47d235586d2628924e8bafc07a25d4dadda2d197cc5d431520eb741b1","observation_id":"ff68941b-0c1f-477e-b16a-8640575e47d7","resolution":{"observed_at":"2026-05-16T09:52:42.158695Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"By further using eΛ2 Θ∗ ≥ηL S(eΘ(0)), it holds 1 T TX k=1 EA LS(eΘ(k)) ≤4L S(Θ∗) + 4 ηT ∥eΘ(0)−Θ ∗∥2 2 + mp4ηT dlog(2T /δ) n2ϵ2","venue":null,"work_id":"22b14125-511c-4cc2-8e5c-8a8e9b6c4af9","year":null},"citing_paper":{"arxiv_id":"2601.22409","last_updated":"2026-05-12T23:48:38Z","snapshot_observed_at":"2026-08-02T15:20:04.793342Z","submitted_at":"2026-01-29T23:43:26Z","title":"Optimization, Generalization and Differential Privacy Bounds for Gradient Descent on Kolmogorov-Arnold Networks","version":3},"reference_index":71,"source":"pdf_text","source_observed_at":"2026-05-16T09:34:00.409455Z"},"links":{"citing_paper":"/paper/2601.22409"},"observation_digest":"sha256:43818abf6bf1dc722aebd80b4fea803589e04719370abb7b28005f2ec9e38812","observation_id":"0d0c0885-6c30-4b1d-85fc-2e4748113850","resolution":{"observed_at":"2026-05-16T09:52:42.176870Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"These match the width conditions stated in the theorem","venue":null,"work_id":"956c1f71-bcb0-497f-a4c8-dce4a90728f5","year":null},"citing_paper":{"arxiv_id":"2601.22409","last_updated":"2026-05-12T23:48:38Z","snapshot_observed_at":"2026-08-02T15:20:04.793342Z","submitted_at":"2026-01-29T23:43:26Z","title":"Optimization, Generalization and Differential Privacy Bounds for Gradient Descent on Kolmogorov-Arnold Networks","version":3},"reference_index":72,"source":"pdf_text","source_observed_at":"2026-05-16T09:34:00.409455Z"},"links":{"citing_paper":"/paper/2601.22409"},"observation_digest":"sha256:620ac4790396f5889c430abd0beb85862a64d80e4b626d7dbe1576da8de48db4","observation_id":"db10ea31-9b0e-4631-b04f-4cfacdeb66bb","resolution":{"observed_at":"2026-05-16T09:52:42.170538Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"This completes the proof of the theorem","venue":null,"work_id":"eafc52fb-075c-473c-ae26-72d19d930c68","year":2048},"citing_paper":{"arxiv_id":"2601.22409","last_updated":"2026-05-12T23:48:38Z","snapshot_observed_at":"2026-08-02T15:20:04.793342Z","submitted_at":"2026-01-29T23:43:26Z","title":"Optimization, Generalization and Differential Privacy Bounds for Gradient Descent on Kolmogorov-Arnold Networks","version":3},"reference_index":73,"source":"pdf_text","source_observed_at":"2026-05-16T09:34:00.409455Z"},"links":{"citing_paper":"/paper/2601.22409"},"observation_digest":"sha256:0f0cda1e86b67201bde9ea3928ed311ad46e1d61627a2cfc9c132f4166770c83","observation_id":"7c97cae7-198b-456b-a0d3-2c9b7630ffbe","resolution":{"observed_at":"2026-05-16T09:52:42.172323Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2601.22409","last_updated":"2026-05-12T23:48:38Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-02T15:20:04.793342Z","submitted_at":"2026-01-29T23:43:26Z","title":"Optimization, Generalization and Differential Privacy Bounds for Gradient Descent on Kolmogorov-Arnold Networks"},"reference_resolution":{"displayed":73,"state_counts":{"malformed_identifier":1,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":3,"verified_exact":5,"verified_fuzzy":63},"total_outbound_references":73},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 73 of 73 outbound references and 3 inbound Pith citation observations for arXiv:2601.22409."}