{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:3AXRW75HL6Z3WQZD5DJPINRPWD","short_pith_number":"pith:3AXRW75H","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"},"canonical_sha256":"d82f1b7fa75fb3bb4323e8d2f4362fb0c636a1901307cd78589265b8d202f485","source":{"kind":"arxiv","id":"1012.2206","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1012.2206","created_at":"2026-05-18T04:33:38Z"},{"alias_kind":"arxiv_version","alias_value":"1012.2206v1","created_at":"2026-05-18T04:33:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.2206","created_at":"2026-05-18T04:33:38Z"},{"alias_kind":"pith_short_12","alias_value":"3AXRW75HL6Z3","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_16","alias_value":"3AXRW75HL6Z3WQZD","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_8","alias_value":"3AXRW75H","created_at":"2026-05-18T12:26:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:3AXRW75HL6Z3WQZD5DJPINRPWD","target":"record","payload":{"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"},"canonical_sha256":"d82f1b7fa75fb3bb4323e8d2f4362fb0c636a1901307cd78589265b8d202f485","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"},"source_kind":"arxiv","source_id":"1012.2206","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:33:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ORBqGCWPfZBx1YTH9/kDdXZt5VJqOgIODyK7zvaVX24cBX4YN/81UYdAMghK6dd4q+k4RuJRCrM3DjJwxnuXBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T06:50:22.138488Z"},"content_sha256":"277281c5680ad52e4851141c7f595c0f1ef004e72621655e0ad3ad0412e758b3","schema_version":"1.0","event_id":"sha256:277281c5680ad52e4851141c7f595c0f1ef004e72621655e0ad3ad0412e758b3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:3AXRW75HL6Z3WQZD5DJPINRPWD","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:33:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zK7P/JMxfxBjrBRzY2XEHr+Qn+E47DFejjb8thuezXQAjJHIBZz7hTbRLSgAjM9XSItFlpu316jhx9AnTSdXDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T06:50:22.138843Z"},"content_sha256":"5b6b99a593fee1022d0eae218aeb21db61965832107ac699a00ebe2aba13a7bf","schema_version":"1.0","event_id":"sha256:5b6b99a593fee1022d0eae218aeb21db61965832107ac699a00ebe2aba13a7bf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3AXRW75HL6Z3WQZD5DJPINRPWD/bundle.json","state_url":"https://pith.science/pith/3AXRW75HL6Z3WQZD5DJPINRPWD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3AXRW75HL6Z3WQZD5DJPINRPWD/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-12T06:50:22Z","links":{"resolver":"https://pith.science/pith/3AXRW75HL6Z3WQZD5DJPINRPWD","bundle":"https://pith.science/pith/3AXRW75HL6Z3WQZD5DJPINRPWD/bundle.json","state":"https://pith.science/pith/3AXRW75HL6Z3WQZD5DJPINRPWD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3AXRW75HL6Z3WQZD5DJPINRPWD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:3AXRW75HL6Z3WQZD5DJPINRPWD","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"d3d2d343f7cce7f4f5b5c786b71a0e0e495751d86c275fcd40601088eeb589a7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-12-10T08:54:18Z","title_canon_sha256":"170856bdfb393dff66ccafb852f7330ab3fcb7d62e11a54df951571ad46d9461"},"schema_version":"1.0","source":{"id":"1012.2206","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1012.2206","created_at":"2026-05-18T04:33:38Z"},{"alias_kind":"arxiv_version","alias_value":"1012.2206v1","created_at":"2026-05-18T04:33:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.2206","created_at":"2026-05-18T04:33:38Z"},{"alias_kind":"pith_short_12","alias_value":"3AXRW75HL6Z3","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_16","alias_value":"3AXRW75HL6Z3WQZD","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_8","alias_value":"3AXRW75H","created_at":"2026-05-18T12:26:03Z"}],"graph_snapshots":[{"event_id":"sha256:5b6b99a593fee1022d0eae218aeb21db61965832107ac699a00ebe2aba13a7bf","target":"graph","created_at":"2026-05-18T04:33:38Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Fr\\'ed\\'eric Mouton (IF), Roland Bacher (IF)","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-12-10T08:54:18Z","title":"Triangulations of nearly convex polygons"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.2206","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:277281c5680ad52e4851141c7f595c0f1ef004e72621655e0ad3ad0412e758b3","target":"record","created_at":"2026-05-18T04:33:38Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"d3d2d343f7cce7f4f5b5c786b71a0e0e495751d86c275fcd40601088eeb589a7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-12-10T08:54:18Z","title_canon_sha256":"170856bdfb393dff66ccafb852f7330ab3fcb7d62e11a54df951571ad46d9461"},"schema_version":"1.0","source":{"id":"1012.2206","kind":"arxiv","version":1}},"canonical_sha256":"d82f1b7fa75fb3bb4323e8d2f4362fb0c636a1901307cd78589265b8d202f485","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d82f1b7fa75fb3bb4323e8d2f4362fb0c636a1901307cd78589265b8d202f485","first_computed_at":"2026-05-18T04:33:38.298168Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:33:38.298168Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"c1oMKP1yX9m3MXKPypeUXgYPgxufQ5hiZ8+0oTDBhSdxktlbMo1Um2jqtJSTKuo94m50k405zr3qM9x1x/bPDg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:33:38.298737Z","signed_message":"canonical_sha256_bytes"},"source_id":"1012.2206","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:277281c5680ad52e4851141c7f595c0f1ef004e72621655e0ad3ad0412e758b3","sha256:5b6b99a593fee1022d0eae218aeb21db61965832107ac699a00ebe2aba13a7bf"],"state_sha256":"e606aeb0423974c40988fb4a381b5308615ac29b95d2c50f4560153b7bd7271e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uZ36n3S4sYjpWiVVVCRsyRBDPPQjc7wmabJkft1mbIQNXtAENO25X8PQJLMd5GnLHZo1KQW2c3K/RJyf1DZhBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T06:50:22.140973Z","bundle_sha256":"dd72bed0869101d0f333f622f0bb30e822b033ebdd2097a687321140bc5bbbf8"}}