{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:VTP3RFTVYAC675LNFYZ7NHAPCF","short_pith_number":"pith:VTP3RFTV","canonical_record":{"source":{"id":"1911.08941","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-11-20T14:46:54Z","cross_cats_sorted":["math.DS","stat.ML"],"title_canon_sha256":"1938e7caadff132b7b9f9340af8d362710726a6ab5faae6e4cf8b12197847b94","abstract_canon_sha256":"dde212db2bb26345fa51654f68bfd2fd989966c32793a691055d7406300e0b5f"},"schema_version":"1.0"},"canonical_sha256":"acdfb89675c005eff56d2e33f69c0f115ae95a5d9f75f93160079239e72528ef","source":{"kind":"arxiv","id":"1911.08941","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1911.08941","created_at":"2026-07-05T00:20:47Z"},{"alias_kind":"arxiv_version","alias_value":"1911.08941v1","created_at":"2026-07-05T00:20:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1911.08941","created_at":"2026-07-05T00:20:47Z"},{"alias_kind":"pith_short_12","alias_value":"VTP3RFTVYAC6","created_at":"2026-07-05T00:20:47Z"},{"alias_kind":"pith_short_16","alias_value":"VTP3RFTVYAC675LN","created_at":"2026-07-05T00:20:47Z"},{"alias_kind":"pith_short_8","alias_value":"VTP3RFTV","created_at":"2026-07-05T00:20:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:VTP3RFTVYAC675LNFYZ7NHAPCF","target":"record","payload":{"canonical_record":{"source":{"id":"1911.08941","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-11-20T14:46:54Z","cross_cats_sorted":["math.DS","stat.ML"],"title_canon_sha256":"1938e7caadff132b7b9f9340af8d362710726a6ab5faae6e4cf8b12197847b94","abstract_canon_sha256":"dde212db2bb26345fa51654f68bfd2fd989966c32793a691055d7406300e0b5f"},"schema_version":"1.0"},"canonical_sha256":"acdfb89675c005eff56d2e33f69c0f115ae95a5d9f75f93160079239e72528ef","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:20:47.161471Z","signature_b64":"v2p9Gz+16o7mulzFeKt7OAPi5zfphjyo/xLrqmBhNWINyNEOTnc2vErtUuM09dTgMIyWtRI0iyOZmcIstv9DCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"acdfb89675c005eff56d2e33f69c0f115ae95a5d9f75f93160079239e72528ef","last_reissued_at":"2026-07-05T00:20:47.161062Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:20:47.161062Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1911.08941","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-05T00:20:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4IycJPqzf/351hi1CNkK6aEilKtlzi/Z4RHz/a5ug25KwvONfE0Zh6X/WuwXbKvl5by27ZInzGok4exVsGwzDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T11:25:09.359969Z"},"content_sha256":"2b159d23cae0696a2dfac5fe17683b61c80412a7b563c2121765f73d95de4b94","schema_version":"1.0","event_id":"sha256:2b159d23cae0696a2dfac5fe17683b61c80412a7b563c2121765f73d95de4b94"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:VTP3RFTVYAC675LNFYZ7NHAPCF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast and Deep Graph Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.DS","stat.ML"],"primary_cat":"cs.LG","authors_text":"Alessio Micheli, Claudio Gallicchio","submitted_at":"2019-11-20T14:46:54Z","abstract_excerpt":"We address the efficiency issue for the construction of a deep graph neural network (GNN). The approach exploits the idea of representing each input graph as a fixed point of a dynamical system (implemented through a recurrent neural network), and leverages a deep architectural organization of the recurrent units. Efficiency is gained by many aspects, including the use of small and very sparse networks, where the weights of the recurrent units are left untrained under the stability condition introduced in this work. This can be viewed as a way to study the intrinsic power of the architecture o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1911.08941","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/1911.08941/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-05T00:20:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aZtIFIK1sCPFa0dlSRx0gnc87JXtWWsuRpyn1MXshno8p7LFSJlbOeUMmvJzUO0rglk6e23Y9Bu8Jn+C0ChyAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T11:25:09.360348Z"},"content_sha256":"8f81681fa6a776415fdc0eae6d963ab133abe6be78b52a14cafebed17f7902e5","schema_version":"1.0","event_id":"sha256:8f81681fa6a776415fdc0eae6d963ab133abe6be78b52a14cafebed17f7902e5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VTP3RFTVYAC675LNFYZ7NHAPCF/bundle.json","state_url":"https://pith.science/pith/VTP3RFTVYAC675LNFYZ7NHAPCF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VTP3RFTVYAC675LNFYZ7NHAPCF/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-07T11:25:09Z","links":{"resolver":"https://pith.science/pith/VTP3RFTVYAC675LNFYZ7NHAPCF","bundle":"https://pith.science/pith/VTP3RFTVYAC675LNFYZ7NHAPCF/bundle.json","state":"https://pith.science/pith/VTP3RFTVYAC675LNFYZ7NHAPCF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VTP3RFTVYAC675LNFYZ7NHAPCF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:VTP3RFTVYAC675LNFYZ7NHAPCF","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":"dde212db2bb26345fa51654f68bfd2fd989966c32793a691055d7406300e0b5f","cross_cats_sorted":["math.DS","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-11-20T14:46:54Z","title_canon_sha256":"1938e7caadff132b7b9f9340af8d362710726a6ab5faae6e4cf8b12197847b94"},"schema_version":"1.0","source":{"id":"1911.08941","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1911.08941","created_at":"2026-07-05T00:20:47Z"},{"alias_kind":"arxiv_version","alias_value":"1911.08941v1","created_at":"2026-07-05T00:20:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1911.08941","created_at":"2026-07-05T00:20:47Z"},{"alias_kind":"pith_short_12","alias_value":"VTP3RFTVYAC6","created_at":"2026-07-05T00:20:47Z"},{"alias_kind":"pith_short_16","alias_value":"VTP3RFTVYAC675LN","created_at":"2026-07-05T00:20:47Z"},{"alias_kind":"pith_short_8","alias_value":"VTP3RFTV","created_at":"2026-07-05T00:20:47Z"}],"graph_snapshots":[{"event_id":"sha256:8f81681fa6a776415fdc0eae6d963ab133abe6be78b52a14cafebed17f7902e5","target":"graph","created_at":"2026-07-05T00:20:47Z","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/1911.08941/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We address the efficiency issue for the construction of a deep graph neural network (GNN). The approach exploits the idea of representing each input graph as a fixed point of a dynamical system (implemented through a recurrent neural network), and leverages a deep architectural organization of the recurrent units. Efficiency is gained by many aspects, including the use of small and very sparse networks, where the weights of the recurrent units are left untrained under the stability condition introduced in this work. This can be viewed as a way to study the intrinsic power of the architecture o","authors_text":"Alessio Micheli, Claudio Gallicchio","cross_cats":["math.DS","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-11-20T14:46:54Z","title":"Fast and Deep Graph Neural Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1911.08941","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:2b159d23cae0696a2dfac5fe17683b61c80412a7b563c2121765f73d95de4b94","target":"record","created_at":"2026-07-05T00:20:47Z","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":"dde212db2bb26345fa51654f68bfd2fd989966c32793a691055d7406300e0b5f","cross_cats_sorted":["math.DS","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-11-20T14:46:54Z","title_canon_sha256":"1938e7caadff132b7b9f9340af8d362710726a6ab5faae6e4cf8b12197847b94"},"schema_version":"1.0","source":{"id":"1911.08941","kind":"arxiv","version":1}},"canonical_sha256":"acdfb89675c005eff56d2e33f69c0f115ae95a5d9f75f93160079239e72528ef","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"acdfb89675c005eff56d2e33f69c0f115ae95a5d9f75f93160079239e72528ef","first_computed_at":"2026-07-05T00:20:47.161062Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:20:47.161062Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"v2p9Gz+16o7mulzFeKt7OAPi5zfphjyo/xLrqmBhNWINyNEOTnc2vErtUuM09dTgMIyWtRI0iyOZmcIstv9DCg==","signature_status":"signed_v1","signed_at":"2026-07-05T00:20:47.161471Z","signed_message":"canonical_sha256_bytes"},"source_id":"1911.08941","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2b159d23cae0696a2dfac5fe17683b61c80412a7b563c2121765f73d95de4b94","sha256:8f81681fa6a776415fdc0eae6d963ab133abe6be78b52a14cafebed17f7902e5"],"state_sha256":"dfd65436a73404a98d44e60c192a9525cb13d336e78bddec8cd5cae32bc79ed9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YZk3CehYgGPZiOcJpQhbTXS8J9RaMa62GrALvfNkkm6JmFhBm5W2F5FhVnbGN20BFxbO720NTVIee1NuCv31Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T11:25:09.362191Z","bundle_sha256":"32888bbfe7be541f76063176af9b806add985328eda7b3b180cabcef37d95f5f"}}