{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:ZYJWANUZI5LIOJHL257JIA7TEH","short_pith_number":"pith:ZYJWANUZ","schema_version":"1.0","canonical_sha256":"ce1360369947568724ebd77e9403f321cc643d71e0293fa5fddf3a8021526c1d","source":{"kind":"arxiv","id":"1706.06992","version":3},"attestation_state":"computed","paper":{"title":"Obstacle Numbers of Planar Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"John Gimbel, Patrice Ossona de Mendez, Pavel Valtr","submitted_at":"2017-06-21T16:28:56Z","abstract_excerpt":"Given finitely many connected polygonal obstacles $O_1,\\dots,O_k$ in the plane and a set $P$ of points in general position and not in any obstacle, the {\\em visibility graph} of $P$ with obstacles $O_1,\\dots,O_k$ is the (geometric) graph with vertex set $P$, where two vertices are adjacent if the straight line segment joining them intersects no obstacle. The obstacle number of a graph $G$ is the smallest integer $k$ such that $G$ is the visibility graph of a set of points with $k$ obstacles. If $G$ is planar, we define the planar obstacle number of $G$ by further requiring that the visibility "},"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":"1706.06992","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-06-21T16:28:56Z","cross_cats_sorted":[],"title_canon_sha256":"515cfe543a1c6d47a089ac15d2367df1a648519a560c73e9f481fdaf4b96182f","abstract_canon_sha256":"ab97f2ddac7099ea70ba6d64d72782f1a623d41908c5ecea358323db9f15b5eb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:35:51.150159Z","signature_b64":"ANMx7Worq8rMo8yZ5+lUSzPoLx8cv5WuvANBrRAB69ZZrGC2rGsdqL9OIj2uRNg6FQ/zb4w384T8t0MpDj4jCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ce1360369947568724ebd77e9403f321cc643d71e0293fa5fddf3a8021526c1d","last_reissued_at":"2026-05-18T00:35:51.149718Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:35:51.149718Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Obstacle Numbers of Planar Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"John Gimbel, Patrice Ossona de Mendez, Pavel Valtr","submitted_at":"2017-06-21T16:28:56Z","abstract_excerpt":"Given finitely many connected polygonal obstacles $O_1,\\dots,O_k$ in the plane and a set $P$ of points in general position and not in any obstacle, the {\\em visibility graph} of $P$ with obstacles $O_1,\\dots,O_k$ is the (geometric) graph with vertex set $P$, where two vertices are adjacent if the straight line segment joining them intersects no obstacle. The obstacle number of a graph $G$ is the smallest integer $k$ such that $G$ is the visibility graph of a set of points with $k$ obstacles. If $G$ is planar, we define the planar obstacle number of $G$ by further requiring that the visibility "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.06992","kind":"arxiv","version":3},"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":"1706.06992","created_at":"2026-05-18T00:35:51.149782+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.06992v3","created_at":"2026-05-18T00:35:51.149782+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.06992","created_at":"2026-05-18T00:35:51.149782+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZYJWANUZI5LI","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZYJWANUZI5LIOJHL","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZYJWANUZ","created_at":"2026-05-18T12:31:59.375834+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/ZYJWANUZI5LIOJHL257JIA7TEH","json":"https://pith.science/pith/ZYJWANUZI5LIOJHL257JIA7TEH.json","graph_json":"https://pith.science/api/pith-number/ZYJWANUZI5LIOJHL257JIA7TEH/graph.json","events_json":"https://pith.science/api/pith-number/ZYJWANUZI5LIOJHL257JIA7TEH/events.json","paper":"https://pith.science/paper/ZYJWANUZ"},"agent_actions":{"view_html":"https://pith.science/pith/ZYJWANUZI5LIOJHL257JIA7TEH","download_json":"https://pith.science/pith/ZYJWANUZI5LIOJHL257JIA7TEH.json","view_paper":"https://pith.science/paper/ZYJWANUZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.06992&json=true","fetch_graph":"https://pith.science/api/pith-number/ZYJWANUZI5LIOJHL257JIA7TEH/graph.json","fetch_events":"https://pith.science/api/pith-number/ZYJWANUZI5LIOJHL257JIA7TEH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZYJWANUZI5LIOJHL257JIA7TEH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZYJWANUZI5LIOJHL257JIA7TEH/action/storage_attestation","attest_author":"https://pith.science/pith/ZYJWANUZI5LIOJHL257JIA7TEH/action/author_attestation","sign_citation":"https://pith.science/pith/ZYJWANUZI5LIOJHL257JIA7TEH/action/citation_signature","submit_replication":"https://pith.science/pith/ZYJWANUZI5LIOJHL257JIA7TEH/action/replication_record"}},"created_at":"2026-05-18T00:35:51.149782+00:00","updated_at":"2026-05-18T00:35:51.149782+00:00"}