{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:B5BPLT2K36TK5PIV7B4ZMME47D","short_pith_number":"pith:B5BPLT2K","schema_version":"1.0","canonical_sha256":"0f42f5cf4adfa6aebd15f87996309cf8fa8feff3d7284cd472257d0184bc96fd","source":{"kind":"arxiv","id":"2606.05721","version":1},"attestation_state":"computed","paper":{"title":"On the maximum number of $k$-holes in point sets with no $(k + 1)$-hole","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrew Suk, Su Zhou","submitted_at":"2026-06-04T05:25:07Z","abstract_excerpt":"The classical problem of Erd\\H{o}s asks for the minimum number of empty convex $k$-gons determined by an $n$-element point set in the plane. The celebrated empty hexagon theorem, proved independently by Gerken and Nicol\\'as, shows that every sufficiently large planar point set contains a $6$-hole, while Horton's famous construction shows the existence of arbitrarily large point sets with no $7$-hole. In this paper, we initiate the study of the maximum number of $k$-holes in planar point sets with no $(k+1)$-hole. More precisely, for each fixed $k\\geq 6$, let $h_k(n)$ be the maximum number of $"},"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":"2606.05721","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-04T05:25:07Z","cross_cats_sorted":[],"title_canon_sha256":"d64b4478d7eac1c51c24eabacc8e5d4f780e5eef1d0e070df6446f4fb6934507","abstract_canon_sha256":"3bbd6c49d82c75e7409bed936acb6970e18f20cbcec7b0f1c4aafa736edd8bc7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-05T01:15:00.279442Z","signature_b64":"euRoCiUbfPbEVqc4z663mn/YEu0e63PDtTgEN9fIRq9R0AihRm77enRGcocDrefVDyHUOQxw+myq7NnA1FdkDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0f42f5cf4adfa6aebd15f87996309cf8fa8feff3d7284cd472257d0184bc96fd","last_reissued_at":"2026-06-05T01:15:00.279003Z","signature_status":"signed_v1","first_computed_at":"2026-06-05T01:15:00.279003Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the maximum number of $k$-holes in point sets with no $(k + 1)$-hole","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrew Suk, Su Zhou","submitted_at":"2026-06-04T05:25:07Z","abstract_excerpt":"The classical problem of Erd\\H{o}s asks for the minimum number of empty convex $k$-gons determined by an $n$-element point set in the plane. The celebrated empty hexagon theorem, proved independently by Gerken and Nicol\\'as, shows that every sufficiently large planar point set contains a $6$-hole, while Horton's famous construction shows the existence of arbitrarily large point sets with no $7$-hole. In this paper, we initiate the study of the maximum number of $k$-holes in planar point sets with no $(k+1)$-hole. More precisely, for each fixed $k\\geq 6$, let $h_k(n)$ be the maximum number of $"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.05721","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.05721/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2606.05721","created_at":"2026-06-05T01:15:00.279067+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.05721v1","created_at":"2026-06-05T01:15:00.279067+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.05721","created_at":"2026-06-05T01:15:00.279067+00:00"},{"alias_kind":"pith_short_12","alias_value":"B5BPLT2K36TK","created_at":"2026-06-05T01:15:00.279067+00:00"},{"alias_kind":"pith_short_16","alias_value":"B5BPLT2K36TK5PIV","created_at":"2026-06-05T01:15:00.279067+00:00"},{"alias_kind":"pith_short_8","alias_value":"B5BPLT2K","created_at":"2026-06-05T01:15:00.279067+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2606.08762","citing_title":"Many holes but no large one: maximizing $k$-holes while forbidding $(k+1)$-holes","ref_index":16,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/B5BPLT2K36TK5PIV7B4ZMME47D","json":"https://pith.science/pith/B5BPLT2K36TK5PIV7B4ZMME47D.json","graph_json":"https://pith.science/api/pith-number/B5BPLT2K36TK5PIV7B4ZMME47D/graph.json","events_json":"https://pith.science/api/pith-number/B5BPLT2K36TK5PIV7B4ZMME47D/events.json","paper":"https://pith.science/paper/B5BPLT2K"},"agent_actions":{"view_html":"https://pith.science/pith/B5BPLT2K36TK5PIV7B4ZMME47D","download_json":"https://pith.science/pith/B5BPLT2K36TK5PIV7B4ZMME47D.json","view_paper":"https://pith.science/paper/B5BPLT2K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.05721&json=true","fetch_graph":"https://pith.science/api/pith-number/B5BPLT2K36TK5PIV7B4ZMME47D/graph.json","fetch_events":"https://pith.science/api/pith-number/B5BPLT2K36TK5PIV7B4ZMME47D/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/B5BPLT2K36TK5PIV7B4ZMME47D/action/timestamp_anchor","attest_storage":"https://pith.science/pith/B5BPLT2K36TK5PIV7B4ZMME47D/action/storage_attestation","attest_author":"https://pith.science/pith/B5BPLT2K36TK5PIV7B4ZMME47D/action/author_attestation","sign_citation":"https://pith.science/pith/B5BPLT2K36TK5PIV7B4ZMME47D/action/citation_signature","submit_replication":"https://pith.science/pith/B5BPLT2K36TK5PIV7B4ZMME47D/action/replication_record"}},"created_at":"2026-06-05T01:15:00.279067+00:00","updated_at":"2026-06-05T01:15:00.279067+00:00"}