{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:FG4RPMB4OZA2LDUH4F5KTPHV4D","short_pith_number":"pith:FG4RPMB4","schema_version":"1.0","canonical_sha256":"29b917b03c7641a58e87e17aa9bcf5e0e022446314a8f22c3a60aa6d9b508d3b","source":{"kind":"arxiv","id":"2605.25088","version":1},"attestation_state":"computed","paper":{"title":"The size of the spanning-tree spectrum of simple graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Vishesh Jain","submitted_at":"2026-05-24T14:05:26Z","abstract_excerpt":"For a graph $G$, let $\\tau(G)$ denote the number of spanning trees. We show that for every fixed $0 < c < 1/4$, the number of distinct values of $\\tau(G)$, as $G$ ranges over simple graphs on $n$ vertices, is at least $\\exp(c n \\log n)$ for all sufficiently large $n$. This is optimal up to the choice of the constant $c$ and resolves a conjecture of Chan-Kontorovich-Pak regarding a problem of Sedl\\'a\\v{c}ek from the late 1960s."},"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":"2605.25088","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-24T14:05:26Z","cross_cats_sorted":[],"title_canon_sha256":"4ba50382622c3c301e404146c76505506af340249f08012a3814daab60f7ef1c","abstract_canon_sha256":"56b3d7b2788d12958de6232a7bc84b459aa815547d3f6808a8792b570bacf0a3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-26T02:03:39.357563Z","signature_b64":"Idqads28DWapv5mYsbWkwOK4LoSlN+TVJd/7Bf8xh6IwollDpLp+tE0tZADpEH4Z0sLuYCosaKLw7TTaF+aeDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"29b917b03c7641a58e87e17aa9bcf5e0e022446314a8f22c3a60aa6d9b508d3b","last_reissued_at":"2026-05-26T02:03:39.356724Z","signature_status":"signed_v1","first_computed_at":"2026-05-26T02:03:39.356724Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The size of the spanning-tree spectrum of simple graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Vishesh Jain","submitted_at":"2026-05-24T14:05:26Z","abstract_excerpt":"For a graph $G$, let $\\tau(G)$ denote the number of spanning trees. We show that for every fixed $0 < c < 1/4$, the number of distinct values of $\\tau(G)$, as $G$ ranges over simple graphs on $n$ vertices, is at least $\\exp(c n \\log n)$ for all sufficiently large $n$. This is optimal up to the choice of the constant $c$ and resolves a conjecture of Chan-Kontorovich-Pak regarding a problem of Sedl\\'a\\v{c}ek from the late 1960s."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.25088","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.25088/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":"2605.25088","created_at":"2026-05-26T02:03:39.356871+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.25088v1","created_at":"2026-05-26T02:03:39.356871+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.25088","created_at":"2026-05-26T02:03:39.356871+00:00"},{"alias_kind":"pith_short_12","alias_value":"FG4RPMB4OZA2","created_at":"2026-05-26T02:03:39.356871+00:00"},{"alias_kind":"pith_short_16","alias_value":"FG4RPMB4OZA2LDUH","created_at":"2026-05-26T02:03:39.356871+00:00"},{"alias_kind":"pith_short_8","alias_value":"FG4RPMB4","created_at":"2026-05-26T02:03:39.356871+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/FG4RPMB4OZA2LDUH4F5KTPHV4D","json":"https://pith.science/pith/FG4RPMB4OZA2LDUH4F5KTPHV4D.json","graph_json":"https://pith.science/api/pith-number/FG4RPMB4OZA2LDUH4F5KTPHV4D/graph.json","events_json":"https://pith.science/api/pith-number/FG4RPMB4OZA2LDUH4F5KTPHV4D/events.json","paper":"https://pith.science/paper/FG4RPMB4"},"agent_actions":{"view_html":"https://pith.science/pith/FG4RPMB4OZA2LDUH4F5KTPHV4D","download_json":"https://pith.science/pith/FG4RPMB4OZA2LDUH4F5KTPHV4D.json","view_paper":"https://pith.science/paper/FG4RPMB4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.25088&json=true","fetch_graph":"https://pith.science/api/pith-number/FG4RPMB4OZA2LDUH4F5KTPHV4D/graph.json","fetch_events":"https://pith.science/api/pith-number/FG4RPMB4OZA2LDUH4F5KTPHV4D/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FG4RPMB4OZA2LDUH4F5KTPHV4D/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FG4RPMB4OZA2LDUH4F5KTPHV4D/action/storage_attestation","attest_author":"https://pith.science/pith/FG4RPMB4OZA2LDUH4F5KTPHV4D/action/author_attestation","sign_citation":"https://pith.science/pith/FG4RPMB4OZA2LDUH4F5KTPHV4D/action/citation_signature","submit_replication":"https://pith.science/pith/FG4RPMB4OZA2LDUH4F5KTPHV4D/action/replication_record"}},"created_at":"2026-05-26T02:03:39.356871+00:00","updated_at":"2026-05-26T02:03:39.356871+00:00"}