{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:4CNQHFAYQHNFQNWREGF4F2VFCS","short_pith_number":"pith:4CNQHFAY","canonical_record":{"source":{"id":"1803.00412","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-02-28T17:54:24Z","cross_cats_sorted":[],"title_canon_sha256":"12d967f633b4f231f8ce6b19084bc86a55f1d0f010002828515c141f8d803491","abstract_canon_sha256":"37ad3238b6353bc73d2141c03f4d1f7377901d4f12a056c6b955a9e7a5369781"},"schema_version":"1.0"},"canonical_sha256":"e09b03941881da5836d1218bc2eaa514942d1cb8bc07bc949d25d060431c9c9c","source":{"kind":"arxiv","id":"1803.00412","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.00412","created_at":"2026-05-18T00:22:11Z"},{"alias_kind":"arxiv_version","alias_value":"1803.00412v1","created_at":"2026-05-18T00:22:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.00412","created_at":"2026-05-18T00:22:11Z"},{"alias_kind":"pith_short_12","alias_value":"4CNQHFAYQHNF","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"4CNQHFAYQHNFQNWR","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"4CNQHFAY","created_at":"2026-05-18T12:32:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:4CNQHFAYQHNFQNWREGF4F2VFCS","target":"record","payload":{"canonical_record":{"source":{"id":"1803.00412","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-02-28T17:54:24Z","cross_cats_sorted":[],"title_canon_sha256":"12d967f633b4f231f8ce6b19084bc86a55f1d0f010002828515c141f8d803491","abstract_canon_sha256":"37ad3238b6353bc73d2141c03f4d1f7377901d4f12a056c6b955a9e7a5369781"},"schema_version":"1.0"},"canonical_sha256":"e09b03941881da5836d1218bc2eaa514942d1cb8bc07bc949d25d060431c9c9c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:11.795311Z","signature_b64":"O7AtLKjW4cUO2C7EeMxwZF9MvXDMlcWWnipJsx/89+IXXtMTv5mlcQwMPcUiJWWsUPJ/08uswjqoeMaSA6xnAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e09b03941881da5836d1218bc2eaa514942d1cb8bc07bc949d25d060431c9c9c","last_reissued_at":"2026-05-18T00:22:11.794840Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:11.794840Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.00412","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-18T00:22:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3ao56xr5jh9b8Tl5dLU/Zd9UtLat7C9kQfds6feWowkQ8p79auRPCvSbtuHoWrBZtJylpA+rurj0S/LoN7leAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T04:05:55.186044Z"},"content_sha256":"62d2394ab89ed72c6370a3f80db3a286246d0238d0e3548792c2f86bd3c5da4f","schema_version":"1.0","event_id":"sha256:62d2394ab89ed72c6370a3f80db3a286246d0238d0e3548792c2f86bd3c5da4f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:4CNQHFAYQHNFQNWREGF4F2VFCS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A theory of sequence indexing and working memory in recurrent neural networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Denis Kleyko, E. Paxon Frady, Friedrich T. Sommer","submitted_at":"2018-02-28T17:54:24Z","abstract_excerpt":"To accommodate structured approaches of neural computation, we propose a class of recurrent neural networks for indexing and storing sequences of symbols or analog data vectors. These networks with randomized input weights and orthogonal recurrent weights implement coding principles previously described in vector symbolic architectures (VSA), and leverage properties of reservoir computing. In general, the storage in reservoir computing is lossy and crosstalk noise limits the retrieval accuracy and information capacity. A novel theory to optimize memory performance in such networks is presented"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.00412","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-18T00:22:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p95lU6YLlrp9SPigMBDKsknRqqaBOstORKoW5D9L0xjzpx/djxmQKTjetn/sx7Mc/9nVzNcSjrrQjW36wAoVBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T04:05:55.186774Z"},"content_sha256":"8f685ee24186e8dea787295ed25bddcd2d954f392dd9662092ff77ac87890cbe","schema_version":"1.0","event_id":"sha256:8f685ee24186e8dea787295ed25bddcd2d954f392dd9662092ff77ac87890cbe"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4CNQHFAYQHNFQNWREGF4F2VFCS/bundle.json","state_url":"https://pith.science/pith/4CNQHFAYQHNFQNWREGF4F2VFCS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4CNQHFAYQHNFQNWREGF4F2VFCS/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-05-26T04:05:55Z","links":{"resolver":"https://pith.science/pith/4CNQHFAYQHNFQNWREGF4F2VFCS","bundle":"https://pith.science/pith/4CNQHFAYQHNFQNWREGF4F2VFCS/bundle.json","state":"https://pith.science/pith/4CNQHFAYQHNFQNWREGF4F2VFCS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4CNQHFAYQHNFQNWREGF4F2VFCS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:4CNQHFAYQHNFQNWREGF4F2VFCS","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":"37ad3238b6353bc73d2141c03f4d1f7377901d4f12a056c6b955a9e7a5369781","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-02-28T17:54:24Z","title_canon_sha256":"12d967f633b4f231f8ce6b19084bc86a55f1d0f010002828515c141f8d803491"},"schema_version":"1.0","source":{"id":"1803.00412","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.00412","created_at":"2026-05-18T00:22:11Z"},{"alias_kind":"arxiv_version","alias_value":"1803.00412v1","created_at":"2026-05-18T00:22:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.00412","created_at":"2026-05-18T00:22:11Z"},{"alias_kind":"pith_short_12","alias_value":"4CNQHFAYQHNF","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"4CNQHFAYQHNFQNWR","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"4CNQHFAY","created_at":"2026-05-18T12:32:05Z"}],"graph_snapshots":[{"event_id":"sha256:8f685ee24186e8dea787295ed25bddcd2d954f392dd9662092ff77ac87890cbe","target":"graph","created_at":"2026-05-18T00:22:11Z","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":"To accommodate structured approaches of neural computation, we propose a class of recurrent neural networks for indexing and storing sequences of symbols or analog data vectors. These networks with randomized input weights and orthogonal recurrent weights implement coding principles previously described in vector symbolic architectures (VSA), and leverage properties of reservoir computing. In general, the storage in reservoir computing is lossy and crosstalk noise limits the retrieval accuracy and information capacity. A novel theory to optimize memory performance in such networks is presented","authors_text":"Denis Kleyko, E. Paxon Frady, Friedrich T. Sommer","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-02-28T17:54:24Z","title":"A theory of sequence indexing and working memory in recurrent neural networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.00412","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:62d2394ab89ed72c6370a3f80db3a286246d0238d0e3548792c2f86bd3c5da4f","target":"record","created_at":"2026-05-18T00:22:11Z","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":"37ad3238b6353bc73d2141c03f4d1f7377901d4f12a056c6b955a9e7a5369781","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-02-28T17:54:24Z","title_canon_sha256":"12d967f633b4f231f8ce6b19084bc86a55f1d0f010002828515c141f8d803491"},"schema_version":"1.0","source":{"id":"1803.00412","kind":"arxiv","version":1}},"canonical_sha256":"e09b03941881da5836d1218bc2eaa514942d1cb8bc07bc949d25d060431c9c9c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e09b03941881da5836d1218bc2eaa514942d1cb8bc07bc949d25d060431c9c9c","first_computed_at":"2026-05-18T00:22:11.794840Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:22:11.794840Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"O7AtLKjW4cUO2C7EeMxwZF9MvXDMlcWWnipJsx/89+IXXtMTv5mlcQwMPcUiJWWsUPJ/08uswjqoeMaSA6xnAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:22:11.795311Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.00412","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:62d2394ab89ed72c6370a3f80db3a286246d0238d0e3548792c2f86bd3c5da4f","sha256:8f685ee24186e8dea787295ed25bddcd2d954f392dd9662092ff77ac87890cbe"],"state_sha256":"740171ac5fbedbe4a502be83ea6143455d7210e68d549c45b4b86c9da039224a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3phrmHbVf0nHHGMHKELEmM6OQ55sta7dLg4q0KqgfHL19zFHaY/StC9/5tVsyngykoB+C8m3KDTl9S5JM0SCDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T04:05:55.190040Z","bundle_sha256":"12d541d096d19d0a23d59d13e3087597bdae82a9bba435d8a38d6eaad2ff0db3"}}