{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:LDHRPYNO4UYLHFIJU5L4NNYTL7","short_pith_number":"pith:LDHRPYNO","schema_version":"1.0","canonical_sha256":"58cf17e1aee530b39509a757c6b7135fe7b9a7115964f6eb5166c8807dab4469","source":{"kind":"arxiv","id":"1609.00790","version":1},"attestation_state":"computed","paper":{"title":"Scalable Betweenness Centrality Maximization via Sampling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.SI","authors_text":"Ahmad Mahmoody, Charalampos E. Tsourakakis, Eli Upfal","submitted_at":"2016-09-03T04:09:00Z","abstract_excerpt":"Betweenness centrality is a fundamental centrality measure in social network analysis. Given a large-scale network, how can we find the most central nodes? This question is of key importance to numerous important applications that rely on betweenness centrality, including community detection and understanding graph vulnerability. Despite the large amount of work on designing scalable approximation algorithms for betweenness centrality, estimating it on large-scale networks remains a computational challenge.\n  In this paper, we study the Betweenness Centrality Maximization problem: given a grap"},"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":"1609.00790","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-09-03T04:09:00Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"883b5028662e6264eb231a26d05c01511c95c2a088fd1e05e51a2fd50db25d62","abstract_canon_sha256":"245e0c5c9e6ae8a73c82a487565431d8a03184236df935411b9658662fb471ae"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:06:19.947222Z","signature_b64":"GxA5lzsuUW26Wbh+U0FbjcIrJXD8nY4kxte9IKWJFOv/pYoSOkTr7csjRSdFE+2ex9gSnDyl1vZz1s8oa4GpDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"58cf17e1aee530b39509a757c6b7135fe7b9a7115964f6eb5166c8807dab4469","last_reissued_at":"2026-05-18T01:06:19.946596Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:06:19.946596Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Scalable Betweenness Centrality Maximization via Sampling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.SI","authors_text":"Ahmad Mahmoody, Charalampos E. Tsourakakis, Eli Upfal","submitted_at":"2016-09-03T04:09:00Z","abstract_excerpt":"Betweenness centrality is a fundamental centrality measure in social network analysis. Given a large-scale network, how can we find the most central nodes? This question is of key importance to numerous important applications that rely on betweenness centrality, including community detection and understanding graph vulnerability. Despite the large amount of work on designing scalable approximation algorithms for betweenness centrality, estimating it on large-scale networks remains a computational challenge.\n  In this paper, we study the Betweenness Centrality Maximization problem: given a grap"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.00790","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":"1609.00790","created_at":"2026-05-18T01:06:19.946694+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.00790v1","created_at":"2026-05-18T01:06:19.946694+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.00790","created_at":"2026-05-18T01:06:19.946694+00:00"},{"alias_kind":"pith_short_12","alias_value":"LDHRPYNO4UYL","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_16","alias_value":"LDHRPYNO4UYLHFIJ","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_8","alias_value":"LDHRPYNO","created_at":"2026-05-18T12:30:29.479603+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/LDHRPYNO4UYLHFIJU5L4NNYTL7","json":"https://pith.science/pith/LDHRPYNO4UYLHFIJU5L4NNYTL7.json","graph_json":"https://pith.science/api/pith-number/LDHRPYNO4UYLHFIJU5L4NNYTL7/graph.json","events_json":"https://pith.science/api/pith-number/LDHRPYNO4UYLHFIJU5L4NNYTL7/events.json","paper":"https://pith.science/paper/LDHRPYNO"},"agent_actions":{"view_html":"https://pith.science/pith/LDHRPYNO4UYLHFIJU5L4NNYTL7","download_json":"https://pith.science/pith/LDHRPYNO4UYLHFIJU5L4NNYTL7.json","view_paper":"https://pith.science/paper/LDHRPYNO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.00790&json=true","fetch_graph":"https://pith.science/api/pith-number/LDHRPYNO4UYLHFIJU5L4NNYTL7/graph.json","fetch_events":"https://pith.science/api/pith-number/LDHRPYNO4UYLHFIJU5L4NNYTL7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LDHRPYNO4UYLHFIJU5L4NNYTL7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LDHRPYNO4UYLHFIJU5L4NNYTL7/action/storage_attestation","attest_author":"https://pith.science/pith/LDHRPYNO4UYLHFIJU5L4NNYTL7/action/author_attestation","sign_citation":"https://pith.science/pith/LDHRPYNO4UYLHFIJU5L4NNYTL7/action/citation_signature","submit_replication":"https://pith.science/pith/LDHRPYNO4UYLHFIJU5L4NNYTL7/action/replication_record"}},"created_at":"2026-05-18T01:06:19.946694+00:00","updated_at":"2026-05-18T01:06:19.946694+00:00"}