{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:RSY3AELBQFEXIOSZ4JSQ23EJLC","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":"46d4295d638746eaa3d4a1945d434ec5a1fccee55ba03dde99ee9ec470ba12a3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-03-31T01:27:53Z","title_canon_sha256":"03b00d5566cbbeabcd0458cd5c671a86fbd91f6fdda9222fa7410aa9c17eb836"},"schema_version":"1.0","source":{"id":"2503.23648","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2503.23648","created_at":"2026-07-05T11:57:55Z"},{"alias_kind":"arxiv_version","alias_value":"2503.23648v2","created_at":"2026-07-05T11:57:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.23648","created_at":"2026-07-05T11:57:55Z"},{"alias_kind":"pith_short_12","alias_value":"RSY3AELBQFEX","created_at":"2026-07-05T11:57:55Z"},{"alias_kind":"pith_short_16","alias_value":"RSY3AELBQFEXIOSZ","created_at":"2026-07-05T11:57:55Z"},{"alias_kind":"pith_short_8","alias_value":"RSY3AELB","created_at":"2026-07-05T11:57:55Z"}],"graph_snapshots":[{"event_id":"sha256:b985c95bc8963632d1bea08ba50970c09dd5adb7edeedf456bd49f7d164ddc3e","target":"graph","created_at":"2026-07-05T11:57:55Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2503.23648/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The number of spanning trees of a graph $G$, denoted $\\tau(G)$, is a well studied graph parameter with numerous connections to other areas of mathematics. In a recent remarkable paper, answering a question of Sedl\\'a\\v{c}ek from 1969, Chan, Kontorovich and Pak showed that $\\tau(G)$ takes at least $1.1103^n$ different values across simple (and planar) $n$-vertex graphs $G$, for large enough $n$. We give a very short, purely combinatorial proof that at least $1.55^n$ values are attained. We also prove that exponential growth can be achieved with regular graphs, determining the growth rate in ano","authors_text":"Lior Gishboliner, Matija Buci\\'c, Noga Alon","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-03-31T01:27:53Z","title":"The spanning tree spectrum: improved bounds and simple proofs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.23648","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:346d26c190ffd02768b362bd1e646c1bdfad6578a989e1bc1f7c877a93768f82","target":"record","created_at":"2026-07-05T11:57:55Z","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":"46d4295d638746eaa3d4a1945d434ec5a1fccee55ba03dde99ee9ec470ba12a3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-03-31T01:27:53Z","title_canon_sha256":"03b00d5566cbbeabcd0458cd5c671a86fbd91f6fdda9222fa7410aa9c17eb836"},"schema_version":"1.0","source":{"id":"2503.23648","kind":"arxiv","version":2}},"canonical_sha256":"8cb1b011618149743a59e2650d6c8958a604a1e3d5099af260abaad0cf6c0bbc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8cb1b011618149743a59e2650d6c8958a604a1e3d5099af260abaad0cf6c0bbc","first_computed_at":"2026-07-05T11:57:55.616294Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:57:55.616294Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WmaTtbBra5VM05tDPkOp5rXP5+FsRxrD4+0DqqZ6iVYQnlFVO3OxnSiRGrVDaev0VQey6bkbmsUEnstAQcJRDg==","signature_status":"signed_v1","signed_at":"2026-07-05T11:57:55.616801Z","signed_message":"canonical_sha256_bytes"},"source_id":"2503.23648","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:346d26c190ffd02768b362bd1e646c1bdfad6578a989e1bc1f7c877a93768f82","sha256:b985c95bc8963632d1bea08ba50970c09dd5adb7edeedf456bd49f7d164ddc3e"],"state_sha256":"ddbb48f8899096a963a1c5b68cf03274cf422282aabf78bc14503cf55c2c00ed"}