{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:TGAOAQYFUXCXOERH3PA6YEAHHZ","short_pith_number":"pith:TGAOAQYF","canonical_record":{"source":{"id":"1510.07971","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-10-27T16:29:20Z","cross_cats_sorted":[],"title_canon_sha256":"32dd2d7723ec7bff4aeb068bf201c275497e3746faafe9a7760cb2ce0a5f8fb4","abstract_canon_sha256":"b7c0d5ed00d0112bb204f3c5de3cc9a69c2251d15261217ce61da44dfa8db8c4"},"schema_version":"1.0"},"canonical_sha256":"9980e04305a5c5771227dbc1ec10073e6fb570e70a7de4f537dbee86a68b08c6","source":{"kind":"arxiv","id":"1510.07971","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.07971","created_at":"2026-05-18T01:28:44Z"},{"alias_kind":"arxiv_version","alias_value":"1510.07971v1","created_at":"2026-05-18T01:28:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.07971","created_at":"2026-05-18T01:28:44Z"},{"alias_kind":"pith_short_12","alias_value":"TGAOAQYFUXCX","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"TGAOAQYFUXCXOERH","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"TGAOAQYF","created_at":"2026-05-18T12:29:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:TGAOAQYFUXCXOERH3PA6YEAHHZ","target":"record","payload":{"canonical_record":{"source":{"id":"1510.07971","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-10-27T16:29:20Z","cross_cats_sorted":[],"title_canon_sha256":"32dd2d7723ec7bff4aeb068bf201c275497e3746faafe9a7760cb2ce0a5f8fb4","abstract_canon_sha256":"b7c0d5ed00d0112bb204f3c5de3cc9a69c2251d15261217ce61da44dfa8db8c4"},"schema_version":"1.0"},"canonical_sha256":"9980e04305a5c5771227dbc1ec10073e6fb570e70a7de4f537dbee86a68b08c6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:28:44.941329Z","signature_b64":"yxLaWxIZ0gmH2RK4hBIgP73APeaXtvh+fWI7rNMQ8AK0Hfz/Fjf+u7uqIOtWhJoMzFtjx/9W88uWEdtqnh8kDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9980e04305a5c5771227dbc1ec10073e6fb570e70a7de4f537dbee86a68b08c6","last_reissued_at":"2026-05-18T01:28:44.940951Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:28:44.940951Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1510.07971","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:28:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M6E+6yj1xSVVYP55JVIGTbYHGq73d8J1CYwh/unmL/APkkBF0p1cxTq3B4lEbBwA/9ws2sB2yj7UzQCbJ0FxDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T19:39:56.949141Z"},"content_sha256":"a50a4e923ca4fb040412997c19aeba7975dede2f6b500669eb608d8278522fdb","schema_version":"1.0","event_id":"sha256:a50a4e923ca4fb040412997c19aeba7975dede2f6b500669eb608d8278522fdb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:TGAOAQYFUXCXOERH3PA6YEAHHZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximating Betweenness Centrality in Fully-dynamic Networks","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-10-27T16:29:20Z","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 networks that change over time. In this paper we propose the first betweenness centrality approximation algorithms with a provable guarantee on the maximum approximation error for dynamic networks. Several new intermediate algorithm"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.07971","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:28:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YiuhtQ2X5DXuKOFfs+Cdz0STo5YYYKKgTZ3C3Gl4ZNvwXmX4qV+N8kH8Eq31MGcN2oNHEzkqtZdEc+iM8+M4AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T19:39:56.949497Z"},"content_sha256":"2ee3a7e86190bfaba4f0eee1388f0d03ebfc9f5da43639268001233e489df98c","schema_version":"1.0","event_id":"sha256:2ee3a7e86190bfaba4f0eee1388f0d03ebfc9f5da43639268001233e489df98c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TGAOAQYFUXCXOERH3PA6YEAHHZ/bundle.json","state_url":"https://pith.science/pith/TGAOAQYFUXCXOERH3PA6YEAHHZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TGAOAQYFUXCXOERH3PA6YEAHHZ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-01T19:39:56Z","links":{"resolver":"https://pith.science/pith/TGAOAQYFUXCXOERH3PA6YEAHHZ","bundle":"https://pith.science/pith/TGAOAQYFUXCXOERH3PA6YEAHHZ/bundle.json","state":"https://pith.science/pith/TGAOAQYFUXCXOERH3PA6YEAHHZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TGAOAQYFUXCXOERH3PA6YEAHHZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:TGAOAQYFUXCXOERH3PA6YEAHHZ","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"b7c0d5ed00d0112bb204f3c5de3cc9a69c2251d15261217ce61da44dfa8db8c4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-10-27T16:29:20Z","title_canon_sha256":"32dd2d7723ec7bff4aeb068bf201c275497e3746faafe9a7760cb2ce0a5f8fb4"},"schema_version":"1.0","source":{"id":"1510.07971","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.07971","created_at":"2026-05-18T01:28:44Z"},{"alias_kind":"arxiv_version","alias_value":"1510.07971v1","created_at":"2026-05-18T01:28:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.07971","created_at":"2026-05-18T01:28:44Z"},{"alias_kind":"pith_short_12","alias_value":"TGAOAQYFUXCX","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"TGAOAQYFUXCXOERH","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"TGAOAQYF","created_at":"2026-05-18T12:29:42Z"}],"graph_snapshots":[{"event_id":"sha256:2ee3a7e86190bfaba4f0eee1388f0d03ebfc9f5da43639268001233e489df98c","target":"graph","created_at":"2026-05-18T01:28:44Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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 networks that change over time. In this paper we propose the first betweenness centrality approximation algorithms with a provable guarantee on the maximum approximation error for dynamic networks. Several new intermediate algorithm","authors_text":"Elisabetta Bergamini, Henning Meyerhenke","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-10-27T16:29:20Z","title":"Approximating Betweenness Centrality in Fully-dynamic Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.07971","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:a50a4e923ca4fb040412997c19aeba7975dede2f6b500669eb608d8278522fdb","target":"record","created_at":"2026-05-18T01:28:44Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"b7c0d5ed00d0112bb204f3c5de3cc9a69c2251d15261217ce61da44dfa8db8c4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-10-27T16:29:20Z","title_canon_sha256":"32dd2d7723ec7bff4aeb068bf201c275497e3746faafe9a7760cb2ce0a5f8fb4"},"schema_version":"1.0","source":{"id":"1510.07971","kind":"arxiv","version":1}},"canonical_sha256":"9980e04305a5c5771227dbc1ec10073e6fb570e70a7de4f537dbee86a68b08c6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9980e04305a5c5771227dbc1ec10073e6fb570e70a7de4f537dbee86a68b08c6","first_computed_at":"2026-05-18T01:28:44.940951Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:28:44.940951Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yxLaWxIZ0gmH2RK4hBIgP73APeaXtvh+fWI7rNMQ8AK0Hfz/Fjf+u7uqIOtWhJoMzFtjx/9W88uWEdtqnh8kDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:28:44.941329Z","signed_message":"canonical_sha256_bytes"},"source_id":"1510.07971","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a50a4e923ca4fb040412997c19aeba7975dede2f6b500669eb608d8278522fdb","sha256:2ee3a7e86190bfaba4f0eee1388f0d03ebfc9f5da43639268001233e489df98c"],"state_sha256":"e503b49fb3c40524b0ca535784ebccd0d15a423b6544dd214ae7e303d327b45a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jpQtjZn1Lg6rmmfQwpxmARNCTlA/fb8EaWQY6LaZSZhBGMrd99CwECL6A5sAWTwHkpNRSLmn8nikifIc6uWaDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T19:39:56.951350Z","bundle_sha256":"77fc072b6d2f4484d1fe6815cf7674396d39f6a9aa6b7dad7669d74413449bb9"}}