{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:JXP5B5J6GGQ4P2OJBGOKUJJU2V","short_pith_number":"pith:JXP5B5J6","canonical_record":{"source":{"id":"1904.05811","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-04-11T16:11:36Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"32a430ba7d12465d711093e0d4f86f9af98cc65e481009f18022fc9556105a2e","abstract_canon_sha256":"679c1b13850fe20d467980c6f8b077f1ee0d7d0672bee037a6c14085bb1cc784"},"schema_version":"1.0"},"canonical_sha256":"4ddfd0f53e31a1c7e9c9099caa2534d57946376fd1e166ce796d2814339634e7","source":{"kind":"arxiv","id":"1904.05811","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.05811","created_at":"2026-05-17T23:48:48Z"},{"alias_kind":"arxiv_version","alias_value":"1904.05811v1","created_at":"2026-05-17T23:48:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.05811","created_at":"2026-05-17T23:48:48Z"},{"alias_kind":"pith_short_12","alias_value":"JXP5B5J6GGQ4","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"JXP5B5J6GGQ4P2OJ","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"JXP5B5J6","created_at":"2026-05-18T12:33:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:JXP5B5J6GGQ4P2OJBGOKUJJU2V","target":"record","payload":{"canonical_record":{"source":{"id":"1904.05811","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-04-11T16:11:36Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"32a430ba7d12465d711093e0d4f86f9af98cc65e481009f18022fc9556105a2e","abstract_canon_sha256":"679c1b13850fe20d467980c6f8b077f1ee0d7d0672bee037a6c14085bb1cc784"},"schema_version":"1.0"},"canonical_sha256":"4ddfd0f53e31a1c7e9c9099caa2534d57946376fd1e166ce796d2814339634e7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:48.372380Z","signature_b64":"tT3z4RtTZb7tjrnzjx4QCGKTHX6bzSUpeIvTnCXkXXUgaC06bIFfZSFWa0BchfcThXR4lukM73z8d14vzmMMAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4ddfd0f53e31a1c7e9c9099caa2534d57946376fd1e166ce796d2814339634e7","last_reissued_at":"2026-05-17T23:48:48.371960Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:48.371960Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1904.05811","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:48:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UJb5uXzjxAlDYycVfeceRjgPC0sYY2aiR96/dPVKY951JEjHcCdw5eClpKjEEZ+vkoaF/3A9NBZk27IJAfMwDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T01:43:54.448144Z"},"content_sha256":"6bf3228cc524b2ba228df836608a42cb08a9b84dc70d21f39e9a62c0b62f6c40","schema_version":"1.0","event_id":"sha256:6bf3228cc524b2ba228df836608a42cb08a9b84dc70d21f39e9a62c0b62f6c40"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:JXP5B5J6GGQ4P2OJBGOKUJJU2V","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Relational Graph Attention Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Dan Busbridge, Dane Sherburn, Nils Y. Hammerla, Pietro Cavallo","submitted_at":"2019-04-11T16:11:36Z","abstract_excerpt":"We investigate Relational Graph Attention Networks, a class of models that extends non-relational graph attention mechanisms to incorporate relational information, opening up these methods to a wider variety of problems. A thorough evaluation of these models is performed, and comparisons are made against established benchmarks. To provide a meaningful comparison, we retrain Relational Graph Convolutional Networks, the spectral counterpart of Relational Graph Attention Networks, and evaluate them under the same conditions. We find that Relational Graph Attention Networks perform worse than anti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.05811","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:48:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1dU1LvYQADtnbO+D0OUdBtnHplTNm0Oud4wRt7nReXug8r+aDeto7c/dCs2yXjDYrjOtwGGGgAMLbwalJ1zGCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T01:43:54.448834Z"},"content_sha256":"a9a667dc0beca1353211f4f12bf735d3f6eae36029548a1b7b010f573c53b6a2","schema_version":"1.0","event_id":"sha256:a9a667dc0beca1353211f4f12bf735d3f6eae36029548a1b7b010f573c53b6a2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JXP5B5J6GGQ4P2OJBGOKUJJU2V/bundle.json","state_url":"https://pith.science/pith/JXP5B5J6GGQ4P2OJBGOKUJJU2V/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JXP5B5J6GGQ4P2OJBGOKUJJU2V/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-01T01:43:54Z","links":{"resolver":"https://pith.science/pith/JXP5B5J6GGQ4P2OJBGOKUJJU2V","bundle":"https://pith.science/pith/JXP5B5J6GGQ4P2OJBGOKUJJU2V/bundle.json","state":"https://pith.science/pith/JXP5B5J6GGQ4P2OJBGOKUJJU2V/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JXP5B5J6GGQ4P2OJBGOKUJJU2V/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:JXP5B5J6GGQ4P2OJBGOKUJJU2V","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":"679c1b13850fe20d467980c6f8b077f1ee0d7d0672bee037a6c14085bb1cc784","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-04-11T16:11:36Z","title_canon_sha256":"32a430ba7d12465d711093e0d4f86f9af98cc65e481009f18022fc9556105a2e"},"schema_version":"1.0","source":{"id":"1904.05811","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.05811","created_at":"2026-05-17T23:48:48Z"},{"alias_kind":"arxiv_version","alias_value":"1904.05811v1","created_at":"2026-05-17T23:48:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.05811","created_at":"2026-05-17T23:48:48Z"},{"alias_kind":"pith_short_12","alias_value":"JXP5B5J6GGQ4","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"JXP5B5J6GGQ4P2OJ","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"JXP5B5J6","created_at":"2026-05-18T12:33:21Z"}],"graph_snapshots":[{"event_id":"sha256:a9a667dc0beca1353211f4f12bf735d3f6eae36029548a1b7b010f573c53b6a2","target":"graph","created_at":"2026-05-17T23:48:48Z","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 investigate Relational Graph Attention Networks, a class of models that extends non-relational graph attention mechanisms to incorporate relational information, opening up these methods to a wider variety of problems. A thorough evaluation of these models is performed, and comparisons are made against established benchmarks. To provide a meaningful comparison, we retrain Relational Graph Convolutional Networks, the spectral counterpart of Relational Graph Attention Networks, and evaluate them under the same conditions. We find that Relational Graph Attention Networks perform worse than anti","authors_text":"Dan Busbridge, Dane Sherburn, Nils Y. Hammerla, Pietro Cavallo","cross_cats":["cs.AI","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-04-11T16:11:36Z","title":"Relational Graph Attention Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.05811","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:6bf3228cc524b2ba228df836608a42cb08a9b84dc70d21f39e9a62c0b62f6c40","target":"record","created_at":"2026-05-17T23:48:48Z","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":"679c1b13850fe20d467980c6f8b077f1ee0d7d0672bee037a6c14085bb1cc784","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-04-11T16:11:36Z","title_canon_sha256":"32a430ba7d12465d711093e0d4f86f9af98cc65e481009f18022fc9556105a2e"},"schema_version":"1.0","source":{"id":"1904.05811","kind":"arxiv","version":1}},"canonical_sha256":"4ddfd0f53e31a1c7e9c9099caa2534d57946376fd1e166ce796d2814339634e7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4ddfd0f53e31a1c7e9c9099caa2534d57946376fd1e166ce796d2814339634e7","first_computed_at":"2026-05-17T23:48:48.371960Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:48:48.371960Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tT3z4RtTZb7tjrnzjx4QCGKTHX6bzSUpeIvTnCXkXXUgaC06bIFfZSFWa0BchfcThXR4lukM73z8d14vzmMMAA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:48:48.372380Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.05811","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6bf3228cc524b2ba228df836608a42cb08a9b84dc70d21f39e9a62c0b62f6c40","sha256:a9a667dc0beca1353211f4f12bf735d3f6eae36029548a1b7b010f573c53b6a2"],"state_sha256":"e5bb7eeac8eb8634ed3054980a6b23b5cf639fcd2a864577342dd72d24377768"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AlJn8KFMEnt6jE7R87auI26win0jRAjQgSvYCiHDaEsfCGTw09e8f3jXtCL6/Cyd9fpoyFcYtd+x8tMQ2Nz1BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T01:43:54.452403Z","bundle_sha256":"17b3c359a4c778b167754d23b98e5cf613ddda800251e43d804dbc4be51dfa13"}}