{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:PALIALFN7KL6ATFWA3JH6NLQ3I","short_pith_number":"pith:PALIALFN","canonical_record":{"source":{"id":"2204.05351","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2022-04-11T18:13:19Z","cross_cats_sorted":[],"title_canon_sha256":"47f7aefb4a7bb5a7e05bdfd076201d6af91a513b9c4b36a9482b961f18c913f9","abstract_canon_sha256":"d2649e2bb1df85a6cc3ac79d89679f6e6b1fa81cbfc91edb0a36a08aa2f61032"},"schema_version":"1.0"},"canonical_sha256":"7816802cadfa97e04cb606d27f3570da3890c55d057274775a4b11ec1678fd69","source":{"kind":"arxiv","id":"2204.05351","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2204.05351","created_at":"2026-07-05T05:17:45Z"},{"alias_kind":"arxiv_version","alias_value":"2204.05351v3","created_at":"2026-07-05T05:17:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2204.05351","created_at":"2026-07-05T05:17:45Z"},{"alias_kind":"pith_short_12","alias_value":"PALIALFN7KL6","created_at":"2026-07-05T05:17:45Z"},{"alias_kind":"pith_short_16","alias_value":"PALIALFN7KL6ATFW","created_at":"2026-07-05T05:17:45Z"},{"alias_kind":"pith_short_8","alias_value":"PALIALFN","created_at":"2026-07-05T05:17:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:PALIALFN7KL6ATFWA3JH6NLQ3I","target":"record","payload":{"canonical_record":{"source":{"id":"2204.05351","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2022-04-11T18:13:19Z","cross_cats_sorted":[],"title_canon_sha256":"47f7aefb4a7bb5a7e05bdfd076201d6af91a513b9c4b36a9482b961f18c913f9","abstract_canon_sha256":"d2649e2bb1df85a6cc3ac79d89679f6e6b1fa81cbfc91edb0a36a08aa2f61032"},"schema_version":"1.0"},"canonical_sha256":"7816802cadfa97e04cb606d27f3570da3890c55d057274775a4b11ec1678fd69","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:17:45.505713Z","signature_b64":"TKd/5kk5nXtCaMpk7gUBwaSen8eXGTmO8LzBqMxtn1WMCGkrgUtyT1TQgOOV1fbIpMbWPc2B22L0NaR6oVxmBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7816802cadfa97e04cb606d27f3570da3890c55d057274775a4b11ec1678fd69","last_reissued_at":"2026-07-05T05:17:45.505219Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:17:45.505219Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2204.05351","source_version":3,"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-05T05:17:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+NbunA/qBxPTcM2RUghcgUVMyv3F3XOYcHjyCCloJLz2TJeP0QvOhlNHfVV+5de+jkpI73Urwi35y+bI+4qFCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-09T05:43:44.445666Z"},"content_sha256":"865e44bad01672317ade2e61bc69f42105849bdd56139f286ad2a3ca03374418","schema_version":"1.0","event_id":"sha256:865e44bad01672317ade2e61bc69f42105849bdd56139f286ad2a3ca03374418"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:PALIALFN7KL6ATFWA3JH6NLQ3I","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Graph Ordering Attention Networks","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"George Dasoulas, Johannes F. Lutzeyer, Michail Chatzianastasis, Michalis Vazirgiannis","submitted_at":"2022-04-11T18:13:19Z","abstract_excerpt":"Graph Neural Networks (GNNs) have been successfully used in many problems involving graph-structured data, achieving state-of-the-art performance. GNNs typically employ a message-passing scheme, in which every node aggregates information from its neighbors using a permutation-invariant aggregation function. Standard well-examined choices such as the mean or sum aggregation functions have limited capabilities, as they are not able to capture interactions among neighbors. In this work, we formalize these interactions using an information-theoretic framework that notably includes synergistic info"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2204.05351","kind":"arxiv","version":3},"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/2204.05351/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-05T05:17:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7qAzfXIqbaq2uB1OYydSVPO+5tA5dKMWIamEWEt2lze2XVby3BGsz+jsb2dNbSSZTXPLbrhLHq5qMK0UV6KNDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-09T05:43:44.446417Z"},"content_sha256":"5a018d1db9c8df14ec5235dc0a5d1a9dc46745e214c1def38212e780f6931c8c","schema_version":"1.0","event_id":"sha256:5a018d1db9c8df14ec5235dc0a5d1a9dc46745e214c1def38212e780f6931c8c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PALIALFN7KL6ATFWA3JH6NLQ3I/bundle.json","state_url":"https://pith.science/pith/PALIALFN7KL6ATFWA3JH6NLQ3I/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PALIALFN7KL6ATFWA3JH6NLQ3I/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-09T05:43:44Z","links":{"resolver":"https://pith.science/pith/PALIALFN7KL6ATFWA3JH6NLQ3I","bundle":"https://pith.science/pith/PALIALFN7KL6ATFWA3JH6NLQ3I/bundle.json","state":"https://pith.science/pith/PALIALFN7KL6ATFWA3JH6NLQ3I/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PALIALFN7KL6ATFWA3JH6NLQ3I/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:PALIALFN7KL6ATFWA3JH6NLQ3I","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":"d2649e2bb1df85a6cc3ac79d89679f6e6b1fa81cbfc91edb0a36a08aa2f61032","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2022-04-11T18:13:19Z","title_canon_sha256":"47f7aefb4a7bb5a7e05bdfd076201d6af91a513b9c4b36a9482b961f18c913f9"},"schema_version":"1.0","source":{"id":"2204.05351","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2204.05351","created_at":"2026-07-05T05:17:45Z"},{"alias_kind":"arxiv_version","alias_value":"2204.05351v3","created_at":"2026-07-05T05:17:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2204.05351","created_at":"2026-07-05T05:17:45Z"},{"alias_kind":"pith_short_12","alias_value":"PALIALFN7KL6","created_at":"2026-07-05T05:17:45Z"},{"alias_kind":"pith_short_16","alias_value":"PALIALFN7KL6ATFW","created_at":"2026-07-05T05:17:45Z"},{"alias_kind":"pith_short_8","alias_value":"PALIALFN","created_at":"2026-07-05T05:17:45Z"}],"graph_snapshots":[{"event_id":"sha256:5a018d1db9c8df14ec5235dc0a5d1a9dc46745e214c1def38212e780f6931c8c","target":"graph","created_at":"2026-07-05T05:17:45Z","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/2204.05351/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Graph Neural Networks (GNNs) have been successfully used in many problems involving graph-structured data, achieving state-of-the-art performance. GNNs typically employ a message-passing scheme, in which every node aggregates information from its neighbors using a permutation-invariant aggregation function. Standard well-examined choices such as the mean or sum aggregation functions have limited capabilities, as they are not able to capture interactions among neighbors. In this work, we formalize these interactions using an information-theoretic framework that notably includes synergistic info","authors_text":"George Dasoulas, Johannes F. Lutzeyer, Michail Chatzianastasis, Michalis Vazirgiannis","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2022-04-11T18:13:19Z","title":"Graph Ordering Attention Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2204.05351","kind":"arxiv","version":3},"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:865e44bad01672317ade2e61bc69f42105849bdd56139f286ad2a3ca03374418","target":"record","created_at":"2026-07-05T05:17:45Z","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":"d2649e2bb1df85a6cc3ac79d89679f6e6b1fa81cbfc91edb0a36a08aa2f61032","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2022-04-11T18:13:19Z","title_canon_sha256":"47f7aefb4a7bb5a7e05bdfd076201d6af91a513b9c4b36a9482b961f18c913f9"},"schema_version":"1.0","source":{"id":"2204.05351","kind":"arxiv","version":3}},"canonical_sha256":"7816802cadfa97e04cb606d27f3570da3890c55d057274775a4b11ec1678fd69","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7816802cadfa97e04cb606d27f3570da3890c55d057274775a4b11ec1678fd69","first_computed_at":"2026-07-05T05:17:45.505219Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:17:45.505219Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TKd/5kk5nXtCaMpk7gUBwaSen8eXGTmO8LzBqMxtn1WMCGkrgUtyT1TQgOOV1fbIpMbWPc2B22L0NaR6oVxmBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T05:17:45.505713Z","signed_message":"canonical_sha256_bytes"},"source_id":"2204.05351","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:865e44bad01672317ade2e61bc69f42105849bdd56139f286ad2a3ca03374418","sha256:5a018d1db9c8df14ec5235dc0a5d1a9dc46745e214c1def38212e780f6931c8c"],"state_sha256":"8227ef890353d71a3f29dcf8e397dcb7f6c349c10d28d6145e8d727d1f2a45aa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iUGx2yfgPrfOBcq+vURz0VkqMo/gi9l0UNhz+tqpvPENIJ82btS7SjMzAiU2D6g5EjMxggplT5O5JiJNERAQBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-09T05:43:44.449492Z","bundle_sha256":"9f0ee1c5538d44a0d031ca9c3d5d20bbe081234ceb0492e59bf19a7fa5001153"}}