{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:FW5FVDN3EB3Q3TLAVASE44WBWK","short_pith_number":"pith:FW5FVDN3","schema_version":"1.0","canonical_sha256":"2dba5a8dbb20770dcd60a8244e72c1b29790f7fc1b7788d50d52077ebd0c5efa","source":{"kind":"arxiv","id":"1411.1303","version":3},"attestation_state":"computed","paper":{"title":"Convex polygons in geometric triangulations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"math.MG","authors_text":"Adrian Dumitrescu, Csaba D. T\\'oth","submitted_at":"2014-11-04T18:05:26Z","abstract_excerpt":"We show that the maximum number of convex polygons in a triangulation of $n$ points in the plane is $O(1.5029^n)$. This improves an earlier bound of $O(1.6181^n)$ established by van Kreveld, L\\\"offler, and Pach (2012) and almost matches the current best lower bound of $\\Omega(1.5028^n)$ due to the same authors. Given a planar straight-line graph $G$ with $n$ vertices, we show how to compute efficiently the number of convex polygons in $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":"1411.1303","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2014-11-04T18:05:26Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"a708fda7150538e84651acb1ec2541baf2302e4b51e461ede60252bcf4b2ae2c","abstract_canon_sha256":"f2eb066b5abdcb0676a9f9510ffa67147b1b5a1db459955deb6ba9338df8026f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:38:23.732269Z","signature_b64":"K3dPYby8U4iFgCRExg5+tDfSfQWxhNB4LetvcIrklqeL9WpDrJAqjmUzjXcxHLOxF1AkAhNnu6hj3ngJ9hKOBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2dba5a8dbb20770dcd60a8244e72c1b29790f7fc1b7788d50d52077ebd0c5efa","last_reissued_at":"2026-05-18T00:38:23.731480Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:38:23.731480Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Convex polygons in geometric triangulations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"math.MG","authors_text":"Adrian Dumitrescu, Csaba D. T\\'oth","submitted_at":"2014-11-04T18:05:26Z","abstract_excerpt":"We show that the maximum number of convex polygons in a triangulation of $n$ points in the plane is $O(1.5029^n)$. This improves an earlier bound of $O(1.6181^n)$ established by van Kreveld, L\\\"offler, and Pach (2012) and almost matches the current best lower bound of $\\Omega(1.5028^n)$ due to the same authors. Given a planar straight-line graph $G$ with $n$ vertices, we show how to compute efficiently the number of convex polygons in $G$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.1303","kind":"arxiv","version":3},"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":"1411.1303","created_at":"2026-05-18T00:38:23.731608+00:00"},{"alias_kind":"arxiv_version","alias_value":"1411.1303v3","created_at":"2026-05-18T00:38:23.731608+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.1303","created_at":"2026-05-18T00:38:23.731608+00:00"},{"alias_kind":"pith_short_12","alias_value":"FW5FVDN3EB3Q","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_16","alias_value":"FW5FVDN3EB3Q3TLA","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_8","alias_value":"FW5FVDN3","created_at":"2026-05-18T12:28:28.263976+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/FW5FVDN3EB3Q3TLAVASE44WBWK","json":"https://pith.science/pith/FW5FVDN3EB3Q3TLAVASE44WBWK.json","graph_json":"https://pith.science/api/pith-number/FW5FVDN3EB3Q3TLAVASE44WBWK/graph.json","events_json":"https://pith.science/api/pith-number/FW5FVDN3EB3Q3TLAVASE44WBWK/events.json","paper":"https://pith.science/paper/FW5FVDN3"},"agent_actions":{"view_html":"https://pith.science/pith/FW5FVDN3EB3Q3TLAVASE44WBWK","download_json":"https://pith.science/pith/FW5FVDN3EB3Q3TLAVASE44WBWK.json","view_paper":"https://pith.science/paper/FW5FVDN3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1411.1303&json=true","fetch_graph":"https://pith.science/api/pith-number/FW5FVDN3EB3Q3TLAVASE44WBWK/graph.json","fetch_events":"https://pith.science/api/pith-number/FW5FVDN3EB3Q3TLAVASE44WBWK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FW5FVDN3EB3Q3TLAVASE44WBWK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FW5FVDN3EB3Q3TLAVASE44WBWK/action/storage_attestation","attest_author":"https://pith.science/pith/FW5FVDN3EB3Q3TLAVASE44WBWK/action/author_attestation","sign_citation":"https://pith.science/pith/FW5FVDN3EB3Q3TLAVASE44WBWK/action/citation_signature","submit_replication":"https://pith.science/pith/FW5FVDN3EB3Q3TLAVASE44WBWK/action/replication_record"}},"created_at":"2026-05-18T00:38:23.731608+00:00","updated_at":"2026-05-18T00:38:23.731608+00:00"}