{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:32GGR35ZVOLIIRKW7FDTPFUYO6","short_pith_number":"pith:32GGR35Z","schema_version":"1.0","canonical_sha256":"de8c68efb9ab96844556f94737969877a911106969c9cb83ce6db5001cf61131","source":{"kind":"arxiv","id":"1412.3984","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1412.3984","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-12-12T13:18:47Z","cross_cats_sorted":[],"title_canon_sha256":"a1edfd75f37e685dbe61dddf83b31afea091ad300585c96fc85e01b072eac8bc","abstract_canon_sha256":"a0f568f6506ba757252c06cbad15ea484742c7be31b6e4f5bbed82b84ebcc8cc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:31:28.154034Z","signature_b64":"NSQEt4fhxew7RzurnOe+hvyl/delcpawilbwGzTLzjjs6dlxL4qTcKRcnczCZd6gn08um4t7S0yWA3qqi4IBCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"de8c68efb9ab96844556f94737969877a911106969c9cb83ce6db5001cf61131","last_reissued_at":"2026-05-18T02:31:28.153393Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:31:28.153393Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1412.3984","created_at":"2026-05-18T02:31:28.153488+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.3984v1","created_at":"2026-05-18T02:31:28.153488+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.3984","created_at":"2026-05-18T02:31:28.153488+00:00"},{"alias_kind":"pith_short_12","alias_value":"32GGR35ZVOLI","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_16","alias_value":"32GGR35ZVOLIIRKW","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_8","alias_value":"32GGR35Z","created_at":"2026-05-18T12:28:11.866339+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/32GGR35ZVOLIIRKW7FDTPFUYO6","json":"https://pith.science/pith/32GGR35ZVOLIIRKW7FDTPFUYO6.json","graph_json":"https://pith.science/api/pith-number/32GGR35ZVOLIIRKW7FDTPFUYO6/graph.json","events_json":"https://pith.science/api/pith-number/32GGR35ZVOLIIRKW7FDTPFUYO6/events.json","paper":"https://pith.science/paper/32GGR35Z"},"agent_actions":{"view_html":"https://pith.science/pith/32GGR35ZVOLIIRKW7FDTPFUYO6","download_json":"https://pith.science/pith/32GGR35ZVOLIIRKW7FDTPFUYO6.json","view_paper":"https://pith.science/paper/32GGR35Z","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.3984&json=true","fetch_graph":"https://pith.science/api/pith-number/32GGR35ZVOLIIRKW7FDTPFUYO6/graph.json","fetch_events":"https://pith.science/api/pith-number/32GGR35ZVOLIIRKW7FDTPFUYO6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/32GGR35ZVOLIIRKW7FDTPFUYO6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/32GGR35ZVOLIIRKW7FDTPFUYO6/action/storage_attestation","attest_author":"https://pith.science/pith/32GGR35ZVOLIIRKW7FDTPFUYO6/action/author_attestation","sign_citation":"https://pith.science/pith/32GGR35ZVOLIIRKW7FDTPFUYO6/action/citation_signature","submit_replication":"https://pith.science/pith/32GGR35ZVOLIIRKW7FDTPFUYO6/action/replication_record"}},"created_at":"2026-05-18T02:31:28.153488+00:00","updated_at":"2026-05-18T02:31:28.153488+00:00"}