{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:BXNK55TWETLJDDJAZBGXLWVYRD","short_pith_number":"pith:BXNK55TW","canonical_record":{"source":{"id":"1901.07718","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2019-01-23T04:31:04Z","cross_cats_sorted":[],"title_canon_sha256":"91e5936160969e23b79394b364c0c0cd45144833989398e149ee07edf9a4d29a","abstract_canon_sha256":"1357c24262387bc28402d195f352f559967aa7edf2779c7878740011fda46e96"},"schema_version":"1.0"},"canonical_sha256":"0ddaaef67624d6918d20c84d75dab888fab3d069aee54aa3cb79ce337c6cba73","source":{"kind":"arxiv","id":"1901.07718","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.07718","created_at":"2026-05-17T23:55:41Z"},{"alias_kind":"arxiv_version","alias_value":"1901.07718v1","created_at":"2026-05-17T23:55:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.07718","created_at":"2026-05-17T23:55:41Z"},{"alias_kind":"pith_short_12","alias_value":"BXNK55TWETLJ","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"BXNK55TWETLJDDJA","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"BXNK55TW","created_at":"2026-05-18T12:33:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:BXNK55TWETLJDDJAZBGXLWVYRD","target":"record","payload":{"canonical_record":{"source":{"id":"1901.07718","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2019-01-23T04:31:04Z","cross_cats_sorted":[],"title_canon_sha256":"91e5936160969e23b79394b364c0c0cd45144833989398e149ee07edf9a4d29a","abstract_canon_sha256":"1357c24262387bc28402d195f352f559967aa7edf2779c7878740011fda46e96"},"schema_version":"1.0"},"canonical_sha256":"0ddaaef67624d6918d20c84d75dab888fab3d069aee54aa3cb79ce337c6cba73","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:41.727437Z","signature_b64":"tu3i5DkSuTmXSPS58SmuNUi5aUUZNvL5GATdr0oku+j6cCu7EoUH2gb5BRii6C64xgHBHgKM+gfqUcg6QvskBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0ddaaef67624d6918d20c84d75dab888fab3d069aee54aa3cb79ce337c6cba73","last_reissued_at":"2026-05-17T23:55:41.726817Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:41.726817Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1901.07718","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-05-17T23:55:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JqpJ0Lo5py06Kqyx6JDrnYhhAgR5vWtL8xIYHMBSV7YAm3M0wQentZq1Nnqp1H4ZdGcb16F/vWq/2nZddOSYCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T12:33:49.987086Z"},"content_sha256":"3a7593e8346e77314562e232d83ad619c37571d292406d3582fae8e7f63cc9dc","schema_version":"1.0","event_id":"sha256:3a7593e8346e77314562e232d83ad619c37571d292406d3582fae8e7f63cc9dc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:BXNK55TWETLJDDJAZBGXLWVYRD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Robust computation with rhythmic spike patterns","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"E. Paxon Frady, Friedrich T. Sommer","submitted_at":"2019-01-23T04:31:04Z","abstract_excerpt":"Information coding by precise timing of spikes can be faster and more energy-efficient than traditional rate coding. However, spike-timing codes are often brittle, which has limited their use in theoretical neuroscience and computing applications. Here, we propose a novel type of attractor neural network in complex state space, and show how it can be leveraged to construct spiking neural networks with robust computational properties through a phase-to-timing mapping. Building on Hebbian neural associative memories, like Hopfield networks, we first propose threshold phasor associative memory (T"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.07718","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":""},"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-05-17T23:55:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jjAlOKsCJuf3kD/UWbeLcMqgpD27cjY2ipUSZ0kl5EHp35Uzk85bilNaFh3pIUdoFMB9X7pBH/OqeQcAsEw0BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T12:33:49.987432Z"},"content_sha256":"ec5e7cc5a8648d0e7958226d2c2511105057a76d0b34351b0ceb800952ca6f25","schema_version":"1.0","event_id":"sha256:ec5e7cc5a8648d0e7958226d2c2511105057a76d0b34351b0ceb800952ca6f25"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BXNK55TWETLJDDJAZBGXLWVYRD/bundle.json","state_url":"https://pith.science/pith/BXNK55TWETLJDDJAZBGXLWVYRD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BXNK55TWETLJDDJAZBGXLWVYRD/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-06-29T12:33:49Z","links":{"resolver":"https://pith.science/pith/BXNK55TWETLJDDJAZBGXLWVYRD","bundle":"https://pith.science/pith/BXNK55TWETLJDDJAZBGXLWVYRD/bundle.json","state":"https://pith.science/pith/BXNK55TWETLJDDJAZBGXLWVYRD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BXNK55TWETLJDDJAZBGXLWVYRD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:BXNK55TWETLJDDJAZBGXLWVYRD","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":"1357c24262387bc28402d195f352f559967aa7edf2779c7878740011fda46e96","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2019-01-23T04:31:04Z","title_canon_sha256":"91e5936160969e23b79394b364c0c0cd45144833989398e149ee07edf9a4d29a"},"schema_version":"1.0","source":{"id":"1901.07718","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.07718","created_at":"2026-05-17T23:55:41Z"},{"alias_kind":"arxiv_version","alias_value":"1901.07718v1","created_at":"2026-05-17T23:55:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.07718","created_at":"2026-05-17T23:55:41Z"},{"alias_kind":"pith_short_12","alias_value":"BXNK55TWETLJ","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"BXNK55TWETLJDDJA","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"BXNK55TW","created_at":"2026-05-18T12:33:12Z"}],"graph_snapshots":[{"event_id":"sha256:ec5e7cc5a8648d0e7958226d2c2511105057a76d0b34351b0ceb800952ca6f25","target":"graph","created_at":"2026-05-17T23:55:41Z","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"},"paper":{"abstract_excerpt":"Information coding by precise timing of spikes can be faster and more energy-efficient than traditional rate coding. However, spike-timing codes are often brittle, which has limited their use in theoretical neuroscience and computing applications. Here, we propose a novel type of attractor neural network in complex state space, and show how it can be leveraged to construct spiking neural networks with robust computational properties through a phase-to-timing mapping. Building on Hebbian neural associative memories, like Hopfield networks, we first propose threshold phasor associative memory (T","authors_text":"E. Paxon Frady, Friedrich T. Sommer","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2019-01-23T04:31:04Z","title":"Robust computation with rhythmic spike patterns"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.07718","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:3a7593e8346e77314562e232d83ad619c37571d292406d3582fae8e7f63cc9dc","target":"record","created_at":"2026-05-17T23:55:41Z","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":"1357c24262387bc28402d195f352f559967aa7edf2779c7878740011fda46e96","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2019-01-23T04:31:04Z","title_canon_sha256":"91e5936160969e23b79394b364c0c0cd45144833989398e149ee07edf9a4d29a"},"schema_version":"1.0","source":{"id":"1901.07718","kind":"arxiv","version":1}},"canonical_sha256":"0ddaaef67624d6918d20c84d75dab888fab3d069aee54aa3cb79ce337c6cba73","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0ddaaef67624d6918d20c84d75dab888fab3d069aee54aa3cb79ce337c6cba73","first_computed_at":"2026-05-17T23:55:41.726817Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:55:41.726817Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tu3i5DkSuTmXSPS58SmuNUi5aUUZNvL5GATdr0oku+j6cCu7EoUH2gb5BRii6C64xgHBHgKM+gfqUcg6QvskBw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:55:41.727437Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.07718","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3a7593e8346e77314562e232d83ad619c37571d292406d3582fae8e7f63cc9dc","sha256:ec5e7cc5a8648d0e7958226d2c2511105057a76d0b34351b0ceb800952ca6f25"],"state_sha256":"58589e74b0b85c9a4094e8685a801d2504bc9fc03bd08a2955861e9e82604b51"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w6A4H4Nk15Taay8Ee8ygim5WF1QL2rkJ0lxym4p3yb8r7jLRTTclrjajPY88+mmBDROJ4vqHDI6QeJbmRyeHAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T12:33:49.989252Z","bundle_sha256":"58df6756036014d0b4ce2dcf3a3835b5da50f5c6382232a0a784a574ffecec0f"}}