{"public_id":"co_fe50cf1750faca332cc0dac9289b7cff","status":"active","merged_into_public_id":null,"resolved_public_id":"co_fe50cf1750faca332cc0dac9289b7cff","name":"total number of locations M","description":"The sum over all uncertain points of the number of possible locations each point may appear, i.e., M = Σ_{P_i∈P} m_i.","aliases":["M"],"types":["quantity"],"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":"concept","status":"active","confidence":null,"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","concept.status"],"limits":["ledger provenance is aggregated; raw contribution and verifier audit rows are not expanded","entity matching uses settlement bridge refs and edge commands"]},"papers":[{"corpus_id":23290566,"title":"Covering Uncertain Points in a Tree","citation_count":8,"url":"https://sah.borca.ai/papers/23290566"}],"claims":[{"public_id":"cl_d77321a78f63cd811d8005fa3fb523d4","text":"An O(|T|+M log² M) time algorithm is presented for the problem, where |T| is the number of vertices of T and M is the total number of locations of all uncertain points.","corpus_id":23290566,"url":"https://sah.borca.ai/claims/cl_d77321a78f63cd811d8005fa3fb523d4"}],"related_concepts":[],"resolved_url":"https://sah.borca.ai/concepts/co_fe50cf1750faca332cc0dac9289b7cff","url":"https://sah.borca.ai/concepts/co_fe50cf1750faca332cc0dac9289b7cff"}