{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:OMAH4ATTUDSIMSH2RSGVBORPXM","short_pith_number":"pith:OMAH4ATT","schema_version":"1.0","canonical_sha256":"73007e0273a0e48648fa8c8d50ba2fbb0c59e643b75340e24e93e58b7b9374b4","source":{"kind":"arxiv","id":"1206.5689","version":1},"attestation_state":"computed","paper":{"title":"A New Upper Bound for the VC-Dimension of Visibility Regions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Alexander Gilbers, Rolf Klein","submitted_at":"2012-06-25T14:12:52Z","abstract_excerpt":"In this paper we are proving the following fact. Let P be an arbitrary simple polygon, and let S be an arbitrary set of 15 points inside P. Then there exists a subset T of S that is not \"visually discernible\", that is, T is not equal to the intersection of S with the visibility region vis(v) of any point v in P. In other words, the VC-dimension d of visibility regions in a simple polygon cannot exceed 14. Since Valtr proved in 1998 that d \\in [6,23] holds, no progress has been made on this bound. By epsilon-net theorems our reduction immediately implies a smaller upper bound to the number of g"},"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":"1206.5689","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2012-06-25T14:12:52Z","cross_cats_sorted":[],"title_canon_sha256":"254bc4b0735e999fa5202193c05193b8b1e6d1a04c5a948765d305ba9f4ec72b","abstract_canon_sha256":"1331fc2cfe2a54aa2abd356ef99887a9838aca4ad52d9dd8ad2921e2ac163c2c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:52:39.321180Z","signature_b64":"yUVKp9EsFWjQGhLORoU24XjjAd6vcywlYsU0ioL0pWrAqD1sqXV69a9Zx173J319vEM/lqlHdoht2AMgtQtxBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"73007e0273a0e48648fa8c8d50ba2fbb0c59e643b75340e24e93e58b7b9374b4","last_reissued_at":"2026-05-18T03:52:39.320636Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:52:39.320636Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A New Upper Bound for the VC-Dimension of Visibility Regions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Alexander Gilbers, Rolf Klein","submitted_at":"2012-06-25T14:12:52Z","abstract_excerpt":"In this paper we are proving the following fact. Let P be an arbitrary simple polygon, and let S be an arbitrary set of 15 points inside P. Then there exists a subset T of S that is not \"visually discernible\", that is, T is not equal to the intersection of S with the visibility region vis(v) of any point v in P. In other words, the VC-dimension d of visibility regions in a simple polygon cannot exceed 14. Since Valtr proved in 1998 that d \\in [6,23] holds, no progress has been made on this bound. By epsilon-net theorems our reduction immediately implies a smaller upper bound to the number of g"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.5689","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":"1206.5689","created_at":"2026-05-18T03:52:39.320715+00:00"},{"alias_kind":"arxiv_version","alias_value":"1206.5689v1","created_at":"2026-05-18T03:52:39.320715+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.5689","created_at":"2026-05-18T03:52:39.320715+00:00"},{"alias_kind":"pith_short_12","alias_value":"OMAH4ATTUDSI","created_at":"2026-05-18T12:27:16.716162+00:00"},{"alias_kind":"pith_short_16","alias_value":"OMAH4ATTUDSIMSH2","created_at":"2026-05-18T12:27:16.716162+00:00"},{"alias_kind":"pith_short_8","alias_value":"OMAH4ATT","created_at":"2026-05-18T12:27:16.716162+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/OMAH4ATTUDSIMSH2RSGVBORPXM","json":"https://pith.science/pith/OMAH4ATTUDSIMSH2RSGVBORPXM.json","graph_json":"https://pith.science/api/pith-number/OMAH4ATTUDSIMSH2RSGVBORPXM/graph.json","events_json":"https://pith.science/api/pith-number/OMAH4ATTUDSIMSH2RSGVBORPXM/events.json","paper":"https://pith.science/paper/OMAH4ATT"},"agent_actions":{"view_html":"https://pith.science/pith/OMAH4ATTUDSIMSH2RSGVBORPXM","download_json":"https://pith.science/pith/OMAH4ATTUDSIMSH2RSGVBORPXM.json","view_paper":"https://pith.science/paper/OMAH4ATT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1206.5689&json=true","fetch_graph":"https://pith.science/api/pith-number/OMAH4ATTUDSIMSH2RSGVBORPXM/graph.json","fetch_events":"https://pith.science/api/pith-number/OMAH4ATTUDSIMSH2RSGVBORPXM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OMAH4ATTUDSIMSH2RSGVBORPXM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OMAH4ATTUDSIMSH2RSGVBORPXM/action/storage_attestation","attest_author":"https://pith.science/pith/OMAH4ATTUDSIMSH2RSGVBORPXM/action/author_attestation","sign_citation":"https://pith.science/pith/OMAH4ATTUDSIMSH2RSGVBORPXM/action/citation_signature","submit_replication":"https://pith.science/pith/OMAH4ATTUDSIMSH2RSGVBORPXM/action/replication_record"}},"created_at":"2026-05-18T03:52:39.320715+00:00","updated_at":"2026-05-18T03:52:39.320715+00:00"}