{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:X34BYG7SBMSCLVJSKSJAND2JHS","short_pith_number":"pith:X34BYG7S","schema_version":"1.0","canonical_sha256":"bef81c1bf20b2425d5325492068f493c8e7c9627ec9301f3f67813b1f6ff8c13","source":{"kind":"arxiv","id":"1907.06051","version":2},"attestation_state":"computed","paper":{"title":"k-hop Graph Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"George Dasoulas, Giannis Nikolentzos, Michalis Vazirgiannis","submitted_at":"2019-07-13T11:31:57Z","abstract_excerpt":"Graph neural networks (GNNs) have emerged recently as a powerful architecture for learning node and graph representations. Standard GNNs have the same expressive power as the Weisfeiler-Leman test of graph isomorphism in terms of distinguishing non-isomorphic graphs. However, it was recently shown that this test cannot identify fundamental graph properties such as connectivity and triangle freeness. We show that GNNs also suffer from the same limitation. To address this limitation, we propose a more expressive architecture, k-hop GNNs, which updates a node's representation by aggregating infor"},"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":"1907.06051","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-07-13T11:31:57Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"ff06144cbd22416a5c439ba86618c2f8e9bec9ccaad028734b9876bc7cb55b49","abstract_canon_sha256":"018e951a86777225a5de4393f2b3ef3d8cd2dec3e74beaa43860a1c865f7c060"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:25:34.760913Z","signature_b64":"mglQUU3YQ8VbllM3KAHydBhNoyvtKFQkLW2j3sxVhjWG1DjErLtbTlM3fwyHutqon/WqugvWiKTCZSTlGzg2Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bef81c1bf20b2425d5325492068f493c8e7c9627ec9301f3f67813b1f6ff8c13","last_reissued_at":"2026-07-05T01:25:34.760375Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:25:34.760375Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"k-hop Graph Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"George Dasoulas, Giannis Nikolentzos, Michalis Vazirgiannis","submitted_at":"2019-07-13T11:31:57Z","abstract_excerpt":"Graph neural networks (GNNs) have emerged recently as a powerful architecture for learning node and graph representations. Standard GNNs have the same expressive power as the Weisfeiler-Leman test of graph isomorphism in terms of distinguishing non-isomorphic graphs. However, it was recently shown that this test cannot identify fundamental graph properties such as connectivity and triangle freeness. We show that GNNs also suffer from the same limitation. To address this limitation, we propose a more expressive architecture, k-hop GNNs, which updates a node's representation by aggregating infor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.06051","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/1907.06051/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":"1907.06051","created_at":"2026-07-05T01:25:34.760433+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.06051v2","created_at":"2026-07-05T01:25:34.760433+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.06051","created_at":"2026-07-05T01:25:34.760433+00:00"},{"alias_kind":"pith_short_12","alias_value":"X34BYG7SBMSC","created_at":"2026-07-05T01:25:34.760433+00:00"},{"alias_kind":"pith_short_16","alias_value":"X34BYG7SBMSCLVJS","created_at":"2026-07-05T01:25:34.760433+00:00"},{"alias_kind":"pith_short_8","alias_value":"X34BYG7S","created_at":"2026-07-05T01:25:34.760433+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/X34BYG7SBMSCLVJSKSJAND2JHS","json":"https://pith.science/pith/X34BYG7SBMSCLVJSKSJAND2JHS.json","graph_json":"https://pith.science/api/pith-number/X34BYG7SBMSCLVJSKSJAND2JHS/graph.json","events_json":"https://pith.science/api/pith-number/X34BYG7SBMSCLVJSKSJAND2JHS/events.json","paper":"https://pith.science/paper/X34BYG7S"},"agent_actions":{"view_html":"https://pith.science/pith/X34BYG7SBMSCLVJSKSJAND2JHS","download_json":"https://pith.science/pith/X34BYG7SBMSCLVJSKSJAND2JHS.json","view_paper":"https://pith.science/paper/X34BYG7S","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.06051&json=true","fetch_graph":"https://pith.science/api/pith-number/X34BYG7SBMSCLVJSKSJAND2JHS/graph.json","fetch_events":"https://pith.science/api/pith-number/X34BYG7SBMSCLVJSKSJAND2JHS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/X34BYG7SBMSCLVJSKSJAND2JHS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/X34BYG7SBMSCLVJSKSJAND2JHS/action/storage_attestation","attest_author":"https://pith.science/pith/X34BYG7SBMSCLVJSKSJAND2JHS/action/author_attestation","sign_citation":"https://pith.science/pith/X34BYG7SBMSCLVJSKSJAND2JHS/action/citation_signature","submit_replication":"https://pith.science/pith/X34BYG7SBMSCLVJSKSJAND2JHS/action/replication_record"}},"created_at":"2026-07-05T01:25:34.760433+00:00","updated_at":"2026-07-05T01:25:34.760433+00:00"}