{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:K2W32HTSXZSK6T2NFDQUSWU76X","short_pith_number":"pith:K2W32HTS","canonical_record":{"source":{"id":"2506.12087","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.NE","submitted_at":"2025-06-10T13:27:27Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"eaaf3a43c8f569a1fb9a1cb4c55b8cc08b1bfa479dad688712181192489fa72b","abstract_canon_sha256":"a7e660e9cc5b9c550e8094772c31836fea850cd9d85d1bec497a30251530e42e"},"schema_version":"1.0"},"canonical_sha256":"56adbd1e72be64af4f4d28e1495a9ff5f4f26d9e1c17c06c55213fd02e5079a7","source":{"kind":"arxiv","id":"2506.12087","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.12087","created_at":"2026-07-05T11:21:16Z"},{"alias_kind":"arxiv_version","alias_value":"2506.12087v1","created_at":"2026-07-05T11:21:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.12087","created_at":"2026-07-05T11:21:16Z"},{"alias_kind":"pith_short_12","alias_value":"K2W32HTSXZSK","created_at":"2026-07-05T11:21:16Z"},{"alias_kind":"pith_short_16","alias_value":"K2W32HTSXZSK6T2N","created_at":"2026-07-05T11:21:16Z"},{"alias_kind":"pith_short_8","alias_value":"K2W32HTS","created_at":"2026-07-05T11:21:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:K2W32HTSXZSK6T2NFDQUSWU76X","target":"record","payload":{"canonical_record":{"source":{"id":"2506.12087","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.NE","submitted_at":"2025-06-10T13:27:27Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"eaaf3a43c8f569a1fb9a1cb4c55b8cc08b1bfa479dad688712181192489fa72b","abstract_canon_sha256":"a7e660e9cc5b9c550e8094772c31836fea850cd9d85d1bec497a30251530e42e"},"schema_version":"1.0"},"canonical_sha256":"56adbd1e72be64af4f4d28e1495a9ff5f4f26d9e1c17c06c55213fd02e5079a7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:21:16.862280Z","signature_b64":"HrDnX6qaC0NSf+W8XLrLCWe2b5CpsY2jNVghfgEgX7KqHvOqXCxGSdNeYtHyWvEl8RaU/8WJn+9VfLbOWinhDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"56adbd1e72be64af4f4d28e1495a9ff5f4f26d9e1c17c06c55213fd02e5079a7","last_reissued_at":"2026-07-05T11:21:16.861870Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:21:16.861870Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2506.12087","source_version":1,"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-07-05T11:21:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lqpNUECMJan5f7lgF/SqTVL5bZ+zts8nqUfTFma4MQBcV7ydOAG8XUkVcWirXgktI1ecb/AfXc4v41l8TdCbDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T02:23:07.176418Z"},"content_sha256":"20d38cb5c0777fcb4a44a9b2952dfdc56ca5ea53e114efd7cb6232cca0a68a04","schema_version":"1.0","event_id":"sha256:20d38cb5c0777fcb4a44a9b2952dfdc56ca5ea53e114efd7cb6232cca0a68a04"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:K2W32HTSXZSK6T2NFDQUSWU76X","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Parallel Training Methods for Spiking Neural Networks with Constant Time Complexity","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.NE","authors_text":"Chunyan Miao, Hailong Shi, Peilin Zhao, Pengcheng Wu, Wanjin Feng, Wenqian Du, Xingyu Gao","submitted_at":"2025-06-10T13:27:27Z","abstract_excerpt":"Spiking Neural Networks (SNNs) often suffer from high time complexity $O(T)$ due to the sequential processing of $T$ spikes, making training computationally expensive.\n  In this paper, we propose a novel Fixed-point Parallel Training (FPT) method to accelerate SNN training without modifying the network architecture or introducing additional assumptions.\n  FPT reduces the time complexity to $O(K)$, where $K$ is a small constant (usually $K=3$), by using a fixed-point iteration form of Leaky Integrate-and-Fire (LIF) neurons for all $T$ timesteps.\n  We provide a theoretical convergence analysis o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.12087","kind":"arxiv","version":1},"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/2506.12087/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":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T11:21:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FNQSDt9VfOSowQkqjp3WYtSLAlUN63gj1L+9nX+Xod/5B2MBXbjShv82DHucvHCmJjcv3oRWXazFkfYFaDzRAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T02:23:07.176913Z"},"content_sha256":"af4029d5f345db3cdd0bcae03f01fdcaa83d9685a44777086a4f77527a6d1aff","schema_version":"1.0","event_id":"sha256:af4029d5f345db3cdd0bcae03f01fdcaa83d9685a44777086a4f77527a6d1aff"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/K2W32HTSXZSK6T2NFDQUSWU76X/bundle.json","state_url":"https://pith.science/pith/K2W32HTSXZSK6T2NFDQUSWU76X/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/K2W32HTSXZSK6T2NFDQUSWU76X/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-08-04T02:23:07Z","links":{"resolver":"https://pith.science/pith/K2W32HTSXZSK6T2NFDQUSWU76X","bundle":"https://pith.science/pith/K2W32HTSXZSK6T2NFDQUSWU76X/bundle.json","state":"https://pith.science/pith/K2W32HTSXZSK6T2NFDQUSWU76X/state.json","well_known_bundle":"https://pith.science/.well-known/pith/K2W32HTSXZSK6T2NFDQUSWU76X/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:K2W32HTSXZSK6T2NFDQUSWU76X","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":"a7e660e9cc5b9c550e8094772c31836fea850cd9d85d1bec497a30251530e42e","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.NE","submitted_at":"2025-06-10T13:27:27Z","title_canon_sha256":"eaaf3a43c8f569a1fb9a1cb4c55b8cc08b1bfa479dad688712181192489fa72b"},"schema_version":"1.0","source":{"id":"2506.12087","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.12087","created_at":"2026-07-05T11:21:16Z"},{"alias_kind":"arxiv_version","alias_value":"2506.12087v1","created_at":"2026-07-05T11:21:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.12087","created_at":"2026-07-05T11:21:16Z"},{"alias_kind":"pith_short_12","alias_value":"K2W32HTSXZSK","created_at":"2026-07-05T11:21:16Z"},{"alias_kind":"pith_short_16","alias_value":"K2W32HTSXZSK6T2N","created_at":"2026-07-05T11:21:16Z"},{"alias_kind":"pith_short_8","alias_value":"K2W32HTS","created_at":"2026-07-05T11:21:16Z"}],"graph_snapshots":[{"event_id":"sha256:af4029d5f345db3cdd0bcae03f01fdcaa83d9685a44777086a4f77527a6d1aff","target":"graph","created_at":"2026-07-05T11:21:16Z","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":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2506.12087/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Spiking Neural Networks (SNNs) often suffer from high time complexity $O(T)$ due to the sequential processing of $T$ spikes, making training computationally expensive.\n  In this paper, we propose a novel Fixed-point Parallel Training (FPT) method to accelerate SNN training without modifying the network architecture or introducing additional assumptions.\n  FPT reduces the time complexity to $O(K)$, where $K$ is a small constant (usually $K=3$), by using a fixed-point iteration form of Leaky Integrate-and-Fire (LIF) neurons for all $T$ timesteps.\n  We provide a theoretical convergence analysis o","authors_text":"Chunyan Miao, Hailong Shi, Peilin Zhao, Pengcheng Wu, Wanjin Feng, Wenqian Du, Xingyu Gao","cross_cats":["cs.AI"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.NE","submitted_at":"2025-06-10T13:27:27Z","title":"Efficient Parallel Training Methods for Spiking Neural Networks with Constant Time Complexity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.12087","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:20d38cb5c0777fcb4a44a9b2952dfdc56ca5ea53e114efd7cb6232cca0a68a04","target":"record","created_at":"2026-07-05T11:21:16Z","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":"a7e660e9cc5b9c550e8094772c31836fea850cd9d85d1bec497a30251530e42e","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.NE","submitted_at":"2025-06-10T13:27:27Z","title_canon_sha256":"eaaf3a43c8f569a1fb9a1cb4c55b8cc08b1bfa479dad688712181192489fa72b"},"schema_version":"1.0","source":{"id":"2506.12087","kind":"arxiv","version":1}},"canonical_sha256":"56adbd1e72be64af4f4d28e1495a9ff5f4f26d9e1c17c06c55213fd02e5079a7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"56adbd1e72be64af4f4d28e1495a9ff5f4f26d9e1c17c06c55213fd02e5079a7","first_computed_at":"2026-07-05T11:21:16.861870Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:21:16.861870Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HrDnX6qaC0NSf+W8XLrLCWe2b5CpsY2jNVghfgEgX7KqHvOqXCxGSdNeYtHyWvEl8RaU/8WJn+9VfLbOWinhDg==","signature_status":"signed_v1","signed_at":"2026-07-05T11:21:16.862280Z","signed_message":"canonical_sha256_bytes"},"source_id":"2506.12087","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:20d38cb5c0777fcb4a44a9b2952dfdc56ca5ea53e114efd7cb6232cca0a68a04","sha256:af4029d5f345db3cdd0bcae03f01fdcaa83d9685a44777086a4f77527a6d1aff"],"state_sha256":"504a8baca3e93eaca2ae85df6b0fe690081ed25d7e71bacaae3b002b317234e6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RXbTijTJGm8QisAjF4wN7BNbWAOvuWSpIy6gSKFZBRKST6OATzoohK/KCnIERuf/qYm9U0hGwg9yTTY+EOj6CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T02:23:07.180341Z","bundle_sha256":"c8da7b33e68cac235f974783e19da96929e045661bc8b553c9ab70a56b917abd"}}