{"public_id":"cl_88ca0e1afd495a8cc72357536daa3260","status":"active","superseded_by_public_id":null,"corpus_id":30057235,"text":"The algorithms reuse information from earlier computations to omit unnecessary work without asymptotically exceeding linear memory.","confidence":0.93,"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.93,"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_4fbddaa9d25f90afcf81e78488887920","name":"top-k closeness centrality","description":"The task of identifying the k nodes with the highest closeness values in a graph.","types":["graph algorithm task"],"url":"https://sah.borca.ai/concepts/co_4fbddaa9d25f90afcf81e78488887920"},{"public_id":"co_5f86736fd8d9407283280552d1e4b597","name":"linear memory","description":"Memory usage that grows proportionally with the number of nodes in the graph.","types":["complexity bound"],"url":"https://sah.borca.ai/concepts/co_5f86736fd8d9407283280552d1e4b597"},{"public_id":"co_7ed99632df212ba68f45c02c4b02afb4","name":"earlier computations","description":"Previously computed information reused by the dynamic algorithms to reduce work.","types":["algorithmic state"],"url":"https://sah.borca.ai/concepts/co_7ed99632df212ba68f45c02c4b02afb4"}],"related_claims":[],"url":"https://sah.borca.ai/claims/cl_88ca0e1afd495a8cc72357536daa3260"}