{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:DUYWL2P4VOZG6A7NI7RZ7QHAJS","short_pith_number":"pith:DUYWL2P4","schema_version":"1.0","canonical_sha256":"1d3165e9fcabb26f03ed47e39fc0e04caf165f37cc2b2e584979f4efa0879e84","source":{"kind":"arxiv","id":"1504.07091","version":2},"attestation_state":"computed","paper":{"title":"Fully-dynamic Approximation of Betweenness Centrality","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Elisabetta Bergamini, Henning Meyerhenke","submitted_at":"2015-04-27T13:53:32Z","abstract_excerpt":"Betweenness is a well-known centrality measure that ranks the nodes of a network according to their participation in shortest paths. Since an exact computation is prohibitive in large networks, several approximation algorithms have been proposed. Besides that, recent years have seen the publication of dynamic algorithms for efficient recomputation of betweenness in evolving networks. In previous work we proposed the first semi-dynamic algorithms that recompute an approximation of betweenness in connected graphs after batches of edge insertions.\n  In this paper we propose the first fully-dynami"},"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":"1504.07091","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-27T13:53:32Z","cross_cats_sorted":[],"title_canon_sha256":"cc774f94dc13ce086b259d8be39d84235178353c5baed7bd550108d3da45dd85","abstract_canon_sha256":"ee88991c158e1269f139d5a88c460b89dc01b8f703afc4cddbdc3b9c40174d78"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:23.035176Z","signature_b64":"ay6BzM8AezLihWRehUonnvPbuKB9Xb6m/ZPMpuPsdQxvCqUNiPQr/vWvpzrhC6H4v7xNfcVY76wNBoxRdMUyDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1d3165e9fcabb26f03ed47e39fc0e04caf165f37cc2b2e584979f4efa0879e84","last_reissued_at":"2026-05-18T01:37:23.034430Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:23.034430Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fully-dynamic Approximation of Betweenness Centrality","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Elisabetta Bergamini, Henning Meyerhenke","submitted_at":"2015-04-27T13:53:32Z","abstract_excerpt":"Betweenness is a well-known centrality measure that ranks the nodes of a network according to their participation in shortest paths. Since an exact computation is prohibitive in large networks, several approximation algorithms have been proposed. Besides that, recent years have seen the publication of dynamic algorithms for efficient recomputation of betweenness in evolving networks. In previous work we proposed the first semi-dynamic algorithms that recompute an approximation of betweenness in connected graphs after batches of edge insertions.\n  In this paper we propose the first fully-dynami"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.07091","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":"1504.07091","created_at":"2026-05-18T01:37:23.034540+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.07091v2","created_at":"2026-05-18T01:37:23.034540+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.07091","created_at":"2026-05-18T01:37:23.034540+00:00"},{"alias_kind":"pith_short_12","alias_value":"DUYWL2P4VOZG","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_16","alias_value":"DUYWL2P4VOZG6A7N","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_8","alias_value":"DUYWL2P4","created_at":"2026-05-18T12:29:17.054201+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/DUYWL2P4VOZG6A7NI7RZ7QHAJS","json":"https://pith.science/pith/DUYWL2P4VOZG6A7NI7RZ7QHAJS.json","graph_json":"https://pith.science/api/pith-number/DUYWL2P4VOZG6A7NI7RZ7QHAJS/graph.json","events_json":"https://pith.science/api/pith-number/DUYWL2P4VOZG6A7NI7RZ7QHAJS/events.json","paper":"https://pith.science/paper/DUYWL2P4"},"agent_actions":{"view_html":"https://pith.science/pith/DUYWL2P4VOZG6A7NI7RZ7QHAJS","download_json":"https://pith.science/pith/DUYWL2P4VOZG6A7NI7RZ7QHAJS.json","view_paper":"https://pith.science/paper/DUYWL2P4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.07091&json=true","fetch_graph":"https://pith.science/api/pith-number/DUYWL2P4VOZG6A7NI7RZ7QHAJS/graph.json","fetch_events":"https://pith.science/api/pith-number/DUYWL2P4VOZG6A7NI7RZ7QHAJS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DUYWL2P4VOZG6A7NI7RZ7QHAJS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DUYWL2P4VOZG6A7NI7RZ7QHAJS/action/storage_attestation","attest_author":"https://pith.science/pith/DUYWL2P4VOZG6A7NI7RZ7QHAJS/action/author_attestation","sign_citation":"https://pith.science/pith/DUYWL2P4VOZG6A7NI7RZ7QHAJS/action/citation_signature","submit_replication":"https://pith.science/pith/DUYWL2P4VOZG6A7NI7RZ7QHAJS/action/replication_record"}},"created_at":"2026-05-18T01:37:23.034540+00:00","updated_at":"2026-05-18T01:37:23.034540+00:00"}