{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:BXNK55TWETLJDDJAZBGXLWVYRD","short_pith_number":"pith:BXNK55TW","schema_version":"1.0","canonical_sha256":"0ddaaef67624d6918d20c84d75dab888fab3d069aee54aa3cb79ce337c6cba73","source":{"kind":"arxiv","id":"1901.07718","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1901.07718","created_at":"2026-05-17T23:55:41.726902+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.07718v1","created_at":"2026-05-17T23:55:41.726902+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.07718","created_at":"2026-05-17T23:55:41.726902+00:00"},{"alias_kind":"pith_short_12","alias_value":"BXNK55TWETLJ","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_16","alias_value":"BXNK55TWETLJDDJA","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_8","alias_value":"BXNK55TW","created_at":"2026-05-18T12:33:12.712433+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BXNK55TWETLJDDJAZBGXLWVYRD","json":"https://pith.science/pith/BXNK55TWETLJDDJAZBGXLWVYRD.json","graph_json":"https://pith.science/api/pith-number/BXNK55TWETLJDDJAZBGXLWVYRD/graph.json","events_json":"https://pith.science/api/pith-number/BXNK55TWETLJDDJAZBGXLWVYRD/events.json","paper":"https://pith.science/paper/BXNK55TW"},"agent_actions":{"view_html":"https://pith.science/pith/BXNK55TWETLJDDJAZBGXLWVYRD","download_json":"https://pith.science/pith/BXNK55TWETLJDDJAZBGXLWVYRD.json","view_paper":"https://pith.science/paper/BXNK55TW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.07718&json=true","fetch_graph":"https://pith.science/api/pith-number/BXNK55TWETLJDDJAZBGXLWVYRD/graph.json","fetch_events":"https://pith.science/api/pith-number/BXNK55TWETLJDDJAZBGXLWVYRD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BXNK55TWETLJDDJAZBGXLWVYRD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BXNK55TWETLJDDJAZBGXLWVYRD/action/storage_attestation","attest_author":"https://pith.science/pith/BXNK55TWETLJDDJAZBGXLWVYRD/action/author_attestation","sign_citation":"https://pith.science/pith/BXNK55TWETLJDDJAZBGXLWVYRD/action/citation_signature","submit_replication":"https://pith.science/pith/BXNK55TWETLJDDJAZBGXLWVYRD/action/replication_record"}},"created_at":"2026-05-17T23:55:41.726902+00:00","updated_at":"2026-05-17T23:55:41.726902+00:00"}