{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:2S4VBKJ2F5RKZXPS4JCJANINVL","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":"cc7926e8db346c4bff635d20b1f9e88c0591d6026df6ae0d4846bacf2772b104","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-11-03T16:14:13Z","title_canon_sha256":"a51974f18789f3e28b0e4540330dc3b8af625d63788758b188af00ea0510aee6"},"schema_version":"1.0","source":{"id":"1411.0544","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.0544","created_at":"2026-05-18T02:33:24Z"},{"alias_kind":"arxiv_version","alias_value":"1411.0544v3","created_at":"2026-05-18T02:33:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.0544","created_at":"2026-05-18T02:33:24Z"},{"alias_kind":"pith_short_12","alias_value":"2S4VBKJ2F5RK","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"2S4VBKJ2F5RKZXPS","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"2S4VBKJ2","created_at":"2026-05-18T12:28:11Z"}],"graph_snapshots":[{"event_id":"sha256:6f85db7c262014d6b56d77f927a33c1a61a5b32cd16107df035a5d2a716f0c1c","target":"graph","created_at":"2026-05-18T02:33:24Z","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":"The number of triangulations of a planar n point set is known to be $c^n$, where the base $c$ lies between $2.43$ and $30.$ The fastest known algorithm for counting triangulations of a planar n point set runs in $O^*(2^n)$ time. The fastest known arbitrarily close approximation algorithm for the base of the number of triangulations of a planar n point set runs in time subexponential in $n.$ We present the first quasi-polynomial approximation scheme for the base of the number of triangulations of a planar point set.","authors_text":"Andrzej Lingas, Dzmitry Sledneu, Marek Karpinski","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-11-03T16:14:13Z","title":"A QPTAS for the Base of the Number of Triangulations of a Planar Point Set"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.0544","kind":"arxiv","version":3},"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:e58ead50b2ca2c99008164e88f5f45ed6c003b9f1dffba51b855310625faa2bb","target":"record","created_at":"2026-05-18T02:33:24Z","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":"cc7926e8db346c4bff635d20b1f9e88c0591d6026df6ae0d4846bacf2772b104","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-11-03T16:14:13Z","title_canon_sha256":"a51974f18789f3e28b0e4540330dc3b8af625d63788758b188af00ea0510aee6"},"schema_version":"1.0","source":{"id":"1411.0544","kind":"arxiv","version":3}},"canonical_sha256":"d4b950a93a2f62acddf2e24490350daaf4e06d515364bade032dec454dac40e5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d4b950a93a2f62acddf2e24490350daaf4e06d515364bade032dec454dac40e5","first_computed_at":"2026-05-18T02:33:24.891727Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:33:24.891727Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8ek8YW3IOX/iMiW9b+yO+40W1F1j1GmYVq9xczEVrM87R147s0I1fyeIieCq1kR6VVZzDz8oKxE9oavc9YsPDw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:33:24.892308Z","signed_message":"canonical_sha256_bytes"},"source_id":"1411.0544","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e58ead50b2ca2c99008164e88f5f45ed6c003b9f1dffba51b855310625faa2bb","sha256:6f85db7c262014d6b56d77f927a33c1a61a5b32cd16107df035a5d2a716f0c1c"],"state_sha256":"b661c0feb33d072fe90c4357d0075170118c0e291392642676ebdab54b3c3e6b"}