{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:WQY2NSI6EAILZMEI4BMASG6CKO","short_pith_number":"pith:WQY2NSI6","canonical_record":{"source":{"id":"1803.05383","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-02-14T02:45:26Z","cross_cats_sorted":["cond-mat.dis-nn"],"title_canon_sha256":"a16bdb3f09962feb5f136ca763b41ed0b49258debe5e94ce7a9c2aa4d143b08f","abstract_canon_sha256":"11d9dc7b520786e5b37048da7d9cd7c01473ca61250d1f02159fe710dd4846e9"},"schema_version":"1.0"},"canonical_sha256":"b431a6c91e2010bcb088e058091bc253b8ccdcc282e3109ad69c7ce784f49e22","source":{"kind":"arxiv","id":"1803.05383","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.05383","created_at":"2026-05-18T00:21:01Z"},{"alias_kind":"arxiv_version","alias_value":"1803.05383v1","created_at":"2026-05-18T00:21:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.05383","created_at":"2026-05-18T00:21:01Z"},{"alias_kind":"pith_short_12","alias_value":"WQY2NSI6EAIL","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"WQY2NSI6EAILZMEI","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"WQY2NSI6","created_at":"2026-05-18T12:33:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:WQY2NSI6EAILZMEI4BMASG6CKO","target":"record","payload":{"canonical_record":{"source":{"id":"1803.05383","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-02-14T02:45:26Z","cross_cats_sorted":["cond-mat.dis-nn"],"title_canon_sha256":"a16bdb3f09962feb5f136ca763b41ed0b49258debe5e94ce7a9c2aa4d143b08f","abstract_canon_sha256":"11d9dc7b520786e5b37048da7d9cd7c01473ca61250d1f02159fe710dd4846e9"},"schema_version":"1.0"},"canonical_sha256":"b431a6c91e2010bcb088e058091bc253b8ccdcc282e3109ad69c7ce784f49e22","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:21:01.476708Z","signature_b64":"EBGplq2GMIVBiUibD5VQZQKC/1pbZMbaRXSDT8CUOgxmGzzoht6AZVg0WvI0ilaZkalNSHBIvuvFHzBk+E48Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b431a6c91e2010bcb088e058091bc253b8ccdcc282e3109ad69c7ce784f49e22","last_reissued_at":"2026-05-18T00:21:01.476296Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:21:01.476296Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.05383","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:21:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0Vti2/b+y6ZApt/QkBOR1syp6PuGobjAsJNvz/pvZzAWGuK3g+pV7C62MXlpiLQfQDbMsDWf/j2IXoHgIWd8Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T14:43:31.496611Z"},"content_sha256":"fe1cf2baca047f837a016519d72c90c6d07654cc225f3d484eff31a3ed580e36","schema_version":"1.0","event_id":"sha256:fe1cf2baca047f837a016519d72c90c6d07654cc225f3d484eff31a3ed580e36"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:WQY2NSI6EAILZMEI4BMASG6CKO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Use of recurrent infomax to improve the memory capability of input-driven recurrent neural networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.dis-nn"],"primary_cat":"cs.NE","authors_text":"Hisashi Iwade, Kohei Nakajima, Takuma Tanaka, Toshio Aoyagi","submitted_at":"2018-02-14T02:45:26Z","abstract_excerpt":"The inherent transient dynamics of recurrent neural networks (RNNs) have been exploited as a computational resource in input-driven RNNs. However, the information processing capability varies from RNN to RNN, depending on their properties. Many authors have investigated the dynamics of RNNs and their relevance to the information processing capability. In this study, we present a detailed analysis of the information processing capability of an RNN optimized by recurrent infomax (RI), which is an unsupervised learning scheme that maximizes the mutual information of RNNs by adjusting the connecti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.05383","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:21:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H+jK6mFKZ9sZxHFHb/s2mTqgdNk8C7kNiCpg87IUtNSy9IQKXCXrjCnmTocV0zJwCNuk2FwmNvfi2zZwpeTPAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T14:43:31.497348Z"},"content_sha256":"e42a9efa09f4c640bb92a9268bb783afc21d66ea1dbbcf876de711b2a1751c9a","schema_version":"1.0","event_id":"sha256:e42a9efa09f4c640bb92a9268bb783afc21d66ea1dbbcf876de711b2a1751c9a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WQY2NSI6EAILZMEI4BMASG6CKO/bundle.json","state_url":"https://pith.science/pith/WQY2NSI6EAILZMEI4BMASG6CKO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WQY2NSI6EAILZMEI4BMASG6CKO/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-30T14:43:31Z","links":{"resolver":"https://pith.science/pith/WQY2NSI6EAILZMEI4BMASG6CKO","bundle":"https://pith.science/pith/WQY2NSI6EAILZMEI4BMASG6CKO/bundle.json","state":"https://pith.science/pith/WQY2NSI6EAILZMEI4BMASG6CKO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WQY2NSI6EAILZMEI4BMASG6CKO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:WQY2NSI6EAILZMEI4BMASG6CKO","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":"11d9dc7b520786e5b37048da7d9cd7c01473ca61250d1f02159fe710dd4846e9","cross_cats_sorted":["cond-mat.dis-nn"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-02-14T02:45:26Z","title_canon_sha256":"a16bdb3f09962feb5f136ca763b41ed0b49258debe5e94ce7a9c2aa4d143b08f"},"schema_version":"1.0","source":{"id":"1803.05383","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.05383","created_at":"2026-05-18T00:21:01Z"},{"alias_kind":"arxiv_version","alias_value":"1803.05383v1","created_at":"2026-05-18T00:21:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.05383","created_at":"2026-05-18T00:21:01Z"},{"alias_kind":"pith_short_12","alias_value":"WQY2NSI6EAIL","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"WQY2NSI6EAILZMEI","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"WQY2NSI6","created_at":"2026-05-18T12:33:01Z"}],"graph_snapshots":[{"event_id":"sha256:e42a9efa09f4c640bb92a9268bb783afc21d66ea1dbbcf876de711b2a1751c9a","target":"graph","created_at":"2026-05-18T00:21:01Z","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":"The inherent transient dynamics of recurrent neural networks (RNNs) have been exploited as a computational resource in input-driven RNNs. However, the information processing capability varies from RNN to RNN, depending on their properties. Many authors have investigated the dynamics of RNNs and their relevance to the information processing capability. In this study, we present a detailed analysis of the information processing capability of an RNN optimized by recurrent infomax (RI), which is an unsupervised learning scheme that maximizes the mutual information of RNNs by adjusting the connecti","authors_text":"Hisashi Iwade, Kohei Nakajima, Takuma Tanaka, Toshio Aoyagi","cross_cats":["cond-mat.dis-nn"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-02-14T02:45:26Z","title":"Use of recurrent infomax to improve the memory capability of input-driven recurrent neural networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.05383","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:fe1cf2baca047f837a016519d72c90c6d07654cc225f3d484eff31a3ed580e36","target":"record","created_at":"2026-05-18T00:21:01Z","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":"11d9dc7b520786e5b37048da7d9cd7c01473ca61250d1f02159fe710dd4846e9","cross_cats_sorted":["cond-mat.dis-nn"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-02-14T02:45:26Z","title_canon_sha256":"a16bdb3f09962feb5f136ca763b41ed0b49258debe5e94ce7a9c2aa4d143b08f"},"schema_version":"1.0","source":{"id":"1803.05383","kind":"arxiv","version":1}},"canonical_sha256":"b431a6c91e2010bcb088e058091bc253b8ccdcc282e3109ad69c7ce784f49e22","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b431a6c91e2010bcb088e058091bc253b8ccdcc282e3109ad69c7ce784f49e22","first_computed_at":"2026-05-18T00:21:01.476296Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:21:01.476296Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EBGplq2GMIVBiUibD5VQZQKC/1pbZMbaRXSDT8CUOgxmGzzoht6AZVg0WvI0ilaZkalNSHBIvuvFHzBk+E48Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:21:01.476708Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.05383","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fe1cf2baca047f837a016519d72c90c6d07654cc225f3d484eff31a3ed580e36","sha256:e42a9efa09f4c640bb92a9268bb783afc21d66ea1dbbcf876de711b2a1751c9a"],"state_sha256":"1feaff2d9b3ed33d4cfd74126208033872348b7737e9b05877128ef0826c5a0c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wwhFjjd1DYEHGWTJSgDJjD39t76YETCy87X7lFeZbDNB/bNc53wPwLMQmb9nP2evk315NRxlnHPYu/faUJusCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T14:43:31.501649Z","bundle_sha256":"56b4e40f49cbdd27f023d9a45cebc674e92ea4aa0354ae5f770a012717ba8e47"}}