{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:V4ZAIKMWQRPJAOQKOZX6P3NOJ4","short_pith_number":"pith:V4ZAIKMW","canonical_record":{"source":{"id":"1311.2147","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-11-09T07:59:22Z","cross_cats_sorted":[],"title_canon_sha256":"f82741f081f87a0794a8730ce12a1e692f69b961f2072ec7ebf0afe4d67d17d8","abstract_canon_sha256":"84d47ffd98d1fa2de2c395da5d0095be7e32ad75958abe6939acf70da744939f"},"schema_version":"1.0"},"canonical_sha256":"af32042996845e903a0a766fe7edae4f247f6e2087e041c2931d470e69de74f9","source":{"kind":"arxiv","id":"1311.2147","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.2147","created_at":"2026-05-18T03:06:54Z"},{"alias_kind":"arxiv_version","alias_value":"1311.2147v3","created_at":"2026-05-18T03:06:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.2147","created_at":"2026-05-18T03:06:54Z"},{"alias_kind":"pith_short_12","alias_value":"V4ZAIKMWQRPJ","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"V4ZAIKMWQRPJAOQK","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"V4ZAIKMW","created_at":"2026-05-18T12:28:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:V4ZAIKMWQRPJAOQKOZX6P3NOJ4","target":"record","payload":{"canonical_record":{"source":{"id":"1311.2147","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-11-09T07:59:22Z","cross_cats_sorted":[],"title_canon_sha256":"f82741f081f87a0794a8730ce12a1e692f69b961f2072ec7ebf0afe4d67d17d8","abstract_canon_sha256":"84d47ffd98d1fa2de2c395da5d0095be7e32ad75958abe6939acf70da744939f"},"schema_version":"1.0"},"canonical_sha256":"af32042996845e903a0a766fe7edae4f247f6e2087e041c2931d470e69de74f9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:06:54.112721Z","signature_b64":"p4WFC3v6ywp2ZkrIs877gQqzA4e/ROzN/L3f95/AEmJtNduiDWkogdA0iv5XyAqIMUoztls5Vy1xqE5J4HcABA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"af32042996845e903a0a766fe7edae4f247f6e2087e041c2931d470e69de74f9","last_reissued_at":"2026-05-18T03:06:54.112248Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:06:54.112248Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1311.2147","source_version":3,"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-18T03:06:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f2V0ZgNGPi0ur7OPQT/nC9n5BHcyTEhV65G09OQAIzLPCZIW+7smCda46BeZ8sHEwk45V2+QoTyojQhEXmfJDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T21:34:16.589806Z"},"content_sha256":"9917c9efcfee4ff3f51e027340075540f83e74e30c387690889a2089afbded0a","schema_version":"1.0","event_id":"sha256:9917c9efcfee4ff3f51e027340075540f83e74e30c387690889a2089afbded0a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:V4ZAIKMWQRPJAOQKOZX6P3NOJ4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Betweenness Centrality -- Incremental and Faster","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Matteo Pontecorvi, Meghana Nasre, Vijaya Ramachandran","submitted_at":"2013-11-09T07:59:22Z","abstract_excerpt":"We consider the incremental computation of the betweenness centrality of all vertices in a large complex network modeled as a graph G = (V, E), directed or undirected, with positive real edge-weights. The current widely used algorithm to compute the betweenness centrality of all vertices in G is the Brandes algorithm that runs in O(mn + n^2 log n) time, where n = |V| and m = |E|.\n  We present an incremental algorithm that updates the betweenness centrality score of all vertices in G when a new edge is added to G, or the weight of an existing edge is reduced. Our incremental algorithm runs in O"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.2147","kind":"arxiv","version":3},"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-18T03:06:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QxWXvoLVbBT7HqwC4K9XKdmCvck75Rk/o3NP1Pnkg1Dva8PhBghPhYQ7OZppT+xO54D9r+tTj4S3vY/rxEYOCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T21:34:16.590135Z"},"content_sha256":"049b060c4c33e9d32fef2a2284442f58bb87c0d2a60262e603224622bd65b14f","schema_version":"1.0","event_id":"sha256:049b060c4c33e9d32fef2a2284442f58bb87c0d2a60262e603224622bd65b14f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/V4ZAIKMWQRPJAOQKOZX6P3NOJ4/bundle.json","state_url":"https://pith.science/pith/V4ZAIKMWQRPJAOQKOZX6P3NOJ4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/V4ZAIKMWQRPJAOQKOZX6P3NOJ4/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-24T21:34:16Z","links":{"resolver":"https://pith.science/pith/V4ZAIKMWQRPJAOQKOZX6P3NOJ4","bundle":"https://pith.science/pith/V4ZAIKMWQRPJAOQKOZX6P3NOJ4/bundle.json","state":"https://pith.science/pith/V4ZAIKMWQRPJAOQKOZX6P3NOJ4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/V4ZAIKMWQRPJAOQKOZX6P3NOJ4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:V4ZAIKMWQRPJAOQKOZX6P3NOJ4","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":"84d47ffd98d1fa2de2c395da5d0095be7e32ad75958abe6939acf70da744939f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-11-09T07:59:22Z","title_canon_sha256":"f82741f081f87a0794a8730ce12a1e692f69b961f2072ec7ebf0afe4d67d17d8"},"schema_version":"1.0","source":{"id":"1311.2147","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.2147","created_at":"2026-05-18T03:06:54Z"},{"alias_kind":"arxiv_version","alias_value":"1311.2147v3","created_at":"2026-05-18T03:06:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.2147","created_at":"2026-05-18T03:06:54Z"},{"alias_kind":"pith_short_12","alias_value":"V4ZAIKMWQRPJ","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"V4ZAIKMWQRPJAOQK","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"V4ZAIKMW","created_at":"2026-05-18T12:28:04Z"}],"graph_snapshots":[{"event_id":"sha256:049b060c4c33e9d32fef2a2284442f58bb87c0d2a60262e603224622bd65b14f","target":"graph","created_at":"2026-05-18T03:06:54Z","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":"We consider the incremental computation of the betweenness centrality of all vertices in a large complex network modeled as a graph G = (V, E), directed or undirected, with positive real edge-weights. The current widely used algorithm to compute the betweenness centrality of all vertices in G is the Brandes algorithm that runs in O(mn + n^2 log n) time, where n = |V| and m = |E|.\n  We present an incremental algorithm that updates the betweenness centrality score of all vertices in G when a new edge is added to G, or the weight of an existing edge is reduced. Our incremental algorithm runs in O","authors_text":"Matteo Pontecorvi, Meghana Nasre, Vijaya Ramachandran","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-11-09T07:59:22Z","title":"Betweenness Centrality -- Incremental and Faster"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.2147","kind":"arxiv","version":3},"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:9917c9efcfee4ff3f51e027340075540f83e74e30c387690889a2089afbded0a","target":"record","created_at":"2026-05-18T03:06:54Z","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":"84d47ffd98d1fa2de2c395da5d0095be7e32ad75958abe6939acf70da744939f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-11-09T07:59:22Z","title_canon_sha256":"f82741f081f87a0794a8730ce12a1e692f69b961f2072ec7ebf0afe4d67d17d8"},"schema_version":"1.0","source":{"id":"1311.2147","kind":"arxiv","version":3}},"canonical_sha256":"af32042996845e903a0a766fe7edae4f247f6e2087e041c2931d470e69de74f9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"af32042996845e903a0a766fe7edae4f247f6e2087e041c2931d470e69de74f9","first_computed_at":"2026-05-18T03:06:54.112248Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:06:54.112248Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"p4WFC3v6ywp2ZkrIs877gQqzA4e/ROzN/L3f95/AEmJtNduiDWkogdA0iv5XyAqIMUoztls5Vy1xqE5J4HcABA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:06:54.112721Z","signed_message":"canonical_sha256_bytes"},"source_id":"1311.2147","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9917c9efcfee4ff3f51e027340075540f83e74e30c387690889a2089afbded0a","sha256:049b060c4c33e9d32fef2a2284442f58bb87c0d2a60262e603224622bd65b14f"],"state_sha256":"f84dd61f30c34e2b27b1e7d944092e7b356a5e5e9114e34508fef80d89d8b9b1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cirEtrOiKIkDg3UywyKiXOn7R+0iSm2faZM57/oa/NYdpQVUlO6nC1KqtVkSuagFiFQJSFAPs6E42vQPixRsCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T21:34:16.592824Z","bundle_sha256":"d4d2bea3dec9269d4e5cbc7d45028dfc5a7b91320925daf973827b9b64703b4d"}}