{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:H7TGQFDLTPQP2JRIPJYUWLBM4B","short_pith_number":"pith:H7TGQFDL","canonical_record":{"source":{"id":"1609.03068","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2016-09-10T16:12:27Z","cross_cats_sorted":["math.DS"],"title_canon_sha256":"a3fb90532d2464fde4298d155fae77b21206a1092369f045026b88e6a574fc76","abstract_canon_sha256":"f417db78878e7c2a221fa012c429d8776261aa0b10fe47651b2246692436651f"},"schema_version":"1.0"},"canonical_sha256":"3fe668146b9be0fd26287a714b2c2ce040290c0d1634188599ddd90cb9fceb9d","source":{"kind":"arxiv","id":"1609.03068","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.03068","created_at":"2026-05-18T00:50:19Z"},{"alias_kind":"arxiv_version","alias_value":"1609.03068v3","created_at":"2026-05-18T00:50:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.03068","created_at":"2026-05-18T00:50:19Z"},{"alias_kind":"pith_short_12","alias_value":"H7TGQFDLTPQP","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"H7TGQFDLTPQP2JRI","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"H7TGQFDL","created_at":"2026-05-18T12:30:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:H7TGQFDLTPQP2JRIPJYUWLBM4B","target":"record","payload":{"canonical_record":{"source":{"id":"1609.03068","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2016-09-10T16:12:27Z","cross_cats_sorted":["math.DS"],"title_canon_sha256":"a3fb90532d2464fde4298d155fae77b21206a1092369f045026b88e6a574fc76","abstract_canon_sha256":"f417db78878e7c2a221fa012c429d8776261aa0b10fe47651b2246692436651f"},"schema_version":"1.0"},"canonical_sha256":"3fe668146b9be0fd26287a714b2c2ce040290c0d1634188599ddd90cb9fceb9d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:19.151058Z","signature_b64":"3FesEPUJb04Azaxuz6O/HWLIq6f4LGNjkOOmkVje8GsvK+xYlIKrXe4CVhW5WE/yCuk3pbon8IzdVNYzXtIkBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3fe668146b9be0fd26287a714b2c2ce040290c0d1634188599ddd90cb9fceb9d","last_reissued_at":"2026-05-18T00:50:19.150391Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:19.150391Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1609.03068","source_version":3,"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:50:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3YqJTDB/KCKFTDpYZF0mqNFS4M/gmdbydjlvp/FbXtC/NjYfoMcg1I3RvuIz/HvYg7KH9nZS6yQL6lEKO9LaCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T09:26:02.206833Z"},"content_sha256":"0065bee45aa5f2fe17222199dc30ae1f69d3fe3734f3a35af4ff737767a83cad","schema_version":"1.0","event_id":"sha256:0065bee45aa5f2fe17222199dc30ae1f69d3fe3734f3a35af4ff737767a83cad"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:H7TGQFDLTPQP2JRIPJYUWLBM4B","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multiplex visibility graphs to investigate recurrent neural networks dynamics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.DS"],"primary_cat":"cs.NE","authors_text":"Cesare Alippi, Filippo Maria Bianchi, Lorenzo Livi, Robert Jenssen","submitted_at":"2016-09-10T16:12:27Z","abstract_excerpt":"A recurrent neural network (RNN) is a universal approximator of dynamical systems, whose performance often depends on sensitive hyperparameters. Tuning of such hyperparameters may be difficult and, typically, based on a trial-and-error approach. In this work, we adopt a graph-based framework to interpret and characterize the internal RNN dynamics. Through this insight, we are able to design a principled unsupervised method to derive configurations with maximized performances, in terms of prediction error and memory capacity. In particular, we propose to model time series of neurons activations"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.03068","kind":"arxiv","version":3},"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:50:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u6b+h3xPND/PlvSEpaqpAE6eOCPLJXUhQYih903eQYSB4t7tRALvBiyWwQKCP02m/f87TvhN7PaSgDIPMQWJCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T09:26:02.207167Z"},"content_sha256":"4f6c63090473ac23930d4902592838c6ee3ecc58d218bac3cecd86de5088775d","schema_version":"1.0","event_id":"sha256:4f6c63090473ac23930d4902592838c6ee3ecc58d218bac3cecd86de5088775d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/H7TGQFDLTPQP2JRIPJYUWLBM4B/bundle.json","state_url":"https://pith.science/pith/H7TGQFDLTPQP2JRIPJYUWLBM4B/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/H7TGQFDLTPQP2JRIPJYUWLBM4B/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-01T09:26:02Z","links":{"resolver":"https://pith.science/pith/H7TGQFDLTPQP2JRIPJYUWLBM4B","bundle":"https://pith.science/pith/H7TGQFDLTPQP2JRIPJYUWLBM4B/bundle.json","state":"https://pith.science/pith/H7TGQFDLTPQP2JRIPJYUWLBM4B/state.json","well_known_bundle":"https://pith.science/.well-known/pith/H7TGQFDLTPQP2JRIPJYUWLBM4B/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:H7TGQFDLTPQP2JRIPJYUWLBM4B","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":"f417db78878e7c2a221fa012c429d8776261aa0b10fe47651b2246692436651f","cross_cats_sorted":["math.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2016-09-10T16:12:27Z","title_canon_sha256":"a3fb90532d2464fde4298d155fae77b21206a1092369f045026b88e6a574fc76"},"schema_version":"1.0","source":{"id":"1609.03068","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.03068","created_at":"2026-05-18T00:50:19Z"},{"alias_kind":"arxiv_version","alias_value":"1609.03068v3","created_at":"2026-05-18T00:50:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.03068","created_at":"2026-05-18T00:50:19Z"},{"alias_kind":"pith_short_12","alias_value":"H7TGQFDLTPQP","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"H7TGQFDLTPQP2JRI","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"H7TGQFDL","created_at":"2026-05-18T12:30:19Z"}],"graph_snapshots":[{"event_id":"sha256:4f6c63090473ac23930d4902592838c6ee3ecc58d218bac3cecd86de5088775d","target":"graph","created_at":"2026-05-18T00:50:19Z","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":"A recurrent neural network (RNN) is a universal approximator of dynamical systems, whose performance often depends on sensitive hyperparameters. Tuning of such hyperparameters may be difficult and, typically, based on a trial-and-error approach. In this work, we adopt a graph-based framework to interpret and characterize the internal RNN dynamics. Through this insight, we are able to design a principled unsupervised method to derive configurations with maximized performances, in terms of prediction error and memory capacity. In particular, we propose to model time series of neurons activations","authors_text":"Cesare Alippi, Filippo Maria Bianchi, Lorenzo Livi, Robert Jenssen","cross_cats":["math.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2016-09-10T16:12:27Z","title":"Multiplex visibility graphs to investigate recurrent neural networks dynamics"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.03068","kind":"arxiv","version":3},"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:0065bee45aa5f2fe17222199dc30ae1f69d3fe3734f3a35af4ff737767a83cad","target":"record","created_at":"2026-05-18T00:50:19Z","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":"f417db78878e7c2a221fa012c429d8776261aa0b10fe47651b2246692436651f","cross_cats_sorted":["math.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2016-09-10T16:12:27Z","title_canon_sha256":"a3fb90532d2464fde4298d155fae77b21206a1092369f045026b88e6a574fc76"},"schema_version":"1.0","source":{"id":"1609.03068","kind":"arxiv","version":3}},"canonical_sha256":"3fe668146b9be0fd26287a714b2c2ce040290c0d1634188599ddd90cb9fceb9d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3fe668146b9be0fd26287a714b2c2ce040290c0d1634188599ddd90cb9fceb9d","first_computed_at":"2026-05-18T00:50:19.150391Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:50:19.150391Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3FesEPUJb04Azaxuz6O/HWLIq6f4LGNjkOOmkVje8GsvK+xYlIKrXe4CVhW5WE/yCuk3pbon8IzdVNYzXtIkBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:50:19.151058Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.03068","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0065bee45aa5f2fe17222199dc30ae1f69d3fe3734f3a35af4ff737767a83cad","sha256:4f6c63090473ac23930d4902592838c6ee3ecc58d218bac3cecd86de5088775d"],"state_sha256":"db7aebfce747a12aed82ae45491a84581ad6f5dc025090c6a588bde435883a54"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b9cn1KeGhW1udbztaZtVlic8FqCuP4GesXWU+JPcVRhHMEsl7lYzjJXIGn6nL4mLoK+XoVmXW0nei8MPqgV5BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T09:26:02.209019Z","bundle_sha256":"ea199d6ec3f76ad6e57eda3d35c444ef0ef323f4d1a98ccdf9d7b097d905145a"}}