{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:ZXTEFX6ZO4WGOFGXVXQRT3Y6DB","short_pith_number":"pith:ZXTEFX6Z","canonical_record":{"source":{"id":"2005.05294","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-05-11T17:51:40Z","cross_cats_sorted":["cs.NE","stat.ML"],"title_canon_sha256":"a0da9394fd57e7c01f3481eef8ce947f2c752a8f2ff2c385ada69f182436b16c","abstract_canon_sha256":"19876cc9071bd49228086ccd03382e0a6ea122404e8c4743af7b7edc3b9bd83d"},"schema_version":"1.0"},"canonical_sha256":"cde642dfd9772c6714d7ade119ef1e1843b3aba7f0f1f4f040daa4b722d4b1a3","source":{"kind":"arxiv","id":"2005.05294","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2005.05294","created_at":"2026-07-05T01:01:58Z"},{"alias_kind":"arxiv_version","alias_value":"2005.05294v1","created_at":"2026-07-05T01:01:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2005.05294","created_at":"2026-07-05T01:01:58Z"},{"alias_kind":"pith_short_12","alias_value":"ZXTEFX6ZO4WG","created_at":"2026-07-05T01:01:58Z"},{"alias_kind":"pith_short_16","alias_value":"ZXTEFX6ZO4WGOFGX","created_at":"2026-07-05T01:01:58Z"},{"alias_kind":"pith_short_8","alias_value":"ZXTEFX6Z","created_at":"2026-07-05T01:01:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:ZXTEFX6ZO4WGOFGXVXQRT3Y6DB","target":"record","payload":{"canonical_record":{"source":{"id":"2005.05294","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-05-11T17:51:40Z","cross_cats_sorted":["cs.NE","stat.ML"],"title_canon_sha256":"a0da9394fd57e7c01f3481eef8ce947f2c752a8f2ff2c385ada69f182436b16c","abstract_canon_sha256":"19876cc9071bd49228086ccd03382e0a6ea122404e8c4743af7b7edc3b9bd83d"},"schema_version":"1.0"},"canonical_sha256":"cde642dfd9772c6714d7ade119ef1e1843b3aba7f0f1f4f040daa4b722d4b1a3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:01:58.855873Z","signature_b64":"Mu2hM2pdQdckltZh7RvbXmpNRV46Ax4sUAzDN7qAH7t3zxypJZBF8ICG+N4d9aleFF01Kj5ZBnCqjsiviUQxBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cde642dfd9772c6714d7ade119ef1e1843b3aba7f0f1f4f040daa4b722d4b1a3","last_reissued_at":"2026-07-05T01:01:58.855492Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:01:58.855492Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2005.05294","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-07-05T01:01:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9hq+oeY+XPXT/J9bJ1OCCbFyoKrDOHY/EtYr5UtMUtx8EAusiq95hBxujEnBoXfiad/SmRHlAD0rbHEKbl3yAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-08T19:09:59.888332Z"},"content_sha256":"d7ea63c781a3ad2004625886b017bae3959b62e62e7361ce691df96cd502e202","schema_version":"1.0","event_id":"sha256:d7ea63c781a3ad2004625886b017bae3959b62e62e7361ce691df96cd502e202"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:ZXTEFX6ZO4WGOFGXVXQRT3Y6DB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Ring Reservoir Neural Networks for Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NE","stat.ML"],"primary_cat":"cs.LG","authors_text":"Alessio Micheli, Claudio Gallicchio","submitted_at":"2020-05-11T17:51:40Z","abstract_excerpt":"Machine Learning for graphs is nowadays a research topic of consolidated relevance. Common approaches in the field typically resort to complex deep neural network architectures and demanding training algorithms, highlighting the need for more efficient solutions. The class of Reservoir Computing (RC) models can play an important role in this context, enabling to develop fruitful graph embeddings through untrained recursive architectures. In this paper, we study progressive simplifications to the design strategy of RC neural networks for graphs. Our core proposal is based on shaping the organiz"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2005.05294","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2005.05294/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T01:01:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NeIVv+3i0qRpE8d1fAfkDgNLqIZ8/S41tqrfU9wuOjjZtT06p8Hiw0epS31cn3QF2fq5vmh4Q0MrPg5e9ArMAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-08T19:09:59.888703Z"},"content_sha256":"106ad42cce45889db8c94fb2d8640fe26bd01df8887a3a5fce58b255b98fc60a","schema_version":"1.0","event_id":"sha256:106ad42cce45889db8c94fb2d8640fe26bd01df8887a3a5fce58b255b98fc60a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZXTEFX6ZO4WGOFGXVXQRT3Y6DB/bundle.json","state_url":"https://pith.science/pith/ZXTEFX6ZO4WGOFGXVXQRT3Y6DB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZXTEFX6ZO4WGOFGXVXQRT3Y6DB/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-07-08T19:09:59Z","links":{"resolver":"https://pith.science/pith/ZXTEFX6ZO4WGOFGXVXQRT3Y6DB","bundle":"https://pith.science/pith/ZXTEFX6ZO4WGOFGXVXQRT3Y6DB/bundle.json","state":"https://pith.science/pith/ZXTEFX6ZO4WGOFGXVXQRT3Y6DB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZXTEFX6ZO4WGOFGXVXQRT3Y6DB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:ZXTEFX6ZO4WGOFGXVXQRT3Y6DB","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":"19876cc9071bd49228086ccd03382e0a6ea122404e8c4743af7b7edc3b9bd83d","cross_cats_sorted":["cs.NE","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-05-11T17:51:40Z","title_canon_sha256":"a0da9394fd57e7c01f3481eef8ce947f2c752a8f2ff2c385ada69f182436b16c"},"schema_version":"1.0","source":{"id":"2005.05294","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2005.05294","created_at":"2026-07-05T01:01:58Z"},{"alias_kind":"arxiv_version","alias_value":"2005.05294v1","created_at":"2026-07-05T01:01:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2005.05294","created_at":"2026-07-05T01:01:58Z"},{"alias_kind":"pith_short_12","alias_value":"ZXTEFX6ZO4WG","created_at":"2026-07-05T01:01:58Z"},{"alias_kind":"pith_short_16","alias_value":"ZXTEFX6ZO4WGOFGX","created_at":"2026-07-05T01:01:58Z"},{"alias_kind":"pith_short_8","alias_value":"ZXTEFX6Z","created_at":"2026-07-05T01:01:58Z"}],"graph_snapshots":[{"event_id":"sha256:106ad42cce45889db8c94fb2d8640fe26bd01df8887a3a5fce58b255b98fc60a","target":"graph","created_at":"2026-07-05T01:01:58Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2005.05294/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Machine Learning for graphs is nowadays a research topic of consolidated relevance. Common approaches in the field typically resort to complex deep neural network architectures and demanding training algorithms, highlighting the need for more efficient solutions. The class of Reservoir Computing (RC) models can play an important role in this context, enabling to develop fruitful graph embeddings through untrained recursive architectures. In this paper, we study progressive simplifications to the design strategy of RC neural networks for graphs. Our core proposal is based on shaping the organiz","authors_text":"Alessio Micheli, Claudio Gallicchio","cross_cats":["cs.NE","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-05-11T17:51:40Z","title":"Ring Reservoir Neural Networks for Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2005.05294","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:d7ea63c781a3ad2004625886b017bae3959b62e62e7361ce691df96cd502e202","target":"record","created_at":"2026-07-05T01:01:58Z","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":"19876cc9071bd49228086ccd03382e0a6ea122404e8c4743af7b7edc3b9bd83d","cross_cats_sorted":["cs.NE","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-05-11T17:51:40Z","title_canon_sha256":"a0da9394fd57e7c01f3481eef8ce947f2c752a8f2ff2c385ada69f182436b16c"},"schema_version":"1.0","source":{"id":"2005.05294","kind":"arxiv","version":1}},"canonical_sha256":"cde642dfd9772c6714d7ade119ef1e1843b3aba7f0f1f4f040daa4b722d4b1a3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cde642dfd9772c6714d7ade119ef1e1843b3aba7f0f1f4f040daa4b722d4b1a3","first_computed_at":"2026-07-05T01:01:58.855492Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:01:58.855492Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Mu2hM2pdQdckltZh7RvbXmpNRV46Ax4sUAzDN7qAH7t3zxypJZBF8ICG+N4d9aleFF01Kj5ZBnCqjsiviUQxBg==","signature_status":"signed_v1","signed_at":"2026-07-05T01:01:58.855873Z","signed_message":"canonical_sha256_bytes"},"source_id":"2005.05294","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d7ea63c781a3ad2004625886b017bae3959b62e62e7361ce691df96cd502e202","sha256:106ad42cce45889db8c94fb2d8640fe26bd01df8887a3a5fce58b255b98fc60a"],"state_sha256":"997c1b08e714eabccb1af24fa9c78dbce1c6b4e6986beeba2dae84170aeb093d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RbzvtZ87OORI3DAfTH73NY9/NZq/OWk7/pYIWLkVVDS4FBz1qJnGBogdRDp/FKTGOuujOrP/oroOrNJtAy+DAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-08T19:09:59.890800Z","bundle_sha256":"c431034699cf18bd6134945d024e951606d4a5a28c01cbb8abbbfe0ce463777e"}}