{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:CJJI4ASGSHX3SATMI2UCMSMQYD","short_pith_number":"pith:CJJI4ASG","canonical_record":{"source":{"id":"1211.4520","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2012-11-19T17:45:25Z","cross_cats_sorted":[],"title_canon_sha256":"23b09b3e104fe1c9bb31249b80192442eaf610354c949e5848df743c7c9895c6","abstract_canon_sha256":"518455336b421eb80392586c113966059e6773f2d398215c5c6ec9ede9e19c0b"},"schema_version":"1.0"},"canonical_sha256":"12528e024691efb9026c46a8264990c0d2a07b1cd8c050e1df533da408628251","source":{"kind":"arxiv","id":"1211.4520","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.4520","created_at":"2026-05-18T03:15:18Z"},{"alias_kind":"arxiv_version","alias_value":"1211.4520v2","created_at":"2026-05-18T03:15:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.4520","created_at":"2026-05-18T03:15:18Z"},{"alias_kind":"pith_short_12","alias_value":"CJJI4ASGSHX3","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"CJJI4ASGSHX3SATM","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"CJJI4ASG","created_at":"2026-05-18T12:27:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:CJJI4ASGSHX3SATMI2UCMSMQYD","target":"record","payload":{"canonical_record":{"source":{"id":"1211.4520","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2012-11-19T17:45:25Z","cross_cats_sorted":[],"title_canon_sha256":"23b09b3e104fe1c9bb31249b80192442eaf610354c949e5848df743c7c9895c6","abstract_canon_sha256":"518455336b421eb80392586c113966059e6773f2d398215c5c6ec9ede9e19c0b"},"schema_version":"1.0"},"canonical_sha256":"12528e024691efb9026c46a8264990c0d2a07b1cd8c050e1df533da408628251","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:15:18.578922Z","signature_b64":"hRQw5bhXSOZ9tGOghuYTRIDGiSOEgbaACVNkoXeb3G93bPZ12NQl3zg3hkw2kroxvZKTtfJMVJUAnDSQGPAxCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"12528e024691efb9026c46a8264990c0d2a07b1cd8c050e1df533da408628251","last_reissued_at":"2026-05-18T03:15:18.578150Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:15:18.578150Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1211.4520","source_version":2,"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-18T03:15:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QAx0F2FLCOVFAkI2ONfvwjiTgD4vGYvIPFUV2oEFvCCaSO7iqkHan1ssZDE0xNlOU6kTcKZzRgMO6vtz0chUDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T19:14:27.178991Z"},"content_sha256":"866aad260f6cf78232e40f83c8c265cdf2988a3a677f22f8631b00a82bbbf192","schema_version":"1.0","event_id":"sha256:866aad260f6cf78232e40f83c8c265cdf2988a3a677f22f8631b00a82bbbf192"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:CJJI4ASGSHX3SATMI2UCMSMQYD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Storing cycles in Hopfield-type networks with pseudoinverse learning rule: admissibility and network topology","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Chuan Zhang, Gerhard Dangelmayr, Iuliana Oprea","submitted_at":"2012-11-19T17:45:25Z","abstract_excerpt":"Cyclic patterns of neuronal activity are ubiquitous in animal nervous systems, and partially responsible for generating and controlling rhythmic movements such as locomotion, respiration, swallowing and so on. Clarifying the role of the network connectivities for generating cyclic patterns is fundamental for understanding the generation of rhythmic movements. In this paper, the storage of binary cycles in neural networks is investigated. We call a cycle $\\Sigma$ admissible if a connectivity matrix satisfying the cycle's transition conditions exists, and construct it using the pseudoinverse lea"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.4520","kind":"arxiv","version":2},"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-18T03:15:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sMetxmF8id4m3nva4qVYMT8Ji68/fLCT60k6r70XNxPfbKlOEhuRhcTj58SpTKlkb3vGFpMOaBTTbhPXCUg1AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T19:14:27.179360Z"},"content_sha256":"73784865e5ed9dfbb06366697c0458b8894371b99368a1e726ea31790800c13c","schema_version":"1.0","event_id":"sha256:73784865e5ed9dfbb06366697c0458b8894371b99368a1e726ea31790800c13c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CJJI4ASGSHX3SATMI2UCMSMQYD/bundle.json","state_url":"https://pith.science/pith/CJJI4ASGSHX3SATMI2UCMSMQYD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CJJI4ASGSHX3SATMI2UCMSMQYD/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-27T19:14:27Z","links":{"resolver":"https://pith.science/pith/CJJI4ASGSHX3SATMI2UCMSMQYD","bundle":"https://pith.science/pith/CJJI4ASGSHX3SATMI2UCMSMQYD/bundle.json","state":"https://pith.science/pith/CJJI4ASGSHX3SATMI2UCMSMQYD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CJJI4ASGSHX3SATMI2UCMSMQYD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:CJJI4ASGSHX3SATMI2UCMSMQYD","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":"518455336b421eb80392586c113966059e6773f2d398215c5c6ec9ede9e19c0b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2012-11-19T17:45:25Z","title_canon_sha256":"23b09b3e104fe1c9bb31249b80192442eaf610354c949e5848df743c7c9895c6"},"schema_version":"1.0","source":{"id":"1211.4520","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.4520","created_at":"2026-05-18T03:15:18Z"},{"alias_kind":"arxiv_version","alias_value":"1211.4520v2","created_at":"2026-05-18T03:15:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.4520","created_at":"2026-05-18T03:15:18Z"},{"alias_kind":"pith_short_12","alias_value":"CJJI4ASGSHX3","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"CJJI4ASGSHX3SATM","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"CJJI4ASG","created_at":"2026-05-18T12:27:01Z"}],"graph_snapshots":[{"event_id":"sha256:73784865e5ed9dfbb06366697c0458b8894371b99368a1e726ea31790800c13c","target":"graph","created_at":"2026-05-18T03:15:18Z","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":"Cyclic patterns of neuronal activity are ubiquitous in animal nervous systems, and partially responsible for generating and controlling rhythmic movements such as locomotion, respiration, swallowing and so on. Clarifying the role of the network connectivities for generating cyclic patterns is fundamental for understanding the generation of rhythmic movements. In this paper, the storage of binary cycles in neural networks is investigated. We call a cycle $\\Sigma$ admissible if a connectivity matrix satisfying the cycle's transition conditions exists, and construct it using the pseudoinverse lea","authors_text":"Chuan Zhang, Gerhard Dangelmayr, Iuliana Oprea","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2012-11-19T17:45:25Z","title":"Storing cycles in Hopfield-type networks with pseudoinverse learning rule: admissibility and network topology"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.4520","kind":"arxiv","version":2},"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:866aad260f6cf78232e40f83c8c265cdf2988a3a677f22f8631b00a82bbbf192","target":"record","created_at":"2026-05-18T03:15:18Z","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":"518455336b421eb80392586c113966059e6773f2d398215c5c6ec9ede9e19c0b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2012-11-19T17:45:25Z","title_canon_sha256":"23b09b3e104fe1c9bb31249b80192442eaf610354c949e5848df743c7c9895c6"},"schema_version":"1.0","source":{"id":"1211.4520","kind":"arxiv","version":2}},"canonical_sha256":"12528e024691efb9026c46a8264990c0d2a07b1cd8c050e1df533da408628251","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"12528e024691efb9026c46a8264990c0d2a07b1cd8c050e1df533da408628251","first_computed_at":"2026-05-18T03:15:18.578150Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:15:18.578150Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hRQw5bhXSOZ9tGOghuYTRIDGiSOEgbaACVNkoXeb3G93bPZ12NQl3zg3hkw2kroxvZKTtfJMVJUAnDSQGPAxCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:15:18.578922Z","signed_message":"canonical_sha256_bytes"},"source_id":"1211.4520","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:866aad260f6cf78232e40f83c8c265cdf2988a3a677f22f8631b00a82bbbf192","sha256:73784865e5ed9dfbb06366697c0458b8894371b99368a1e726ea31790800c13c"],"state_sha256":"7eb7d9aac2d573c468d5129029107c02d4945436f98122088b83c4bc35606664"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KFIo3WyVPSpxQv4inKpprPcc/rV7FvfUymLBz09sTpNvTv3oK17vFcQp49yAnfc1PuWBlX7CAWecJ3p2wgztBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T19:14:27.181306Z","bundle_sha256":"6980af8bafdc7adfe4e1f1c4dba8f0336ce96e9c706f03997a7c5a1250aabe24"}}