{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:3NVKQMB2EAABU3BD2J3P67U4YB","short_pith_number":"pith:3NVKQMB2","schema_version":"1.0","canonical_sha256":"db6aa8303a20001a6c23d276ff7e9cc06e073fca1c127cfdf11a7031a61fbd8c","source":{"kind":"arxiv","id":"1401.6981","version":2},"attestation_state":"computed","paper":{"title":"Scalable Online Betweenness Centrality in Evolving Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Francesco Bonchi, Gianmarco De Francisci Morales, Nicolas Kourtellis","submitted_at":"2014-01-27T19:50:47Z","abstract_excerpt":"Betweenness centrality is a classic measure that quantifies the importance of a graph element (vertex or edge) according to the fraction of shortest paths passing through it. This measure is notoriously expensive to compute, and the best known algorithm runs in O(nm) time. The problems of efficiency and scalability are exacerbated in a dynamic setting, where the input is an evolving graph seen edge by edge, and the goal is to keep the betweenness centrality up to date. In this paper we propose the first truly scalable algorithm for online computation of betweenness centrality of both vertices "},"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":"1401.6981","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-01-27T19:50:47Z","cross_cats_sorted":[],"title_canon_sha256":"cd6e5a818ef4b17f4f378ad1cc5f5560f4406872cd8d89386c4edb03dc00f698","abstract_canon_sha256":"e72ad23f5da0d8bd079840241ce64e52990b54f22e7b0bde0d8083def36947a7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:17:43.178305Z","signature_b64":"9JY5gIqMj6wMnLplKy9IQI5225cJeCsAuG161j0if0YOObADGiU9VS6aCaK/G8rwA48U/6gnqhjUJj85rNLTCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"db6aa8303a20001a6c23d276ff7e9cc06e073fca1c127cfdf11a7031a61fbd8c","last_reissued_at":"2026-05-18T02:17:43.177946Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:17:43.177946Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Scalable Online Betweenness Centrality in Evolving Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Francesco Bonchi, Gianmarco De Francisci Morales, Nicolas Kourtellis","submitted_at":"2014-01-27T19:50:47Z","abstract_excerpt":"Betweenness centrality is a classic measure that quantifies the importance of a graph element (vertex or edge) according to the fraction of shortest paths passing through it. This measure is notoriously expensive to compute, and the best known algorithm runs in O(nm) time. The problems of efficiency and scalability are exacerbated in a dynamic setting, where the input is an evolving graph seen edge by edge, and the goal is to keep the betweenness centrality up to date. In this paper we propose the first truly scalable algorithm for online computation of betweenness centrality of both vertices "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.6981","kind":"arxiv","version":2},"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":"1401.6981","created_at":"2026-05-18T02:17:43.178001+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.6981v2","created_at":"2026-05-18T02:17:43.178001+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.6981","created_at":"2026-05-18T02:17:43.178001+00:00"},{"alias_kind":"pith_short_12","alias_value":"3NVKQMB2EAAB","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_16","alias_value":"3NVKQMB2EAABU3BD","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_8","alias_value":"3NVKQMB2","created_at":"2026-05-18T12:28:11.866339+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/3NVKQMB2EAABU3BD2J3P67U4YB","json":"https://pith.science/pith/3NVKQMB2EAABU3BD2J3P67U4YB.json","graph_json":"https://pith.science/api/pith-number/3NVKQMB2EAABU3BD2J3P67U4YB/graph.json","events_json":"https://pith.science/api/pith-number/3NVKQMB2EAABU3BD2J3P67U4YB/events.json","paper":"https://pith.science/paper/3NVKQMB2"},"agent_actions":{"view_html":"https://pith.science/pith/3NVKQMB2EAABU3BD2J3P67U4YB","download_json":"https://pith.science/pith/3NVKQMB2EAABU3BD2J3P67U4YB.json","view_paper":"https://pith.science/paper/3NVKQMB2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.6981&json=true","fetch_graph":"https://pith.science/api/pith-number/3NVKQMB2EAABU3BD2J3P67U4YB/graph.json","fetch_events":"https://pith.science/api/pith-number/3NVKQMB2EAABU3BD2J3P67U4YB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3NVKQMB2EAABU3BD2J3P67U4YB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3NVKQMB2EAABU3BD2J3P67U4YB/action/storage_attestation","attest_author":"https://pith.science/pith/3NVKQMB2EAABU3BD2J3P67U4YB/action/author_attestation","sign_citation":"https://pith.science/pith/3NVKQMB2EAABU3BD2J3P67U4YB/action/citation_signature","submit_replication":"https://pith.science/pith/3NVKQMB2EAABU3BD2J3P67U4YB/action/replication_record"}},"created_at":"2026-05-18T02:17:43.178001+00:00","updated_at":"2026-05-18T02:17:43.178001+00:00"}