{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:PALIALFN7KL6ATFWA3JH6NLQ3I","short_pith_number":"pith:PALIALFN","schema_version":"1.0","canonical_sha256":"7816802cadfa97e04cb606d27f3570da3890c55d057274775a4b11ec1678fd69","source":{"kind":"arxiv","id":"2204.05351","version":3},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2204.05351","created_at":"2026-07-05T05:17:45.505271+00:00"},{"alias_kind":"arxiv_version","alias_value":"2204.05351v3","created_at":"2026-07-05T05:17:45.505271+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2204.05351","created_at":"2026-07-05T05:17:45.505271+00:00"},{"alias_kind":"pith_short_12","alias_value":"PALIALFN7KL6","created_at":"2026-07-05T05:17:45.505271+00:00"},{"alias_kind":"pith_short_16","alias_value":"PALIALFN7KL6ATFW","created_at":"2026-07-05T05:17:45.505271+00:00"},{"alias_kind":"pith_short_8","alias_value":"PALIALFN","created_at":"2026-07-05T05:17:45.505271+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.27439","citing_title":"Simulation-Based Inference for Cluster Cosmology with Set-Based Neural Network Architectures","ref_index":22,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PALIALFN7KL6ATFWA3JH6NLQ3I","json":"https://pith.science/pith/PALIALFN7KL6ATFWA3JH6NLQ3I.json","graph_json":"https://pith.science/api/pith-number/PALIALFN7KL6ATFWA3JH6NLQ3I/graph.json","events_json":"https://pith.science/api/pith-number/PALIALFN7KL6ATFWA3JH6NLQ3I/events.json","paper":"https://pith.science/paper/PALIALFN"},"agent_actions":{"view_html":"https://pith.science/pith/PALIALFN7KL6ATFWA3JH6NLQ3I","download_json":"https://pith.science/pith/PALIALFN7KL6ATFWA3JH6NLQ3I.json","view_paper":"https://pith.science/paper/PALIALFN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2204.05351&json=true","fetch_graph":"https://pith.science/api/pith-number/PALIALFN7KL6ATFWA3JH6NLQ3I/graph.json","fetch_events":"https://pith.science/api/pith-number/PALIALFN7KL6ATFWA3JH6NLQ3I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PALIALFN7KL6ATFWA3JH6NLQ3I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PALIALFN7KL6ATFWA3JH6NLQ3I/action/storage_attestation","attest_author":"https://pith.science/pith/PALIALFN7KL6ATFWA3JH6NLQ3I/action/author_attestation","sign_citation":"https://pith.science/pith/PALIALFN7KL6ATFWA3JH6NLQ3I/action/citation_signature","submit_replication":"https://pith.science/pith/PALIALFN7KL6ATFWA3JH6NLQ3I/action/replication_record"}},"created_at":"2026-07-05T05:17:45.505271+00:00","updated_at":"2026-07-05T05:17:45.505271+00:00"}