{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:EYWQ5OE3ENFSCLV3TDJPT6MTOQ","short_pith_number":"pith:EYWQ5OE3","schema_version":"1.0","canonical_sha256":"262d0eb89b234b212ebb98d2f9f993742c339412935bde81d756dea7520d4735","source":{"kind":"arxiv","id":"1409.6241","version":1},"attestation_state":"computed","paper":{"title":"Approximating Betweenness Centrality in Large Evolving Networks","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":["cs.DS","physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Christian L. Staudt, Elisabetta Bergamini, Henning Meyerhenke","submitted_at":"2014-09-22T16:51:41Z","abstract_excerpt":"Betweenness centrality ranks the importance of nodes by their participation in all shortest paths of the network. Therefore computing exact betweenness values is impractical in large networks. For static networks, approximation based on randomly sampled paths has been shown to be significantly faster in practice. However, for dynamic networks, no approximation algorithm for betweenness centrality is known that improves on static recomputation. We address this deficit by proposing two incremental approximation algorithms (for weighted and unweighted connected graphs) which provide a provable gu"},"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":"1409.6241","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.SI","submitted_at":"2014-09-22T16:51:41Z","cross_cats_sorted":["cs.DS","physics.soc-ph"],"title_canon_sha256":"12c8a249596d82979a5f5199f9ee695df33036341264f11be7179f0e2782f0f8","abstract_canon_sha256":"e304708ff72e002db78334d94032a453ecc44ccbd5b94ac55c63b9dbae498379"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:42:13.526513Z","signature_b64":"/kgD3qJf2/axMOzCFenofPExBJx/6FaM3RCzOLJeNG8BHFhC1EqZj70UOn3dyhJ4WAVt+EMPSeCnX8uNDNTnCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"262d0eb89b234b212ebb98d2f9f993742c339412935bde81d756dea7520d4735","last_reissued_at":"2026-05-18T02:42:13.526099Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:42:13.526099Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximating Betweenness Centrality in Large Evolving Networks","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":["cs.DS","physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Christian L. Staudt, Elisabetta Bergamini, Henning Meyerhenke","submitted_at":"2014-09-22T16:51:41Z","abstract_excerpt":"Betweenness centrality ranks the importance of nodes by their participation in all shortest paths of the network. Therefore computing exact betweenness values is impractical in large networks. For static networks, approximation based on randomly sampled paths has been shown to be significantly faster in practice. However, for dynamic networks, no approximation algorithm for betweenness centrality is known that improves on static recomputation. We address this deficit by proposing two incremental approximation algorithms (for weighted and unweighted connected graphs) which provide a provable gu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.6241","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":"1409.6241","created_at":"2026-05-18T02:42:13.526164+00:00"},{"alias_kind":"arxiv_version","alias_value":"1409.6241v1","created_at":"2026-05-18T02:42:13.526164+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.6241","created_at":"2026-05-18T02:42:13.526164+00:00"},{"alias_kind":"pith_short_12","alias_value":"EYWQ5OE3ENFS","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_16","alias_value":"EYWQ5OE3ENFSCLV3","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_8","alias_value":"EYWQ5OE3","created_at":"2026-05-18T12:28:28.263976+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/EYWQ5OE3ENFSCLV3TDJPT6MTOQ","json":"https://pith.science/pith/EYWQ5OE3ENFSCLV3TDJPT6MTOQ.json","graph_json":"https://pith.science/api/pith-number/EYWQ5OE3ENFSCLV3TDJPT6MTOQ/graph.json","events_json":"https://pith.science/api/pith-number/EYWQ5OE3ENFSCLV3TDJPT6MTOQ/events.json","paper":"https://pith.science/paper/EYWQ5OE3"},"agent_actions":{"view_html":"https://pith.science/pith/EYWQ5OE3ENFSCLV3TDJPT6MTOQ","download_json":"https://pith.science/pith/EYWQ5OE3ENFSCLV3TDJPT6MTOQ.json","view_paper":"https://pith.science/paper/EYWQ5OE3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1409.6241&json=true","fetch_graph":"https://pith.science/api/pith-number/EYWQ5OE3ENFSCLV3TDJPT6MTOQ/graph.json","fetch_events":"https://pith.science/api/pith-number/EYWQ5OE3ENFSCLV3TDJPT6MTOQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EYWQ5OE3ENFSCLV3TDJPT6MTOQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EYWQ5OE3ENFSCLV3TDJPT6MTOQ/action/storage_attestation","attest_author":"https://pith.science/pith/EYWQ5OE3ENFSCLV3TDJPT6MTOQ/action/author_attestation","sign_citation":"https://pith.science/pith/EYWQ5OE3ENFSCLV3TDJPT6MTOQ/action/citation_signature","submit_replication":"https://pith.science/pith/EYWQ5OE3ENFSCLV3TDJPT6MTOQ/action/replication_record"}},"created_at":"2026-05-18T02:42:13.526164+00:00","updated_at":"2026-05-18T02:42:13.526164+00:00"}