{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:3PDI5SJZVMUZYW6N72CPDL4BHG","short_pith_number":"pith:3PDI5SJZ","schema_version":"1.0","canonical_sha256":"dbc68ec939ab299c5bcdfe84f1af81399181d67d86b5a7bfc684b3135ea1646d","source":{"kind":"arxiv","id":"1704.07351","version":3},"attestation_state":"computed","paper":{"title":"Metropolis-Hastings Algorithms for Estimating Betweenness Centrality in Large Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"and Albert Bifet, Mostafa Haghir Chehreghani, Talel Abdessalem","submitted_at":"2017-04-24T17:45:31Z","abstract_excerpt":"Betweenness centrality is an important index widely used in different domains such as social networks, traffic networks and the world wide web. However, even for mid-size networks that have only a few hundreds thousands vertices, it is computationally expensive to compute exact betweenness scores. Therefore in recent years, several approximate algorithms have been developed. In this paper, first given a network $G$ and a vertex $r \\in V(G)$, we propose a Metropolis-Hastings MCMC algorithm that samples from the space $V(G)$ and estimates betweenness score of $r$. The stationary distribution of "},"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":"1704.07351","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-24T17:45:31Z","cross_cats_sorted":[],"title_canon_sha256":"a9be6f84edcd2e3fff7e425b1a209c294234a9fd8451321b69d6ec3aff97ad88","abstract_canon_sha256":"fdf7ffde6254a4910aca291796d82c9afc12d69f5862dd2138d57301e8dc97c1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:04.709153Z","signature_b64":"TzA2HXTl1HSwxLa+3Yc3AlFNOuFCWgT9gmZtVNuuSF/x4rocucSmW8VYuyHGKlheYbYKxyGlWJ3T/ZU3ANqiDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dbc68ec939ab299c5bcdfe84f1af81399181d67d86b5a7bfc684b3135ea1646d","last_reissued_at":"2026-05-18T00:45:04.708723Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:04.708723Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Metropolis-Hastings Algorithms for Estimating Betweenness Centrality in Large Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"and Albert Bifet, Mostafa Haghir Chehreghani, Talel Abdessalem","submitted_at":"2017-04-24T17:45:31Z","abstract_excerpt":"Betweenness centrality is an important index widely used in different domains such as social networks, traffic networks and the world wide web. However, even for mid-size networks that have only a few hundreds thousands vertices, it is computationally expensive to compute exact betweenness scores. Therefore in recent years, several approximate algorithms have been developed. In this paper, first given a network $G$ and a vertex $r \\in V(G)$, we propose a Metropolis-Hastings MCMC algorithm that samples from the space $V(G)$ and estimates betweenness score of $r$. The stationary distribution of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.07351","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1704.07351","created_at":"2026-05-18T00:45:04.708799+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.07351v3","created_at":"2026-05-18T00:45:04.708799+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.07351","created_at":"2026-05-18T00:45:04.708799+00:00"},{"alias_kind":"pith_short_12","alias_value":"3PDI5SJZVMUZ","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_16","alias_value":"3PDI5SJZVMUZYW6N","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_8","alias_value":"3PDI5SJZ","created_at":"2026-05-18T12:30:58.224056+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/3PDI5SJZVMUZYW6N72CPDL4BHG","json":"https://pith.science/pith/3PDI5SJZVMUZYW6N72CPDL4BHG.json","graph_json":"https://pith.science/api/pith-number/3PDI5SJZVMUZYW6N72CPDL4BHG/graph.json","events_json":"https://pith.science/api/pith-number/3PDI5SJZVMUZYW6N72CPDL4BHG/events.json","paper":"https://pith.science/paper/3PDI5SJZ"},"agent_actions":{"view_html":"https://pith.science/pith/3PDI5SJZVMUZYW6N72CPDL4BHG","download_json":"https://pith.science/pith/3PDI5SJZVMUZYW6N72CPDL4BHG.json","view_paper":"https://pith.science/paper/3PDI5SJZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.07351&json=true","fetch_graph":"https://pith.science/api/pith-number/3PDI5SJZVMUZYW6N72CPDL4BHG/graph.json","fetch_events":"https://pith.science/api/pith-number/3PDI5SJZVMUZYW6N72CPDL4BHG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3PDI5SJZVMUZYW6N72CPDL4BHG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3PDI5SJZVMUZYW6N72CPDL4BHG/action/storage_attestation","attest_author":"https://pith.science/pith/3PDI5SJZVMUZYW6N72CPDL4BHG/action/author_attestation","sign_citation":"https://pith.science/pith/3PDI5SJZVMUZYW6N72CPDL4BHG/action/citation_signature","submit_replication":"https://pith.science/pith/3PDI5SJZVMUZYW6N72CPDL4BHG/action/replication_record"}},"created_at":"2026-05-18T00:45:04.708799+00:00","updated_at":"2026-05-18T00:45:04.708799+00:00"}