{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:HZJAJ7Z4ND3URT2PYCWBZMID7E","short_pith_number":"pith:HZJAJ7Z4","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"},"canonical_sha256":"3e5204ff3c68f748cf4fc0ac1cb103f935d48843d7319d6e1239679c3a7c1787","source":{"kind":"arxiv","id":"2604.03345","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2604.03345","created_at":"2026-06-24T01:14:27Z"},{"alias_kind":"arxiv_version","alias_value":"2604.03345v2","created_at":"2026-06-24T01:14:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.03345","created_at":"2026-06-24T01:14:27Z"},{"alias_kind":"pith_short_12","alias_value":"HZJAJ7Z4ND3U","created_at":"2026-06-24T01:14:27Z"},{"alias_kind":"pith_short_16","alias_value":"HZJAJ7Z4ND3URT2P","created_at":"2026-06-24T01:14:27Z"},{"alias_kind":"pith_short_8","alias_value":"HZJAJ7Z4","created_at":"2026-06-24T01:14:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:HZJAJ7Z4ND3URT2PYCWBZMID7E","target":"record","payload":{"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"},"canonical_sha256":"3e5204ff3c68f748cf4fc0ac1cb103f935d48843d7319d6e1239679c3a7c1787","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"},"source_kind":"arxiv","source_id":"2604.03345","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-24T01:14:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z0wqTAyl/FSckfcZk5YOyfO/uGndnSE7Gh4/O+KaeLg78rvY+UEqNBff+ZCWnk2KnuGgDpxWlcuGeE05oLokDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T22:37:09.987784Z"},"content_sha256":"c253b083856145f7efc343b5d93e3d5ad4cd159c541ea32e40f2b0761f663261","schema_version":"1.0","event_id":"sha256:c253b083856145f7efc343b5d93e3d5ad4cd159c541ea32e40f2b0761f663261"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:HZJAJ7Z4ND3URT2PYCWBZMID7E","target":"graph","payload":{"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"},"verdict_id":"3d817662-71e4-4a19-8846-f6d7c3672a7f"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-24T01:14:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GthsOLwyizAdwKUM0gWw7h9ClFhZS4TVRIBc4s6dHSoHkGcVCYm+8EpwC1DCLPrjltzbt20Uuiv15WhRkzdUBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T22:37:09.988243Z"},"content_sha256":"f8a6b792acd18bd34604b69fcd5406d7fde0e720faed5ab090f36236afe5d9a3","schema_version":"1.0","event_id":"sha256:f8a6b792acd18bd34604b69fcd5406d7fde0e720faed5ab090f36236afe5d9a3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HZJAJ7Z4ND3URT2PYCWBZMID7E/bundle.json","state_url":"https://pith.science/pith/HZJAJ7Z4ND3URT2PYCWBZMID7E/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HZJAJ7Z4ND3URT2PYCWBZMID7E/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-02T22:37:09Z","links":{"resolver":"https://pith.science/pith/HZJAJ7Z4ND3URT2PYCWBZMID7E","bundle":"https://pith.science/pith/HZJAJ7Z4ND3URT2PYCWBZMID7E/bundle.json","state":"https://pith.science/pith/HZJAJ7Z4ND3URT2PYCWBZMID7E/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HZJAJ7Z4ND3URT2PYCWBZMID7E/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:HZJAJ7Z4ND3URT2PYCWBZMID7E","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":"a3c4a099237e00854e7b7d36eb2c380f5161c970f1ee7a3eded7f726df9a02bf","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-04-03T10:18:05Z","title_canon_sha256":"47f171a8d977cee1c119a1f4e207e8731b155e4159455568a79cbd0454422791"},"schema_version":"1.0","source":{"id":"2604.03345","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2604.03345","created_at":"2026-06-24T01:14:27Z"},{"alias_kind":"arxiv_version","alias_value":"2604.03345v2","created_at":"2026-06-24T01:14:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.03345","created_at":"2026-06-24T01:14:27Z"},{"alias_kind":"pith_short_12","alias_value":"HZJAJ7Z4ND3U","created_at":"2026-06-24T01:14:27Z"},{"alias_kind":"pith_short_16","alias_value":"HZJAJ7Z4ND3URT2P","created_at":"2026-06-24T01:14:27Z"},{"alias_kind":"pith_short_8","alias_value":"HZJAJ7Z4","created_at":"2026-06-24T01:14:27Z"}],"graph_snapshots":[{"event_id":"sha256:f8a6b792acd18bd34604b69fcd5406d7fde0e720faed5ab090f36236afe5d9a3","target":"graph","created_at":"2026-06-24T01:14:27Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","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."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","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."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Derives generalized formulas for KAN inference complexity using RM, BOP, and NABS metrics across B-spline, GRBF, Chebyshev, and Fourier variants."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Kolmogorov-Arnold Networks now have platform-independent formulas that count real multiplications, bit operations, and additions for hardware inference."}],"snapshot_sha256":"4b5b1543c135bdc0db32f62b924ce1806757a6bdaac506b649598bb8a8fef406"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2604.03345/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Bilal Khalid, Jaroslaw E. Prilepsky, Pedro Freire, Sergei K. Turitsyn","cross_cats":[],"headline":"Kolmogorov-Arnold Networks now have platform-independent formulas that count real multiplications, bit operations, and additions for hardware inference.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-04-03T10:18:05Z","title":"Hardware-Oriented Inference Complexity of Kolmogorov-Arnold Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2604.03345","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-13T20:26:04.678464Z","id":"3d817662-71e4-4a19-8846-f6d7c3672a7f","model_set":{"reader":"grok-4.3"},"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","pith_extraction_headline":"Kolmogorov-Arnold Networks now have platform-independent formulas that count real multiplications, bit operations, and additions for hardware inference.","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.","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."}},"verdict_id":"3d817662-71e4-4a19-8846-f6d7c3672a7f"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:c253b083856145f7efc343b5d93e3d5ad4cd159c541ea32e40f2b0761f663261","target":"record","created_at":"2026-06-24T01:14:27Z","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":"a3c4a099237e00854e7b7d36eb2c380f5161c970f1ee7a3eded7f726df9a02bf","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-04-03T10:18:05Z","title_canon_sha256":"47f171a8d977cee1c119a1f4e207e8731b155e4159455568a79cbd0454422791"},"schema_version":"1.0","source":{"id":"2604.03345","kind":"arxiv","version":2}},"canonical_sha256":"3e5204ff3c68f748cf4fc0ac1cb103f935d48843d7319d6e1239679c3a7c1787","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3e5204ff3c68f748cf4fc0ac1cb103f935d48843d7319d6e1239679c3a7c1787","first_computed_at":"2026-06-24T01:14:27.438699Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-24T01:14:27.438699Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ADXUKqkiCgPdUaEDCb+9jHtbkecWHlLJYwkX7Aub+qnD3gQOwQu7jMPJDdAQOYBXd1ynckrlK77Xv3psoXbqBA==","signature_status":"signed_v1","signed_at":"2026-06-24T01:14:27.439192Z","signed_message":"canonical_sha256_bytes"},"source_id":"2604.03345","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c253b083856145f7efc343b5d93e3d5ad4cd159c541ea32e40f2b0761f663261","sha256:f8a6b792acd18bd34604b69fcd5406d7fde0e720faed5ab090f36236afe5d9a3"],"state_sha256":"0d3776987526436eeccfe8c5b1472bcc4b17a76d8420f2e300695f216b6230fb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"95NZ19kImWfBrzH+WqmJUbo7gLL2M22KhuNPm16j+V61gjQg0f8J4fhnB2AuxZCX4Wnij1Q5o4a16j41LA0gCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-02T22:37:09.991073Z","bundle_sha256":"570d1212ce86827397fb5d725e8857af86ca1b44aeb92f768969021e18d30ca8"}}