{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:R23QQCZ25SXXVBGWAVHA2YQNRJ","short_pith_number":"pith:R23QQCZ2","schema_version":"1.0","canonical_sha256":"8eb7080b3aecaf7a84d6054e0d620d8a6d990913dafa206180db3a1f4023c7b8","source":{"kind":"arxiv","id":"2106.03462","version":2},"attestation_state":"computed","paper":{"title":"SILVAN: Estimating Betweenness Centralities with Progressive Sampling and Non-uniform Rademacher Bounds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.DS","authors_text":"Fabio Vandin, Leonardo Pellegrina","submitted_at":"2021-06-07T09:43:48Z","abstract_excerpt":"Betweenness centrality is a popular centrality measure with applications in several domains, and whose exact computation is impractical for modern-sized networks. We present SILVAN, a novel, efficient algorithm to compute, with high probability, accurate estimates of the betweenness centrality of all nodes of a graph and a high-quality approximation of the top-k betweenness centralities. SILVAN follows a progressive sampling approach, and builds on novel bounds based on Monte-Carlo Empirical Rademacher Averages, a powerful and flexible tool from statistical learning theory. SILVAN relies on a "},"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":"2106.03462","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2021-06-07T09:43:48Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"c712b47bb9637ba58df61177394caf82fb247f49d0cd5a722715a67effd987e1","abstract_canon_sha256":"1498c134752feccb0dfc617563744cecaafb45d63218c81414187a768af1e01b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:28:06.918086Z","signature_b64":"JCM9ovXNZjRLiH7Dgb0yNV9nwo0rbIfFn0+DOceNOnXsKPmSlVh5bBDNVYpyXWY9hPfuQP2yiUViXvtsWdOtCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8eb7080b3aecaf7a84d6054e0d620d8a6d990913dafa206180db3a1f4023c7b8","last_reissued_at":"2026-07-05T04:28:06.917684Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:28:06.917684Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"SILVAN: Estimating Betweenness Centralities with Progressive Sampling and Non-uniform Rademacher Bounds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.DS","authors_text":"Fabio Vandin, Leonardo Pellegrina","submitted_at":"2021-06-07T09:43:48Z","abstract_excerpt":"Betweenness centrality is a popular centrality measure with applications in several domains, and whose exact computation is impractical for modern-sized networks. We present SILVAN, a novel, efficient algorithm to compute, with high probability, accurate estimates of the betweenness centrality of all nodes of a graph and a high-quality approximation of the top-k betweenness centralities. SILVAN follows a progressive sampling approach, and builds on novel bounds based on Monte-Carlo Empirical Rademacher Averages, a powerful and flexible tool from statistical learning theory. SILVAN relies on a "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.03462","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/2106.03462/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":"2106.03462","created_at":"2026-07-05T04:28:06.917748+00:00"},{"alias_kind":"arxiv_version","alias_value":"2106.03462v2","created_at":"2026-07-05T04:28:06.917748+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.03462","created_at":"2026-07-05T04:28:06.917748+00:00"},{"alias_kind":"pith_short_12","alias_value":"R23QQCZ25SXX","created_at":"2026-07-05T04:28:06.917748+00:00"},{"alias_kind":"pith_short_16","alias_value":"R23QQCZ25SXXVBGW","created_at":"2026-07-05T04:28:06.917748+00:00"},{"alias_kind":"pith_short_8","alias_value":"R23QQCZ2","created_at":"2026-07-05T04:28:06.917748+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.14122","citing_title":"CLGNN: A Contrastive Learning-based GNN Model for Betweenness Centrality Prediction on Temporal Graphs","ref_index":29,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/R23QQCZ25SXXVBGWAVHA2YQNRJ","json":"https://pith.science/pith/R23QQCZ25SXXVBGWAVHA2YQNRJ.json","graph_json":"https://pith.science/api/pith-number/R23QQCZ25SXXVBGWAVHA2YQNRJ/graph.json","events_json":"https://pith.science/api/pith-number/R23QQCZ25SXXVBGWAVHA2YQNRJ/events.json","paper":"https://pith.science/paper/R23QQCZ2"},"agent_actions":{"view_html":"https://pith.science/pith/R23QQCZ25SXXVBGWAVHA2YQNRJ","download_json":"https://pith.science/pith/R23QQCZ25SXXVBGWAVHA2YQNRJ.json","view_paper":"https://pith.science/paper/R23QQCZ2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2106.03462&json=true","fetch_graph":"https://pith.science/api/pith-number/R23QQCZ25SXXVBGWAVHA2YQNRJ/graph.json","fetch_events":"https://pith.science/api/pith-number/R23QQCZ25SXXVBGWAVHA2YQNRJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/R23QQCZ25SXXVBGWAVHA2YQNRJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/R23QQCZ25SXXVBGWAVHA2YQNRJ/action/storage_attestation","attest_author":"https://pith.science/pith/R23QQCZ25SXXVBGWAVHA2YQNRJ/action/author_attestation","sign_citation":"https://pith.science/pith/R23QQCZ25SXXVBGWAVHA2YQNRJ/action/citation_signature","submit_replication":"https://pith.science/pith/R23QQCZ25SXXVBGWAVHA2YQNRJ/action/replication_record"}},"created_at":"2026-07-05T04:28:06.917748+00:00","updated_at":"2026-07-05T04:28:06.917748+00:00"}