{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:BASNRBXMMQOWQ5XTSWEMU34IWN","short_pith_number":"pith:BASNRBXM","schema_version":"1.0","canonical_sha256":"0824d886ec641d6876f39588ca6f88b36278aea6553817fdb686794cd64b5289","source":{"kind":"arxiv","id":"2409.13550","version":2},"attestation_state":"computed","paper":{"title":"A preliminary study on continual learning in computer vision using Kolmogorov-Arnold Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CV","authors_text":"Alessandro Cacciatore, Daniele Berardini, Emanuele Frontoni, Federica Paganica, Lucia Migliorelli, Valerio Morelli","submitted_at":"2024-09-20T14:49:21Z","abstract_excerpt":"Deep learning has long been dominated by multi-layer perceptrons (MLPs), which have demonstrated superiority over other optimizable models in various domains. Recently, a new alternative to MLPs has emerged - Kolmogorov-Arnold Networks (KAN)- which are based on a fundamentally different mathematical framework. According to their authors, KANs address several major issues in MLPs, such as catastrophic forgetting in continual learning scenarios. However, this claim has only been supported by results from a regression task on a toy 1D dataset. In this paper, we extend the investigation by evaluat"},"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":"2409.13550","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2024-09-20T14:49:21Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"53eef4cea557741fd24e83405640c1e27acb33c2445b13ec6883077865b3829b","abstract_canon_sha256":"9803b9a05656ad0ae679181ab35d699c8d5f746e0901a28f9cb7daf362250a7e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:12:48.063880Z","signature_b64":"q3sSw2ClMwCQoFyze52WKP6iO+WspFwd3JlhK+tpl1FWZ/JcjpcZUBNNdwOu7cc0gYN9UCsx4E8u+OnDNVjKDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0824d886ec641d6876f39588ca6f88b36278aea6553817fdb686794cd64b5289","last_reissued_at":"2026-07-05T09:12:48.063293Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:12:48.063293Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A preliminary study on continual learning in computer vision using Kolmogorov-Arnold Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CV","authors_text":"Alessandro Cacciatore, Daniele Berardini, Emanuele Frontoni, Federica Paganica, Lucia Migliorelli, Valerio Morelli","submitted_at":"2024-09-20T14:49:21Z","abstract_excerpt":"Deep learning has long been dominated by multi-layer perceptrons (MLPs), which have demonstrated superiority over other optimizable models in various domains. Recently, a new alternative to MLPs has emerged - Kolmogorov-Arnold Networks (KAN)- which are based on a fundamentally different mathematical framework. According to their authors, KANs address several major issues in MLPs, such as catastrophic forgetting in continual learning scenarios. However, this claim has only been supported by results from a regression task on a toy 1D dataset. In this paper, we extend the investigation by evaluat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.13550","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/2409.13550/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":"2409.13550","created_at":"2026-07-05T09:12:48.063370+00:00"},{"alias_kind":"arxiv_version","alias_value":"2409.13550v2","created_at":"2026-07-05T09:12:48.063370+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.13550","created_at":"2026-07-05T09:12:48.063370+00:00"},{"alias_kind":"pith_short_12","alias_value":"BASNRBXMMQOW","created_at":"2026-07-05T09:12:48.063370+00:00"},{"alias_kind":"pith_short_16","alias_value":"BASNRBXMMQOWQ5XT","created_at":"2026-07-05T09:12:48.063370+00:00"},{"alias_kind":"pith_short_8","alias_value":"BASNRBXM","created_at":"2026-07-05T09:12:48.063370+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.24371","citing_title":"Structural Kolmogorov-Arnold Convolutions: Learnable Function on the Values or the Filter Shape as Parameter-Efficient Alternative to Per-Edge Convolutional KANs","ref_index":14,"is_internal_anchor":false},{"citing_arxiv_id":"2605.12306","citing_title":"KAN-CL: Per-Knot Importance Regularization for Continual Learning with Kolmogorov-Arnold Networks","ref_index":32,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BASNRBXMMQOWQ5XTSWEMU34IWN","json":"https://pith.science/pith/BASNRBXMMQOWQ5XTSWEMU34IWN.json","graph_json":"https://pith.science/api/pith-number/BASNRBXMMQOWQ5XTSWEMU34IWN/graph.json","events_json":"https://pith.science/api/pith-number/BASNRBXMMQOWQ5XTSWEMU34IWN/events.json","paper":"https://pith.science/paper/BASNRBXM"},"agent_actions":{"view_html":"https://pith.science/pith/BASNRBXMMQOWQ5XTSWEMU34IWN","download_json":"https://pith.science/pith/BASNRBXMMQOWQ5XTSWEMU34IWN.json","view_paper":"https://pith.science/paper/BASNRBXM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2409.13550&json=true","fetch_graph":"https://pith.science/api/pith-number/BASNRBXMMQOWQ5XTSWEMU34IWN/graph.json","fetch_events":"https://pith.science/api/pith-number/BASNRBXMMQOWQ5XTSWEMU34IWN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BASNRBXMMQOWQ5XTSWEMU34IWN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BASNRBXMMQOWQ5XTSWEMU34IWN/action/storage_attestation","attest_author":"https://pith.science/pith/BASNRBXMMQOWQ5XTSWEMU34IWN/action/author_attestation","sign_citation":"https://pith.science/pith/BASNRBXMMQOWQ5XTSWEMU34IWN/action/citation_signature","submit_replication":"https://pith.science/pith/BASNRBXMMQOWQ5XTSWEMU34IWN/action/replication_record"}},"created_at":"2026-07-05T09:12:48.063370+00:00","updated_at":"2026-07-05T09:12:48.063370+00:00"}