{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:BXQYR26ULZ7KQALLASLUS6QKBZ","short_pith_number":"pith:BXQYR26U","schema_version":"1.0","canonical_sha256":"0de188ebd45e7ea8016b0497497a0a0e685a89ec95ad1640240e3f2084c95fa7","source":{"kind":"arxiv","id":"1610.04741","version":2},"attestation_state":"computed","paper":{"title":"Drawing graphs using a small number of obstacles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Josef Cibulka, Martin Balko, Pavel Valtr","submitted_at":"2016-10-15T14:19:29Z","abstract_excerpt":"An obstacle representation of a graph $G$ is a set of points in the plane representing the vertices of $G$, together with a set of polygonal obstacles such that two vertices of $G$ are connected by an edge in $G$ if and only if the line segment between the corresponding points avoids all the obstacles. The obstacle number ${\\rm obs}(G)$ of $G$ is the minimum number of obstacles in an obstacle representation of $G$.\n  We provide the first non-trivial general upper bound on the obstacle number of graphs by showing that every $n$-vertex graph $G$ satisfies ${\\rm obs}(G) \\leq n\\lceil\\log{n}\\rceil-"},"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.04741","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-10-15T14:19:29Z","cross_cats_sorted":[],"title_canon_sha256":"0ca6b69ac3b5724700152a12c962b67cd6af0c7b0a0053e97b8143b7b07b5d74","abstract_canon_sha256":"fca09c10910f4c424baa0b50358e0af7bb16fb9ee2c8ea3349acb34b226540d8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:13.680503Z","signature_b64":"SZeaEwaNbaCJ55Mb6c1YzMqLorZNKZdb8/jR0GYmyCCdG0NKFBUmJTSZX2BYFXHEqfr9Rmu8PXfRPHNvromnDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0de188ebd45e7ea8016b0497497a0a0e685a89ec95ad1640240e3f2084c95fa7","last_reissued_at":"2026-05-18T00:40:13.679881Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:13.679881Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Drawing graphs using a small number of obstacles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Josef Cibulka, Martin Balko, Pavel Valtr","submitted_at":"2016-10-15T14:19:29Z","abstract_excerpt":"An obstacle representation of a graph $G$ is a set of points in the plane representing the vertices of $G$, together with a set of polygonal obstacles such that two vertices of $G$ are connected by an edge in $G$ if and only if the line segment between the corresponding points avoids all the obstacles. The obstacle number ${\\rm obs}(G)$ of $G$ is the minimum number of obstacles in an obstacle representation of $G$.\n  We provide the first non-trivial general upper bound on the obstacle number of graphs by showing that every $n$-vertex graph $G$ satisfies ${\\rm obs}(G) \\leq n\\lceil\\log{n}\\rceil-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.04741","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.04741","created_at":"2026-05-18T00:40:13.679971+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.04741v2","created_at":"2026-05-18T00:40:13.679971+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.04741","created_at":"2026-05-18T00:40:13.679971+00:00"},{"alias_kind":"pith_short_12","alias_value":"BXQYR26ULZ7K","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_16","alias_value":"BXQYR26ULZ7KQALL","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_8","alias_value":"BXQYR26U","created_at":"2026-05-18T12:30:09.641336+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/BXQYR26ULZ7KQALLASLUS6QKBZ","json":"https://pith.science/pith/BXQYR26ULZ7KQALLASLUS6QKBZ.json","graph_json":"https://pith.science/api/pith-number/BXQYR26ULZ7KQALLASLUS6QKBZ/graph.json","events_json":"https://pith.science/api/pith-number/BXQYR26ULZ7KQALLASLUS6QKBZ/events.json","paper":"https://pith.science/paper/BXQYR26U"},"agent_actions":{"view_html":"https://pith.science/pith/BXQYR26ULZ7KQALLASLUS6QKBZ","download_json":"https://pith.science/pith/BXQYR26ULZ7KQALLASLUS6QKBZ.json","view_paper":"https://pith.science/paper/BXQYR26U","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.04741&json=true","fetch_graph":"https://pith.science/api/pith-number/BXQYR26ULZ7KQALLASLUS6QKBZ/graph.json","fetch_events":"https://pith.science/api/pith-number/BXQYR26ULZ7KQALLASLUS6QKBZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BXQYR26ULZ7KQALLASLUS6QKBZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BXQYR26ULZ7KQALLASLUS6QKBZ/action/storage_attestation","attest_author":"https://pith.science/pith/BXQYR26ULZ7KQALLASLUS6QKBZ/action/author_attestation","sign_citation":"https://pith.science/pith/BXQYR26ULZ7KQALLASLUS6QKBZ/action/citation_signature","submit_replication":"https://pith.science/pith/BXQYR26ULZ7KQALLASLUS6QKBZ/action/replication_record"}},"created_at":"2026-05-18T00:40:13.679971+00:00","updated_at":"2026-05-18T00:40:13.679971+00:00"}