{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:7DRD4IHSFGTMOF2LIA6GALVDYK","short_pith_number":"pith:7DRD4IHS","canonical_record":{"source":{"id":"1803.07294","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-03-20T08:33:20Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"e406e50a0484fa303a73db99731b80abb9b170055618b1c2814e83421495c577","abstract_canon_sha256":"a6cec209df914999cf5327b826b85f03c6586c4b8b44d842841ee3e972993720"},"schema_version":"1.0"},"canonical_sha256":"f8e23e20f229a6c7174b403c602ea3c28006758e9f880ff32838eb4e41aec503","source":{"kind":"arxiv","id":"1803.07294","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.07294","created_at":"2026-05-18T00:20:33Z"},{"alias_kind":"arxiv_version","alias_value":"1803.07294v1","created_at":"2026-05-18T00:20:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.07294","created_at":"2026-05-18T00:20:33Z"},{"alias_kind":"pith_short_12","alias_value":"7DRD4IHSFGTM","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"7DRD4IHSFGTMOF2L","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"7DRD4IHS","created_at":"2026-05-18T12:32:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:7DRD4IHSFGTMOF2LIA6GALVDYK","target":"record","payload":{"canonical_record":{"source":{"id":"1803.07294","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-03-20T08:33:20Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"e406e50a0484fa303a73db99731b80abb9b170055618b1c2814e83421495c577","abstract_canon_sha256":"a6cec209df914999cf5327b826b85f03c6586c4b8b44d842841ee3e972993720"},"schema_version":"1.0"},"canonical_sha256":"f8e23e20f229a6c7174b403c602ea3c28006758e9f880ff32838eb4e41aec503","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:20:33.717895Z","signature_b64":"5xILx2XmbbpBZv37fJVE2wfK6BEdD+HeTs8378T8unx1bvLBh8ExcQE7YlBFfHCbgZ9+fOiO3WPlfR4qWYawBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f8e23e20f229a6c7174b403c602ea3c28006758e9f880ff32838eb4e41aec503","last_reissued_at":"2026-05-18T00:20:33.717410Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:20:33.717410Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.07294","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:20:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nYFmcZRqZ4ruE+vqxkIFzO+X+0PTC+3SxBYRe9RVzWkaBmPOYxi9a4dKlTvG4jUx/HuR5fafoTLO9Hh/L02xDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T03:56:44.529373Z"},"content_sha256":"52de9cfdaf5718021a96fd26b1cc4e19d63bffb3ceb32949ce3ce3bed0841358","schema_version":"1.0","event_id":"sha256:52de9cfdaf5718021a96fd26b1cc4e19d63bffb3ceb32949ce3ce3bed0841358"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:7DRD4IHSFGTMOF2LIA6GALVDYK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"GaAN: Gated Attention Networks for Learning on Large and Spatiotemporal Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.LG","authors_text":"Dit-Yan Yeung, Hao Ma, Irwin King, Jiani Zhang, Junyuan Xie, Xingjian Shi","submitted_at":"2018-03-20T08:33:20Z","abstract_excerpt":"We propose a new network architecture, Gated Attention Networks (GaAN), for learning on graphs. Unlike the traditional multi-head attention mechanism, which equally consumes all attention heads, GaAN uses a convolutional sub-network to control each attention head's importance. We demonstrate the effectiveness of GaAN on the inductive node classification problem. Moreover, with GaAN as a building block, we construct the Graph Gated Recurrent Unit (GGRU) to address the traffic speed forecasting problem. Extensive experiments on three real-world datasets show that our GaAN framework achieves stat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.07294","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:20:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VwvcxkfyplRNr8ASrPPKyoNEyrxSDUyg4DxqOTmgl78Rg7KGTG2BLkM/hZSKYnfYUVJz1K+c+7BCK0c4zlUMDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T03:56:44.529894Z"},"content_sha256":"f01022165cc054e8239ef77e7b02df04bf5af85d0286d2ac6f4de05f9969ac34","schema_version":"1.0","event_id":"sha256:f01022165cc054e8239ef77e7b02df04bf5af85d0286d2ac6f4de05f9969ac34"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7DRD4IHSFGTMOF2LIA6GALVDYK/bundle.json","state_url":"https://pith.science/pith/7DRD4IHSFGTMOF2LIA6GALVDYK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7DRD4IHSFGTMOF2LIA6GALVDYK/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-26T03:56:44Z","links":{"resolver":"https://pith.science/pith/7DRD4IHSFGTMOF2LIA6GALVDYK","bundle":"https://pith.science/pith/7DRD4IHSFGTMOF2LIA6GALVDYK/bundle.json","state":"https://pith.science/pith/7DRD4IHSFGTMOF2LIA6GALVDYK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7DRD4IHSFGTMOF2LIA6GALVDYK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:7DRD4IHSFGTMOF2LIA6GALVDYK","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":"a6cec209df914999cf5327b826b85f03c6586c4b8b44d842841ee3e972993720","cross_cats_sorted":["cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-03-20T08:33:20Z","title_canon_sha256":"e406e50a0484fa303a73db99731b80abb9b170055618b1c2814e83421495c577"},"schema_version":"1.0","source":{"id":"1803.07294","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.07294","created_at":"2026-05-18T00:20:33Z"},{"alias_kind":"arxiv_version","alias_value":"1803.07294v1","created_at":"2026-05-18T00:20:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.07294","created_at":"2026-05-18T00:20:33Z"},{"alias_kind":"pith_short_12","alias_value":"7DRD4IHSFGTM","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"7DRD4IHSFGTMOF2L","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"7DRD4IHS","created_at":"2026-05-18T12:32:11Z"}],"graph_snapshots":[{"event_id":"sha256:f01022165cc054e8239ef77e7b02df04bf5af85d0286d2ac6f4de05f9969ac34","target":"graph","created_at":"2026-05-18T00:20:33Z","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":"We propose a new network architecture, Gated Attention Networks (GaAN), for learning on graphs. Unlike the traditional multi-head attention mechanism, which equally consumes all attention heads, GaAN uses a convolutional sub-network to control each attention head's importance. We demonstrate the effectiveness of GaAN on the inductive node classification problem. Moreover, with GaAN as a building block, we construct the Graph Gated Recurrent Unit (GGRU) to address the traffic speed forecasting problem. Extensive experiments on three real-world datasets show that our GaAN framework achieves stat","authors_text":"Dit-Yan Yeung, Hao Ma, Irwin King, Jiani Zhang, Junyuan Xie, Xingjian Shi","cross_cats":["cs.SI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-03-20T08:33:20Z","title":"GaAN: Gated Attention Networks for Learning on Large and Spatiotemporal Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.07294","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:52de9cfdaf5718021a96fd26b1cc4e19d63bffb3ceb32949ce3ce3bed0841358","target":"record","created_at":"2026-05-18T00:20:33Z","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":"a6cec209df914999cf5327b826b85f03c6586c4b8b44d842841ee3e972993720","cross_cats_sorted":["cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-03-20T08:33:20Z","title_canon_sha256":"e406e50a0484fa303a73db99731b80abb9b170055618b1c2814e83421495c577"},"schema_version":"1.0","source":{"id":"1803.07294","kind":"arxiv","version":1}},"canonical_sha256":"f8e23e20f229a6c7174b403c602ea3c28006758e9f880ff32838eb4e41aec503","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f8e23e20f229a6c7174b403c602ea3c28006758e9f880ff32838eb4e41aec503","first_computed_at":"2026-05-18T00:20:33.717410Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:20:33.717410Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5xILx2XmbbpBZv37fJVE2wfK6BEdD+HeTs8378T8unx1bvLBh8ExcQE7YlBFfHCbgZ9+fOiO3WPlfR4qWYawBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:20:33.717895Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.07294","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:52de9cfdaf5718021a96fd26b1cc4e19d63bffb3ceb32949ce3ce3bed0841358","sha256:f01022165cc054e8239ef77e7b02df04bf5af85d0286d2ac6f4de05f9969ac34"],"state_sha256":"3fc9f6b3e9ca87679638e48df1c6d87e1d8efd7584bd15fda6140cf16cf9b87d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BdiK8XUUsSkPZ+qj5csPiJQKEzachKeBCclIred/Y1Afp4Rg7BLAzK8fCMedRw92snExsQsnGPFaas3wXMUYAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T03:56:44.532574Z","bundle_sha256":"28cfe83fe2fae7f07359ad0617f808dadd85aa7a1335f008c13abfe02b3b25ef"}}