{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:V4ZAIKMWQRPJAOQKOZX6P3NOJ4","short_pith_number":"pith:V4ZAIKMW","schema_version":"1.0","canonical_sha256":"af32042996845e903a0a766fe7edae4f247f6e2087e041c2931d470e69de74f9","source":{"kind":"arxiv","id":"1311.2147","version":3},"attestation_state":"computed","paper":{"title":"Betweenness Centrality -- Incremental and Faster","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Matteo Pontecorvi, Meghana Nasre, Vijaya Ramachandran","submitted_at":"2013-11-09T07:59:22Z","abstract_excerpt":"We consider the incremental computation of the betweenness centrality of all vertices in a large complex network modeled as a graph G = (V, E), directed or undirected, with positive real edge-weights. The current widely used algorithm to compute the betweenness centrality of all vertices in G is the Brandes algorithm that runs in O(mn + n^2 log n) time, where n = |V| and m = |E|.\n  We present an incremental algorithm that updates the betweenness centrality score of all vertices in G when a new edge is added to G, or the weight of an existing edge is reduced. Our incremental algorithm runs in O"},"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":"1311.2147","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-11-09T07:59:22Z","cross_cats_sorted":[],"title_canon_sha256":"f82741f081f87a0794a8730ce12a1e692f69b961f2072ec7ebf0afe4d67d17d8","abstract_canon_sha256":"84d47ffd98d1fa2de2c395da5d0095be7e32ad75958abe6939acf70da744939f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:06:54.112721Z","signature_b64":"p4WFC3v6ywp2ZkrIs877gQqzA4e/ROzN/L3f95/AEmJtNduiDWkogdA0iv5XyAqIMUoztls5Vy1xqE5J4HcABA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"af32042996845e903a0a766fe7edae4f247f6e2087e041c2931d470e69de74f9","last_reissued_at":"2026-05-18T03:06:54.112248Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:06:54.112248Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Betweenness Centrality -- Incremental and Faster","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Matteo Pontecorvi, Meghana Nasre, Vijaya Ramachandran","submitted_at":"2013-11-09T07:59:22Z","abstract_excerpt":"We consider the incremental computation of the betweenness centrality of all vertices in a large complex network modeled as a graph G = (V, E), directed or undirected, with positive real edge-weights. The current widely used algorithm to compute the betweenness centrality of all vertices in G is the Brandes algorithm that runs in O(mn + n^2 log n) time, where n = |V| and m = |E|.\n  We present an incremental algorithm that updates the betweenness centrality score of all vertices in G when a new edge is added to G, or the weight of an existing edge is reduced. Our incremental algorithm runs in O"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.2147","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":"1311.2147","created_at":"2026-05-18T03:06:54.112311+00:00"},{"alias_kind":"arxiv_version","alias_value":"1311.2147v3","created_at":"2026-05-18T03:06:54.112311+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.2147","created_at":"2026-05-18T03:06:54.112311+00:00"},{"alias_kind":"pith_short_12","alias_value":"V4ZAIKMWQRPJ","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_16","alias_value":"V4ZAIKMWQRPJAOQK","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_8","alias_value":"V4ZAIKMW","created_at":"2026-05-18T12:28:04.890932+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/V4ZAIKMWQRPJAOQKOZX6P3NOJ4","json":"https://pith.science/pith/V4ZAIKMWQRPJAOQKOZX6P3NOJ4.json","graph_json":"https://pith.science/api/pith-number/V4ZAIKMWQRPJAOQKOZX6P3NOJ4/graph.json","events_json":"https://pith.science/api/pith-number/V4ZAIKMWQRPJAOQKOZX6P3NOJ4/events.json","paper":"https://pith.science/paper/V4ZAIKMW"},"agent_actions":{"view_html":"https://pith.science/pith/V4ZAIKMWQRPJAOQKOZX6P3NOJ4","download_json":"https://pith.science/pith/V4ZAIKMWQRPJAOQKOZX6P3NOJ4.json","view_paper":"https://pith.science/paper/V4ZAIKMW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1311.2147&json=true","fetch_graph":"https://pith.science/api/pith-number/V4ZAIKMWQRPJAOQKOZX6P3NOJ4/graph.json","fetch_events":"https://pith.science/api/pith-number/V4ZAIKMWQRPJAOQKOZX6P3NOJ4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/V4ZAIKMWQRPJAOQKOZX6P3NOJ4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/V4ZAIKMWQRPJAOQKOZX6P3NOJ4/action/storage_attestation","attest_author":"https://pith.science/pith/V4ZAIKMWQRPJAOQKOZX6P3NOJ4/action/author_attestation","sign_citation":"https://pith.science/pith/V4ZAIKMWQRPJAOQKOZX6P3NOJ4/action/citation_signature","submit_replication":"https://pith.science/pith/V4ZAIKMWQRPJAOQKOZX6P3NOJ4/action/replication_record"}},"created_at":"2026-05-18T03:06:54.112311+00:00","updated_at":"2026-05-18T03:06:54.112311+00:00"}