{"public_id":"cl_28889494398c483d908bb00c33b6d5a0","status":"active","superseded_by_public_id":null,"corpus_id":30057235,"text":"Separate algorithms are proposed for complex networks with the small-world property and for large-diameter networks such as street networks.","confidence":0.95,"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.95,"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_1382991fe528f9aa90bf48213dbdbfa4","name":"large-diameter networks","description":"Networks whose shortest-path distances can be relatively large, as contrasted with complex networks.","types":["graph type"],"url":"https://sah.borca.ai/concepts/co_1382991fe528f9aa90bf48213dbdbfa4"},{"public_id":"co_1b934c70c86f8098bf1f8dd34a895b41","name":"complex networks","description":"Networks characterized in the abstract as exhibiting the small-world property.","types":["graph type"],"url":"https://sah.borca.ai/concepts/co_1b934c70c86f8098bf1f8dd34a895b41"},{"public_id":"co_23f205b2fa7d164d70f9314f62260f5b","name":"street networks","description":"Road-network graphs used as an example of large-diameter networks.","types":["graph type"],"url":"https://sah.borca.ai/concepts/co_23f205b2fa7d164d70f9314f62260f5b"},{"public_id":"co_81bdd08c0fd315212289f1646f262476","name":"small-world property","description":"A network property associated with short paths and high local clustering.","types":["graph property"],"url":"https://sah.borca.ai/concepts/co_81bdd08c0fd315212289f1646f262476"}],"related_claims":[],"url":"https://sah.borca.ai/claims/cl_28889494398c483d908bb00c33b6d5a0"}