{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:PLCWQPXYIUWFDCGGVDEKMU43UX","short_pith_number":"pith:PLCWQPXY","schema_version":"1.0","canonical_sha256":"7ac5683ef8452c5188c6a8c8a6539ba5ded4aa7ab14359261e6bde64b2e2bf15","source":{"kind":"arxiv","id":"2502.16664","version":2},"attestation_state":"computed","paper":{"title":"Geometric Kolmogorov-Arnold Superposition Theorem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Francesco Alesiani, Henrik Christiansen, Takashi Maruyama, Viktor Zaverkin","submitted_at":"2025-02-23T17:47:33Z","abstract_excerpt":"The Kolmogorov-Arnold Theorem (KAT), or more generally, the Kolmogorov Superposition Theorem (KST), establishes that any non-linear multivariate function can be exactly represented as a finite superposition of non-linear univariate functions. Unlike the universal approximation theorem, which provides only an approximate representation without guaranteeing a fixed network size, KST offers a theoretically exact decomposition. The Kolmogorov-Arnold Network (KAN) was introduced as a trainable model to implement KAT, and recent advancements have adapted KAN using concepts from modern neural network"},"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":"2502.16664","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-02-23T17:47:33Z","cross_cats_sorted":[],"title_canon_sha256":"f9534001658712b4f91b998f538e9e51f3b79cf04d63bd4e98b5cc10d84b2f59","abstract_canon_sha256":"2f39ea64712876ffb0b0e11a9e71f423e6181063a7022972e4ee367a94061710"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:21:43.035332Z","signature_b64":"EDHZY7mDD0wrVHkRP05QwJq+KnfTIOMdX9BN9DOJqBlaKdp3z9ucJH3BJsNAqReMuFS1y1eNfTLp1/qNOEXBCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7ac5683ef8452c5188c6a8c8a6539ba5ded4aa7ab14359261e6bde64b2e2bf15","last_reissued_at":"2026-07-05T11:21:43.034811Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:21:43.034811Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Geometric Kolmogorov-Arnold Superposition Theorem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Francesco Alesiani, Henrik Christiansen, Takashi Maruyama, Viktor Zaverkin","submitted_at":"2025-02-23T17:47:33Z","abstract_excerpt":"The Kolmogorov-Arnold Theorem (KAT), or more generally, the Kolmogorov Superposition Theorem (KST), establishes that any non-linear multivariate function can be exactly represented as a finite superposition of non-linear univariate functions. Unlike the universal approximation theorem, which provides only an approximate representation without guaranteeing a fixed network size, KST offers a theoretically exact decomposition. The Kolmogorov-Arnold Network (KAN) was introduced as a trainable model to implement KAT, and recent advancements have adapted KAN using concepts from modern neural network"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.16664","kind":"arxiv","version":2},"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/2502.16664/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":"2502.16664","created_at":"2026-07-05T11:21:43.034870+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.16664v2","created_at":"2026-07-05T11:21:43.034870+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.16664","created_at":"2026-07-05T11:21:43.034870+00:00"},{"alias_kind":"pith_short_12","alias_value":"PLCWQPXYIUWF","created_at":"2026-07-05T11:21:43.034870+00:00"},{"alias_kind":"pith_short_16","alias_value":"PLCWQPXYIUWFDCGG","created_at":"2026-07-05T11:21:43.034870+00:00"},{"alias_kind":"pith_short_8","alias_value":"PLCWQPXY","created_at":"2026-07-05T11:21:43.034870+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2507.02466","citing_title":"Variational Kolmogorov-Arnold Network","ref_index":1,"is_internal_anchor":false},{"citing_arxiv_id":"2510.25781","citing_title":"A Practitioner's Guide to Kolmogorov-Arnold Networks","ref_index":214,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PLCWQPXYIUWFDCGGVDEKMU43UX","json":"https://pith.science/pith/PLCWQPXYIUWFDCGGVDEKMU43UX.json","graph_json":"https://pith.science/api/pith-number/PLCWQPXYIUWFDCGGVDEKMU43UX/graph.json","events_json":"https://pith.science/api/pith-number/PLCWQPXYIUWFDCGGVDEKMU43UX/events.json","paper":"https://pith.science/paper/PLCWQPXY"},"agent_actions":{"view_html":"https://pith.science/pith/PLCWQPXYIUWFDCGGVDEKMU43UX","download_json":"https://pith.science/pith/PLCWQPXYIUWFDCGGVDEKMU43UX.json","view_paper":"https://pith.science/paper/PLCWQPXY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.16664&json=true","fetch_graph":"https://pith.science/api/pith-number/PLCWQPXYIUWFDCGGVDEKMU43UX/graph.json","fetch_events":"https://pith.science/api/pith-number/PLCWQPXYIUWFDCGGVDEKMU43UX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PLCWQPXYIUWFDCGGVDEKMU43UX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PLCWQPXYIUWFDCGGVDEKMU43UX/action/storage_attestation","attest_author":"https://pith.science/pith/PLCWQPXYIUWFDCGGVDEKMU43UX/action/author_attestation","sign_citation":"https://pith.science/pith/PLCWQPXYIUWFDCGGVDEKMU43UX/action/citation_signature","submit_replication":"https://pith.science/pith/PLCWQPXYIUWFDCGGVDEKMU43UX/action/replication_record"}},"created_at":"2026-07-05T11:21:43.034870+00:00","updated_at":"2026-07-05T11:21:43.034870+00:00"}