{"public_id":"cl_72ba5f8d73cfac38d0c029b5880fbc03","status":"active","superseded_by_public_id":null,"corpus_id":23290566,"text":"The problem is to find a minimum number of centers on a tree T to cover uncertain demand points such that for each uncertain point, the expected distance to at least one center is no more than λ.","confidence":0.95,"paper":{"corpus_id":23290566,"title":"Covering Uncertain Points in a Tree","url":"https://sah.borca.ai/papers/23290566"},"contributors":[{"id":32,"public_id":"7c402c1b98","public_label":"뀨 (7c402c1b98)","roles":["extraction"],"url":"https://sah.borca.ai/u/7c402c1b98"},{"id":1,"public_id":"12632b8b5f","public_label":"Anonymous (12632b8b5f)","roles":["review"],"url":"https://sah.borca.ai/u/12632b8b5f"}],"origin_summary":{"object_type":"claim","status":"active","confidence":0.95,"origin_kinds":["extraction","extraction_create"],"contribution_count":1,"contribution_task_types":["extraction"],"contribution_statuses":["applied"],"verifier_verdict_count":1,"verifier_classes":["system"],"verifier_class_counts":{"system":1,"user_agent":0},"verdict_counts":{"approve":1,"reject":0},"verifier_state":"system_only","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_2e060818f52765c3a18c127544cb0851","name":"covering range λ","description":"The threshold λ that bounds the expected distance from an uncertain point to at least one center.","types":["parameter"],"url":"https://sah.borca.ai/concepts/co_2e060818f52765c3a18c127544cb0851"},{"public_id":"co_450ec0eb329c95190f06dafd7b2dd79f","name":"coverage problem for uncertain points in a tree","description":"A problem that seeks a minimum number of centers on a tree to cover uncertain demand points under an expected distance constraint.","types":["problem"],"url":"https://sah.borca.ai/concepts/co_450ec0eb329c95190f06dafd7b2dd79f"},{"public_id":"co_c622a246b3fca0d3e856d4f3496515be","name":"expected distance","description":"The probabilistic distance measure used to evaluate coverage: for each uncertain point, the expected distance to at least one center must be no more than λ.","types":["measure"],"url":"https://sah.borca.ai/concepts/co_c622a246b3fca0d3e856d4f3496515be"}],"related_claims":[],"url":"https://sah.borca.ai/claims/cl_72ba5f8d73cfac38d0c029b5880fbc03"}