{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:TD7ZXGNEEDWPC7N2YWNTAMR2PD","short_pith_number":"pith:TD7ZXGNE","schema_version":"1.0","canonical_sha256":"98ff9b99a420ecf17dbac59b30323a78ffaeb862cced80bdcc1823edddd805d5","source":{"kind":"arxiv","id":"2509.19830","version":3},"attestation_state":"computed","paper":{"title":"On the Rate of Convergence of Kolmogorov-Arnold Network Regression Estimators","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Eleni Chatzi, Wei Liu, Zhilu Lai","submitted_at":"2025-09-24T07:22:03Z","abstract_excerpt":"Kolmogorov-Arnold Networks (KANs) approximate multivariate functions by composing univariate transformations through additive or multiplicative aggregation. We establish convergence guarantees for KANs whose univariate components are B-splines. The least-squares estimator over the KAN spline sieve attains the rate $O((\\log n / n)^{2r/(2r+1)})$, uniformly over a ball of regression functions admitting a KAN representation with univariate components of Sobolev smoothness $r$; a matching lower bound of order $n^{-2r/(2r+1)}$ shows this is minimax optimal up to the logarithmic factor, which we trac"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2509.19830","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-09-24T07:22:03Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"d9c924561fb97c9ebbfb5875892cbde4ac0e15e0d6d0665ee9ef1a3744ebe52a","abstract_canon_sha256":"6fa281a920d579cbde2427243096c9011b601faa80edd9d51757df3f7d104b8b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"98ff9b99a420ecf17dbac59b30323a78ffaeb862cced80bdcc1823edddd805d5","last_reissued_at":"2026-07-31T01:08:40.676310Z","signature_status":"unsigned_v0","first_computed_at":"2026-07-31T01:08:40.676310Z"},"graph_snapshot":{"paper":{"title":"On the Rate of Convergence of Kolmogorov-Arnold Network Regression Estimators","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Eleni Chatzi, Wei Liu, Zhilu Lai","submitted_at":"2025-09-24T07:22:03Z","abstract_excerpt":"Kolmogorov-Arnold Networks (KANs) approximate multivariate functions by composing univariate transformations through additive or multiplicative aggregation. We establish convergence guarantees for KANs whose univariate components are B-splines. The least-squares estimator over the KAN spline sieve attains the rate $O((\\log n / n)^{2r/(2r+1)})$, uniformly over a ball of regression functions admitting a KAN representation with univariate components of Sobolev smoothness $r$; a matching lower bound of order $n^{-2r/(2r+1)}$ shows this is minimax optimal up to the logarithmic factor, which we trac"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.19830","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2509.19830/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2509.19830","created_at":"2026-07-31T01:08:40.679327+00:00"},{"alias_kind":"arxiv_version","alias_value":"2509.19830v3","created_at":"2026-07-31T01:08:40.679327+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.19830","created_at":"2026-07-31T01:08:40.679327+00:00"},{"alias_kind":"pith_short_12","alias_value":"TD7ZXGNEEDWP","created_at":"2026-07-31T01:08:40.679327+00:00"},{"alias_kind":"pith_short_16","alias_value":"TD7ZXGNEEDWPC7N2","created_at":"2026-07-31T01:08:40.679327+00:00"},{"alias_kind":"pith_short_8","alias_value":"TD7ZXGNE","created_at":"2026-07-31T01:08:40.679327+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":6,"internal_anchor_count":6,"sample":[{"citing_arxiv_id":"2604.23765","citing_title":"Necessary and sufficient conditions for universality of Kolmogorov-Arnold networks","ref_index":13,"is_internal_anchor":true},{"citing_arxiv_id":"2604.23765","citing_title":"Necessary and sufficient conditions for universality of Kolmogorov-Arnold networks","ref_index":13,"is_internal_anchor":true},{"citing_arxiv_id":"2510.25781","citing_title":"A Practitioner's Guide to Kolmogorov-Arnold Networks","ref_index":147,"is_internal_anchor":true},{"citing_arxiv_id":"2601.22409","citing_title":"Optimization, Generalization and Differential Privacy Bounds for Gradient Descent on Kolmogorov-Arnold Networks","ref_index":30,"is_internal_anchor":true},{"citing_arxiv_id":"2605.12648","citing_title":"Population Risk Bounds for Kolmogorov-Arnold Networks Trained by DP-SGD with Correlated Noise","ref_index":38,"is_internal_anchor":true},{"citing_arxiv_id":"2604.23765","citing_title":"Necessary and sufficient conditions for universality of Kolmogorov-Arnold networks","ref_index":13,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TD7ZXGNEEDWPC7N2YWNTAMR2PD","json":"https://pith.science/pith/TD7ZXGNEEDWPC7N2YWNTAMR2PD.json","graph_json":"https://pith.science/api/pith-number/TD7ZXGNEEDWPC7N2YWNTAMR2PD/graph.json","events_json":"https://pith.science/api/pith-number/TD7ZXGNEEDWPC7N2YWNTAMR2PD/events.json","paper":"https://pith.science/paper/TD7ZXGNE"},"agent_actions":{"view_html":"https://pith.science/pith/TD7ZXGNEEDWPC7N2YWNTAMR2PD","download_json":"https://pith.science/pith/TD7ZXGNEEDWPC7N2YWNTAMR2PD.json","view_paper":"https://pith.science/paper/TD7ZXGNE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2509.19830&json=true","fetch_graph":"https://pith.science/api/pith-number/TD7ZXGNEEDWPC7N2YWNTAMR2PD/graph.json","fetch_events":"https://pith.science/api/pith-number/TD7ZXGNEEDWPC7N2YWNTAMR2PD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TD7ZXGNEEDWPC7N2YWNTAMR2PD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TD7ZXGNEEDWPC7N2YWNTAMR2PD/action/storage_attestation","attest_author":"https://pith.science/pith/TD7ZXGNEEDWPC7N2YWNTAMR2PD/action/author_attestation","sign_citation":"https://pith.science/pith/TD7ZXGNEEDWPC7N2YWNTAMR2PD/action/citation_signature","submit_replication":"https://pith.science/pith/TD7ZXGNEEDWPC7N2YWNTAMR2PD/action/replication_record"}},"created_at":"2026-07-31T01:08:40.679327+00:00","updated_at":"2026-07-31T01:08:40.679327+00:00"}