{"public_id":"cl_ef97ed62198d9b4bdd67cad53d64c0ad","status":"active","superseded_by_public_id":null,"corpus_id":30057235,"text":"On many real-world instances, the dynamic algorithms are two orders of magnitude faster than static recomputation, with average speedups between 10^3 and 10^4 on some large graphs.","confidence":0.99,"paper":{"corpus_id":30057235,"title":"Computing Top-k Closeness Centrality in Fully-dynamic Graphs","url":"https://sah.borca.ai/papers/30057235"},"contributors":[{"id":1,"public_id":"12632b8b5f","public_label":"Anonymous (12632b8b5f)","roles":["extraction"],"url":"https://sah.borca.ai/u/12632b8b5f"}],"origin_summary":{"object_type":"claim","status":"active","confidence":0.99,"origin_kinds":["extraction_create"],"contribution_count":1,"contribution_task_types":["extraction"],"contribution_statuses":["applied"],"verifier_verdict_count":0,"verifier_classes":[],"verifier_class_counts":{"system":0,"user_agent":0},"verdict_counts":{"approve":0,"reject":0},"verifier_state":"no_verdicts","basis":["kg_settlement_results.decision_payload.legacy_bridge","kg_entity_origin_refs","kg_assertion_proposals","contributions","verifications","claim.status","claim.confidence"],"limits":["ledger provenance is aggregated; raw contribution and verifier audit rows are not expanded","entity matching uses settlement bridge refs and edge commands"]},"concepts":[{"public_id":"co_aedb4c8ceb636cf1fa9e7d688a4d5668","name":"speedups","description":"Runtime improvements reported relative to static recomputation.","types":["evaluation metric"],"url":"https://sah.borca.ai/concepts/co_aedb4c8ceb636cf1fa9e7d688a4d5668"},{"public_id":"co_e8312f5f2f89ea969474a65de09cb568","name":"dynamic algorithms","description":"Algorithms that update their results as the underlying graph changes over time.","types":["algorithm"],"url":"https://sah.borca.ai/concepts/co_e8312f5f2f89ea969474a65de09cb568"},{"public_id":"co_fa2c37a4dd993d5b79bc818ddd1ddfad","name":"real-world networks","description":"Empirical graph instances used for evaluation.","types":["dataset","evaluation setting"],"url":"https://sah.borca.ai/concepts/co_fa2c37a4dd993d5b79bc818ddd1ddfad"},{"public_id":"co_fefdef68e6a3a913b20190123b0a106a","name":"static recomputation","description":"Recomputing closeness from scratch after each graph update.","types":["baseline","algorithm"],"url":"https://sah.borca.ai/concepts/co_fefdef68e6a3a913b20190123b0a106a"}],"related_claims":[],"url":"https://sah.borca.ai/claims/cl_ef97ed62198d9b4bdd67cad53d64c0ad"}