{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:RSY3AELBQFEXIOSZ4JSQ23EJLC","short_pith_number":"pith:RSY3AELB","schema_version":"1.0","canonical_sha256":"8cb1b011618149743a59e2650d6c8958a604a1e3d5099af260abaad0cf6c0bbc","source":{"kind":"arxiv","id":"2503.23648","version":2},"attestation_state":"computed","paper":{"title":"The spanning tree spectrum: improved bounds and simple proofs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Lior Gishboliner, Matija Buci\\'c, Noga Alon","submitted_at":"2025-03-31T01:27:53Z","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"},"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":"2503.23648","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-03-31T01:27:53Z","cross_cats_sorted":[],"title_canon_sha256":"03b00d5566cbbeabcd0458cd5c671a86fbd91f6fdda9222fa7410aa9c17eb836","abstract_canon_sha256":"46d4295d638746eaa3d4a1945d434ec5a1fccee55ba03dde99ee9ec470ba12a3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:57:55.616801Z","signature_b64":"WmaTtbBra5VM05tDPkOp5rXP5+FsRxrD4+0DqqZ6iVYQnlFVO3OxnSiRGrVDaev0VQey6bkbmsUEnstAQcJRDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8cb1b011618149743a59e2650d6c8958a604a1e3d5099af260abaad0cf6c0bbc","last_reissued_at":"2026-07-05T11:57:55.616294Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:57:55.616294Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The spanning tree spectrum: improved bounds and simple proofs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Lior Gishboliner, Matija Buci\\'c, Noga Alon","submitted_at":"2025-03-31T01:27:53Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.23648","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2503.23648/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2503.23648","created_at":"2026-07-05T11:57:55.616370+00:00"},{"alias_kind":"arxiv_version","alias_value":"2503.23648v2","created_at":"2026-07-05T11:57:55.616370+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.23648","created_at":"2026-07-05T11:57:55.616370+00:00"},{"alias_kind":"pith_short_12","alias_value":"RSY3AELBQFEX","created_at":"2026-07-05T11:57:55.616370+00:00"},{"alias_kind":"pith_short_16","alias_value":"RSY3AELBQFEXIOSZ","created_at":"2026-07-05T11:57:55.616370+00:00"},{"alias_kind":"pith_short_8","alias_value":"RSY3AELB","created_at":"2026-07-05T11:57:55.616370+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.25088","citing_title":"The size of the spanning-tree spectrum of simple graphs","ref_index":1,"is_internal_anchor":false},{"citing_arxiv_id":"2604.19094","citing_title":"Independent Sets and Continued Fractions","ref_index":1,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RSY3AELBQFEXIOSZ4JSQ23EJLC","json":"https://pith.science/pith/RSY3AELBQFEXIOSZ4JSQ23EJLC.json","graph_json":"https://pith.science/api/pith-number/RSY3AELBQFEXIOSZ4JSQ23EJLC/graph.json","events_json":"https://pith.science/api/pith-number/RSY3AELBQFEXIOSZ4JSQ23EJLC/events.json","paper":"https://pith.science/paper/RSY3AELB"},"agent_actions":{"view_html":"https://pith.science/pith/RSY3AELBQFEXIOSZ4JSQ23EJLC","download_json":"https://pith.science/pith/RSY3AELBQFEXIOSZ4JSQ23EJLC.json","view_paper":"https://pith.science/paper/RSY3AELB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2503.23648&json=true","fetch_graph":"https://pith.science/api/pith-number/RSY3AELBQFEXIOSZ4JSQ23EJLC/graph.json","fetch_events":"https://pith.science/api/pith-number/RSY3AELBQFEXIOSZ4JSQ23EJLC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RSY3AELBQFEXIOSZ4JSQ23EJLC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RSY3AELBQFEXIOSZ4JSQ23EJLC/action/storage_attestation","attest_author":"https://pith.science/pith/RSY3AELBQFEXIOSZ4JSQ23EJLC/action/author_attestation","sign_citation":"https://pith.science/pith/RSY3AELBQFEXIOSZ4JSQ23EJLC/action/citation_signature","submit_replication":"https://pith.science/pith/RSY3AELBQFEXIOSZ4JSQ23EJLC/action/replication_record"}},"created_at":"2026-07-05T11:57:55.616370+00:00","updated_at":"2026-07-05T11:57:55.616370+00:00"}