{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:LTV7P75YGBYWV5KSBYVPSV57IG","short_pith_number":"pith:LTV7P75Y","schema_version":"1.0","canonical_sha256":"5cebf7ffb830716af5520e2af957bf4191dd5d72b6211ea2f28b7d9739585f27","source":{"kind":"arxiv","id":"0912.0712","version":2},"attestation_state":"computed","paper":{"title":"On the number of spanning trees a planar graph can have","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andr\\'e Schulz, Kevin Buchin","submitted_at":"2009-12-03T19:11:39Z","abstract_excerpt":"We prove that any planar graph on $n$ vertices has less than $O(5{.}2852^n)$ spanning trees. Under the restriction that the planar graph is 3-connected and contains no triangle and no quadrilateral the number of its spanning trees is less than $O(2{.}7156^n)$. As a consequence of the latter the grid size needed to realize a 3d polytope with integer coordinates can be bounded by $O(147.{7}^n)$. Our observations imply improved upper bounds for related quantities: the number of cycle-free graphs in a planar graph is bounded by $O(6.4884^n)$, the number of plane spanning trees on a set of $n$ poin"},"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":"0912.0712","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-12-03T19:11:39Z","cross_cats_sorted":[],"title_canon_sha256":"054d7bfacb68bb795eb9a3d9e8cd6964d94ef5fc99e633abc5a42afd02a62b7a","abstract_canon_sha256":"63b47df20828a13c1844cbdb1e4ad1b162afbb54c606f3f96b3db16b77155763"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:41:25.141965Z","signature_b64":"sUMWoAUqLZaR+Gmt+pxZ7YSCilPXTCAv7cKbUT/3Lp0I3ToFoonP3bBBpjI0WX+t9mejIwg3Ueg6WDHY8I//BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5cebf7ffb830716af5520e2af957bf4191dd5d72b6211ea2f28b7d9739585f27","last_reissued_at":"2026-05-18T04:41:25.141379Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:41:25.141379Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the number of spanning trees a planar graph can have","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andr\\'e Schulz, Kevin Buchin","submitted_at":"2009-12-03T19:11:39Z","abstract_excerpt":"We prove that any planar graph on $n$ vertices has less than $O(5{.}2852^n)$ spanning trees. Under the restriction that the planar graph is 3-connected and contains no triangle and no quadrilateral the number of its spanning trees is less than $O(2{.}7156^n)$. As a consequence of the latter the grid size needed to realize a 3d polytope with integer coordinates can be bounded by $O(147.{7}^n)$. Our observations imply improved upper bounds for related quantities: the number of cycle-free graphs in a planar graph is bounded by $O(6.4884^n)$, the number of plane spanning trees on a set of $n$ poin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0912.0712","kind":"arxiv","version":2},"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":"0912.0712","created_at":"2026-05-18T04:41:25.141481+00:00"},{"alias_kind":"arxiv_version","alias_value":"0912.0712v2","created_at":"2026-05-18T04:41:25.141481+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0912.0712","created_at":"2026-05-18T04:41:25.141481+00:00"},{"alias_kind":"pith_short_12","alias_value":"LTV7P75YGBYW","created_at":"2026-05-18T12:26:00.592388+00:00"},{"alias_kind":"pith_short_16","alias_value":"LTV7P75YGBYWV5KS","created_at":"2026-05-18T12:26:00.592388+00:00"},{"alias_kind":"pith_short_8","alias_value":"LTV7P75Y","created_at":"2026-05-18T12:26:00.592388+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/LTV7P75YGBYWV5KSBYVPSV57IG","json":"https://pith.science/pith/LTV7P75YGBYWV5KSBYVPSV57IG.json","graph_json":"https://pith.science/api/pith-number/LTV7P75YGBYWV5KSBYVPSV57IG/graph.json","events_json":"https://pith.science/api/pith-number/LTV7P75YGBYWV5KSBYVPSV57IG/events.json","paper":"https://pith.science/paper/LTV7P75Y"},"agent_actions":{"view_html":"https://pith.science/pith/LTV7P75YGBYWV5KSBYVPSV57IG","download_json":"https://pith.science/pith/LTV7P75YGBYWV5KSBYVPSV57IG.json","view_paper":"https://pith.science/paper/LTV7P75Y","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0912.0712&json=true","fetch_graph":"https://pith.science/api/pith-number/LTV7P75YGBYWV5KSBYVPSV57IG/graph.json","fetch_events":"https://pith.science/api/pith-number/LTV7P75YGBYWV5KSBYVPSV57IG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LTV7P75YGBYWV5KSBYVPSV57IG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LTV7P75YGBYWV5KSBYVPSV57IG/action/storage_attestation","attest_author":"https://pith.science/pith/LTV7P75YGBYWV5KSBYVPSV57IG/action/author_attestation","sign_citation":"https://pith.science/pith/LTV7P75YGBYWV5KSBYVPSV57IG/action/citation_signature","submit_replication":"https://pith.science/pith/LTV7P75YGBYWV5KSBYVPSV57IG/action/replication_record"}},"created_at":"2026-05-18T04:41:25.141481+00:00","updated_at":"2026-05-18T04:41:25.141481+00:00"}