{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:FG4RPMB4OZA2LDUH4F5KTPHV4D","short_pith_number":"pith:FG4RPMB4","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"},"canonical_sha256":"29b917b03c7641a58e87e17aa9bcf5e0e022446314a8f22c3a60aa6d9b508d3b","source":{"kind":"arxiv","id":"2605.25088","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.25088","created_at":"2026-05-26T02:03:39Z"},{"alias_kind":"arxiv_version","alias_value":"2605.25088v1","created_at":"2026-05-26T02:03:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.25088","created_at":"2026-05-26T02:03:39Z"},{"alias_kind":"pith_short_12","alias_value":"FG4RPMB4OZA2","created_at":"2026-05-26T02:03:39Z"},{"alias_kind":"pith_short_16","alias_value":"FG4RPMB4OZA2LDUH","created_at":"2026-05-26T02:03:39Z"},{"alias_kind":"pith_short_8","alias_value":"FG4RPMB4","created_at":"2026-05-26T02:03:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:FG4RPMB4OZA2LDUH4F5KTPHV4D","target":"record","payload":{"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"},"canonical_sha256":"29b917b03c7641a58e87e17aa9bcf5e0e022446314a8f22c3a60aa6d9b508d3b","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"},"source_kind":"arxiv","source_id":"2605.25088","source_version":1,"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-26T02:03:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x+zwupjYHHqjlBhRGdXUU8xCzE9WZzr8OY+77DOPRlVdPxatONqm47LnDkLKThd5ltf2by9/20LjFgUgLPjdAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T21:26:41.516593Z"},"content_sha256":"4590d4bf900499560140b9319d45357818471ebabfce6674e90a587a8784a4c4","schema_version":"1.0","event_id":"sha256:4590d4bf900499560140b9319d45357818471ebabfce6674e90a587a8784a4c4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:FG4RPMB4OZA2LDUH4F5KTPHV4D","target":"graph","payload":{"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"},"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-26T02:03:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7BCy4AdpA0jPNWioRlGjjWCG71vx37U+bHAbpiACfpc8KSEtEO6iEvIt7fINI96cV2kCo+UNq6r3GwBKgFgfAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T21:26:41.517122Z"},"content_sha256":"1a30cdfb45a96b338d6be24b2d8f8db3080f871993e737247e3d3b25001acb5c","schema_version":"1.0","event_id":"sha256:1a30cdfb45a96b338d6be24b2d8f8db3080f871993e737247e3d3b25001acb5c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FG4RPMB4OZA2LDUH4F5KTPHV4D/bundle.json","state_url":"https://pith.science/pith/FG4RPMB4OZA2LDUH4F5KTPHV4D/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FG4RPMB4OZA2LDUH4F5KTPHV4D/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-08-12T21:26:41Z","links":{"resolver":"https://pith.science/pith/FG4RPMB4OZA2LDUH4F5KTPHV4D","bundle":"https://pith.science/pith/FG4RPMB4OZA2LDUH4F5KTPHV4D/bundle.json","state":"https://pith.science/pith/FG4RPMB4OZA2LDUH4F5KTPHV4D/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FG4RPMB4OZA2LDUH4F5KTPHV4D/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:FG4RPMB4OZA2LDUH4F5KTPHV4D","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":"56b3d7b2788d12958de6232a7bc84b459aa815547d3f6808a8792b570bacf0a3","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-24T14:05:26Z","title_canon_sha256":"4ba50382622c3c301e404146c76505506af340249f08012a3814daab60f7ef1c"},"schema_version":"1.0","source":{"id":"2605.25088","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.25088","created_at":"2026-05-26T02:03:39Z"},{"alias_kind":"arxiv_version","alias_value":"2605.25088v1","created_at":"2026-05-26T02:03:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.25088","created_at":"2026-05-26T02:03:39Z"},{"alias_kind":"pith_short_12","alias_value":"FG4RPMB4OZA2","created_at":"2026-05-26T02:03:39Z"},{"alias_kind":"pith_short_16","alias_value":"FG4RPMB4OZA2LDUH","created_at":"2026-05-26T02:03:39Z"},{"alias_kind":"pith_short_8","alias_value":"FG4RPMB4","created_at":"2026-05-26T02:03:39Z"}],"graph_snapshots":[{"event_id":"sha256:1a30cdfb45a96b338d6be24b2d8f8db3080f871993e737247e3d3b25001acb5c","target":"graph","created_at":"2026-05-26T02:03:39Z","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/2605.25088/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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.","authors_text":"Vishesh Jain","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-24T14:05:26Z","title":"The size of the spanning-tree spectrum of simple graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.25088","kind":"arxiv","version":1},"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:4590d4bf900499560140b9319d45357818471ebabfce6674e90a587a8784a4c4","target":"record","created_at":"2026-05-26T02:03:39Z","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":"56b3d7b2788d12958de6232a7bc84b459aa815547d3f6808a8792b570bacf0a3","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-24T14:05:26Z","title_canon_sha256":"4ba50382622c3c301e404146c76505506af340249f08012a3814daab60f7ef1c"},"schema_version":"1.0","source":{"id":"2605.25088","kind":"arxiv","version":1}},"canonical_sha256":"29b917b03c7641a58e87e17aa9bcf5e0e022446314a8f22c3a60aa6d9b508d3b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"29b917b03c7641a58e87e17aa9bcf5e0e022446314a8f22c3a60aa6d9b508d3b","first_computed_at":"2026-05-26T02:03:39.356724Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-26T02:03:39.356724Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Idqads28DWapv5mYsbWkwOK4LoSlN+TVJd/7Bf8xh6IwollDpLp+tE0tZADpEH4Z0sLuYCosaKLw7TTaF+aeDQ==","signature_status":"signed_v1","signed_at":"2026-05-26T02:03:39.357563Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.25088","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4590d4bf900499560140b9319d45357818471ebabfce6674e90a587a8784a4c4","sha256:1a30cdfb45a96b338d6be24b2d8f8db3080f871993e737247e3d3b25001acb5c"],"state_sha256":"61042375d2e6f201170fef1f5ff30c08e6714771ce011383b9a47b30dc809c75"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0hwcX8CKjRDEq5VMWuBmJQGgjAXGEDAQNI/py23E7naeTd6e5m/CMppj3ItulkK+/DfDgQvQ28fnjsq9lVSFDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-12T21:26:41.521931Z","bundle_sha256":"7f44e0e7da401bce0b801e4a40e991a9370552fb0621699c239766db759b0af8"}}