{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:LTV7P75YGBYWV5KSBYVPSV57IG","short_pith_number":"pith:LTV7P75Y","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"},"canonical_sha256":"5cebf7ffb830716af5520e2af957bf4191dd5d72b6211ea2f28b7d9739585f27","source":{"kind":"arxiv","id":"0912.0712","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0912.0712","created_at":"2026-05-18T04:41:25Z"},{"alias_kind":"arxiv_version","alias_value":"0912.0712v2","created_at":"2026-05-18T04:41:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0912.0712","created_at":"2026-05-18T04:41:25Z"},{"alias_kind":"pith_short_12","alias_value":"LTV7P75YGBYW","created_at":"2026-05-18T12:26:00Z"},{"alias_kind":"pith_short_16","alias_value":"LTV7P75YGBYWV5KS","created_at":"2026-05-18T12:26:00Z"},{"alias_kind":"pith_short_8","alias_value":"LTV7P75Y","created_at":"2026-05-18T12:26:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:LTV7P75YGBYWV5KSBYVPSV57IG","target":"record","payload":{"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"},"canonical_sha256":"5cebf7ffb830716af5520e2af957bf4191dd5d72b6211ea2f28b7d9739585f27","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"},"source_kind":"arxiv","source_id":"0912.0712","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:41:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W42PCmDJ2o03TlZ8fcKQDBDFiBs24fVeEW+ywQIKXnuvhgCz9z3Sn3xg9r80mY20kdSaCJGKJck3cqI2i/bTBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T18:11:33.214562Z"},"content_sha256":"9bf4043731d92787c654543e24a912a57443c682070877c5af56508e3c0a5ad0","schema_version":"1.0","event_id":"sha256:9bf4043731d92787c654543e24a912a57443c682070877c5af56508e3c0a5ad0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:LTV7P75YGBYWV5KSBYVPSV57IG","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:41:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QLN0fiBIX9Y+QbZ6GE0/QljiusXgDLvCuFHgEdxTlb4rHuH6fl5F8dnY0rhAZEtOa/9pTu55WQPJugyKQG2KCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T18:11:33.215236Z"},"content_sha256":"fd7e939f1950c957bc0cf12f984e1fd55c58a6c58f261d7128f70e28ab90b91e","schema_version":"1.0","event_id":"sha256:fd7e939f1950c957bc0cf12f984e1fd55c58a6c58f261d7128f70e28ab90b91e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LTV7P75YGBYWV5KSBYVPSV57IG/bundle.json","state_url":"https://pith.science/pith/LTV7P75YGBYWV5KSBYVPSV57IG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LTV7P75YGBYWV5KSBYVPSV57IG/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-27T18:11:33Z","links":{"resolver":"https://pith.science/pith/LTV7P75YGBYWV5KSBYVPSV57IG","bundle":"https://pith.science/pith/LTV7P75YGBYWV5KSBYVPSV57IG/bundle.json","state":"https://pith.science/pith/LTV7P75YGBYWV5KSBYVPSV57IG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LTV7P75YGBYWV5KSBYVPSV57IG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:LTV7P75YGBYWV5KSBYVPSV57IG","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"63b47df20828a13c1844cbdb1e4ad1b162afbb54c606f3f96b3db16b77155763","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-12-03T19:11:39Z","title_canon_sha256":"054d7bfacb68bb795eb9a3d9e8cd6964d94ef5fc99e633abc5a42afd02a62b7a"},"schema_version":"1.0","source":{"id":"0912.0712","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0912.0712","created_at":"2026-05-18T04:41:25Z"},{"alias_kind":"arxiv_version","alias_value":"0912.0712v2","created_at":"2026-05-18T04:41:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0912.0712","created_at":"2026-05-18T04:41:25Z"},{"alias_kind":"pith_short_12","alias_value":"LTV7P75YGBYW","created_at":"2026-05-18T12:26:00Z"},{"alias_kind":"pith_short_16","alias_value":"LTV7P75YGBYWV5KS","created_at":"2026-05-18T12:26:00Z"},{"alias_kind":"pith_short_8","alias_value":"LTV7P75Y","created_at":"2026-05-18T12:26:00Z"}],"graph_snapshots":[{"event_id":"sha256:fd7e939f1950c957bc0cf12f984e1fd55c58a6c58f261d7128f70e28ab90b91e","target":"graph","created_at":"2026-05-18T04:41:25Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Andr\\'e Schulz, Kevin Buchin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-12-03T19:11:39Z","title":"On the number of spanning trees a planar graph can have"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0912.0712","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:9bf4043731d92787c654543e24a912a57443c682070877c5af56508e3c0a5ad0","target":"record","created_at":"2026-05-18T04:41:25Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"63b47df20828a13c1844cbdb1e4ad1b162afbb54c606f3f96b3db16b77155763","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-12-03T19:11:39Z","title_canon_sha256":"054d7bfacb68bb795eb9a3d9e8cd6964d94ef5fc99e633abc5a42afd02a62b7a"},"schema_version":"1.0","source":{"id":"0912.0712","kind":"arxiv","version":2}},"canonical_sha256":"5cebf7ffb830716af5520e2af957bf4191dd5d72b6211ea2f28b7d9739585f27","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5cebf7ffb830716af5520e2af957bf4191dd5d72b6211ea2f28b7d9739585f27","first_computed_at":"2026-05-18T04:41:25.141379Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:41:25.141379Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sUMWoAUqLZaR+Gmt+pxZ7YSCilPXTCAv7cKbUT/3Lp0I3ToFoonP3bBBpjI0WX+t9mejIwg3Ueg6WDHY8I//BA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:41:25.141965Z","signed_message":"canonical_sha256_bytes"},"source_id":"0912.0712","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9bf4043731d92787c654543e24a912a57443c682070877c5af56508e3c0a5ad0","sha256:fd7e939f1950c957bc0cf12f984e1fd55c58a6c58f261d7128f70e28ab90b91e"],"state_sha256":"a0ad707ce3591ca39b0d77a354e868466c9eef91fac592cf158a547a13710dfb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ecezHsUvpCLRkbEdYnP2tn4uvsuVrXmO8Djr2CDQnWUtyfHTsV0jujGgGLhiFNlvuYTgkKTSVD+L51f3mhWbBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T18:11:33.218575Z","bundle_sha256":"0ef3fb2450a16e5f5b5ab941fd9eebcbf08b8646b6e56526acd88616ebb8b3c7"}}