{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:4MNJOTK7WUBZYTB43KKRPVPMLT","short_pith_number":"pith:4MNJOTK7","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"},"canonical_sha256":"e31a974d5fb5039c4c3cda9517d5ec5cfd8ff6ed17724816ca86302c1d352c0a","source":{"kind":"arxiv","id":"2605.19707","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.19707","created_at":"2026-05-20T01:05:58Z"},{"alias_kind":"arxiv_version","alias_value":"2605.19707v1","created_at":"2026-05-20T01:05:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.19707","created_at":"2026-05-20T01:05:58Z"},{"alias_kind":"pith_short_12","alias_value":"4MNJOTK7WUBZ","created_at":"2026-05-20T01:05:58Z"},{"alias_kind":"pith_short_16","alias_value":"4MNJOTK7WUBZYTB4","created_at":"2026-05-20T01:05:58Z"},{"alias_kind":"pith_short_8","alias_value":"4MNJOTK7","created_at":"2026-05-20T01:05:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:4MNJOTK7WUBZYTB43KKRPVPMLT","target":"record","payload":{"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"},"canonical_sha256":"e31a974d5fb5039c4c3cda9517d5ec5cfd8ff6ed17724816ca86302c1d352c0a","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"},"source_kind":"arxiv","source_id":"2605.19707","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-20T01:05:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m6ZnpoZurhNWYlH/d8dA4F85dV+vvmkFvih/tFrP8meSddxyLKbdeNzCss64APFUkfYUser0QEvb0tW7+wUEBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T22:18:38.626992Z"},"content_sha256":"7ce5e4ce535a5bcc611029309d3c36467d58ad5d315fafd1ac68393d11dde5cc","schema_version":"1.0","event_id":"sha256:7ce5e4ce535a5bcc611029309d3c36467d58ad5d315fafd1ac68393d11dde5cc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:4MNJOTK7WUBZYTB43KKRPVPMLT","target":"graph","payload":{"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"},"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-20T01:05:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SFnY8A2COFJTpUq+bpu/ZorTc32I5aCWnUrzJXE4fYD5Gq10qNpBAfYCcsXVj4nKE8XIqZgpYzY1NfxTMjKzBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T22:18:38.627854Z"},"content_sha256":"eefc77e80fb6544c44628a7a8827b0e059b9c24e5e00e34a1d8705d03e16af07","schema_version":"1.0","event_id":"sha256:eefc77e80fb6544c44628a7a8827b0e059b9c24e5e00e34a1d8705d03e16af07"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4MNJOTK7WUBZYTB43KKRPVPMLT/bundle.json","state_url":"https://pith.science/pith/4MNJOTK7WUBZYTB43KKRPVPMLT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4MNJOTK7WUBZYTB43KKRPVPMLT/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-05-31T22:18:38Z","links":{"resolver":"https://pith.science/pith/4MNJOTK7WUBZYTB43KKRPVPMLT","bundle":"https://pith.science/pith/4MNJOTK7WUBZYTB43KKRPVPMLT/bundle.json","state":"https://pith.science/pith/4MNJOTK7WUBZYTB43KKRPVPMLT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4MNJOTK7WUBZYTB43KKRPVPMLT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:4MNJOTK7WUBZYTB43KKRPVPMLT","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":"a810e4316f7726d2c2dd1e69f776ffcd04a1fe6dfe3179e8e3408eaf738151e0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-19T11:44:38Z","title_canon_sha256":"ade7283a83bc2d4d8b62805d0eb8d54051e55d4f150d467e3ead69b547087ac2"},"schema_version":"1.0","source":{"id":"2605.19707","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.19707","created_at":"2026-05-20T01:05:58Z"},{"alias_kind":"arxiv_version","alias_value":"2605.19707v1","created_at":"2026-05-20T01:05:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.19707","created_at":"2026-05-20T01:05:58Z"},{"alias_kind":"pith_short_12","alias_value":"4MNJOTK7WUBZ","created_at":"2026-05-20T01:05:58Z"},{"alias_kind":"pith_short_16","alias_value":"4MNJOTK7WUBZYTB4","created_at":"2026-05-20T01:05:58Z"},{"alias_kind":"pith_short_8","alias_value":"4MNJOTK7","created_at":"2026-05-20T01:05:58Z"}],"graph_snapshots":[{"event_id":"sha256:eefc77e80fb6544c44628a7a8827b0e059b9c24e5e00e34a1d8705d03e16af07","target":"graph","created_at":"2026-05-20T01:05:58Z","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.19707/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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$.","authors_text":"Kexiang Xu, Shaohan Xu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-19T11:44:38Z","title":"On asymptotic values for the minimum number of spanning forests in simple regular graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.19707","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:7ce5e4ce535a5bcc611029309d3c36467d58ad5d315fafd1ac68393d11dde5cc","target":"record","created_at":"2026-05-20T01:05:58Z","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":"a810e4316f7726d2c2dd1e69f776ffcd04a1fe6dfe3179e8e3408eaf738151e0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-19T11:44:38Z","title_canon_sha256":"ade7283a83bc2d4d8b62805d0eb8d54051e55d4f150d467e3ead69b547087ac2"},"schema_version":"1.0","source":{"id":"2605.19707","kind":"arxiv","version":1}},"canonical_sha256":"e31a974d5fb5039c4c3cda9517d5ec5cfd8ff6ed17724816ca86302c1d352c0a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e31a974d5fb5039c4c3cda9517d5ec5cfd8ff6ed17724816ca86302c1d352c0a","first_computed_at":"2026-05-20T01:05:58.586988Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T01:05:58.586988Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UeGjKyTvPYaK/7qCT8JOkT/6lu8ObeFe4nuYfFO+NED1XfdL0hR9mkykD/jYFnMMjgyp0oHNCu2nKNDcTZLQAA==","signature_status":"signed_v1","signed_at":"2026-05-20T01:05:58.587593Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.19707","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7ce5e4ce535a5bcc611029309d3c36467d58ad5d315fafd1ac68393d11dde5cc","sha256:eefc77e80fb6544c44628a7a8827b0e059b9c24e5e00e34a1d8705d03e16af07"],"state_sha256":"fbdd9c85c5693d01f693d9ef5308ffd07b73186f9099d2539623e69cd45c9f47"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P/Y4gGgwtz7hh9Bg4TJjuoT3Kf2q1kXvcGBBPutKzOZqI/y8sscbppbBZmO3LJeg6vBVonFXRX3e7Q4/WL5HDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T22:18:38.632434Z","bundle_sha256":"461d4393e9d30629cef21a1c91cbf1989683f12b2f8b8850b97a0c317bb6730f"}}