{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:5LGXERQNLNWEKSEWYQLYWSNSI4","short_pith_number":"pith:5LGXERQN","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"},"canonical_sha256":"eacd72460d5b6c454896c4178b49b247193967d8543c5601c38847399073aaa0","source":{"kind":"arxiv","id":"1704.08592","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.08592","created_at":"2026-05-18T00:45:27Z"},{"alias_kind":"arxiv_version","alias_value":"1704.08592v1","created_at":"2026-05-18T00:45:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.08592","created_at":"2026-05-18T00:45:27Z"},{"alias_kind":"pith_short_12","alias_value":"5LGXERQNLNWE","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"5LGXERQNLNWEKSEW","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"5LGXERQN","created_at":"2026-05-18T12:31:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:5LGXERQNLNWEKSEWYQLYWSNSI4","target":"record","payload":{"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"},"canonical_sha256":"eacd72460d5b6c454896c4178b49b247193967d8543c5601c38847399073aaa0","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"},"source_kind":"arxiv","source_id":"1704.08592","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-18T00:45:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FEh7UjaJt2CMvAtfZc4t2fduaQd52ywmHhxi6MLDWTCmP5HOPrSCD+iHdePmmtVOaF9iojAMNBA/3LHxf/HKCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T00:33:28.642825Z"},"content_sha256":"1a9af19744efff0129a3ce16f5664cd7a7865550e56b5ecc3725e200610dcb29","schema_version":"1.0","event_id":"sha256:1a9af19744efff0129a3ce16f5664cd7a7865550e56b5ecc3725e200610dcb29"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:5LGXERQNLNWEKSEWYQLYWSNSI4","target":"graph","payload":{"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"},"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-18T00:45:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ar3BPb0T0r6mKLtXdzs8KKYcMSCayGQ6M2lKzFS0OVca4TjfEIXoNwLN0T56IN1OiibAbGmnEzPFishHL7LADw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T00:33:28.643160Z"},"content_sha256":"53a41d00a0bf3c571b306d88570cbd44b57c3a23d700e6ee6dea5ee253e8826a","schema_version":"1.0","event_id":"sha256:53a41d00a0bf3c571b306d88570cbd44b57c3a23d700e6ee6dea5ee253e8826a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5LGXERQNLNWEKSEWYQLYWSNSI4/bundle.json","state_url":"https://pith.science/pith/5LGXERQNLNWEKSEWYQLYWSNSI4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5LGXERQNLNWEKSEWYQLYWSNSI4/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-02T00:33:28Z","links":{"resolver":"https://pith.science/pith/5LGXERQNLNWEKSEWYQLYWSNSI4","bundle":"https://pith.science/pith/5LGXERQNLNWEKSEWYQLYWSNSI4/bundle.json","state":"https://pith.science/pith/5LGXERQNLNWEKSEWYQLYWSNSI4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5LGXERQNLNWEKSEWYQLYWSNSI4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:5LGXERQNLNWEKSEWYQLYWSNSI4","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":"17eaee908a93a3250eae2ef2933b076b0e747dc0ee9eeb0e8534db319b3734c4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-27T14:21:19Z","title_canon_sha256":"8cb0bb93fdbe5ac2e67e5013cf2056368913c360be8ca42bbedfb014240362eb"},"schema_version":"1.0","source":{"id":"1704.08592","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.08592","created_at":"2026-05-18T00:45:27Z"},{"alias_kind":"arxiv_version","alias_value":"1704.08592v1","created_at":"2026-05-18T00:45:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.08592","created_at":"2026-05-18T00:45:27Z"},{"alias_kind":"pith_short_12","alias_value":"5LGXERQNLNWE","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"5LGXERQNLNWEKSEW","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"5LGXERQN","created_at":"2026-05-18T12:31:00Z"}],"graph_snapshots":[{"event_id":"sha256:53a41d00a0bf3c571b306d88570cbd44b57c3a23d700e6ee6dea5ee253e8826a","target":"graph","created_at":"2026-05-18T00:45:27Z","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":"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 ","authors_text":"Arie Slobbe, Elisabetta Bergamini, Henning Meyerhenke, Mark Ortmann","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-27T14:21:19Z","title":"Faster Betweenness Centrality Updates in Evolving Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.08592","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:1a9af19744efff0129a3ce16f5664cd7a7865550e56b5ecc3725e200610dcb29","target":"record","created_at":"2026-05-18T00:45:27Z","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":"17eaee908a93a3250eae2ef2933b076b0e747dc0ee9eeb0e8534db319b3734c4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-27T14:21:19Z","title_canon_sha256":"8cb0bb93fdbe5ac2e67e5013cf2056368913c360be8ca42bbedfb014240362eb"},"schema_version":"1.0","source":{"id":"1704.08592","kind":"arxiv","version":1}},"canonical_sha256":"eacd72460d5b6c454896c4178b49b247193967d8543c5601c38847399073aaa0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"eacd72460d5b6c454896c4178b49b247193967d8543c5601c38847399073aaa0","first_computed_at":"2026-05-18T00:45:27.336069Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:45:27.336069Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"icAnaYcJ42RBQYf2W9uvxyfpD09WqoK1BDjjsDjH37b+c1alpVZNLbwQUaoaWNGGS4DTDBtZYxgxDyR/fx/HCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:45:27.336739Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.08592","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1a9af19744efff0129a3ce16f5664cd7a7865550e56b5ecc3725e200610dcb29","sha256:53a41d00a0bf3c571b306d88570cbd44b57c3a23d700e6ee6dea5ee253e8826a"],"state_sha256":"571f45c1146d9e8a1fe675379986fb61f8a476673f2e0eecd690f68661d1a99a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Vot/qvL+z4jFueEBMXXBRvEPUQpzkfHVEwFB/riDsbfeot2wxJ9x9obwJjmvGeYrfXE2TeVFbOyRt6GCT8vWDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T00:33:28.645038Z","bundle_sha256":"bf02e36240abcde7c3916bfbae3e29984020e0b59c646b45e2bd91ad78f5f536"}}