{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:CICKWUIADDC5SHOKXR3NKS6MMI","short_pith_number":"pith:CICKWUIA","schema_version":"1.0","canonical_sha256":"1204ab510018c5d91dcabc76d54bcc621c408605aac14bb46fa3ae4a86f8153a","source":{"kind":"arxiv","id":"1506.05783","version":3},"attestation_state":"computed","paper":{"title":"A Faster Algorithm for Fully Dynamic Betweenness Centrality","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Matteo Pontecorvi, Vijaya Ramachandran","submitted_at":"2015-06-18T19:37:22Z","abstract_excerpt":"We present a new fully dynamic algorithm for maintaining betweenness centrality (BC) of vertices in a directed graph $G=(V,E)$ with positive edge weights. BC is a widely used parameter in the analysis of large complex networks. We achieve an amortized $O((\\nu^*)^2 \\log^2 n)$ time per update, where $n = |V| $ and $\\nu^*$ bounds the number of distinct edges that lie on shortest paths through any single vertex. This result improves on the amortized bound for fully dynamic BC in [Pontecorvi-Ramachandran2015] by a logarithmic factor. Our algorithm uses new data structures and techniques that are ex"},"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":"1506.05783","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-06-18T19:37:22Z","cross_cats_sorted":[],"title_canon_sha256":"323d2557b3c7614a9f0373ddd9cde04331142f8a646086048ca99bd9ecaffb02","abstract_canon_sha256":"c2b9002d5bb6b84fda792bdc48066cade474ee7b04d59bf89f91371f9581dbd0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:15:38.288384Z","signature_b64":"2Mj1lvZxCq762M+5dVfhSlRts55rJOqWYW7SKuAnm0wLsP3he13iO/BGONKB/o7T5kyMnS+b1eIoVtB5FMFjAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1204ab510018c5d91dcabc76d54bcc621c408605aac14bb46fa3ae4a86f8153a","last_reissued_at":"2026-07-05T04:15:38.287805Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:15:38.287805Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Faster Algorithm for Fully Dynamic Betweenness Centrality","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Matteo Pontecorvi, Vijaya Ramachandran","submitted_at":"2015-06-18T19:37:22Z","abstract_excerpt":"We present a new fully dynamic algorithm for maintaining betweenness centrality (BC) of vertices in a directed graph $G=(V,E)$ with positive edge weights. BC is a widely used parameter in the analysis of large complex networks. We achieve an amortized $O((\\nu^*)^2 \\log^2 n)$ time per update, where $n = |V| $ and $\\nu^*$ bounds the number of distinct edges that lie on shortest paths through any single vertex. This result improves on the amortized bound for fully dynamic BC in [Pontecorvi-Ramachandran2015] by a logarithmic factor. Our algorithm uses new data structures and techniques that are ex"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.05783","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1506.05783/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":"1506.05783","created_at":"2026-07-05T04:15:38.287872+00:00"},{"alias_kind":"arxiv_version","alias_value":"1506.05783v3","created_at":"2026-07-05T04:15:38.287872+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.05783","created_at":"2026-07-05T04:15:38.287872+00:00"},{"alias_kind":"pith_short_12","alias_value":"CICKWUIADDC5","created_at":"2026-07-05T04:15:38.287872+00:00"},{"alias_kind":"pith_short_16","alias_value":"CICKWUIADDC5SHOK","created_at":"2026-07-05T04:15:38.287872+00:00"},{"alias_kind":"pith_short_8","alias_value":"CICKWUIA","created_at":"2026-07-05T04:15:38.287872+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/CICKWUIADDC5SHOKXR3NKS6MMI","json":"https://pith.science/pith/CICKWUIADDC5SHOKXR3NKS6MMI.json","graph_json":"https://pith.science/api/pith-number/CICKWUIADDC5SHOKXR3NKS6MMI/graph.json","events_json":"https://pith.science/api/pith-number/CICKWUIADDC5SHOKXR3NKS6MMI/events.json","paper":"https://pith.science/paper/CICKWUIA"},"agent_actions":{"view_html":"https://pith.science/pith/CICKWUIADDC5SHOKXR3NKS6MMI","download_json":"https://pith.science/pith/CICKWUIADDC5SHOKXR3NKS6MMI.json","view_paper":"https://pith.science/paper/CICKWUIA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1506.05783&json=true","fetch_graph":"https://pith.science/api/pith-number/CICKWUIADDC5SHOKXR3NKS6MMI/graph.json","fetch_events":"https://pith.science/api/pith-number/CICKWUIADDC5SHOKXR3NKS6MMI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CICKWUIADDC5SHOKXR3NKS6MMI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CICKWUIADDC5SHOKXR3NKS6MMI/action/storage_attestation","attest_author":"https://pith.science/pith/CICKWUIADDC5SHOKXR3NKS6MMI/action/author_attestation","sign_citation":"https://pith.science/pith/CICKWUIADDC5SHOKXR3NKS6MMI/action/citation_signature","submit_replication":"https://pith.science/pith/CICKWUIADDC5SHOKXR3NKS6MMI/action/replication_record"}},"created_at":"2026-07-05T04:15:38.287872+00:00","updated_at":"2026-07-05T04:15:38.287872+00:00"}