{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:BQSP6QZLQPZ2YTO6WCQCIZRR52","short_pith_number":"pith:BQSP6QZL","schema_version":"1.0","canonical_sha256":"0c24ff432b83f3ac4ddeb0a0246631ee842564db798b8f19ae477293843f9d56","source":{"kind":"arxiv","id":"1610.00952","version":2},"attestation_state":"computed","paper":{"title":"On colouring point visibility graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Ajit Arvind Diwan, Bodhayan Roy","submitted_at":"2016-10-04T12:39:26Z","abstract_excerpt":"In this paper we show that it can be decided in polynomial time whether or not the visibility graph of a given point set is 4-colourable, and such a 4-colouring, if it exists, can also be constructed in polynomial time. We show that the problem of deciding whether the visibility graph of a point set is 5-colourable, is NP-complete. We give an example of a point visibility graph that has chromatic number 6 while its clique number is only 4."},"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":"1610.00952","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-10-04T12:39:26Z","cross_cats_sorted":[],"title_canon_sha256":"967291a2f6753a435346f9dd3b07bfb5727372a1db9579e2f54dc6f80b4a5671","abstract_canon_sha256":"97efeee6982940fef33d98c123422384e4d1e7c5046189dcf1939f50bb7e8274"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:41:46.264177Z","signature_b64":"bkj18zAJVvhvupO+fdJcs0PqwB/0yMmEVqhZ0TGwf76mt1r2Q3aOfLlEoKMuScEhFwmFdOGpiYVvvTbsFfjJDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0c24ff432b83f3ac4ddeb0a0246631ee842564db798b8f19ae477293843f9d56","last_reissued_at":"2026-05-18T00:41:46.263572Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:41:46.263572Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On colouring point visibility graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Ajit Arvind Diwan, Bodhayan Roy","submitted_at":"2016-10-04T12:39:26Z","abstract_excerpt":"In this paper we show that it can be decided in polynomial time whether or not the visibility graph of a given point set is 4-colourable, and such a 4-colouring, if it exists, can also be constructed in polynomial time. We show that the problem of deciding whether the visibility graph of a point set is 5-colourable, is NP-complete. We give an example of a point visibility graph that has chromatic number 6 while its clique number is only 4."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.00952","kind":"arxiv","version":2},"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":"1610.00952","created_at":"2026-05-18T00:41:46.263660+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.00952v2","created_at":"2026-05-18T00:41:46.263660+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.00952","created_at":"2026-05-18T00:41:46.263660+00:00"},{"alias_kind":"pith_short_12","alias_value":"BQSP6QZLQPZ2","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_16","alias_value":"BQSP6QZLQPZ2YTO6","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_8","alias_value":"BQSP6QZL","created_at":"2026-05-18T12:30:07.202191+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/BQSP6QZLQPZ2YTO6WCQCIZRR52","json":"https://pith.science/pith/BQSP6QZLQPZ2YTO6WCQCIZRR52.json","graph_json":"https://pith.science/api/pith-number/BQSP6QZLQPZ2YTO6WCQCIZRR52/graph.json","events_json":"https://pith.science/api/pith-number/BQSP6QZLQPZ2YTO6WCQCIZRR52/events.json","paper":"https://pith.science/paper/BQSP6QZL"},"agent_actions":{"view_html":"https://pith.science/pith/BQSP6QZLQPZ2YTO6WCQCIZRR52","download_json":"https://pith.science/pith/BQSP6QZLQPZ2YTO6WCQCIZRR52.json","view_paper":"https://pith.science/paper/BQSP6QZL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.00952&json=true","fetch_graph":"https://pith.science/api/pith-number/BQSP6QZLQPZ2YTO6WCQCIZRR52/graph.json","fetch_events":"https://pith.science/api/pith-number/BQSP6QZLQPZ2YTO6WCQCIZRR52/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BQSP6QZLQPZ2YTO6WCQCIZRR52/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BQSP6QZLQPZ2YTO6WCQCIZRR52/action/storage_attestation","attest_author":"https://pith.science/pith/BQSP6QZLQPZ2YTO6WCQCIZRR52/action/author_attestation","sign_citation":"https://pith.science/pith/BQSP6QZLQPZ2YTO6WCQCIZRR52/action/citation_signature","submit_replication":"https://pith.science/pith/BQSP6QZLQPZ2YTO6WCQCIZRR52/action/replication_record"}},"created_at":"2026-05-18T00:41:46.263660+00:00","updated_at":"2026-05-18T00:41:46.263660+00:00"}