{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:NKIKDL75GA6WAOI7AGBXZY7M6U","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":"39a830fe5b18a0c5d0aaaa2819293b1dba4d6bd6a9515c34b4673dacf641d2d9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-02-27T15:58:17Z","title_canon_sha256":"4fcb9d952285efd3abd440490d7e90ad6eb48c19ba35b2bd543d222e779b1896"},"schema_version":"1.0","source":{"id":"1802.09981","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.09981","created_at":"2026-05-18T00:22:21Z"},{"alias_kind":"arxiv_version","alias_value":"1802.09981v1","created_at":"2026-05-18T00:22:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.09981","created_at":"2026-05-18T00:22:21Z"},{"alias_kind":"pith_short_12","alias_value":"NKIKDL75GA6W","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"NKIKDL75GA6WAOI7","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"NKIKDL75","created_at":"2026-05-18T12:32:40Z"}],"graph_snapshots":[{"event_id":"sha256:e8f1d01f107d7518099af7cb51a127f222184e21e6414c941ceabb2bcd0c52d0","target":"graph","created_at":"2026-05-18T00:22:21Z","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"},"paper":{"abstract_excerpt":"Let $T$ be a tree, a vertex of degree one and a vertex of degree at least three is called a leaf and a branch vertex, respectively. The set of leaves of $T$ is denoted by $Leaf(T)$. The subtree $T-Leaf(T)$ of $T$ is called the stem of $T$ and denoted by $Stem(T).$ In this paper, we give two sufficient conditions for a connected claw-free graph to have a spanning tree whose stem has a bounded number of branch vertices, and those conditions are best possible. As corollaries of main results we also give some conditions to show that a connected claw-free graph has a spanning tree whose stem is a s","authors_text":"Pham Hoang Ha","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-02-27T15:58:17Z","title":"Spanning trees in a Claw-free graph whose stems have at most $k$ branch vertices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.09981","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:e91fdaf0483efc06b197be46ee18b978ad2412c516e023ad38d7b57748715e2b","target":"record","created_at":"2026-05-18T00:22:21Z","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":"39a830fe5b18a0c5d0aaaa2819293b1dba4d6bd6a9515c34b4673dacf641d2d9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-02-27T15:58:17Z","title_canon_sha256":"4fcb9d952285efd3abd440490d7e90ad6eb48c19ba35b2bd543d222e779b1896"},"schema_version":"1.0","source":{"id":"1802.09981","kind":"arxiv","version":1}},"canonical_sha256":"6a90a1affd303d60391f01837ce3ecf5138f6af470c186dcd9b8a1f3d27236c3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6a90a1affd303d60391f01837ce3ecf5138f6af470c186dcd9b8a1f3d27236c3","first_computed_at":"2026-05-18T00:22:21.697558Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:22:21.697558Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dC2+9fPpxJLKQsqQUt2VUORQ+jb7YY+53TURAQrvFFq6rF/v/8B0lzmgJhyDt1dgLsItaxLFKoGA91hqjPEZDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:22:21.698277Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.09981","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e91fdaf0483efc06b197be46ee18b978ad2412c516e023ad38d7b57748715e2b","sha256:e8f1d01f107d7518099af7cb51a127f222184e21e6414c941ceabb2bcd0c52d0"],"state_sha256":"541600c976dfd597c4bfb9e91f361ad5cc05b461ad8fd35d24d2043021bc8c5b"}