{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:4MNJOTK7WUBZYTB43KKRPVPMLT","short_pith_number":"pith:4MNJOTK7","schema_version":"1.0","canonical_sha256":"e31a974d5fb5039c4c3cda9517d5ec5cfd8ff6ed17724816ca86302c1d352c0a","source":{"kind":"arxiv","id":"2605.19707","version":1},"attestation_state":"computed","paper":{"title":"On asymptotic values for the minimum number of spanning forests in simple regular graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Kexiang Xu, Shaohan Xu","submitted_at":"2026-05-19T11:44:38Z","abstract_excerpt":"Let $F(G)$ be the number of spanning forests in a graph $G$ and $\\mathcal{C}(n,d)$ be the set of all connected $d$-regular simple graphs of order $n$. Define $\\widehat{f}_{d}=\\liminf_{n\\rightarrow \\infty}\\{F(G)^{1/n}:G\\in \\mathcal{C}(n,d)\\}$. Let $n_i$ be the number of vertices of degree $i$ in $G$. In this paper we give two lower bounds for $F(G)$ in terms of $n_i$ in connected graphs whose vertex degrees belong to $\\{2,3\\}$ and $\\{2,3,4\\}$, respectively. Furthermore, we determine the exact values of $\\widehat{f}_3$ and $\\widehat{f}_4$."},"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.19707","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-19T11:44:38Z","cross_cats_sorted":[],"title_canon_sha256":"ade7283a83bc2d4d8b62805d0eb8d54051e55d4f150d467e3ead69b547087ac2","abstract_canon_sha256":"a810e4316f7726d2c2dd1e69f776ffcd04a1fe6dfe3179e8e3408eaf738151e0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T01:05:58.587593Z","signature_b64":"UeGjKyTvPYaK/7qCT8JOkT/6lu8ObeFe4nuYfFO+NED1XfdL0hR9mkykD/jYFnMMjgyp0oHNCu2nKNDcTZLQAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e31a974d5fb5039c4c3cda9517d5ec5cfd8ff6ed17724816ca86302c1d352c0a","last_reissued_at":"2026-05-20T01:05:58.586988Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T01:05:58.586988Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On asymptotic values for the minimum number of spanning forests in simple regular graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Kexiang Xu, Shaohan Xu","submitted_at":"2026-05-19T11:44:38Z","abstract_excerpt":"Let $F(G)$ be the number of spanning forests in a graph $G$ and $\\mathcal{C}(n,d)$ be the set of all connected $d$-regular simple graphs of order $n$. Define $\\widehat{f}_{d}=\\liminf_{n\\rightarrow \\infty}\\{F(G)^{1/n}:G\\in \\mathcal{C}(n,d)\\}$. Let $n_i$ be the number of vertices of degree $i$ in $G$. In this paper we give two lower bounds for $F(G)$ in terms of $n_i$ in connected graphs whose vertex degrees belong to $\\{2,3\\}$ and $\\{2,3,4\\}$, respectively. Furthermore, we determine the exact values of $\\widehat{f}_3$ and $\\widehat{f}_4$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.19707","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.19707/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.19707","created_at":"2026-05-20T01:05:58.587057+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.19707v1","created_at":"2026-05-20T01:05:58.587057+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.19707","created_at":"2026-05-20T01:05:58.587057+00:00"},{"alias_kind":"pith_short_12","alias_value":"4MNJOTK7WUBZ","created_at":"2026-05-20T01:05:58.587057+00:00"},{"alias_kind":"pith_short_16","alias_value":"4MNJOTK7WUBZYTB4","created_at":"2026-05-20T01:05:58.587057+00:00"},{"alias_kind":"pith_short_8","alias_value":"4MNJOTK7","created_at":"2026-05-20T01:05:58.587057+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/4MNJOTK7WUBZYTB43KKRPVPMLT","json":"https://pith.science/pith/4MNJOTK7WUBZYTB43KKRPVPMLT.json","graph_json":"https://pith.science/api/pith-number/4MNJOTK7WUBZYTB43KKRPVPMLT/graph.json","events_json":"https://pith.science/api/pith-number/4MNJOTK7WUBZYTB43KKRPVPMLT/events.json","paper":"https://pith.science/paper/4MNJOTK7"},"agent_actions":{"view_html":"https://pith.science/pith/4MNJOTK7WUBZYTB43KKRPVPMLT","download_json":"https://pith.science/pith/4MNJOTK7WUBZYTB43KKRPVPMLT.json","view_paper":"https://pith.science/paper/4MNJOTK7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.19707&json=true","fetch_graph":"https://pith.science/api/pith-number/4MNJOTK7WUBZYTB43KKRPVPMLT/graph.json","fetch_events":"https://pith.science/api/pith-number/4MNJOTK7WUBZYTB43KKRPVPMLT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4MNJOTK7WUBZYTB43KKRPVPMLT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4MNJOTK7WUBZYTB43KKRPVPMLT/action/storage_attestation","attest_author":"https://pith.science/pith/4MNJOTK7WUBZYTB43KKRPVPMLT/action/author_attestation","sign_citation":"https://pith.science/pith/4MNJOTK7WUBZYTB43KKRPVPMLT/action/citation_signature","submit_replication":"https://pith.science/pith/4MNJOTK7WUBZYTB43KKRPVPMLT/action/replication_record"}},"created_at":"2026-05-20T01:05:58.587057+00:00","updated_at":"2026-05-20T01:05:58.587057+00:00"}