{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:HZJAJ7Z4ND3URT2PYCWBZMID7E","short_pith_number":"pith:HZJAJ7Z4","schema_version":"1.0","canonical_sha256":"3e5204ff3c68f748cf4fc0ac1cb103f935d48843d7319d6e1239679c3a7c1787","source":{"kind":"arxiv","id":"2604.03345","version":2},"attestation_state":"computed","paper":{"title":"Hardware-Oriented Inference Complexity of Kolmogorov-Arnold Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Kolmogorov-Arnold Networks now have platform-independent formulas that count real multiplications, bit operations, and additions for hardware inference.","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Bilal Khalid, Jaroslaw E. Prilepsky, Pedro Freire, Sergei K. Turitsyn","submitted_at":"2026-04-03T10:18:05Z","abstract_excerpt":"Kolmogorov-Arnold Networks (KANs) have recently emerged as a powerful architecture for various machine learning applications. However, their unique structure raises significant concerns regarding their computational overhead. Existing studies primarily evaluate KAN complexity in terms of Floating-Point Operations (FLOPs) required for GPU-based training and inference. However, in many latency-sensitive and power-constrained deployment scenarios, such as neural network-driven non-linearity mitigation in optical communications or channel state estimation in wireless communications, training is pe"},"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":"2604.03345","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-04-03T10:18:05Z","cross_cats_sorted":[],"title_canon_sha256":"47f171a8d977cee1c119a1f4e207e8731b155e4159455568a79cbd0454422791","abstract_canon_sha256":"a3c4a099237e00854e7b7d36eb2c380f5161c970f1ee7a3eded7f726df9a02bf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-24T01:14:27.439192Z","signature_b64":"ADXUKqkiCgPdUaEDCb+9jHtbkecWHlLJYwkX7Aub+qnD3gQOwQu7jMPJDdAQOYBXd1ynckrlK77Xv3psoXbqBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3e5204ff3c68f748cf4fc0ac1cb103f935d48843d7319d6e1239679c3a7c1787","last_reissued_at":"2026-06-24T01:14:27.438699Z","signature_status":"signed_v1","first_computed_at":"2026-06-24T01:14:27.438699Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hardware-Oriented Inference Complexity of Kolmogorov-Arnold Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Kolmogorov-Arnold Networks now have platform-independent formulas that count real multiplications, bit operations, and additions for hardware inference.","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Bilal Khalid, Jaroslaw E. Prilepsky, Pedro Freire, Sergei K. Turitsyn","submitted_at":"2026-04-03T10:18:05Z","abstract_excerpt":"Kolmogorov-Arnold Networks (KANs) have recently emerged as a powerful architecture for various machine learning applications. However, their unique structure raises significant concerns regarding their computational overhead. Existing studies primarily evaluate KAN complexity in terms of Floating-Point Operations (FLOPs) required for GPU-based training and inference. However, in many latency-sensitive and power-constrained deployment scenarios, such as neural network-driven non-linearity mitigation in optical communications or channel state estimation in wireless communications, training is pe"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"we derive generalized, platform-independent formulae for evaluating the hardware inference complexity of KANs in terms of Real Multiplications (RM), Bit Operations (BOP), and Number of Additions and Bit-Shifts (NABS). We extend our analysis across multiple KAN variants, including B-spline, Gaussian Radial Basis Function (GRBF), Chebyshev, and Fourier KANs.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That RM, BOP, and NABS counts derived solely from network structure accurately predict real hardware resource use and latency without additional factors such as memory access patterns or routing overhead.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Derives generalized formulas for KAN inference complexity using RM, BOP, and NABS metrics across B-spline, GRBF, Chebyshev, and Fourier variants.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Kolmogorov-Arnold Networks now have platform-independent formulas that count real multiplications, bit operations, and additions for hardware inference.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"4b5b1543c135bdc0db32f62b924ce1806757a6bdaac506b649598bb8a8fef406"},"source":{"id":"2604.03345","kind":"arxiv","version":2},"verdict":{"id":"3d817662-71e4-4a19-8846-f6d7c3672a7f","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-13T20:26:04.678464Z","strongest_claim":"we derive generalized, platform-independent formulae for evaluating the hardware inference complexity of KANs in terms of Real Multiplications (RM), Bit Operations (BOP), and Number of Additions and Bit-Shifts (NABS). We extend our analysis across multiple KAN variants, including B-spline, Gaussian Radial Basis Function (GRBF), Chebyshev, and Fourier KANs.","one_line_summary":"Derives generalized formulas for KAN inference complexity using RM, BOP, and NABS metrics across B-spline, GRBF, Chebyshev, and Fourier variants.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That RM, BOP, and NABS counts derived solely from network structure accurately predict real hardware resource use and latency without additional factors such as memory access patterns or routing overhead.","pith_extraction_headline":"Kolmogorov-Arnold Networks now have platform-independent formulas that count real multiplications, bit operations, and additions for hardware inference."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2604.03345/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":"2604.03345","created_at":"2026-06-24T01:14:27.438766+00:00"},{"alias_kind":"arxiv_version","alias_value":"2604.03345v2","created_at":"2026-06-24T01:14:27.438766+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.03345","created_at":"2026-06-24T01:14:27.438766+00:00"},{"alias_kind":"pith_short_12","alias_value":"HZJAJ7Z4ND3U","created_at":"2026-06-24T01:14:27.438766+00:00"},{"alias_kind":"pith_short_16","alias_value":"HZJAJ7Z4ND3URT2P","created_at":"2026-06-24T01:14:27.438766+00:00"},{"alias_kind":"pith_short_8","alias_value":"HZJAJ7Z4","created_at":"2026-06-24T01:14:27.438766+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HZJAJ7Z4ND3URT2PYCWBZMID7E","json":"https://pith.science/pith/HZJAJ7Z4ND3URT2PYCWBZMID7E.json","graph_json":"https://pith.science/api/pith-number/HZJAJ7Z4ND3URT2PYCWBZMID7E/graph.json","events_json":"https://pith.science/api/pith-number/HZJAJ7Z4ND3URT2PYCWBZMID7E/events.json","paper":"https://pith.science/paper/HZJAJ7Z4"},"agent_actions":{"view_html":"https://pith.science/pith/HZJAJ7Z4ND3URT2PYCWBZMID7E","download_json":"https://pith.science/pith/HZJAJ7Z4ND3URT2PYCWBZMID7E.json","view_paper":"https://pith.science/paper/HZJAJ7Z4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2604.03345&json=true","fetch_graph":"https://pith.science/api/pith-number/HZJAJ7Z4ND3URT2PYCWBZMID7E/graph.json","fetch_events":"https://pith.science/api/pith-number/HZJAJ7Z4ND3URT2PYCWBZMID7E/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HZJAJ7Z4ND3URT2PYCWBZMID7E/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HZJAJ7Z4ND3URT2PYCWBZMID7E/action/storage_attestation","attest_author":"https://pith.science/pith/HZJAJ7Z4ND3URT2PYCWBZMID7E/action/author_attestation","sign_citation":"https://pith.science/pith/HZJAJ7Z4ND3URT2PYCWBZMID7E/action/citation_signature","submit_replication":"https://pith.science/pith/HZJAJ7Z4ND3URT2PYCWBZMID7E/action/replication_record"}},"created_at":"2026-06-24T01:14:27.438766+00:00","updated_at":"2026-06-24T01:14:27.438766+00:00"}