{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:N23BSGETAIYSF2LCIO52RGUF3R","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"5255c44686432c6d0ed5c7cbe8665baad2a54fe3b02fe8cdfa5907c81eacd57e","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-06-05T09:25:58Z","title_canon_sha256":"53d0009661556c1d128209e17559e5691ba69f3728cdb71c4d73c5d3f76139e6"},"schema_version":"1.0","source":{"id":"1906.01904","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.01904","created_at":"2026-05-17T23:44:05Z"},{"alias_kind":"arxiv_version","alias_value":"1906.01904v1","created_at":"2026-05-17T23:44:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.01904","created_at":"2026-05-17T23:44:05Z"},{"alias_kind":"pith_short_12","alias_value":"N23BSGETAIYS","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"N23BSGETAIYSF2LC","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"N23BSGET","created_at":"2026-05-18T12:33:24Z"}],"graph_snapshots":[{"event_id":"sha256:d5a886a6ebf01a122f6e80c795adaddbf2f9b90c68a93ed1b2536bd029a8cb08","target":"graph","created_at":"2026-05-17T23:44:05Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"We study the problem of colouring visibility graphs of polygons. In particular, for visibility graphs of simple polygons, we provide a polynomial algorithm for 4-colouring, and prove that the 5-colourability question is already NP-complete for them. For visibility graphs of polygons with holes, we prove that the 4-colourability question is NP-complete.","authors_text":"Bodhayan Roy, Onur \\c{C}a\\u{g}irici, Petr Hlin\\v{e}n\\'y","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-06-05T09:25:58Z","title":"On Colourability of Polygon Visibility Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.01904","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:5619fc8ba475af75e4f11924e5e00fa147e9c8dd022365069241212cb5391ae1","target":"record","created_at":"2026-05-17T23:44:05Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"5255c44686432c6d0ed5c7cbe8665baad2a54fe3b02fe8cdfa5907c81eacd57e","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-06-05T09:25:58Z","title_canon_sha256":"53d0009661556c1d128209e17559e5691ba69f3728cdb71c4d73c5d3f76139e6"},"schema_version":"1.0","source":{"id":"1906.01904","kind":"arxiv","version":1}},"canonical_sha256":"6eb6191893023122e96243bba89a85dc4577f16c58298f3ebcb9098d37dfdb2a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6eb6191893023122e96243bba89a85dc4577f16c58298f3ebcb9098d37dfdb2a","first_computed_at":"2026-05-17T23:44:05.809935Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:44:05.809935Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9kAcScTqSnhOiY4GalNVg555/7waEfv/2NMpxjowmKQ945iGn6jT/ZXQbRngN0YA8NVw5blCVqF7BgassMvMCw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:44:05.810491Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.01904","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5619fc8ba475af75e4f11924e5e00fa147e9c8dd022365069241212cb5391ae1","sha256:d5a886a6ebf01a122f6e80c795adaddbf2f9b90c68a93ed1b2536bd029a8cb08"],"state_sha256":"97e58c027577e71b843a464384013c44cfe0c91dacac822dac55cf5b90941052"}