{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:77OMW4O22BEFLNJM2TAHUFE6C4","short_pith_number":"pith:77OMW4O2","schema_version":"1.0","canonical_sha256":"ffdccb71dad04855b52cd4c07a149e1737adf1b43492ace8a931b2f90721dc63","source":{"kind":"arxiv","id":"1606.03782","version":2},"attestation_state":"computed","paper":{"title":"Graphs with obstacle number greater than one","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Chris Hartman, Glenn G. Chappell, Gordon I. Williams, Jill R. Faudree, John Gimbel, Leah Wrenn Berman","submitted_at":"2016-06-12T23:19:37Z","abstract_excerpt":"An \\emph{obstacle representation} of a graph $G$ is a straight-line drawing of $G$ in the plane together with a collection of connected subsets of the plane, called \\emph{obstacles}, that block all non-edges of $G$ while not blocking any of the edges of $G$. The \\emph{obstacle number} obs$(G)$ is the minimum number of obstacles required to represent $G$.\n  We study the structure of graphs with obstacle number greater than one. We show that the icosahedron has obstacle number $2$, thus answering a question of Alpert, Koch, \\& Laison asking whether all planar graphs have obstacle number at most "},"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":"1606.03782","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-06-12T23:19:37Z","cross_cats_sorted":[],"title_canon_sha256":"384cd6d265380c7a406772ab75e48d3c9aa88fec0c575fbd587146afb9c6a347","abstract_canon_sha256":"cb641f76e8ed0a42f6fa58e3089505db36171825c68feb247c214a89fb1e9f4a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:51.825019Z","signature_b64":"lblrdHvxnhH/p/hgb02GWzH7qAhyhRE3o2aV+13Yktp/Y0rSq4iqh8Y+cEmRosnO2WlYWiVP/EE8+2lDSIFJDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ffdccb71dad04855b52cd4c07a149e1737adf1b43492ace8a931b2f90721dc63","last_reissued_at":"2026-05-18T00:46:51.824359Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:51.824359Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graphs with obstacle number greater than one","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Chris Hartman, Glenn G. Chappell, Gordon I. Williams, Jill R. Faudree, John Gimbel, Leah Wrenn Berman","submitted_at":"2016-06-12T23:19:37Z","abstract_excerpt":"An \\emph{obstacle representation} of a graph $G$ is a straight-line drawing of $G$ in the plane together with a collection of connected subsets of the plane, called \\emph{obstacles}, that block all non-edges of $G$ while not blocking any of the edges of $G$. The \\emph{obstacle number} obs$(G)$ is the minimum number of obstacles required to represent $G$.\n  We study the structure of graphs with obstacle number greater than one. We show that the icosahedron has obstacle number $2$, thus answering a question of Alpert, Koch, \\& Laison asking whether all planar graphs have obstacle number at most "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.03782","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":"1606.03782","created_at":"2026-05-18T00:46:51.824434+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.03782v2","created_at":"2026-05-18T00:46:51.824434+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.03782","created_at":"2026-05-18T00:46:51.824434+00:00"},{"alias_kind":"pith_short_12","alias_value":"77OMW4O22BEF","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_16","alias_value":"77OMW4O22BEFLNJM","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_8","alias_value":"77OMW4O2","created_at":"2026-05-18T12:30:04.600751+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/77OMW4O22BEFLNJM2TAHUFE6C4","json":"https://pith.science/pith/77OMW4O22BEFLNJM2TAHUFE6C4.json","graph_json":"https://pith.science/api/pith-number/77OMW4O22BEFLNJM2TAHUFE6C4/graph.json","events_json":"https://pith.science/api/pith-number/77OMW4O22BEFLNJM2TAHUFE6C4/events.json","paper":"https://pith.science/paper/77OMW4O2"},"agent_actions":{"view_html":"https://pith.science/pith/77OMW4O22BEFLNJM2TAHUFE6C4","download_json":"https://pith.science/pith/77OMW4O22BEFLNJM2TAHUFE6C4.json","view_paper":"https://pith.science/paper/77OMW4O2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.03782&json=true","fetch_graph":"https://pith.science/api/pith-number/77OMW4O22BEFLNJM2TAHUFE6C4/graph.json","fetch_events":"https://pith.science/api/pith-number/77OMW4O22BEFLNJM2TAHUFE6C4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/77OMW4O22BEFLNJM2TAHUFE6C4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/77OMW4O22BEFLNJM2TAHUFE6C4/action/storage_attestation","attest_author":"https://pith.science/pith/77OMW4O22BEFLNJM2TAHUFE6C4/action/author_attestation","sign_citation":"https://pith.science/pith/77OMW4O22BEFLNJM2TAHUFE6C4/action/citation_signature","submit_replication":"https://pith.science/pith/77OMW4O22BEFLNJM2TAHUFE6C4/action/replication_record"}},"created_at":"2026-05-18T00:46:51.824434+00:00","updated_at":"2026-05-18T00:46:51.824434+00:00"}