{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:332KW6SFCO5PD7RLXJCI27V3YW","short_pith_number":"pith:332KW6SF","schema_version":"1.0","canonical_sha256":"def4ab7a4513baf1fe2bba448d7ebbc58eb09ebdf329be35952b86efb7b5feb0","source":{"kind":"arxiv","id":"1404.0261","version":1},"attestation_state":"computed","paper":{"title":"Counting Triangulations and other Crossing-Free Structures Approximately","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Karl Bringmann, Raimund Seidel, Saurabh Ray, Victor Alvarez","submitted_at":"2014-04-01T14:42:48Z","abstract_excerpt":"We consider the problem of counting straight-edge triangulations of a given set $P$ of $n$ points in the plane. Until very recently it was not known whether the exact number of triangulations of $P$ can be computed asymptotically faster than by enumerating all triangulations. We now know that the number of triangulations of $P$ can be computed in $O^{*}(2^{n})$ time, which is less than the lower bound of $\\Omega(2.43^{n})$ on the number of triangulations of any point set. In this paper we address the question of whether one can approximately count triangulations in sub-exponential time. We pre"},"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":"1404.0261","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-04-01T14:42:48Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"38f92e92032c5bda461ce7ece2facb0f033c27f600369215982667813b184733","abstract_canon_sha256":"8fec4905443e95e01b71122f39258cf674c79449b316e2737e68a88b931488c2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:55:04.792726Z","signature_b64":"w29eb3mYO+94DytQh87+2xug6WYEQwC5/wkfZG3SyVRHdK1YcoEc9GbV7XxqdQZmaht0SAqXYVNPRXNiSMe/Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"def4ab7a4513baf1fe2bba448d7ebbc58eb09ebdf329be35952b86efb7b5feb0","last_reissued_at":"2026-05-18T02:55:04.792274Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:55:04.792274Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Counting Triangulations and other Crossing-Free Structures Approximately","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Karl Bringmann, Raimund Seidel, Saurabh Ray, Victor Alvarez","submitted_at":"2014-04-01T14:42:48Z","abstract_excerpt":"We consider the problem of counting straight-edge triangulations of a given set $P$ of $n$ points in the plane. Until very recently it was not known whether the exact number of triangulations of $P$ can be computed asymptotically faster than by enumerating all triangulations. We now know that the number of triangulations of $P$ can be computed in $O^{*}(2^{n})$ time, which is less than the lower bound of $\\Omega(2.43^{n})$ on the number of triangulations of any point set. In this paper we address the question of whether one can approximately count triangulations in sub-exponential time. We pre"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.0261","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":"1404.0261","created_at":"2026-05-18T02:55:04.792352+00:00"},{"alias_kind":"arxiv_version","alias_value":"1404.0261v1","created_at":"2026-05-18T02:55:04.792352+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.0261","created_at":"2026-05-18T02:55:04.792352+00:00"},{"alias_kind":"pith_short_12","alias_value":"332KW6SFCO5P","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_16","alias_value":"332KW6SFCO5PD7RL","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_8","alias_value":"332KW6SF","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/332KW6SFCO5PD7RLXJCI27V3YW","json":"https://pith.science/pith/332KW6SFCO5PD7RLXJCI27V3YW.json","graph_json":"https://pith.science/api/pith-number/332KW6SFCO5PD7RLXJCI27V3YW/graph.json","events_json":"https://pith.science/api/pith-number/332KW6SFCO5PD7RLXJCI27V3YW/events.json","paper":"https://pith.science/paper/332KW6SF"},"agent_actions":{"view_html":"https://pith.science/pith/332KW6SFCO5PD7RLXJCI27V3YW","download_json":"https://pith.science/pith/332KW6SFCO5PD7RLXJCI27V3YW.json","view_paper":"https://pith.science/paper/332KW6SF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1404.0261&json=true","fetch_graph":"https://pith.science/api/pith-number/332KW6SFCO5PD7RLXJCI27V3YW/graph.json","fetch_events":"https://pith.science/api/pith-number/332KW6SFCO5PD7RLXJCI27V3YW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/332KW6SFCO5PD7RLXJCI27V3YW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/332KW6SFCO5PD7RLXJCI27V3YW/action/storage_attestation","attest_author":"https://pith.science/pith/332KW6SFCO5PD7RLXJCI27V3YW/action/author_attestation","sign_citation":"https://pith.science/pith/332KW6SFCO5PD7RLXJCI27V3YW/action/citation_signature","submit_replication":"https://pith.science/pith/332KW6SFCO5PD7RLXJCI27V3YW/action/replication_record"}},"created_at":"2026-05-18T02:55:04.792352+00:00","updated_at":"2026-05-18T02:55:04.792352+00:00"}