{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:PU2KZP3NO7MLSJOI5463FTDR3F","short_pith_number":"pith:PU2KZP3N","schema_version":"1.0","canonical_sha256":"7d34acbf6d77d8b925c8ef3db2cc71d95739ddf670cb28a673cb8ad3effd6214","source":{"kind":"arxiv","id":"1209.3954","version":1},"attestation_state":"computed","paper":{"title":"How Many Potatoes are in a Mesh?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","math.CO"],"primary_cat":"cs.DM","authors_text":"J\\'anos Pach, Maarten L\\\"offler, Marc van Kreveld","submitted_at":"2012-09-18T13:25:40Z","abstract_excerpt":"We consider the combinatorial question of how many convex polygons can be made by using the edges taken from a fixed triangulation of n vertices. For general triangulations, there can be exponentially many: we show a construction that has Omega(1.5028^n) convex polygons, and prove an O(1.62^n) upper bound in the worst case. If the triangulation is fat (every triangle has its angles lower-bounded by a constant delta>0), then there can be only polynomially many.\n  We also consider the problem of counting convex outerplanar polygons (i.e., they contain no vertices of the triangulation in their in"},"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":"1209.3954","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-09-18T13:25:40Z","cross_cats_sorted":["cs.CG","math.CO"],"title_canon_sha256":"ba457c418448f8c2aac70bc13830a2bc6e48d86ef17103b0556084215b00b1c0","abstract_canon_sha256":"2b4b2b31f82dcd7e7bafd2b40a020c41e682aaeadacfc109ef6229c69a49c2cc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:45:22.157330Z","signature_b64":"VeM3V0O9bLWFkJCLV+l1erR0Tokj8ThKBBrdkaicqz4UF2BEMBgb5UUWlI+bQyAUzxo/9d3c+I2439iMIO4PBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7d34acbf6d77d8b925c8ef3db2cc71d95739ddf670cb28a673cb8ad3effd6214","last_reissued_at":"2026-05-18T03:45:22.156847Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:45:22.156847Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"How Many Potatoes are in a Mesh?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","math.CO"],"primary_cat":"cs.DM","authors_text":"J\\'anos Pach, Maarten L\\\"offler, Marc van Kreveld","submitted_at":"2012-09-18T13:25:40Z","abstract_excerpt":"We consider the combinatorial question of how many convex polygons can be made by using the edges taken from a fixed triangulation of n vertices. For general triangulations, there can be exponentially many: we show a construction that has Omega(1.5028^n) convex polygons, and prove an O(1.62^n) upper bound in the worst case. If the triangulation is fat (every triangle has its angles lower-bounded by a constant delta>0), then there can be only polynomially many.\n  We also consider the problem of counting convex outerplanar polygons (i.e., they contain no vertices of the triangulation in their in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.3954","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":"1209.3954","created_at":"2026-05-18T03:45:22.156921+00:00"},{"alias_kind":"arxiv_version","alias_value":"1209.3954v1","created_at":"2026-05-18T03:45:22.156921+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.3954","created_at":"2026-05-18T03:45:22.156921+00:00"},{"alias_kind":"pith_short_12","alias_value":"PU2KZP3NO7ML","created_at":"2026-05-18T12:27:18.751474+00:00"},{"alias_kind":"pith_short_16","alias_value":"PU2KZP3NO7MLSJOI","created_at":"2026-05-18T12:27:18.751474+00:00"},{"alias_kind":"pith_short_8","alias_value":"PU2KZP3N","created_at":"2026-05-18T12:27:18.751474+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/PU2KZP3NO7MLSJOI5463FTDR3F","json":"https://pith.science/pith/PU2KZP3NO7MLSJOI5463FTDR3F.json","graph_json":"https://pith.science/api/pith-number/PU2KZP3NO7MLSJOI5463FTDR3F/graph.json","events_json":"https://pith.science/api/pith-number/PU2KZP3NO7MLSJOI5463FTDR3F/events.json","paper":"https://pith.science/paper/PU2KZP3N"},"agent_actions":{"view_html":"https://pith.science/pith/PU2KZP3NO7MLSJOI5463FTDR3F","download_json":"https://pith.science/pith/PU2KZP3NO7MLSJOI5463FTDR3F.json","view_paper":"https://pith.science/paper/PU2KZP3N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1209.3954&json=true","fetch_graph":"https://pith.science/api/pith-number/PU2KZP3NO7MLSJOI5463FTDR3F/graph.json","fetch_events":"https://pith.science/api/pith-number/PU2KZP3NO7MLSJOI5463FTDR3F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PU2KZP3NO7MLSJOI5463FTDR3F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PU2KZP3NO7MLSJOI5463FTDR3F/action/storage_attestation","attest_author":"https://pith.science/pith/PU2KZP3NO7MLSJOI5463FTDR3F/action/author_attestation","sign_citation":"https://pith.science/pith/PU2KZP3NO7MLSJOI5463FTDR3F/action/citation_signature","submit_replication":"https://pith.science/pith/PU2KZP3NO7MLSJOI5463FTDR3F/action/replication_record"}},"created_at":"2026-05-18T03:45:22.156921+00:00","updated_at":"2026-05-18T03:45:22.156921+00:00"}