{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:VRJ5PPA6VRL3URKODOSGEPDRQM","short_pith_number":"pith:VRJ5PPA6","schema_version":"1.0","canonical_sha256":"ac53d7bc1eac57ba454e1ba4623c7183274b711a0a3f726e7fe4b99bde607c70","source":{"kind":"arxiv","id":"1810.11242","version":1},"attestation_state":"computed","paper":{"title":"A note on independence number, connectivity and $k$-ended tree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Pham Hoang Ha","submitted_at":"2018-10-26T10:01:37Z","abstract_excerpt":"A $k$-ended tree is a tree with at most $k$ leaves. In this note, we give a simple proof for the following theorem. Let $G$ be a connected graph and $k$ be an integer ($k\\geq 2$). Let $S$ be a vertex subset of $G$ such that $\\alpha_{G}(S) \\leq k + \\kappa_{G}(S)- 1.$ Then, $G$ has a $k$-ended tree which covers $S.$ Moreover, the condition is sharp."},"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.11242","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-26T10:01:37Z","cross_cats_sorted":[],"title_canon_sha256":"0bcb3440f22bdaf8b9dd8710f0556c79757e8aeb5d8a1b04ae86ad119cddfab4","abstract_canon_sha256":"65cb99267a782edbab0e9b432d40c3c2b944c0108ab515640a85e87cb03baae2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:14.721825Z","signature_b64":"QhEXGS0Z4IoBE+5UvtZFuitjq9WXkZZuBqO3+mYFNf67jtFwgKDhZdoHb6u3EZFmSr81qdKWfpheIej3yi1fAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ac53d7bc1eac57ba454e1ba4623c7183274b711a0a3f726e7fe4b99bde607c70","last_reissued_at":"2026-05-18T00:02:14.721305Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:14.721305Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A note on independence number, connectivity and $k$-ended tree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Pham Hoang Ha","submitted_at":"2018-10-26T10:01:37Z","abstract_excerpt":"A $k$-ended tree is a tree with at most $k$ leaves. In this note, we give a simple proof for the following theorem. Let $G$ be a connected graph and $k$ be an integer ($k\\geq 2$). Let $S$ be a vertex subset of $G$ such that $\\alpha_{G}(S) \\leq k + \\kappa_{G}(S)- 1.$ Then, $G$ has a $k$-ended tree which covers $S.$ Moreover, the condition is sharp."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.11242","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.11242","created_at":"2026-05-18T00:02:14.721397+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.11242v1","created_at":"2026-05-18T00:02:14.721397+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.11242","created_at":"2026-05-18T00:02:14.721397+00:00"},{"alias_kind":"pith_short_12","alias_value":"VRJ5PPA6VRL3","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_16","alias_value":"VRJ5PPA6VRL3URKO","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_8","alias_value":"VRJ5PPA6","created_at":"2026-05-18T12:32:59.047623+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/VRJ5PPA6VRL3URKODOSGEPDRQM","json":"https://pith.science/pith/VRJ5PPA6VRL3URKODOSGEPDRQM.json","graph_json":"https://pith.science/api/pith-number/VRJ5PPA6VRL3URKODOSGEPDRQM/graph.json","events_json":"https://pith.science/api/pith-number/VRJ5PPA6VRL3URKODOSGEPDRQM/events.json","paper":"https://pith.science/paper/VRJ5PPA6"},"agent_actions":{"view_html":"https://pith.science/pith/VRJ5PPA6VRL3URKODOSGEPDRQM","download_json":"https://pith.science/pith/VRJ5PPA6VRL3URKODOSGEPDRQM.json","view_paper":"https://pith.science/paper/VRJ5PPA6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.11242&json=true","fetch_graph":"https://pith.science/api/pith-number/VRJ5PPA6VRL3URKODOSGEPDRQM/graph.json","fetch_events":"https://pith.science/api/pith-number/VRJ5PPA6VRL3URKODOSGEPDRQM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VRJ5PPA6VRL3URKODOSGEPDRQM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VRJ5PPA6VRL3URKODOSGEPDRQM/action/storage_attestation","attest_author":"https://pith.science/pith/VRJ5PPA6VRL3URKODOSGEPDRQM/action/author_attestation","sign_citation":"https://pith.science/pith/VRJ5PPA6VRL3URKODOSGEPDRQM/action/citation_signature","submit_replication":"https://pith.science/pith/VRJ5PPA6VRL3URKODOSGEPDRQM/action/replication_record"}},"created_at":"2026-05-18T00:02:14.721397+00:00","updated_at":"2026-05-18T00:02:14.721397+00:00"}