{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:4GXKB4KMMTDCMEJGCGDV4UZDNU","short_pith_number":"pith:4GXKB4KM","canonical_record":{"source":{"id":"1811.04233","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-11-10T11:14:06Z","cross_cats_sorted":[],"title_canon_sha256":"69db27260776a3983a11a6b77b3518cbc7e1e79231697d5479590d792741b02a","abstract_canon_sha256":"c94dd9d9baf300dc3b949f54664eabd13526f70dc84460eebf9129750ae0ca86"},"schema_version":"1.0"},"canonical_sha256":"e1aea0f14c64c626112611875e53236d1520c6dfd17c2fd3ee791908357073ed","source":{"kind":"arxiv","id":"1811.04233","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.04233","created_at":"2026-07-05T02:48:49Z"},{"alias_kind":"arxiv_version","alias_value":"1811.04233v1","created_at":"2026-07-05T02:48:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.04233","created_at":"2026-07-05T02:48:49Z"},{"alias_kind":"pith_short_12","alias_value":"4GXKB4KMMTDC","created_at":"2026-07-05T02:48:49Z"},{"alias_kind":"pith_short_16","alias_value":"4GXKB4KMMTDCMEJG","created_at":"2026-07-05T02:48:49Z"},{"alias_kind":"pith_short_8","alias_value":"4GXKB4KM","created_at":"2026-07-05T02:48:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:4GXKB4KMMTDCMEJGCGDV4UZDNU","target":"record","payload":{"canonical_record":{"source":{"id":"1811.04233","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-11-10T11:14:06Z","cross_cats_sorted":[],"title_canon_sha256":"69db27260776a3983a11a6b77b3518cbc7e1e79231697d5479590d792741b02a","abstract_canon_sha256":"c94dd9d9baf300dc3b949f54664eabd13526f70dc84460eebf9129750ae0ca86"},"schema_version":"1.0"},"canonical_sha256":"e1aea0f14c64c626112611875e53236d1520c6dfd17c2fd3ee791908357073ed","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:48:49.661132Z","signature_b64":"nvDa/+N5p/z6diXAcvnB5p967MFV2+vAzmGPsCSRtcRydyXbeHfCSc329aIvpfEp1GBXxJFabTtNleFD/RvaCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e1aea0f14c64c626112611875e53236d1520c6dfd17c2fd3ee791908357073ed","last_reissued_at":"2026-07-05T02:48:49.660704Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:48:49.660704Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.04233","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-05T02:48:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iqrIT0TXkWniq6x0m8dPxTLirWSbNoM0zIigxbDAjLMYig8jDkDaQoMLqKrgiToYSCC7QJa4Siayja9I7fxUDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T15:24:39.840043Z"},"content_sha256":"04fbd1089c7d48c0baec9d9cac56d19df41cf4746bdffe2e77b9f369ff5fbfad","schema_version":"1.0","event_id":"sha256:04fbd1089c7d48c0baec9d9cac56d19df41cf4746bdffe2e77b9f369ff5fbfad"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:4GXKB4KMMTDCMEJGCGDV4UZDNU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Spiking Neural Networks with Logarithmic Temporal Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"De Ma, Gang Pan, Ming Zhang, Nenggan Zheng, Zonghua Gu","submitted_at":"2018-11-10T11:14:06Z","abstract_excerpt":"A Spiking Neural Network (SNN) can be trained indirectly by first training an Artificial Neural Network (ANN) with the conventional backpropagation algorithm, then converting it into an SNN. The conventional rate-coding method for SNNs uses the number of spikes to encode magnitude of an activation value, and may be computationally inefficient due to the large number of spikes. Temporal-coding is typically more efficient by leveraging the timing of spikes to encode information. In this paper, we present Logarithmic Temporal Coding (LTC), where the number of spikes used to encode an activation v"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.04233","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/1811.04233/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-05T02:48:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PqjLP7Q5d9ovYxcZjykDCYgEkC8BgIHzTve4VlARw5o28X0o/gq5p84wMlpdQYEAfKG/UOi6GvG+58tVLBw7BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T15:24:39.840543Z"},"content_sha256":"b0c94458d08524fa75b9ec06b51cfaefa9911634ea5a435f21cbd38df2e1bbc3","schema_version":"1.0","event_id":"sha256:b0c94458d08524fa75b9ec06b51cfaefa9911634ea5a435f21cbd38df2e1bbc3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4GXKB4KMMTDCMEJGCGDV4UZDNU/bundle.json","state_url":"https://pith.science/pith/4GXKB4KMMTDCMEJGCGDV4UZDNU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4GXKB4KMMTDCMEJGCGDV4UZDNU/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-06T15:24:39Z","links":{"resolver":"https://pith.science/pith/4GXKB4KMMTDCMEJGCGDV4UZDNU","bundle":"https://pith.science/pith/4GXKB4KMMTDCMEJGCGDV4UZDNU/bundle.json","state":"https://pith.science/pith/4GXKB4KMMTDCMEJGCGDV4UZDNU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4GXKB4KMMTDCMEJGCGDV4UZDNU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:4GXKB4KMMTDCMEJGCGDV4UZDNU","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":"c94dd9d9baf300dc3b949f54664eabd13526f70dc84460eebf9129750ae0ca86","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-11-10T11:14:06Z","title_canon_sha256":"69db27260776a3983a11a6b77b3518cbc7e1e79231697d5479590d792741b02a"},"schema_version":"1.0","source":{"id":"1811.04233","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.04233","created_at":"2026-07-05T02:48:49Z"},{"alias_kind":"arxiv_version","alias_value":"1811.04233v1","created_at":"2026-07-05T02:48:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.04233","created_at":"2026-07-05T02:48:49Z"},{"alias_kind":"pith_short_12","alias_value":"4GXKB4KMMTDC","created_at":"2026-07-05T02:48:49Z"},{"alias_kind":"pith_short_16","alias_value":"4GXKB4KMMTDCMEJG","created_at":"2026-07-05T02:48:49Z"},{"alias_kind":"pith_short_8","alias_value":"4GXKB4KM","created_at":"2026-07-05T02:48:49Z"}],"graph_snapshots":[{"event_id":"sha256:b0c94458d08524fa75b9ec06b51cfaefa9911634ea5a435f21cbd38df2e1bbc3","target":"graph","created_at":"2026-07-05T02:48:49Z","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/1811.04233/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A Spiking Neural Network (SNN) can be trained indirectly by first training an Artificial Neural Network (ANN) with the conventional backpropagation algorithm, then converting it into an SNN. The conventional rate-coding method for SNNs uses the number of spikes to encode magnitude of an activation value, and may be computationally inefficient due to the large number of spikes. Temporal-coding is typically more efficient by leveraging the timing of spikes to encode information. In this paper, we present Logarithmic Temporal Coding (LTC), where the number of spikes used to encode an activation v","authors_text":"De Ma, Gang Pan, Ming Zhang, Nenggan Zheng, Zonghua Gu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-11-10T11:14:06Z","title":"Efficient Spiking Neural Networks with Logarithmic Temporal Coding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.04233","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:04fbd1089c7d48c0baec9d9cac56d19df41cf4746bdffe2e77b9f369ff5fbfad","target":"record","created_at":"2026-07-05T02:48:49Z","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":"c94dd9d9baf300dc3b949f54664eabd13526f70dc84460eebf9129750ae0ca86","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-11-10T11:14:06Z","title_canon_sha256":"69db27260776a3983a11a6b77b3518cbc7e1e79231697d5479590d792741b02a"},"schema_version":"1.0","source":{"id":"1811.04233","kind":"arxiv","version":1}},"canonical_sha256":"e1aea0f14c64c626112611875e53236d1520c6dfd17c2fd3ee791908357073ed","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e1aea0f14c64c626112611875e53236d1520c6dfd17c2fd3ee791908357073ed","first_computed_at":"2026-07-05T02:48:49.660704Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:48:49.660704Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nvDa/+N5p/z6diXAcvnB5p967MFV2+vAzmGPsCSRtcRydyXbeHfCSc329aIvpfEp1GBXxJFabTtNleFD/RvaCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T02:48:49.661132Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.04233","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:04fbd1089c7d48c0baec9d9cac56d19df41cf4746bdffe2e77b9f369ff5fbfad","sha256:b0c94458d08524fa75b9ec06b51cfaefa9911634ea5a435f21cbd38df2e1bbc3"],"state_sha256":"4bf5ebf371921f62a5a3cc23263628b8bde87f68ac6e7ef6db3d8d7049f75899"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PlLoehw/yTL6qYR61HsIEceIkVAPVDiiIp+ZKJaIJHsxpJSVW0fxWeDd5LJqCYf4t0Z0a2Xd3oL9nARqrz3SBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T15:24:39.844072Z","bundle_sha256":"e0d67c38fc827a0a8dcd321ab0ffff4157481e32812b182f371f2fbe4623657d"}}