{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:L7A45FOUFUDRRBAQXIS2D5DYIS","short_pith_number":"pith:L7A45FOU","schema_version":"1.0","canonical_sha256":"5fc1ce95d42d07188410ba25a1f47844a56380fe7b6ba82dbef62bce81869014","source":{"kind":"arxiv","id":"1604.05350","version":1},"attestation_state":"computed","paper":{"title":"Counting and Enumerating Crossing-free Geometric Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Manuel Wettstein","submitted_at":"2016-04-18T21:03:31Z","abstract_excerpt":"We describe a framework for counting and enumerating various types of crossing-free geometric graphs on a planar point set. The framework generalizes ideas of Alvarez and Seidel, who used them to count triangulations in time $O(2^nn^2)$ where $n$ is the number of points. The main idea is to reduce the problem of counting geometric graphs to counting source-sink paths in a directed acyclic graph.\n  The following new results will emerge. The number of all crossing-free geometric graphs can be computed in time $O(c^nn^4)$ for some $c < 2.83929$. The number of crossing-free convex partitions can b"},"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":"1604.05350","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-04-18T21:03:31Z","cross_cats_sorted":[],"title_canon_sha256":"9dc8a57c6f4cdf504afe8ba5d8c4e8cc0128ac0692f38931f8a73d80e20adff1","abstract_canon_sha256":"ff08a80429427b46eeb5a86ea977f3e327fe06f6e3e607c0576250502924ee12"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:16:54.224745Z","signature_b64":"c/EEbUhSjjuGNS+IPn/OeqNN6hkkgEdK6ciptchG/XsCcph1U4zEP1aukR4d3QC3ZnhyGY3gtEqmkGEqvK33BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5fc1ce95d42d07188410ba25a1f47844a56380fe7b6ba82dbef62bce81869014","last_reissued_at":"2026-05-18T01:16:54.224143Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:16:54.224143Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Counting and Enumerating Crossing-free Geometric Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Manuel Wettstein","submitted_at":"2016-04-18T21:03:31Z","abstract_excerpt":"We describe a framework for counting and enumerating various types of crossing-free geometric graphs on a planar point set. The framework generalizes ideas of Alvarez and Seidel, who used them to count triangulations in time $O(2^nn^2)$ where $n$ is the number of points. The main idea is to reduce the problem of counting geometric graphs to counting source-sink paths in a directed acyclic graph.\n  The following new results will emerge. The number of all crossing-free geometric graphs can be computed in time $O(c^nn^4)$ for some $c < 2.83929$. The number of crossing-free convex partitions can b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.05350","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":"1604.05350","created_at":"2026-05-18T01:16:54.224231+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.05350v1","created_at":"2026-05-18T01:16:54.224231+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.05350","created_at":"2026-05-18T01:16:54.224231+00:00"},{"alias_kind":"pith_short_12","alias_value":"L7A45FOUFUDR","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_16","alias_value":"L7A45FOUFUDRRBAQ","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_8","alias_value":"L7A45FOU","created_at":"2026-05-18T12:30:29.479603+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/L7A45FOUFUDRRBAQXIS2D5DYIS","json":"https://pith.science/pith/L7A45FOUFUDRRBAQXIS2D5DYIS.json","graph_json":"https://pith.science/api/pith-number/L7A45FOUFUDRRBAQXIS2D5DYIS/graph.json","events_json":"https://pith.science/api/pith-number/L7A45FOUFUDRRBAQXIS2D5DYIS/events.json","paper":"https://pith.science/paper/L7A45FOU"},"agent_actions":{"view_html":"https://pith.science/pith/L7A45FOUFUDRRBAQXIS2D5DYIS","download_json":"https://pith.science/pith/L7A45FOUFUDRRBAQXIS2D5DYIS.json","view_paper":"https://pith.science/paper/L7A45FOU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.05350&json=true","fetch_graph":"https://pith.science/api/pith-number/L7A45FOUFUDRRBAQXIS2D5DYIS/graph.json","fetch_events":"https://pith.science/api/pith-number/L7A45FOUFUDRRBAQXIS2D5DYIS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L7A45FOUFUDRRBAQXIS2D5DYIS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L7A45FOUFUDRRBAQXIS2D5DYIS/action/storage_attestation","attest_author":"https://pith.science/pith/L7A45FOUFUDRRBAQXIS2D5DYIS/action/author_attestation","sign_citation":"https://pith.science/pith/L7A45FOUFUDRRBAQXIS2D5DYIS/action/citation_signature","submit_replication":"https://pith.science/pith/L7A45FOUFUDRRBAQXIS2D5DYIS/action/replication_record"}},"created_at":"2026-05-18T01:16:54.224231+00:00","updated_at":"2026-05-18T01:16:54.224231+00:00"}