{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:7Y2KVPHUAHPPR3E2OO3AD6S63N","short_pith_number":"pith:7Y2KVPHU","schema_version":"1.0","canonical_sha256":"fe34aabcf401def8ec9a73b601fa5edb434f2448778e57160030549940d77b84","source":{"kind":"arxiv","id":"1905.10418","version":4},"attestation_state":"computed","paper":{"title":"Learning to Identify High Betweenness Centrality Nodes from Scratch: A Novel Graph Neural Network Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.SI","authors_text":"Changjun Fan, Li Zeng, Muhao Chen, Yizhou Sun, Yuhui Ding, Zhong Liu","submitted_at":"2019-05-24T19:23:49Z","abstract_excerpt":"Betweenness centrality (BC) is one of the most used centrality measures for network analysis, which seeks to describe the importance of nodes in a network in terms of the fraction of shortest paths that pass through them. It is key to many valuable applications, including community detection and network dismantling. Computing BC scores on large networks is computationally challenging due to high time complexity. Many approximation algorithms have been proposed to speed up the estimation of BC, which are mainly sampling-based. However, these methods are still prone to considerable execution tim"},"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":"1905.10418","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2019-05-24T19:23:49Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"1a78d8ced2d9748bffa732f44427aced88ac89ba3a98f63726292fcc0ef4dd7b","abstract_canon_sha256":"9d482e1815f4027fe10c9d68a1340aa69f546f774210766ea34e1108b6a0f7d1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:00:26.379303Z","signature_b64":"m8zr/mCzfOf6UuV4fCkDxXxbCZIyeYUlnLffhbVpRdVTnSvK4nGPohPY7Gszg7kRWOepcVu+3yyJJs0vSLNsBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fe34aabcf401def8ec9a73b601fa5edb434f2448778e57160030549940d77b84","last_reissued_at":"2026-07-05T00:00:26.378762Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:00:26.378762Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning to Identify High Betweenness Centrality Nodes from Scratch: A Novel Graph Neural Network Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.SI","authors_text":"Changjun Fan, Li Zeng, Muhao Chen, Yizhou Sun, Yuhui Ding, Zhong Liu","submitted_at":"2019-05-24T19:23:49Z","abstract_excerpt":"Betweenness centrality (BC) is one of the most used centrality measures for network analysis, which seeks to describe the importance of nodes in a network in terms of the fraction of shortest paths that pass through them. It is key to many valuable applications, including community detection and network dismantling. Computing BC scores on large networks is computationally challenging due to high time complexity. Many approximation algorithms have been proposed to speed up the estimation of BC, which are mainly sampling-based. However, these methods are still prone to considerable execution tim"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.10418","kind":"arxiv","version":4},"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/1905.10418/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":"1905.10418","created_at":"2026-07-05T00:00:26.378825+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.10418v4","created_at":"2026-07-05T00:00:26.378825+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.10418","created_at":"2026-07-05T00:00:26.378825+00:00"},{"alias_kind":"pith_short_12","alias_value":"7Y2KVPHUAHPP","created_at":"2026-07-05T00:00:26.378825+00:00"},{"alias_kind":"pith_short_16","alias_value":"7Y2KVPHUAHPPR3E2","created_at":"2026-07-05T00:00:26.378825+00:00"},{"alias_kind":"pith_short_8","alias_value":"7Y2KVPHU","created_at":"2026-07-05T00:00:26.378825+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/7Y2KVPHUAHPPR3E2OO3AD6S63N","json":"https://pith.science/pith/7Y2KVPHUAHPPR3E2OO3AD6S63N.json","graph_json":"https://pith.science/api/pith-number/7Y2KVPHUAHPPR3E2OO3AD6S63N/graph.json","events_json":"https://pith.science/api/pith-number/7Y2KVPHUAHPPR3E2OO3AD6S63N/events.json","paper":"https://pith.science/paper/7Y2KVPHU"},"agent_actions":{"view_html":"https://pith.science/pith/7Y2KVPHUAHPPR3E2OO3AD6S63N","download_json":"https://pith.science/pith/7Y2KVPHUAHPPR3E2OO3AD6S63N.json","view_paper":"https://pith.science/paper/7Y2KVPHU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.10418&json=true","fetch_graph":"https://pith.science/api/pith-number/7Y2KVPHUAHPPR3E2OO3AD6S63N/graph.json","fetch_events":"https://pith.science/api/pith-number/7Y2KVPHUAHPPR3E2OO3AD6S63N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7Y2KVPHUAHPPR3E2OO3AD6S63N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7Y2KVPHUAHPPR3E2OO3AD6S63N/action/storage_attestation","attest_author":"https://pith.science/pith/7Y2KVPHUAHPPR3E2OO3AD6S63N/action/author_attestation","sign_citation":"https://pith.science/pith/7Y2KVPHUAHPPR3E2OO3AD6S63N/action/citation_signature","submit_replication":"https://pith.science/pith/7Y2KVPHUAHPPR3E2OO3AD6S63N/action/replication_record"}},"created_at":"2026-07-05T00:00:26.378825+00:00","updated_at":"2026-07-05T00:00:26.378825+00:00"}