{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:5LGXERQNLNWEKSEWYQLYWSNSI4","short_pith_number":"pith:5LGXERQN","schema_version":"1.0","canonical_sha256":"eacd72460d5b6c454896c4178b49b247193967d8543c5601c38847399073aaa0","source":{"kind":"arxiv","id":"1704.08592","version":1},"attestation_state":"computed","paper":{"title":"Faster Betweenness Centrality Updates in Evolving Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Arie Slobbe, Elisabetta Bergamini, Henning Meyerhenke, Mark Ortmann","submitted_at":"2017-04-27T14:21:19Z","abstract_excerpt":"Finding central nodes is a fundamental problem in network analysis. Betweenness centrality is a well-known measure which quantifies the importance of a node based on the fraction of shortest paths going though it. Due to the dynamic nature of many today's networks, algorithms that quickly update centrality scores have become a necessity. For betweenness, several dynamic algorithms have been proposed over the years, targeting different update types (incremental- and decremental-only, fully-dynamic). In this paper we introduce a new dynamic algorithm for updating betweenness centrality after an "},"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":"1704.08592","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-27T14:21:19Z","cross_cats_sorted":[],"title_canon_sha256":"8cb0bb93fdbe5ac2e67e5013cf2056368913c360be8ca42bbedfb014240362eb","abstract_canon_sha256":"17eaee908a93a3250eae2ef2933b076b0e747dc0ee9eeb0e8534db319b3734c4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:27.336739Z","signature_b64":"icAnaYcJ42RBQYf2W9uvxyfpD09WqoK1BDjjsDjH37b+c1alpVZNLbwQUaoaWNGGS4DTDBtZYxgxDyR/fx/HCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eacd72460d5b6c454896c4178b49b247193967d8543c5601c38847399073aaa0","last_reissued_at":"2026-05-18T00:45:27.336069Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:27.336069Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Faster Betweenness Centrality Updates in Evolving Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Arie Slobbe, Elisabetta Bergamini, Henning Meyerhenke, Mark Ortmann","submitted_at":"2017-04-27T14:21:19Z","abstract_excerpt":"Finding central nodes is a fundamental problem in network analysis. Betweenness centrality is a well-known measure which quantifies the importance of a node based on the fraction of shortest paths going though it. Due to the dynamic nature of many today's networks, algorithms that quickly update centrality scores have become a necessity. For betweenness, several dynamic algorithms have been proposed over the years, targeting different update types (incremental- and decremental-only, fully-dynamic). In this paper we introduce a new dynamic algorithm for updating betweenness centrality after an "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.08592","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":"1704.08592","created_at":"2026-05-18T00:45:27.336336+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.08592v1","created_at":"2026-05-18T00:45:27.336336+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.08592","created_at":"2026-05-18T00:45:27.336336+00:00"},{"alias_kind":"pith_short_12","alias_value":"5LGXERQNLNWE","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_16","alias_value":"5LGXERQNLNWEKSEW","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_8","alias_value":"5LGXERQN","created_at":"2026-05-18T12:31:00.734936+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/5LGXERQNLNWEKSEWYQLYWSNSI4","json":"https://pith.science/pith/5LGXERQNLNWEKSEWYQLYWSNSI4.json","graph_json":"https://pith.science/api/pith-number/5LGXERQNLNWEKSEWYQLYWSNSI4/graph.json","events_json":"https://pith.science/api/pith-number/5LGXERQNLNWEKSEWYQLYWSNSI4/events.json","paper":"https://pith.science/paper/5LGXERQN"},"agent_actions":{"view_html":"https://pith.science/pith/5LGXERQNLNWEKSEWYQLYWSNSI4","download_json":"https://pith.science/pith/5LGXERQNLNWEKSEWYQLYWSNSI4.json","view_paper":"https://pith.science/paper/5LGXERQN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.08592&json=true","fetch_graph":"https://pith.science/api/pith-number/5LGXERQNLNWEKSEWYQLYWSNSI4/graph.json","fetch_events":"https://pith.science/api/pith-number/5LGXERQNLNWEKSEWYQLYWSNSI4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5LGXERQNLNWEKSEWYQLYWSNSI4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5LGXERQNLNWEKSEWYQLYWSNSI4/action/storage_attestation","attest_author":"https://pith.science/pith/5LGXERQNLNWEKSEWYQLYWSNSI4/action/author_attestation","sign_citation":"https://pith.science/pith/5LGXERQNLNWEKSEWYQLYWSNSI4/action/citation_signature","submit_replication":"https://pith.science/pith/5LGXERQNLNWEKSEWYQLYWSNSI4/action/replication_record"}},"created_at":"2026-05-18T00:45:27.336336+00:00","updated_at":"2026-05-18T00:45:27.336336+00:00"}