{"_canonicalization":{"envelope_id":"axm_ + sha256(envelope minus {signature, axiom_id, anchors})","envelope_signature":"ed25519(envelope minus {signature, axiom_id})","json":"sort_keys=True, separators=(',',':'), ensure_ascii=False, allow_nan=False, utf-8","leaf_hash":"sha256(0x00 || canonical_json(envelope_full))","seal_signature":"ed25519(seal minus {signature, sig_algorithm})"},"axiom_id":"axm_69278ee8ce6dfa2cbea6b432ee2d919253ee08dfcdcc95b7c0905c09647d06d9","bitcoin_anchor":{"bitcoin_attestations":["bitcoin_block_949451"],"calendar_attestations":["https://finney.calendar.eternitywall.com","https://btc.calendar.catallaxy.com","https://alice.btc.calendar.opentimestamps.org","https://bob.btc.calendar.opentimestamps.org"],"ots_url":"/registry/data/substrate/anchors/77fc9c28fae777b81da5b495b3115474df6592dfac590333213d3bdf8b94a9b3.ots","stamped_at":"2026-05-15T03:00:03Z","status":"bitcoin"},"envelope":{"anchors":[{"chain":"crovia.axiom_graph","height":0,"merkle_proof":"spider_vendor_press_v1","root_at_anchor":"spider_vendor_press_v1"}],"axiom_id":"axm_69278ee8ce6dfa2cbea6b432ee2d919253ee08dfcdcc95b7c0905c09647d06d9","axiom_type":"AX.OBS","body":{"axiom_subtype":"news.vendor_press.v1","category":"news","fingerprint":"456386a4f70987a775c08334b692d29127950fa5cfd1b871298869b93ae9b406","published":"Thu, 07 May 2026 00:00:00 -0400","receipt_hash":"456386a4f70987a775c08334b692d29127950fa5cfd1b871298869b93ae9b406","schema":"spider.news.vendor_press.v1","spider":"vendor_press","spider_record":{"axiom_subtype":"news.vendor_press.v1","category":"news","decision_hint":"POSITIVE","envelope_target":"AX.OBS","fingerprint":"456386a4f70987a775c08334b692d29127950fa5cfd1b871298869b93ae9b406","observed_at":"2026-05-07T04:43:30.601849Z","parent_run_hash":"b20b3beeadde500bb99eda3b869d50b00c5259b2c78c650d83e786ac81b85801","published":"Thu, 07 May 2026 00:00:00 -0400","runtime_version":"0.1.0","schema":"spider.news.vendor_press.v1","source_status":200,"source_url":"https://export.arxiv.org/rss/cs.AI","spider":"vendor_press","summary_excerpt":"arXiv:2605.02927v1 Announce Type: cross \nAbstract: Spiking Neural Networks (SNNs) have garnered increasing attention as one of bio-inspired models due to their great potential in neuromorphic computing and sparse computation. Many practical algorithms and techniques have been developed; however, theoretical understandings of the generalization, that is, the extent to which SNNs perform well on unseen data, are far from clear. Recent advances disclosed an excitation-dependent and architecture-related generalization bound such that the Rademacher complexity of SNNs with stochastic firing can be upper bounded by an exponential function relative to the excitation probability and the architecture depth. In this paper, we theoretically investigate the generalization bounds of SNNs with several integration-and-fire schemes via Rademacher complexity. We recognize that the empirical Rademacher complexity of SNNs is close to the SNN configurations, which is exponential to the network depth and t","title":"Generalization Bounds of Spiking Neural Networks via Rademacher Complexity","url":"https://arxiv.org/abs/2605.02927","vendor":"arxiv_cs_ai"},"summary":"arXiv:2605.02927v1 Announce Type: cross \nAbstract: Spiking Neural Networks (SNNs) have garnered increasing attention as one of bio-inspired models due to their great potential in neuromorphic computing and sparse computation. Many practical algorithms and techniques have been developed; however, theoretical understandings of the generalization, that is, the extent to which SNNs perform well on unseen data, are far from clear. Recent advances disclosed an excitation-dependent and architecture-related generalization bound such that the Rademacher complexity of SNNs with stochastic firing can be upper bounded by an exponential function relative to the excitation probability and the architecture depth. In this paper, we theoretically investigate the generalization bounds of SNNs with several integration-and-fire schemes via Rademacher complexity. We recognize that the empirical Rademacher complexity of SNNs is close to the SNN configurations, which is exponential to the network depth and t","title":"Generalization Bounds of Spiking Neural Networks via Rademacher Complexity","vendor":"arxiv_cs_ai"},"confidence":{"method":"deterministic"},"decision":"POSITIVE","issued_at":"2026-05-07T04:43:30Z","notes":"Spider vendor_press (news) news.vendor_press.v1","object":{"captured_by":"crovia.spider.vendor_press","primary_source_url":"https://arxiv.org/abs/2605.02927"},"predecessors":[],"schema":"crovia.axiom.v1","signature":"ed25519:e044a4d1a71db67e3004ace541d805927db4d339a7e7a7a17ff7c47a1e1b59a3c9f660a3c522582096955b729a276867f173cde657e2a1a4009459fcf096fc00","signer":"crovia.substrate","subject":{"observed_at":"2026-05-07T04:43:30Z","source_collector":"spider:vendor_press","target_id":"https://arxiv.org/abs/2605.02927"},"tsa":{"authority":"crovia.substrate.bootstrap","rfc3161_token":"{\"kind\":\"crovia.bootstrap.tsa\",\"source_jsonl\":\"/opt/crovia/spider/data/news/vendor_press_v1.jsonl\",\"source_seal_merkle_root\":\"spider_vendor_press_v1\",\"upgrade_path\":\"Sessione H \\u2014 OpenTimestamps weekly anchor\"}"},"zk_mode":"clear","zk_proof":null},"ledger":{"leaf_hash":"496a77b8fcd33ae3c3959770865449c4d34ab326435422a4563a318e77dc7338","leaf_index":118220,"ledger_path":"/opt/crovia/substrate/axiom_ledger.jsonl"},"merkle_proof":{"hash_alg":"sha256","leaf_prefix":"0x00","node_prefix":"0x01","odd_leaf_rule":"duplicate_last","path":[{"sibling":"2064035ecb264ae35e81289800f11f11094cc35895cd9e167259ebd98bc5b8b8","side":"right"},{"sibling":"c94733d3cd9e979c252bae64f42fc6003c17d9eb30aa81d4fc6a9948af159fa4","side":"right"},{"sibling":"07f35b420171a7102ec86d009e240796b1f4bb1e0a6334edaf20eb637291d8b2","side":"left"},{"sibling":"dc65ca9e5f87aecb82d6ee44ed320f6194d40471f1087d3af630a17f4c3508dd","side":"left"},{"sibling":"a6ef598ab40441a8ed079d84074d06b5febea003a04fb72b309560a7d89025f5","side":"right"},{"sibling":"c063c39ae694b656fe885810193365d271b3b69afdf3da9ee1836f170f43c681","side":"right"},{"sibling":"1b5d9d099a141dbd9b65685d9424ef07b508b27c0e01ef2b925d1dd5d95de03a","side":"left"},{"sibling":"c25c853cb3dd8c7f1b99fc80fd602c044932de34c1b34bd69ab1d5b8c94e42b1","side":"left"},{"sibling":"3d3124224341dac361f0e93f24f70795342ba216dc1c0065e7fa7592d943b488","side":"left"},{"sibling":"438bef084db8613e8143527769e3c677e12a59f8a6e2dea114f88afab0446a43","side":"right"},{"sibling":"8e758a4477dfc0838d2e8ea2bdbd583bc3192683e75fd9cde217ee6a3b2f3ac8","side":"left"},{"sibling":"4219f746e463e594ccd6447debdf736a57e77319b12bcb74d8ece2b5860064c6","side":"left"},{"sibling":"05f89b32c00462e60adf95c1fe4579cdc2791b36e8b17573d8f3b5fd5da95a0b","side":"right"},{"sibling":"8ccd9937a2c0d5c04044d07d1557791b7d07bb31eac41a39a675608d44b38f23","side":"right"},{"sibling":"3a5e69cf0803f4c91f3895ed7c9a95748fef240bec4422e167c05300f79f06c0","side":"left"},{"sibling":"f2817ab288b5324fe49770372c7a10f33f7cd11005f8d4c0a730316f5229dc98","side":"left"},{"sibling":"725fac972e772ca0dc598810ea1abc70df472f72d2d6ab8a0baee2b80e5d2f4c","side":"left"},{"sibling":"98fc57dfef8873b512edc8340f7181df57302bb96777625e072235c62d7c5895","side":"right"}]},"schema":"crovia.axiom_proof.v1","seal":{"first_collector_run_id":"","first_receipt_hash":"","jsonl_path":"/opt/crovia/substrate/axiom_ledger.jsonl","key_id":"430895f101d38164","last_collector_run_id":"","last_receipt_hash":"","leaf_count":134292,"merkle_root":"77fc9c28fae777b81da5b495b3115474df6592dfac590333213d3bdf8b94a9b3","public_key_hex":"cf742e26f75669dc673cb5c0786a1ae23ae8ca19c347317192ce40c28a7ff25c","run_id":"hourly_json_retrofit_20260515T023701Z","schema":"crovia.seal.v1","seal_family_version":"crovia-seal-family/1","seal_kind":"substrate_batch","sealed_at":"2026-05-15T02:37:25Z","sig_algorithm":"ed25519","signature":"68107a834b00b24f5d4501e5ec727445311f132a486567ecc4c72a4e6dff24c8c21f2de3105293353ba5fdbe370d032819af6aa70f694e2e39b6af6737507009","signer_version":"1.1.0"},"trust_root":{"key_id":"430895f101d38164","public_key_hex":"cf742e26f75669dc673cb5c0786a1ae23ae8ca19c347317192ce40c28a7ff25c","signature_algorithm":"ed25519","url":"/registry/canon/TRUST_ROOT.md"},"verifier":{"spec":"/registry/canon/AXIOM_RECEIPT_v1.md","url":"/v/axm_69278ee8ce6dfa2cbea6b432ee2d919253ee08dfcdcc95b7c0905c09647d06d9"}}