{"paper":{"title":"Almost Tight Bounds for Conflict-Free Chromatic Guarding of Orthogonal Galleries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Frank Hoffmann, Klaus Kriegel, Max Willert","submitted_at":"2014-12-12T13:18:47Z","abstract_excerpt":"We address recently proposed chromatic versions of the classic Art Gallery Problem. Assume a simple polygon $P$ is guarded by a finite set of point guards and each guard is assigned one of $t$ colors. Such a chromatic guarding is said to be conflict-free if each point $p\\in P$ sees at least one guard with a unique color among all guards visible from $p$. The goal is to establish bounds on the function $\\chi_{cf}(n)$ of the number of colors sufficient to guarantee the existence of a conflict-free chromatic guarding for any $n$-vertex polygon. B\\\"artschi and Suri showed $\\chi_{cf}(n)\\in O(\\log n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.3984","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}