{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:2S4VBKJ2F5RKZXPS4JCJANINVL","short_pith_number":"pith:2S4VBKJ2","schema_version":"1.0","canonical_sha256":"d4b950a93a2f62acddf2e24490350daaf4e06d515364bade032dec454dac40e5","source":{"kind":"arxiv","id":"1411.0544","version":3},"attestation_state":"computed","paper":{"title":"A QPTAS for the Base of the Number of Triangulations of a Planar Point Set","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Andrzej Lingas, Dzmitry Sledneu, Marek Karpinski","submitted_at":"2014-11-03T16:14:13Z","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."},"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.0544","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-11-03T16:14:13Z","cross_cats_sorted":[],"title_canon_sha256":"a51974f18789f3e28b0e4540330dc3b8af625d63788758b188af00ea0510aee6","abstract_canon_sha256":"cc7926e8db346c4bff635d20b1f9e88c0591d6026df6ae0d4846bacf2772b104"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:33:24.892308Z","signature_b64":"8ek8YW3IOX/iMiW9b+yO+40W1F1j1GmYVq9xczEVrM87R147s0I1fyeIieCq1kR6VVZzDz8oKxE9oavc9YsPDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d4b950a93a2f62acddf2e24490350daaf4e06d515364bade032dec454dac40e5","last_reissued_at":"2026-05-18T02:33:24.891727Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:33:24.891727Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A QPTAS for the Base of the Number of Triangulations of a Planar Point Set","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Andrzej Lingas, Dzmitry Sledneu, Marek Karpinski","submitted_at":"2014-11-03T16:14:13Z","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."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.0544","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.0544","created_at":"2026-05-18T02:33:24.891811+00:00"},{"alias_kind":"arxiv_version","alias_value":"1411.0544v3","created_at":"2026-05-18T02:33:24.891811+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.0544","created_at":"2026-05-18T02:33:24.891811+00:00"},{"alias_kind":"pith_short_12","alias_value":"2S4VBKJ2F5RK","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_16","alias_value":"2S4VBKJ2F5RKZXPS","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_8","alias_value":"2S4VBKJ2","created_at":"2026-05-18T12:28:11.866339+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/2S4VBKJ2F5RKZXPS4JCJANINVL","json":"https://pith.science/pith/2S4VBKJ2F5RKZXPS4JCJANINVL.json","graph_json":"https://pith.science/api/pith-number/2S4VBKJ2F5RKZXPS4JCJANINVL/graph.json","events_json":"https://pith.science/api/pith-number/2S4VBKJ2F5RKZXPS4JCJANINVL/events.json","paper":"https://pith.science/paper/2S4VBKJ2"},"agent_actions":{"view_html":"https://pith.science/pith/2S4VBKJ2F5RKZXPS4JCJANINVL","download_json":"https://pith.science/pith/2S4VBKJ2F5RKZXPS4JCJANINVL.json","view_paper":"https://pith.science/paper/2S4VBKJ2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1411.0544&json=true","fetch_graph":"https://pith.science/api/pith-number/2S4VBKJ2F5RKZXPS4JCJANINVL/graph.json","fetch_events":"https://pith.science/api/pith-number/2S4VBKJ2F5RKZXPS4JCJANINVL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2S4VBKJ2F5RKZXPS4JCJANINVL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2S4VBKJ2F5RKZXPS4JCJANINVL/action/storage_attestation","attest_author":"https://pith.science/pith/2S4VBKJ2F5RKZXPS4JCJANINVL/action/author_attestation","sign_citation":"https://pith.science/pith/2S4VBKJ2F5RKZXPS4JCJANINVL/action/citation_signature","submit_replication":"https://pith.science/pith/2S4VBKJ2F5RKZXPS4JCJANINVL/action/replication_record"}},"created_at":"2026-05-18T02:33:24.891811+00:00","updated_at":"2026-05-18T02:33:24.891811+00:00"}