{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:UU5FFIPYHVMMIZFO6S4SY27VNT","short_pith_number":"pith:UU5FFIPY","schema_version":"1.0","canonical_sha256":"a53a52a1f83d58c464aef4b92c6bf56cc6f80231a5bf0c83e72db61d68418e31","source":{"kind":"arxiv","id":"1103.2724","version":1},"attestation_state":"computed","paper":{"title":"Lower bounds on the obstacle number of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"D\\\"om\\\"ot\\\"or P\\'alv\\\"olgyi, J\\'anos Pach, Padmini Mukkamala","submitted_at":"2011-03-14T17:41:03Z","abstract_excerpt":"Given a graph $G$, an {\\em obstacle representation} of $G$ is a set of points in the plane representing the vertices of $G$, together with a set of connected obstacles such that two vertices of $G$ are joined by an edge if and only if the corresponding points can be connected by a segment which avoids all obstacles. The {\\em obstacle number} of $G$ is the minimum number of obstacles in an obstacle representation of $G$. It is shown that there are graphs on $n$ vertices with obstacle number at least $\\Omega({n}/{\\log n})$."},"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":"1103.2724","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-03-14T17:41:03Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"d0c33094fa2594bf5a6506004844b5d1fc248d8fb4754d29e511dc51452e3128","abstract_canon_sha256":"271e6aa408f8e2296521335ef7f551c14d0825af806a0ea699c0aa43c362e81b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:26:54.302244Z","signature_b64":"4V6khXYuofQVJXfCJDjy4TomnCl8j8eUc2zlHS4XickrlInWIkSGJRtaoZ9zZvGKFj73idHzGJubLClcIZ3tCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a53a52a1f83d58c464aef4b92c6bf56cc6f80231a5bf0c83e72db61d68418e31","last_reissued_at":"2026-05-18T04:26:54.301821Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:26:54.301821Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lower bounds on the obstacle number of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"D\\\"om\\\"ot\\\"or P\\'alv\\\"olgyi, J\\'anos Pach, Padmini Mukkamala","submitted_at":"2011-03-14T17:41:03Z","abstract_excerpt":"Given a graph $G$, an {\\em obstacle representation} of $G$ is a set of points in the plane representing the vertices of $G$, together with a set of connected obstacles such that two vertices of $G$ are joined by an edge if and only if the corresponding points can be connected by a segment which avoids all obstacles. The {\\em obstacle number} of $G$ is the minimum number of obstacles in an obstacle representation of $G$. It is shown that there are graphs on $n$ vertices with obstacle number at least $\\Omega({n}/{\\log n})$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.2724","kind":"arxiv","version":1},"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":"1103.2724","created_at":"2026-05-18T04:26:54.301886+00:00"},{"alias_kind":"arxiv_version","alias_value":"1103.2724v1","created_at":"2026-05-18T04:26:54.301886+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.2724","created_at":"2026-05-18T04:26:54.301886+00:00"},{"alias_kind":"pith_short_12","alias_value":"UU5FFIPYHVMM","created_at":"2026-05-18T12:26:42.757692+00:00"},{"alias_kind":"pith_short_16","alias_value":"UU5FFIPYHVMMIZFO","created_at":"2026-05-18T12:26:42.757692+00:00"},{"alias_kind":"pith_short_8","alias_value":"UU5FFIPY","created_at":"2026-05-18T12:26:42.757692+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/UU5FFIPYHVMMIZFO6S4SY27VNT","json":"https://pith.science/pith/UU5FFIPYHVMMIZFO6S4SY27VNT.json","graph_json":"https://pith.science/api/pith-number/UU5FFIPYHVMMIZFO6S4SY27VNT/graph.json","events_json":"https://pith.science/api/pith-number/UU5FFIPYHVMMIZFO6S4SY27VNT/events.json","paper":"https://pith.science/paper/UU5FFIPY"},"agent_actions":{"view_html":"https://pith.science/pith/UU5FFIPYHVMMIZFO6S4SY27VNT","download_json":"https://pith.science/pith/UU5FFIPYHVMMIZFO6S4SY27VNT.json","view_paper":"https://pith.science/paper/UU5FFIPY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1103.2724&json=true","fetch_graph":"https://pith.science/api/pith-number/UU5FFIPYHVMMIZFO6S4SY27VNT/graph.json","fetch_events":"https://pith.science/api/pith-number/UU5FFIPYHVMMIZFO6S4SY27VNT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UU5FFIPYHVMMIZFO6S4SY27VNT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UU5FFIPYHVMMIZFO6S4SY27VNT/action/storage_attestation","attest_author":"https://pith.science/pith/UU5FFIPYHVMMIZFO6S4SY27VNT/action/author_attestation","sign_citation":"https://pith.science/pith/UU5FFIPYHVMMIZFO6S4SY27VNT/action/citation_signature","submit_replication":"https://pith.science/pith/UU5FFIPYHVMMIZFO6S4SY27VNT/action/replication_record"}},"created_at":"2026-05-18T04:26:54.301886+00:00","updated_at":"2026-05-18T04:26:54.301886+00:00"}