{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:LAHQ6QQ33JEIV6WN526ECDMXQT","short_pith_number":"pith:LAHQ6QQ3","schema_version":"1.0","canonical_sha256":"580f0f421bda488afacdeebc410d9784d39e0ee52fa66d688de66437c735787c","source":{"kind":"arxiv","id":"1810.10094","version":1},"attestation_state":"computed","paper":{"title":"Novel Adaptive Algorithms for Estimating Betweenness, Coverage and k-path Centralities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Albert Bifet, Mostafa Haghir Chehreghani, Talel Abdessalem","submitted_at":"2018-10-23T21:17:57Z","abstract_excerpt":"An important index widely used to analyze social and information networks is betweenness centrality. In this paper, first given a directed network $G$ and a vertex $r\\in V(G)$, we present a novel adaptive algorithm for estimating betweenness score of $r$. Our algorithm first computes two subsets of the vertex set of $G$, called $\\mathcal{RF}(r)$ and $\\mathcal{RT}(r)$, that define the sample spaces of the start-points and the end-points of the samples. Then, it adaptively samples from $\\mathcal{RF}(r)$ and $\\mathcal{RT}(r)$ and stops as soon as some condition is satisfied. The stopping conditio"},"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":"1810.10094","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-10-23T21:17:57Z","cross_cats_sorted":[],"title_canon_sha256":"a972336463871a918136b72fbee24e105a66e68fed925bc450061f71273e42f4","abstract_canon_sha256":"f3ef108b0178035fb4a2581d058bb32f047ff173872108e3cc69fb6a9b85f743"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:24.258120Z","signature_b64":"zTz4QtbJXk0aE3iz1i8Nk+rpOi0c1XTONAsViBeK0deBCN0bBe8cgIc5M2uHpxCYFmdfo0irHZDZ1mXwXZhZBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"580f0f421bda488afacdeebc410d9784d39e0ee52fa66d688de66437c735787c","last_reissued_at":"2026-05-18T00:02:24.257239Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:24.257239Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Novel Adaptive Algorithms for Estimating Betweenness, Coverage and k-path Centralities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Albert Bifet, Mostafa Haghir Chehreghani, Talel Abdessalem","submitted_at":"2018-10-23T21:17:57Z","abstract_excerpt":"An important index widely used to analyze social and information networks is betweenness centrality. In this paper, first given a directed network $G$ and a vertex $r\\in V(G)$, we present a novel adaptive algorithm for estimating betweenness score of $r$. Our algorithm first computes two subsets of the vertex set of $G$, called $\\mathcal{RF}(r)$ and $\\mathcal{RT}(r)$, that define the sample spaces of the start-points and the end-points of the samples. Then, it adaptively samples from $\\mathcal{RF}(r)$ and $\\mathcal{RT}(r)$ and stops as soon as some condition is satisfied. The stopping conditio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.10094","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":""},"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":"1810.10094","created_at":"2026-05-18T00:02:24.257391+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.10094v1","created_at":"2026-05-18T00:02:24.257391+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.10094","created_at":"2026-05-18T00:02:24.257391+00:00"},{"alias_kind":"pith_short_12","alias_value":"LAHQ6QQ33JEI","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_16","alias_value":"LAHQ6QQ33JEIV6WN","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_8","alias_value":"LAHQ6QQ3","created_at":"2026-05-18T12:32:33.847187+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/LAHQ6QQ33JEIV6WN526ECDMXQT","json":"https://pith.science/pith/LAHQ6QQ33JEIV6WN526ECDMXQT.json","graph_json":"https://pith.science/api/pith-number/LAHQ6QQ33JEIV6WN526ECDMXQT/graph.json","events_json":"https://pith.science/api/pith-number/LAHQ6QQ33JEIV6WN526ECDMXQT/events.json","paper":"https://pith.science/paper/LAHQ6QQ3"},"agent_actions":{"view_html":"https://pith.science/pith/LAHQ6QQ33JEIV6WN526ECDMXQT","download_json":"https://pith.science/pith/LAHQ6QQ33JEIV6WN526ECDMXQT.json","view_paper":"https://pith.science/paper/LAHQ6QQ3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.10094&json=true","fetch_graph":"https://pith.science/api/pith-number/LAHQ6QQ33JEIV6WN526ECDMXQT/graph.json","fetch_events":"https://pith.science/api/pith-number/LAHQ6QQ33JEIV6WN526ECDMXQT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LAHQ6QQ33JEIV6WN526ECDMXQT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LAHQ6QQ33JEIV6WN526ECDMXQT/action/storage_attestation","attest_author":"https://pith.science/pith/LAHQ6QQ33JEIV6WN526ECDMXQT/action/author_attestation","sign_citation":"https://pith.science/pith/LAHQ6QQ33JEIV6WN526ECDMXQT/action/citation_signature","submit_replication":"https://pith.science/pith/LAHQ6QQ33JEIV6WN526ECDMXQT/action/replication_record"}},"created_at":"2026-05-18T00:02:24.257391+00:00","updated_at":"2026-05-18T00:02:24.257391+00:00"}