{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:VGDIZJZ6VQVUT3FOMRHG5GTGOL","short_pith_number":"pith:VGDIZJZ6","schema_version":"1.0","canonical_sha256":"a9868ca73eac2b49ecae644e6e9a6672eda6d5bcc48d8e800b474124761eecf7","source":{"kind":"arxiv","id":"2502.13660","version":1},"attestation_state":"computed","paper":{"title":"Towards Invariance to Node Identifiers in Graph Neural Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Amir Globerson, Carola-Bibiane Schonlieb, Maya Bechler-Speicher, Moshe Eliasof, Ran Gilad-Bachrach","submitted_at":"2025-02-19T12:12:57Z","abstract_excerpt":"Message-Passing Graph Neural Networks (GNNs) are known to have limited expressive power, due to their message passing structure. One mechanism for circumventing this limitation is to add unique node identifiers (IDs), which break the symmetries that underlie the expressivity limitation. In this work, we highlight a key limitation of the ID framework, and propose an approach for addressing it. We begin by observing that the final output of the GNN should clearly not depend on the specific IDs used. We then show that in practice this does not hold, and thus the learned network does not possess t"},"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":"2502.13660","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-02-19T12:12:57Z","cross_cats_sorted":[],"title_canon_sha256":"f234cdb46d24a22ed2db2dab0b55bce6fe88e6748e3779e1824bc1ee7662b675","abstract_canon_sha256":"3121e818ce3e06b072aeee1bc72a720eaaa9d184523e530abc512b887c11e4fe"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:16:51.010421Z","signature_b64":"hIHuUAyiCv3RTQZLmPgJCfBLu1lS0Q7g26dSfbSb6zDjl0TSLcD5Vv1nwLIedUZcwM/HQ0WVW82o7+IvtUocBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a9868ca73eac2b49ecae644e6e9a6672eda6d5bcc48d8e800b474124761eecf7","last_reissued_at":"2026-07-05T10:16:51.009924Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:16:51.009924Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Towards Invariance to Node Identifiers in Graph Neural Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Amir Globerson, Carola-Bibiane Schonlieb, Maya Bechler-Speicher, Moshe Eliasof, Ran Gilad-Bachrach","submitted_at":"2025-02-19T12:12:57Z","abstract_excerpt":"Message-Passing Graph Neural Networks (GNNs) are known to have limited expressive power, due to their message passing structure. One mechanism for circumventing this limitation is to add unique node identifiers (IDs), which break the symmetries that underlie the expressivity limitation. In this work, we highlight a key limitation of the ID framework, and propose an approach for addressing it. We begin by observing that the final output of the GNN should clearly not depend on the specific IDs used. We then show that in practice this does not hold, and thus the learned network does not possess t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.13660","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2502.13660/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":"2502.13660","created_at":"2026-07-05T10:16:51.009990+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.13660v1","created_at":"2026-07-05T10:16:51.009990+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.13660","created_at":"2026-07-05T10:16:51.009990+00:00"},{"alias_kind":"pith_short_12","alias_value":"VGDIZJZ6VQVU","created_at":"2026-07-05T10:16:51.009990+00:00"},{"alias_kind":"pith_short_16","alias_value":"VGDIZJZ6VQVUT3FO","created_at":"2026-07-05T10:16:51.009990+00:00"},{"alias_kind":"pith_short_8","alias_value":"VGDIZJZ6","created_at":"2026-07-05T10:16:51.009990+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2410.01308","citing_title":"How Hard Is It for Message-Passing GNNs to Simulate One Weisfeiler-Lehman Color-Refinement Step?","ref_index":8,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VGDIZJZ6VQVUT3FOMRHG5GTGOL","json":"https://pith.science/pith/VGDIZJZ6VQVUT3FOMRHG5GTGOL.json","graph_json":"https://pith.science/api/pith-number/VGDIZJZ6VQVUT3FOMRHG5GTGOL/graph.json","events_json":"https://pith.science/api/pith-number/VGDIZJZ6VQVUT3FOMRHG5GTGOL/events.json","paper":"https://pith.science/paper/VGDIZJZ6"},"agent_actions":{"view_html":"https://pith.science/pith/VGDIZJZ6VQVUT3FOMRHG5GTGOL","download_json":"https://pith.science/pith/VGDIZJZ6VQVUT3FOMRHG5GTGOL.json","view_paper":"https://pith.science/paper/VGDIZJZ6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.13660&json=true","fetch_graph":"https://pith.science/api/pith-number/VGDIZJZ6VQVUT3FOMRHG5GTGOL/graph.json","fetch_events":"https://pith.science/api/pith-number/VGDIZJZ6VQVUT3FOMRHG5GTGOL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VGDIZJZ6VQVUT3FOMRHG5GTGOL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VGDIZJZ6VQVUT3FOMRHG5GTGOL/action/storage_attestation","attest_author":"https://pith.science/pith/VGDIZJZ6VQVUT3FOMRHG5GTGOL/action/author_attestation","sign_citation":"https://pith.science/pith/VGDIZJZ6VQVUT3FOMRHG5GTGOL/action/citation_signature","submit_replication":"https://pith.science/pith/VGDIZJZ6VQVUT3FOMRHG5GTGOL/action/replication_record"}},"created_at":"2026-07-05T10:16:51.009990+00:00","updated_at":"2026-07-05T10:16:51.009990+00:00"}