{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:RJVAOO53ICNA723HP6BK6SBXN5","short_pith_number":"pith:RJVAOO53","canonical_record":{"source":{"id":"1906.11786","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-06-27T16:48:29Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"e1f68c2c4a9a2b7d616efb8e821f1eac170d9d8de7eb6b1f8918dfb7851761b8","abstract_canon_sha256":"5a8ec4f75a30ce195c1f7295cedcff186d7d58418a336f39e2bd5109f0a94d77"},"schema_version":"1.0"},"canonical_sha256":"8a6a073bbb409a0feb677f82af48376f5955f5389ed4ff75463ff1849a47f6db","source":{"kind":"arxiv","id":"1906.11786","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.11786","created_at":"2026-05-17T23:42:03Z"},{"alias_kind":"arxiv_version","alias_value":"1906.11786v1","created_at":"2026-05-17T23:42:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.11786","created_at":"2026-05-17T23:42:03Z"},{"alias_kind":"pith_short_12","alias_value":"RJVAOO53ICNA","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"RJVAOO53ICNA723H","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"RJVAOO53","created_at":"2026-05-18T12:33:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:RJVAOO53ICNA723HP6BK6SBXN5","target":"record","payload":{"canonical_record":{"source":{"id":"1906.11786","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-06-27T16:48:29Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"e1f68c2c4a9a2b7d616efb8e821f1eac170d9d8de7eb6b1f8918dfb7851761b8","abstract_canon_sha256":"5a8ec4f75a30ce195c1f7295cedcff186d7d58418a336f39e2bd5109f0a94d77"},"schema_version":"1.0"},"canonical_sha256":"8a6a073bbb409a0feb677f82af48376f5955f5389ed4ff75463ff1849a47f6db","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:03.778658Z","signature_b64":"HX0gnavO4cITpFVj/iEweTaR0E3tlnHrvO9LlzLAyqDeMwQ4YwTjlJKogjUxgzSbsM27/yPFY+mEwfgivsIhBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8a6a073bbb409a0feb677f82af48376f5955f5389ed4ff75463ff1849a47f6db","last_reissued_at":"2026-05-17T23:42:03.778047Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:03.778047Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1906.11786","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-17T23:42:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KuaGLodytnikKjwndSgDBr6woTZeh+S3oMgXO1I0bBpsnRqk3eJAbad7FLrwHpt1Ek4CZQaQu4eSyU5llcHHDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T05:15:01.762450Z"},"content_sha256":"30bad831b3f727e6b399209bf417adaeaa4bbe60fa956d96c2269b0cf7a59aef","schema_version":"1.0","event_id":"sha256:30bad831b3f727e6b399209bf417adaeaa4bbe60fa956d96c2269b0cf7a59aef"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:RJVAOO53ICNA723HP6BK6SBXN5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast Training of Sparse Graph Neural Networks on Dense Hardware","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Bart van Merri\\\"enboer, Daniel Tarlow, Matej Balog, Subhodeep Moitra, Yujia Li","submitted_at":"2019-06-27T16:48:29Z","abstract_excerpt":"Graph neural networks have become increasingly popular in recent years due to their ability to naturally encode relational input data and their ability to scale to large graphs by operating on a sparse representation of graph adjacency matrices. As we look to scale up these models using custom hardware, a natural assumption would be that we need hardware tailored to sparse operations and/or dynamic control flow. In this work, we question this assumption by scaling up sparse graph neural networks using a platform targeted at dense computation on fixed-size data. Drawing inspiration from optimiz"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.11786","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-17T23:42:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GDS7lKmq9OS9D9j2eWuIiT1nxNtjiamn+86Ff4eOeu8sw/x7IPSLCt9Bk8O6XDx/0Eg0ZUsmD/+1q7ZCDebuBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T05:15:01.763114Z"},"content_sha256":"c604586db0e9444381004a7c1f1f807e3d9cdd08754a6a69dbe9e31253bc6f13","schema_version":"1.0","event_id":"sha256:c604586db0e9444381004a7c1f1f807e3d9cdd08754a6a69dbe9e31253bc6f13"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RJVAOO53ICNA723HP6BK6SBXN5/bundle.json","state_url":"https://pith.science/pith/RJVAOO53ICNA723HP6BK6SBXN5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RJVAOO53ICNA723HP6BK6SBXN5/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-27T05:15:01Z","links":{"resolver":"https://pith.science/pith/RJVAOO53ICNA723HP6BK6SBXN5","bundle":"https://pith.science/pith/RJVAOO53ICNA723HP6BK6SBXN5/bundle.json","state":"https://pith.science/pith/RJVAOO53ICNA723HP6BK6SBXN5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RJVAOO53ICNA723HP6BK6SBXN5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:RJVAOO53ICNA723HP6BK6SBXN5","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":"5a8ec4f75a30ce195c1f7295cedcff186d7d58418a336f39e2bd5109f0a94d77","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-06-27T16:48:29Z","title_canon_sha256":"e1f68c2c4a9a2b7d616efb8e821f1eac170d9d8de7eb6b1f8918dfb7851761b8"},"schema_version":"1.0","source":{"id":"1906.11786","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.11786","created_at":"2026-05-17T23:42:03Z"},{"alias_kind":"arxiv_version","alias_value":"1906.11786v1","created_at":"2026-05-17T23:42:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.11786","created_at":"2026-05-17T23:42:03Z"},{"alias_kind":"pith_short_12","alias_value":"RJVAOO53ICNA","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"RJVAOO53ICNA723H","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"RJVAOO53","created_at":"2026-05-18T12:33:27Z"}],"graph_snapshots":[{"event_id":"sha256:c604586db0e9444381004a7c1f1f807e3d9cdd08754a6a69dbe9e31253bc6f13","target":"graph","created_at":"2026-05-17T23:42:03Z","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":"Graph neural networks have become increasingly popular in recent years due to their ability to naturally encode relational input data and their ability to scale to large graphs by operating on a sparse representation of graph adjacency matrices. As we look to scale up these models using custom hardware, a natural assumption would be that we need hardware tailored to sparse operations and/or dynamic control flow. In this work, we question this assumption by scaling up sparse graph neural networks using a platform targeted at dense computation on fixed-size data. Drawing inspiration from optimiz","authors_text":"Bart van Merri\\\"enboer, Daniel Tarlow, Matej Balog, Subhodeep Moitra, Yujia Li","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-06-27T16:48:29Z","title":"Fast Training of Sparse Graph Neural Networks on Dense Hardware"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.11786","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:30bad831b3f727e6b399209bf417adaeaa4bbe60fa956d96c2269b0cf7a59aef","target":"record","created_at":"2026-05-17T23:42:03Z","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":"5a8ec4f75a30ce195c1f7295cedcff186d7d58418a336f39e2bd5109f0a94d77","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-06-27T16:48:29Z","title_canon_sha256":"e1f68c2c4a9a2b7d616efb8e821f1eac170d9d8de7eb6b1f8918dfb7851761b8"},"schema_version":"1.0","source":{"id":"1906.11786","kind":"arxiv","version":1}},"canonical_sha256":"8a6a073bbb409a0feb677f82af48376f5955f5389ed4ff75463ff1849a47f6db","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8a6a073bbb409a0feb677f82af48376f5955f5389ed4ff75463ff1849a47f6db","first_computed_at":"2026-05-17T23:42:03.778047Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:42:03.778047Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HX0gnavO4cITpFVj/iEweTaR0E3tlnHrvO9LlzLAyqDeMwQ4YwTjlJKogjUxgzSbsM27/yPFY+mEwfgivsIhBg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:42:03.778658Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.11786","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:30bad831b3f727e6b399209bf417adaeaa4bbe60fa956d96c2269b0cf7a59aef","sha256:c604586db0e9444381004a7c1f1f807e3d9cdd08754a6a69dbe9e31253bc6f13"],"state_sha256":"48baf17c167a7ab2cc8ff3692b836e31f7ce9803fccf8fea49f25d88eecf510e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h9VXikJWLwlxqe+BgOEiNx4g9PF+NK/XcDycqnJynI6lWtlLbJXbGMxpoh0sGRwJqcCeNdzF+n6HsA9Cr9+KAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T05:15:01.766400Z","bundle_sha256":"d0fdc920d1ac0de30741b5c75c624192dc6c92acbc183fa8933a3a47a72b7582"}}