{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:6F3USD2K5ESIF3LDFRRSJUPGVE","short_pith_number":"pith:6F3USD2K","schema_version":"1.0","canonical_sha256":"f177490f4ae92482ed632c6324d1e6a93f3fbabb5c47fa004a2fa8f90beaf510","source":{"kind":"arxiv","id":"2411.18782","version":2},"attestation_state":"computed","paper":{"title":"Spanning trees and continued fractions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NT"],"primary_cat":"math.CO","authors_text":"Alex Kontorovich, Igor Pak, Swee Hong Chan","submitted_at":"2024-11-27T22:11:33Z","abstract_excerpt":"We prove the exponential growth of the cardinality of the set of numbers of spanning trees in simple (and planar) graphs on $n$ vertices, answering a question of Sedl\\'a\\v{c}ek from 1969. The proof uses a connection with continued fractions, ``thin orbits,'' and Zaremba's conjecture."},"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":"2411.18782","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-11-27T22:11:33Z","cross_cats_sorted":["math.NT"],"title_canon_sha256":"0478cac40dd8a4df6c138261802f54738852df99cb872494cab80a8b604d1438","abstract_canon_sha256":"b74efddc2c8547b5b38ec89fa75186fcbccbd26e3d40bbdebdd091d0dbeb68d0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:29:34.258533Z","signature_b64":"ng1Tz9gcVXWG8awdOhKaKffdC9F34mX+NSlFfYp2yeuscqtC3rynM6FmaXEywAqThh3x21UBURDFtA9LBChODA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f177490f4ae92482ed632c6324d1e6a93f3fbabb5c47fa004a2fa8f90beaf510","last_reissued_at":"2026-07-05T11:29:34.257984Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:29:34.257984Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Spanning trees and continued fractions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NT"],"primary_cat":"math.CO","authors_text":"Alex Kontorovich, Igor Pak, Swee Hong Chan","submitted_at":"2024-11-27T22:11:33Z","abstract_excerpt":"We prove the exponential growth of the cardinality of the set of numbers of spanning trees in simple (and planar) graphs on $n$ vertices, answering a question of Sedl\\'a\\v{c}ek from 1969. The proof uses a connection with continued fractions, ``thin orbits,'' and Zaremba's conjecture."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.18782","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/2411.18782/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":"2411.18782","created_at":"2026-07-05T11:29:34.258044+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.18782v2","created_at":"2026-07-05T11:29:34.258044+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.18782","created_at":"2026-07-05T11:29:34.258044+00:00"},{"alias_kind":"pith_short_12","alias_value":"6F3USD2K5ESI","created_at":"2026-07-05T11:29:34.258044+00:00"},{"alias_kind":"pith_short_16","alias_value":"6F3USD2K5ESIF3LD","created_at":"2026-07-05T11:29:34.258044+00:00"},{"alias_kind":"pith_short_8","alias_value":"6F3USD2K","created_at":"2026-07-05T11:29:34.258044+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":9,"is_internal_anchor":false},{"citing_arxiv_id":"2604.19094","citing_title":"Independent Sets and Continued Fractions","ref_index":8,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6F3USD2K5ESIF3LDFRRSJUPGVE","json":"https://pith.science/pith/6F3USD2K5ESIF3LDFRRSJUPGVE.json","graph_json":"https://pith.science/api/pith-number/6F3USD2K5ESIF3LDFRRSJUPGVE/graph.json","events_json":"https://pith.science/api/pith-number/6F3USD2K5ESIF3LDFRRSJUPGVE/events.json","paper":"https://pith.science/paper/6F3USD2K"},"agent_actions":{"view_html":"https://pith.science/pith/6F3USD2K5ESIF3LDFRRSJUPGVE","download_json":"https://pith.science/pith/6F3USD2K5ESIF3LDFRRSJUPGVE.json","view_paper":"https://pith.science/paper/6F3USD2K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.18782&json=true","fetch_graph":"https://pith.science/api/pith-number/6F3USD2K5ESIF3LDFRRSJUPGVE/graph.json","fetch_events":"https://pith.science/api/pith-number/6F3USD2K5ESIF3LDFRRSJUPGVE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6F3USD2K5ESIF3LDFRRSJUPGVE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6F3USD2K5ESIF3LDFRRSJUPGVE/action/storage_attestation","attest_author":"https://pith.science/pith/6F3USD2K5ESIF3LDFRRSJUPGVE/action/author_attestation","sign_citation":"https://pith.science/pith/6F3USD2K5ESIF3LDFRRSJUPGVE/action/citation_signature","submit_replication":"https://pith.science/pith/6F3USD2K5ESIF3LDFRRSJUPGVE/action/replication_record"}},"created_at":"2026-07-05T11:29:34.258044+00:00","updated_at":"2026-07-05T11:29:34.258044+00:00"}