{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:3AXRW75HL6Z3WQZD5DJPINRPWD","short_pith_number":"pith:3AXRW75H","schema_version":"1.0","canonical_sha256":"d82f1b7fa75fb3bb4323e8d2f4362fb0c636a1901307cd78589265b8d202f485","source":{"kind":"arxiv","id":"1012.2206","version":1},"attestation_state":"computed","paper":{"title":"Triangulations of nearly convex polygons","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Fr\\'ed\\'eric Mouton (IF), Roland Bacher (IF)","submitted_at":"2010-12-10T08:54:18Z","abstract_excerpt":"Counting Euclidean triangulations with vertices in a finite set $\\C$ of the convex hull $\\conv(\\C)$ of $\\C$ is difficult in general, both algorithmically and theoretically. The aim of this paper is to describe nearly convex polygons, a class of configurations for which this problem can be solved to some extent. Loosely speaking, a nearly convex polygon is an infinitesimal perturbation of a weakly convex polygon (a convex polygon with edges subdivided by additional points). Our main result shows that the triangulation polynomial, enumerating all triangulations of a nearly convex polygon, is def"},"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":"1012.2206","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-12-10T08:54:18Z","cross_cats_sorted":[],"title_canon_sha256":"170856bdfb393dff66ccafb852f7330ab3fcb7d62e11a54df951571ad46d9461","abstract_canon_sha256":"d3d2d343f7cce7f4f5b5c786b71a0e0e495751d86c275fcd40601088eeb589a7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:33:38.298737Z","signature_b64":"c1oMKP1yX9m3MXKPypeUXgYPgxufQ5hiZ8+0oTDBhSdxktlbMo1Um2jqtJSTKuo94m50k405zr3qM9x1x/bPDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d82f1b7fa75fb3bb4323e8d2f4362fb0c636a1901307cd78589265b8d202f485","last_reissued_at":"2026-05-18T04:33:38.298168Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:33:38.298168Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Triangulations of nearly convex polygons","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Fr\\'ed\\'eric Mouton (IF), Roland Bacher (IF)","submitted_at":"2010-12-10T08:54:18Z","abstract_excerpt":"Counting Euclidean triangulations with vertices in a finite set $\\C$ of the convex hull $\\conv(\\C)$ of $\\C$ is difficult in general, both algorithmically and theoretically. The aim of this paper is to describe nearly convex polygons, a class of configurations for which this problem can be solved to some extent. Loosely speaking, a nearly convex polygon is an infinitesimal perturbation of a weakly convex polygon (a convex polygon with edges subdivided by additional points). Our main result shows that the triangulation polynomial, enumerating all triangulations of a nearly convex polygon, is def"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.2206","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":"1012.2206","created_at":"2026-05-18T04:33:38.298258+00:00"},{"alias_kind":"arxiv_version","alias_value":"1012.2206v1","created_at":"2026-05-18T04:33:38.298258+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.2206","created_at":"2026-05-18T04:33:38.298258+00:00"},{"alias_kind":"pith_short_12","alias_value":"3AXRW75HL6Z3","created_at":"2026-05-18T12:26:03.138858+00:00"},{"alias_kind":"pith_short_16","alias_value":"3AXRW75HL6Z3WQZD","created_at":"2026-05-18T12:26:03.138858+00:00"},{"alias_kind":"pith_short_8","alias_value":"3AXRW75H","created_at":"2026-05-18T12:26:03.138858+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/3AXRW75HL6Z3WQZD5DJPINRPWD","json":"https://pith.science/pith/3AXRW75HL6Z3WQZD5DJPINRPWD.json","graph_json":"https://pith.science/api/pith-number/3AXRW75HL6Z3WQZD5DJPINRPWD/graph.json","events_json":"https://pith.science/api/pith-number/3AXRW75HL6Z3WQZD5DJPINRPWD/events.json","paper":"https://pith.science/paper/3AXRW75H"},"agent_actions":{"view_html":"https://pith.science/pith/3AXRW75HL6Z3WQZD5DJPINRPWD","download_json":"https://pith.science/pith/3AXRW75HL6Z3WQZD5DJPINRPWD.json","view_paper":"https://pith.science/paper/3AXRW75H","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1012.2206&json=true","fetch_graph":"https://pith.science/api/pith-number/3AXRW75HL6Z3WQZD5DJPINRPWD/graph.json","fetch_events":"https://pith.science/api/pith-number/3AXRW75HL6Z3WQZD5DJPINRPWD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3AXRW75HL6Z3WQZD5DJPINRPWD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3AXRW75HL6Z3WQZD5DJPINRPWD/action/storage_attestation","attest_author":"https://pith.science/pith/3AXRW75HL6Z3WQZD5DJPINRPWD/action/author_attestation","sign_citation":"https://pith.science/pith/3AXRW75HL6Z3WQZD5DJPINRPWD/action/citation_signature","submit_replication":"https://pith.science/pith/3AXRW75HL6Z3WQZD5DJPINRPWD/action/replication_record"}},"created_at":"2026-05-18T04:33:38.298258+00:00","updated_at":"2026-05-18T04:33:38.298258+00:00"}