{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:P5I4LI5HHKEV53IVRDJT3FIDWP","short_pith_number":"pith:P5I4LI5H","schema_version":"1.0","canonical_sha256":"7f51c5a3a73a895eed1588d33d9503b3e178e6fb952eeac0982ff3965838deff","source":{"kind":"arxiv","id":"2607.09372","version":1},"attestation_state":"computed","paper":{"title":"Graph Neural Networks for Scalable and Transferable Node Centrality Approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Giorgio Mantica, Samra Sana, Saul Imbrici","submitted_at":"2026-07-10T12:53:18Z","abstract_excerpt":"Graph Neural Networks (GNNs) provide a learning-based framework for approximating graph quantities that are expensive to compute exactly. This paper investigates GNNs for scalable approximation of betweenness and closeness centrality, formulated as a node-ranking problem. Exact centrality values are used as supervision, and ranking quality is evaluated using Kendall's tau rank correlation. We study whether message-passing GNNs can learn transferable structural representations across different graph topologies rather than only fitting the distribution used during training. On unseen Erdos renyi"},"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":"2607.09372","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-07-10T12:53:18Z","cross_cats_sorted":[],"title_canon_sha256":"1dc6c4487eaa198ffa9e9542a01f804814a3891f09331a05fb1d4e78d4dc1084","abstract_canon_sha256":"463f5683426d2d7af4db2a1653f827d5f09588760ed87446b909851e50cb40c9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-13T01:19:06.794901Z","signature_b64":"1liaWP2aNafyxRmSnMp5XoMYefJaa0SqRE+w5zWVNy31pEFDWzGNump/bUZccn9EYKyExE5A6zHj4fPnFfhHDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7f51c5a3a73a895eed1588d33d9503b3e178e6fb952eeac0982ff3965838deff","last_reissued_at":"2026-07-13T01:19:06.792961Z","signature_status":"signed_v1","first_computed_at":"2026-07-13T01:19:06.792961Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graph Neural Networks for Scalable and Transferable Node Centrality Approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Giorgio Mantica, Samra Sana, Saul Imbrici","submitted_at":"2026-07-10T12:53:18Z","abstract_excerpt":"Graph Neural Networks (GNNs) provide a learning-based framework for approximating graph quantities that are expensive to compute exactly. This paper investigates GNNs for scalable approximation of betweenness and closeness centrality, formulated as a node-ranking problem. Exact centrality values are used as supervision, and ranking quality is evaluated using Kendall's tau rank correlation. We study whether message-passing GNNs can learn transferable structural representations across different graph topologies rather than only fitting the distribution used during training. On unseen Erdos renyi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.09372","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/2607.09372/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":"2607.09372","created_at":"2026-07-13T01:19:06.793793+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.09372v1","created_at":"2026-07-13T01:19:06.793793+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.09372","created_at":"2026-07-13T01:19:06.793793+00:00"},{"alias_kind":"pith_short_12","alias_value":"P5I4LI5HHKEV","created_at":"2026-07-13T01:19:06.793793+00:00"},{"alias_kind":"pith_short_16","alias_value":"P5I4LI5HHKEV53IV","created_at":"2026-07-13T01:19:06.793793+00:00"},{"alias_kind":"pith_short_8","alias_value":"P5I4LI5H","created_at":"2026-07-13T01:19:06.793793+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/P5I4LI5HHKEV53IVRDJT3FIDWP","json":"https://pith.science/pith/P5I4LI5HHKEV53IVRDJT3FIDWP.json","graph_json":"https://pith.science/api/pith-number/P5I4LI5HHKEV53IVRDJT3FIDWP/graph.json","events_json":"https://pith.science/api/pith-number/P5I4LI5HHKEV53IVRDJT3FIDWP/events.json","paper":"https://pith.science/paper/P5I4LI5H"},"agent_actions":{"view_html":"https://pith.science/pith/P5I4LI5HHKEV53IVRDJT3FIDWP","download_json":"https://pith.science/pith/P5I4LI5HHKEV53IVRDJT3FIDWP.json","view_paper":"https://pith.science/paper/P5I4LI5H","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.09372&json=true","fetch_graph":"https://pith.science/api/pith-number/P5I4LI5HHKEV53IVRDJT3FIDWP/graph.json","fetch_events":"https://pith.science/api/pith-number/P5I4LI5HHKEV53IVRDJT3FIDWP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/P5I4LI5HHKEV53IVRDJT3FIDWP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/P5I4LI5HHKEV53IVRDJT3FIDWP/action/storage_attestation","attest_author":"https://pith.science/pith/P5I4LI5HHKEV53IVRDJT3FIDWP/action/author_attestation","sign_citation":"https://pith.science/pith/P5I4LI5HHKEV53IVRDJT3FIDWP/action/citation_signature","submit_replication":"https://pith.science/pith/P5I4LI5HHKEV53IVRDJT3FIDWP/action/replication_record"}},"created_at":"2026-07-13T01:19:06.793793+00:00","updated_at":"2026-07-13T01:19:06.793793+00:00"}