{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:XOBX443HMANJKZG6XA65GAJHXZ","short_pith_number":"pith:XOBX443H","schema_version":"1.0","canonical_sha256":"bb837e7367601a9564deb83dd30127be5e6283837f5266e42a8db4939d514edd","source":{"kind":"arxiv","id":"2509.01170","version":1},"attestation_state":"computed","paper":{"title":"ADMP-GNN: Adaptive Depth Message Passing GNN","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Fragkiskos D. Malliaros, Johannes F. Lutzeyer, Michalis Vazirgiannis, Yassine Abbahaddou","submitted_at":"2025-09-01T06:42:19Z","abstract_excerpt":"Graph Neural Networks (GNNs) have proven to be highly effective in various graph learning tasks. A key characteristic of GNNs is their use of a fixed number of message-passing steps for all nodes in the graph, regardless of each node's diverse computational needs and characteristics. Through empirical real-world data analysis, we demonstrate that the optimal number of message-passing layers varies for nodes with different characteristics. This finding is further supported by experiments conducted on synthetic datasets. To address this, we propose Adaptive Depth Message Passing GNN (ADMP-GNN), "},"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":"2509.01170","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-09-01T06:42:19Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"c1b8aafc77f9715247132ea8c74c84a21235d70d5f716aa55a1cdd04d396f4f9","abstract_canon_sha256":"cd86554141233efcf81871c96db9276784c85d38b31a40ee9769b5c0ee47416c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:02:55.312492Z","signature_b64":"BR1UVhZsOqbta+HS+DuG3jlH51f92f2gW/qNzzVFU62Wq164RarafMAeioByTtlhaDAAoyhM5wKbF/c0G/ayCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bb837e7367601a9564deb83dd30127be5e6283837f5266e42a8db4939d514edd","last_reissued_at":"2026-07-05T12:02:55.311975Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:02:55.311975Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"ADMP-GNN: Adaptive Depth Message Passing GNN","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Fragkiskos D. Malliaros, Johannes F. Lutzeyer, Michalis Vazirgiannis, Yassine Abbahaddou","submitted_at":"2025-09-01T06:42:19Z","abstract_excerpt":"Graph Neural Networks (GNNs) have proven to be highly effective in various graph learning tasks. A key characteristic of GNNs is their use of a fixed number of message-passing steps for all nodes in the graph, regardless of each node's diverse computational needs and characteristics. Through empirical real-world data analysis, we demonstrate that the optimal number of message-passing layers varies for nodes with different characteristics. This finding is further supported by experiments conducted on synthetic datasets. To address this, we propose Adaptive Depth Message Passing GNN (ADMP-GNN), "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.01170","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/2509.01170/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":"2509.01170","created_at":"2026-07-05T12:02:55.312046+00:00"},{"alias_kind":"arxiv_version","alias_value":"2509.01170v1","created_at":"2026-07-05T12:02:55.312046+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.01170","created_at":"2026-07-05T12:02:55.312046+00:00"},{"alias_kind":"pith_short_12","alias_value":"XOBX443HMANJ","created_at":"2026-07-05T12:02:55.312046+00:00"},{"alias_kind":"pith_short_16","alias_value":"XOBX443HMANJKZG6","created_at":"2026-07-05T12:02:55.312046+00:00"},{"alias_kind":"pith_short_8","alias_value":"XOBX443H","created_at":"2026-07-05T12:02:55.312046+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/XOBX443HMANJKZG6XA65GAJHXZ","json":"https://pith.science/pith/XOBX443HMANJKZG6XA65GAJHXZ.json","graph_json":"https://pith.science/api/pith-number/XOBX443HMANJKZG6XA65GAJHXZ/graph.json","events_json":"https://pith.science/api/pith-number/XOBX443HMANJKZG6XA65GAJHXZ/events.json","paper":"https://pith.science/paper/XOBX443H"},"agent_actions":{"view_html":"https://pith.science/pith/XOBX443HMANJKZG6XA65GAJHXZ","download_json":"https://pith.science/pith/XOBX443HMANJKZG6XA65GAJHXZ.json","view_paper":"https://pith.science/paper/XOBX443H","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2509.01170&json=true","fetch_graph":"https://pith.science/api/pith-number/XOBX443HMANJKZG6XA65GAJHXZ/graph.json","fetch_events":"https://pith.science/api/pith-number/XOBX443HMANJKZG6XA65GAJHXZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XOBX443HMANJKZG6XA65GAJHXZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XOBX443HMANJKZG6XA65GAJHXZ/action/storage_attestation","attest_author":"https://pith.science/pith/XOBX443HMANJKZG6XA65GAJHXZ/action/author_attestation","sign_citation":"https://pith.science/pith/XOBX443HMANJKZG6XA65GAJHXZ/action/citation_signature","submit_replication":"https://pith.science/pith/XOBX443HMANJKZG6XA65GAJHXZ/action/replication_record"}},"created_at":"2026-07-05T12:02:55.312046+00:00","updated_at":"2026-07-05T12:02:55.312046+00:00"}