{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:NKIKDL75GA6WAOI7AGBXZY7M6U","short_pith_number":"pith:NKIKDL75","schema_version":"1.0","canonical_sha256":"6a90a1affd303d60391f01837ce3ecf5138f6af470c186dcd9b8a1f3d27236c3","source":{"kind":"arxiv","id":"1802.09981","version":1},"attestation_state":"computed","paper":{"title":"Spanning trees in a Claw-free graph whose stems have at most $k$ branch vertices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Pham Hoang Ha","submitted_at":"2018-02-27T15:58:17Z","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"},"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":"1802.09981","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-02-27T15:58:17Z","cross_cats_sorted":[],"title_canon_sha256":"4fcb9d952285efd3abd440490d7e90ad6eb48c19ba35b2bd543d222e779b1896","abstract_canon_sha256":"39a830fe5b18a0c5d0aaaa2819293b1dba4d6bd6a9515c34b4673dacf641d2d9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:21.698277Z","signature_b64":"dC2+9fPpxJLKQsqQUt2VUORQ+jb7YY+53TURAQrvFFq6rF/v/8B0lzmgJhyDt1dgLsItaxLFKoGA91hqjPEZDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6a90a1affd303d60391f01837ce3ecf5138f6af470c186dcd9b8a1f3d27236c3","last_reissued_at":"2026-05-18T00:22:21.697558Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:21.697558Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Spanning trees in a Claw-free graph whose stems have at most $k$ branch vertices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Pham Hoang Ha","submitted_at":"2018-02-27T15:58:17Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.09981","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":""},"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":"1802.09981","created_at":"2026-05-18T00:22:21.697671+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.09981v1","created_at":"2026-05-18T00:22:21.697671+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.09981","created_at":"2026-05-18T00:22:21.697671+00:00"},{"alias_kind":"pith_short_12","alias_value":"NKIKDL75GA6W","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_16","alias_value":"NKIKDL75GA6WAOI7","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_8","alias_value":"NKIKDL75","created_at":"2026-05-18T12:32:40.477152+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/NKIKDL75GA6WAOI7AGBXZY7M6U","json":"https://pith.science/pith/NKIKDL75GA6WAOI7AGBXZY7M6U.json","graph_json":"https://pith.science/api/pith-number/NKIKDL75GA6WAOI7AGBXZY7M6U/graph.json","events_json":"https://pith.science/api/pith-number/NKIKDL75GA6WAOI7AGBXZY7M6U/events.json","paper":"https://pith.science/paper/NKIKDL75"},"agent_actions":{"view_html":"https://pith.science/pith/NKIKDL75GA6WAOI7AGBXZY7M6U","download_json":"https://pith.science/pith/NKIKDL75GA6WAOI7AGBXZY7M6U.json","view_paper":"https://pith.science/paper/NKIKDL75","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.09981&json=true","fetch_graph":"https://pith.science/api/pith-number/NKIKDL75GA6WAOI7AGBXZY7M6U/graph.json","fetch_events":"https://pith.science/api/pith-number/NKIKDL75GA6WAOI7AGBXZY7M6U/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NKIKDL75GA6WAOI7AGBXZY7M6U/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NKIKDL75GA6WAOI7AGBXZY7M6U/action/storage_attestation","attest_author":"https://pith.science/pith/NKIKDL75GA6WAOI7AGBXZY7M6U/action/author_attestation","sign_citation":"https://pith.science/pith/NKIKDL75GA6WAOI7AGBXZY7M6U/action/citation_signature","submit_replication":"https://pith.science/pith/NKIKDL75GA6WAOI7AGBXZY7M6U/action/replication_record"}},"created_at":"2026-05-18T00:22:21.697671+00:00","updated_at":"2026-05-18T00:22:21.697671+00:00"}