{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:6QUNNKYDOLF5OY2U7I5RXGUSH4","short_pith_number":"pith:6QUNNKYD","schema_version":"1.0","canonical_sha256":"f428d6ab0372cbd76354fa3b1b9a923f1fb93d071e1af7b973572db14d04fde5","source":{"kind":"arxiv","id":"2304.10851","version":2},"attestation_state":"computed","paper":{"title":"What Do GNNs Actually Learn? Towards Understanding their Representations","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Giannis Nikolentzos, Michail Chatzianastasis, Michalis Vazirgiannis","submitted_at":"2023-04-21T09:52:19Z","abstract_excerpt":"In recent years, graph neural networks (GNNs) have achieved great success in the field of graph representation learning. Although prior work has shed light on the expressiveness of those models (\\ie whether they can distinguish pairs of non-isomorphic graphs), it is still not clear what structural information is encoded into the node representations that are learned by those models. In this paper, we address this gap by studying the node representations learned by four standard GNN models. We find that some models produce identical representations for all nodes, while the representations learn"},"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":"2304.10851","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2023-04-21T09:52:19Z","cross_cats_sorted":[],"title_canon_sha256":"9b26efe39f3265325032b609552932d3d1a2cfb2b459e623df348836dda022c3","abstract_canon_sha256":"6b351f0af65a26472edf7e24ca1d163f15487e23caf6a5ca4e92f51c32406cc0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:39:03.163635Z","signature_b64":"bQRWfg4h51rbWSebm/bcygmyq49ZzRVNvNLpjQ06zjbVovbX8VnZyIsZgyu1lY5CZjcnWjMY0Dw603xx57VvDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f428d6ab0372cbd76354fa3b1b9a923f1fb93d071e1af7b973572db14d04fde5","last_reissued_at":"2026-07-05T09:39:03.163224Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:39:03.163224Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"What Do GNNs Actually Learn? Towards Understanding their Representations","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Giannis Nikolentzos, Michail Chatzianastasis, Michalis Vazirgiannis","submitted_at":"2023-04-21T09:52:19Z","abstract_excerpt":"In recent years, graph neural networks (GNNs) have achieved great success in the field of graph representation learning. Although prior work has shed light on the expressiveness of those models (\\ie whether they can distinguish pairs of non-isomorphic graphs), it is still not clear what structural information is encoded into the node representations that are learned by those models. In this paper, we address this gap by studying the node representations learned by four standard GNN models. We find that some models produce identical representations for all nodes, while the representations learn"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2304.10851","kind":"arxiv","version":2},"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/2304.10851/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":"2304.10851","created_at":"2026-07-05T09:39:03.163277+00:00"},{"alias_kind":"arxiv_version","alias_value":"2304.10851v2","created_at":"2026-07-05T09:39:03.163277+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2304.10851","created_at":"2026-07-05T09:39:03.163277+00:00"},{"alias_kind":"pith_short_12","alias_value":"6QUNNKYDOLF5","created_at":"2026-07-05T09:39:03.163277+00:00"},{"alias_kind":"pith_short_16","alias_value":"6QUNNKYDOLF5OY2U","created_at":"2026-07-05T09:39:03.163277+00:00"},{"alias_kind":"pith_short_8","alias_value":"6QUNNKYD","created_at":"2026-07-05T09:39:03.163277+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.00716","citing_title":"Aitchison Embeddings for Learning Compositional Graph Representations","ref_index":12,"is_internal_anchor":false},{"citing_arxiv_id":"2605.11142","citing_title":"Rank Is Not Capacity: Spectral Occupancy for Latent Graph Models","ref_index":44,"is_internal_anchor":false},{"citing_arxiv_id":"2605.00716","citing_title":"Aitchison Embeddings for Learning Compositional Graph Representations","ref_index":12,"is_internal_anchor":false},{"citing_arxiv_id":"2604.19372","citing_title":"TACENR: Task-Agnostic Contrastive Explanations for Node Representations","ref_index":21,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6QUNNKYDOLF5OY2U7I5RXGUSH4","json":"https://pith.science/pith/6QUNNKYDOLF5OY2U7I5RXGUSH4.json","graph_json":"https://pith.science/api/pith-number/6QUNNKYDOLF5OY2U7I5RXGUSH4/graph.json","events_json":"https://pith.science/api/pith-number/6QUNNKYDOLF5OY2U7I5RXGUSH4/events.json","paper":"https://pith.science/paper/6QUNNKYD"},"agent_actions":{"view_html":"https://pith.science/pith/6QUNNKYDOLF5OY2U7I5RXGUSH4","download_json":"https://pith.science/pith/6QUNNKYDOLF5OY2U7I5RXGUSH4.json","view_paper":"https://pith.science/paper/6QUNNKYD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2304.10851&json=true","fetch_graph":"https://pith.science/api/pith-number/6QUNNKYDOLF5OY2U7I5RXGUSH4/graph.json","fetch_events":"https://pith.science/api/pith-number/6QUNNKYDOLF5OY2U7I5RXGUSH4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6QUNNKYDOLF5OY2U7I5RXGUSH4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6QUNNKYDOLF5OY2U7I5RXGUSH4/action/storage_attestation","attest_author":"https://pith.science/pith/6QUNNKYDOLF5OY2U7I5RXGUSH4/action/author_attestation","sign_citation":"https://pith.science/pith/6QUNNKYDOLF5OY2U7I5RXGUSH4/action/citation_signature","submit_replication":"https://pith.science/pith/6QUNNKYDOLF5OY2U7I5RXGUSH4/action/replication_record"}},"created_at":"2026-07-05T09:39:03.163277+00:00","updated_at":"2026-07-05T09:39:03.163277+00:00"}