{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:BFW5PTAP2GHGM53EUPOUUCFQA2","short_pith_number":"pith:BFW5PTAP","schema_version":"1.0","canonical_sha256":"096dd7cc0fd18e667764a3dd4a08b006a9774bdbcd90f3f2e767795da5203052","source":{"kind":"arxiv","id":"1810.08336","version":1},"attestation_state":"computed","paper":{"title":"A note on spanning trees of connected $K_{1,t}$-free graphs whose stems have a few leaves","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dang Dinh Hanh, Pham Hoang Ha","submitted_at":"2018-10-19T02:35:19Z","abstract_excerpt":"Let $T$ be a tree, a vertex of degree one is called a leaf. 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 note, we give a sharp sufficient condition to show that a $K_{1,t}-$free graph has a spanning tree whose stem has a few leaves. By applying the main result, we give improvements of previous related results."},"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":"1810.08336","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-19T02:35:19Z","cross_cats_sorted":[],"title_canon_sha256":"7f2376d5691caee71e7da631ba1d506f9af4eebabaf0ceaa220e83252673ef68","abstract_canon_sha256":"456402267a8c2109ae6fe55da124e0a78bee8c6d6811a00e21e7c9467a7cdf84"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:48.428973Z","signature_b64":"nem7cVQbeyqUhhE++lwhPu6YZpeYXzIQSaSU4wc0wUk8ygMxULCU1mHtGOJT84iCLZ6Kwbh+BjobGExvpIijDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"096dd7cc0fd18e667764a3dd4a08b006a9774bdbcd90f3f2e767795da5203052","last_reissued_at":"2026-05-18T00:02:48.428476Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:48.428476Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A note on spanning trees of connected $K_{1,t}$-free graphs whose stems have a few leaves","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dang Dinh Hanh, Pham Hoang Ha","submitted_at":"2018-10-19T02:35:19Z","abstract_excerpt":"Let $T$ be a tree, a vertex of degree one is called a leaf. 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 note, we give a sharp sufficient condition to show that a $K_{1,t}-$free graph has a spanning tree whose stem has a few leaves. By applying the main result, we give improvements of previous related results."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.08336","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":"1810.08336","created_at":"2026-05-18T00:02:48.428563+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.08336v1","created_at":"2026-05-18T00:02:48.428563+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.08336","created_at":"2026-05-18T00:02:48.428563+00:00"},{"alias_kind":"pith_short_12","alias_value":"BFW5PTAP2GHG","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_16","alias_value":"BFW5PTAP2GHGM53E","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_8","alias_value":"BFW5PTAP","created_at":"2026-05-18T12:32:16.446611+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/BFW5PTAP2GHGM53EUPOUUCFQA2","json":"https://pith.science/pith/BFW5PTAP2GHGM53EUPOUUCFQA2.json","graph_json":"https://pith.science/api/pith-number/BFW5PTAP2GHGM53EUPOUUCFQA2/graph.json","events_json":"https://pith.science/api/pith-number/BFW5PTAP2GHGM53EUPOUUCFQA2/events.json","paper":"https://pith.science/paper/BFW5PTAP"},"agent_actions":{"view_html":"https://pith.science/pith/BFW5PTAP2GHGM53EUPOUUCFQA2","download_json":"https://pith.science/pith/BFW5PTAP2GHGM53EUPOUUCFQA2.json","view_paper":"https://pith.science/paper/BFW5PTAP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.08336&json=true","fetch_graph":"https://pith.science/api/pith-number/BFW5PTAP2GHGM53EUPOUUCFQA2/graph.json","fetch_events":"https://pith.science/api/pith-number/BFW5PTAP2GHGM53EUPOUUCFQA2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BFW5PTAP2GHGM53EUPOUUCFQA2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BFW5PTAP2GHGM53EUPOUUCFQA2/action/storage_attestation","attest_author":"https://pith.science/pith/BFW5PTAP2GHGM53EUPOUUCFQA2/action/author_attestation","sign_citation":"https://pith.science/pith/BFW5PTAP2GHGM53EUPOUUCFQA2/action/citation_signature","submit_replication":"https://pith.science/pith/BFW5PTAP2GHGM53EUPOUUCFQA2/action/replication_record"}},"created_at":"2026-05-18T00:02:48.428563+00:00","updated_at":"2026-05-18T00:02:48.428563+00:00"}