{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:VRJ5PPA6VRL3URKODOSGEPDRQM","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":"65cb99267a782edbab0e9b432d40c3c2b944c0108ab515640a85e87cb03baae2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-26T10:01:37Z","title_canon_sha256":"0bcb3440f22bdaf8b9dd8710f0556c79757e8aeb5d8a1b04ae86ad119cddfab4"},"schema_version":"1.0","source":{"id":"1810.11242","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.11242","created_at":"2026-05-18T00:02:14Z"},{"alias_kind":"arxiv_version","alias_value":"1810.11242v1","created_at":"2026-05-18T00:02:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.11242","created_at":"2026-05-18T00:02:14Z"},{"alias_kind":"pith_short_12","alias_value":"VRJ5PPA6VRL3","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"VRJ5PPA6VRL3URKO","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"VRJ5PPA6","created_at":"2026-05-18T12:32:59Z"}],"graph_snapshots":[{"event_id":"sha256:a4aa563c7e9825c6fd80bb938049358dc6448b8c5b21f16e98a711b1a9429a07","target":"graph","created_at":"2026-05-18T00:02:14Z","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":"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.","authors_text":"Pham Hoang Ha","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-26T10:01:37Z","title":"A note on independence number, connectivity and $k$-ended tree"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.11242","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:e46ecf2e014b19cd3910649fbf3542442a51e8242ac9da6b0918d64ea2d98f00","target":"record","created_at":"2026-05-18T00:02:14Z","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":"65cb99267a782edbab0e9b432d40c3c2b944c0108ab515640a85e87cb03baae2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-26T10:01:37Z","title_canon_sha256":"0bcb3440f22bdaf8b9dd8710f0556c79757e8aeb5d8a1b04ae86ad119cddfab4"},"schema_version":"1.0","source":{"id":"1810.11242","kind":"arxiv","version":1}},"canonical_sha256":"ac53d7bc1eac57ba454e1ba4623c7183274b711a0a3f726e7fe4b99bde607c70","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ac53d7bc1eac57ba454e1ba4623c7183274b711a0a3f726e7fe4b99bde607c70","first_computed_at":"2026-05-18T00:02:14.721305Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:02:14.721305Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QhEXGS0Z4IoBE+5UvtZFuitjq9WXkZZuBqO3+mYFNf67jtFwgKDhZdoHb6u3EZFmSr81qdKWfpheIej3yi1fAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:02:14.721825Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.11242","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e46ecf2e014b19cd3910649fbf3542442a51e8242ac9da6b0918d64ea2d98f00","sha256:a4aa563c7e9825c6fd80bb938049358dc6448b8c5b21f16e98a711b1a9429a07"],"state_sha256":"4d8433ba7f9671b0896c827628fead82af0b974e5078191a6ab75a56fd01d94c"}