{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:YXFHAVEAGXQAWRRELEO2AMUKHN","short_pith_number":"pith:YXFHAVEA","schema_version":"1.0","canonical_sha256":"c5ca70548035e00b4624591da0328a3b7d4543ec4f1a8ca403ea50f1dd6402f7","source":{"kind":"arxiv","id":"1109.5596","version":1},"attestation_state":"computed","paper":{"title":"Counting Plane Graphs: Perfect Matchings, Spanning Cycles, and Kasteleyn's Technique","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Adam Sheffer, Emo Welzl, Micha Sharir","submitted_at":"2011-09-26T15:12:14Z","abstract_excerpt":"We derive improved upper bounds on the number of crossing-free straight-edge spanning cycles (also known as Hamiltonian tours and simple polygonizations) that can be embedded over any specific set of $N$ points in the plane. More specifically, we bound the ratio between the number of spanning cycles (or perfect matchings) that can be embedded over a point set and the number of triangulations that can be embedded over it. The respective bounds are $O(1.8181^N)$ for cycles and $O(1.1067^N)$ for matchings. These imply a new upper bound of $O(54.543^N)$ on the number of crossing-free straight-edge"},"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":"1109.5596","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-09-26T15:12:14Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"18918855a9c16667ab1656af5d9e37151d44b99e3aae97ba355c9a6490209bd8","abstract_canon_sha256":"c464df26058bc53bf6307e6348b80f13aae72c0833a73940c99ceb6653843cb7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:12:19.135466Z","signature_b64":"Aq8940wgaW7XPWbsDGg2pf/VqDwaLLpqDqBAgfjqWytGh/oAiriDkzDyEIiM1KYK7TefqeLoOTYAzeAzJFKwCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c5ca70548035e00b4624591da0328a3b7d4543ec4f1a8ca403ea50f1dd6402f7","last_reissued_at":"2026-05-18T04:12:19.134915Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:12:19.134915Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Counting Plane Graphs: Perfect Matchings, Spanning Cycles, and Kasteleyn's Technique","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Adam Sheffer, Emo Welzl, Micha Sharir","submitted_at":"2011-09-26T15:12:14Z","abstract_excerpt":"We derive improved upper bounds on the number of crossing-free straight-edge spanning cycles (also known as Hamiltonian tours and simple polygonizations) that can be embedded over any specific set of $N$ points in the plane. More specifically, we bound the ratio between the number of spanning cycles (or perfect matchings) that can be embedded over a point set and the number of triangulations that can be embedded over it. The respective bounds are $O(1.8181^N)$ for cycles and $O(1.1067^N)$ for matchings. These imply a new upper bound of $O(54.543^N)$ on the number of crossing-free straight-edge"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.5596","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":"1109.5596","created_at":"2026-05-18T04:12:19.134992+00:00"},{"alias_kind":"arxiv_version","alias_value":"1109.5596v1","created_at":"2026-05-18T04:12:19.134992+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.5596","created_at":"2026-05-18T04:12:19.134992+00:00"},{"alias_kind":"pith_short_12","alias_value":"YXFHAVEAGXQA","created_at":"2026-05-18T12:26:47.523578+00:00"},{"alias_kind":"pith_short_16","alias_value":"YXFHAVEAGXQAWRRE","created_at":"2026-05-18T12:26:47.523578+00:00"},{"alias_kind":"pith_short_8","alias_value":"YXFHAVEA","created_at":"2026-05-18T12:26:47.523578+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/YXFHAVEAGXQAWRRELEO2AMUKHN","json":"https://pith.science/pith/YXFHAVEAGXQAWRRELEO2AMUKHN.json","graph_json":"https://pith.science/api/pith-number/YXFHAVEAGXQAWRRELEO2AMUKHN/graph.json","events_json":"https://pith.science/api/pith-number/YXFHAVEAGXQAWRRELEO2AMUKHN/events.json","paper":"https://pith.science/paper/YXFHAVEA"},"agent_actions":{"view_html":"https://pith.science/pith/YXFHAVEAGXQAWRRELEO2AMUKHN","download_json":"https://pith.science/pith/YXFHAVEAGXQAWRRELEO2AMUKHN.json","view_paper":"https://pith.science/paper/YXFHAVEA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1109.5596&json=true","fetch_graph":"https://pith.science/api/pith-number/YXFHAVEAGXQAWRRELEO2AMUKHN/graph.json","fetch_events":"https://pith.science/api/pith-number/YXFHAVEAGXQAWRRELEO2AMUKHN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YXFHAVEAGXQAWRRELEO2AMUKHN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YXFHAVEAGXQAWRRELEO2AMUKHN/action/storage_attestation","attest_author":"https://pith.science/pith/YXFHAVEAGXQAWRRELEO2AMUKHN/action/author_attestation","sign_citation":"https://pith.science/pith/YXFHAVEAGXQAWRRELEO2AMUKHN/action/citation_signature","submit_replication":"https://pith.science/pith/YXFHAVEAGXQAWRRELEO2AMUKHN/action/replication_record"}},"created_at":"2026-05-18T04:12:19.134992+00:00","updated_at":"2026-05-18T04:12:19.134992+00:00"}