{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:IP74UOYX2FCCZ2SAZMA4QGDYH4","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"13778f163aeaf6f9c81811bbc162a73e8f59b35dbddb09746bc7c4083f715cb9","cross_cats_sorted":["cs.NA","cs.NE","math.FA","math.NA","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-04-21T14:02:59Z","title_canon_sha256":"8bdf9adb18f347059d05061c991b3fd0491bd072747f18acb9c6d3f31e9d6cde"},"schema_version":"1.0","source":{"id":"2504.15110","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2504.15110","created_at":"2026-07-05T11:49:33Z"},{"alias_kind":"arxiv_version","alias_value":"2504.15110v3","created_at":"2026-07-05T11:49:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.15110","created_at":"2026-07-05T11:49:33Z"},{"alias_kind":"pith_short_12","alias_value":"IP74UOYX2FCC","created_at":"2026-07-05T11:49:33Z"},{"alias_kind":"pith_short_16","alias_value":"IP74UOYX2FCCZ2SA","created_at":"2026-07-05T11:49:33Z"},{"alias_kind":"pith_short_8","alias_value":"IP74UOYX","created_at":"2026-07-05T11:49:33Z"}],"graph_snapshots":[{"event_id":"sha256:e180ab556cedccfc286274bde9cfe7b951a471f3066afd780ad154c34b65d8de","target":"graph","created_at":"2026-07-05T11:49:33Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2504.15110/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Inspired by the Kolmogorov-Arnold superposition theorem, Kolmogorov-Arnold Networks (KANs) have recently emerged as an improved backbone for most deep learning frameworks, promising more adaptivity than their multilayer perceptron (MLP) predecessor by allowing for trainable spline-based activation functions. In this paper, we probe the theoretical foundations of the KAN architecture by showing that it can optimally approximate any Besov function in $B^{s}_{p,q}(\\mathcal{X})$ on a bounded open, or even fractal, domain $\\mathcal{X}$ in $\\mathbb{R}^d$ at the optimal approximation rate with respec","authors_text":"Anastasis Kratsios, Bum Jun Kim, Takashi Furuya","cross_cats":["cs.NA","cs.NE","math.FA","math.NA","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-04-21T14:02:59Z","title":"Approximation Rates in Besov Norms and Sample-Complexity of Kolmogorov-Arnold Networks with Residual Connections"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.15110","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:2393ea400dc919e43bc34b827c4c88c06b91a4eb79446d36589032aaae369c36","target":"record","created_at":"2026-07-05T11:49:33Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"13778f163aeaf6f9c81811bbc162a73e8f59b35dbddb09746bc7c4083f715cb9","cross_cats_sorted":["cs.NA","cs.NE","math.FA","math.NA","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-04-21T14:02:59Z","title_canon_sha256":"8bdf9adb18f347059d05061c991b3fd0491bd072747f18acb9c6d3f31e9d6cde"},"schema_version":"1.0","source":{"id":"2504.15110","kind":"arxiv","version":3}},"canonical_sha256":"43ffca3b17d1442cea40cb01c818783f026f99a0ec64bf18d8c225c144cb0ef2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"43ffca3b17d1442cea40cb01c818783f026f99a0ec64bf18d8c225c144cb0ef2","first_computed_at":"2026-07-05T11:49:33.181143Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:49:33.181143Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"za6LL6utMiPwzrxMuORreqt+MtBnpG3FXIzZrL5LZ8NKjcMqXxVBpsZkBZbmuUHk9vV4MovS160zZdWi4unpDA==","signature_status":"signed_v1","signed_at":"2026-07-05T11:49:33.181658Z","signed_message":"canonical_sha256_bytes"},"source_id":"2504.15110","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2393ea400dc919e43bc34b827c4c88c06b91a4eb79446d36589032aaae369c36","sha256:e180ab556cedccfc286274bde9cfe7b951a471f3066afd780ad154c34b65d8de"],"state_sha256":"388382a386b10e6452c98a6e351070d3bed12e931b36955a54ccaef184b42239"}