{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:B3LY7KK6CUVX4DFNXNVXLX5ENB","short_pith_number":"pith:B3LY7KK6","schema_version":"1.0","canonical_sha256":"0ed78fa95e152b7e0cadbb6b75dfa4685ccb00bd3aa8888bcd9fd9d40b1d54e6","source":{"kind":"arxiv","id":"1312.4628","version":1},"attestation_state":"computed","paper":{"title":"Counting Triangulations and other Crossing-free Structures via Onion Layers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS","math.CO"],"primary_cat":"cs.CG","authors_text":"Karl Bringmann, Radu Curticapean, Saurabh Ray, Victor Alvarez","submitted_at":"2013-12-17T03:41:41Z","abstract_excerpt":"Let $P$ be a set of $n$ points in the plane. A crossing-free structure on $P$ is a plane graph with vertex set $P$. Examples of crossing-free structures include triangulations of $P$, spanning cycles of $P$, also known as polygonalizations of $P$, among others. In this paper we develop a general technique for computing the number of crossing-free structures of an input set $P$. We apply the technique to obtain algorithms for computing the number of triangulations, matchings, and spanning cycles of $P$. The running time of our algorithms is upper bounded by $n^{O(k)}$, where $k$ is the number o"},"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":"1312.4628","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-12-17T03:41:41Z","cross_cats_sorted":["cs.CC","cs.DS","math.CO"],"title_canon_sha256":"8de900827e48998b736feb761ea65daa5d7bed48e3d3ee014f92cecefb606049","abstract_canon_sha256":"fc1f72615256e07124d6e3dde2b4cd85e35b85807c53a1abb0b27b298d466736"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:04:23.464572Z","signature_b64":"N9+XP5+LQcWO9cDUd3gwkhK1MidKzdPGp8OXMruHrhF6+Z209NHTHULQyyiLp0P7dweYI6CQU19BOLo22GYvBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0ed78fa95e152b7e0cadbb6b75dfa4685ccb00bd3aa8888bcd9fd9d40b1d54e6","last_reissued_at":"2026-05-18T03:04:23.464111Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:04:23.464111Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Counting Triangulations and other Crossing-free Structures via Onion Layers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS","math.CO"],"primary_cat":"cs.CG","authors_text":"Karl Bringmann, Radu Curticapean, Saurabh Ray, Victor Alvarez","submitted_at":"2013-12-17T03:41:41Z","abstract_excerpt":"Let $P$ be a set of $n$ points in the plane. A crossing-free structure on $P$ is a plane graph with vertex set $P$. Examples of crossing-free structures include triangulations of $P$, spanning cycles of $P$, also known as polygonalizations of $P$, among others. In this paper we develop a general technique for computing the number of crossing-free structures of an input set $P$. We apply the technique to obtain algorithms for computing the number of triangulations, matchings, and spanning cycles of $P$. The running time of our algorithms is upper bounded by $n^{O(k)}$, where $k$ is the number o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.4628","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":"1312.4628","created_at":"2026-05-18T03:04:23.464175+00:00"},{"alias_kind":"arxiv_version","alias_value":"1312.4628v1","created_at":"2026-05-18T03:04:23.464175+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.4628","created_at":"2026-05-18T03:04:23.464175+00:00"},{"alias_kind":"pith_short_12","alias_value":"B3LY7KK6CUVX","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_16","alias_value":"B3LY7KK6CUVX4DFN","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_8","alias_value":"B3LY7KK6","created_at":"2026-05-18T12:27:38.830355+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/B3LY7KK6CUVX4DFNXNVXLX5ENB","json":"https://pith.science/pith/B3LY7KK6CUVX4DFNXNVXLX5ENB.json","graph_json":"https://pith.science/api/pith-number/B3LY7KK6CUVX4DFNXNVXLX5ENB/graph.json","events_json":"https://pith.science/api/pith-number/B3LY7KK6CUVX4DFNXNVXLX5ENB/events.json","paper":"https://pith.science/paper/B3LY7KK6"},"agent_actions":{"view_html":"https://pith.science/pith/B3LY7KK6CUVX4DFNXNVXLX5ENB","download_json":"https://pith.science/pith/B3LY7KK6CUVX4DFNXNVXLX5ENB.json","view_paper":"https://pith.science/paper/B3LY7KK6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1312.4628&json=true","fetch_graph":"https://pith.science/api/pith-number/B3LY7KK6CUVX4DFNXNVXLX5ENB/graph.json","fetch_events":"https://pith.science/api/pith-number/B3LY7KK6CUVX4DFNXNVXLX5ENB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/B3LY7KK6CUVX4DFNXNVXLX5ENB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/B3LY7KK6CUVX4DFNXNVXLX5ENB/action/storage_attestation","attest_author":"https://pith.science/pith/B3LY7KK6CUVX4DFNXNVXLX5ENB/action/author_attestation","sign_citation":"https://pith.science/pith/B3LY7KK6CUVX4DFNXNVXLX5ENB/action/citation_signature","submit_replication":"https://pith.science/pith/B3LY7KK6CUVX4DFNXNVXLX5ENB/action/replication_record"}},"created_at":"2026-05-18T03:04:23.464175+00:00","updated_at":"2026-05-18T03:04:23.464175+00:00"}