{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:TXO7T4YVDWRMY366PY7ALXJTO3","short_pith_number":"pith:TXO7T4YV","schema_version":"1.0","canonical_sha256":"9dddf9f3151da2cc6fde7e3e05dd3376de4a4338a59b285093e8718b92bacac0","source":{"kind":"arxiv","id":"1510.05246","version":2},"attestation_state":"computed","paper":{"title":"Spanning k-ended trees of 3-regular connected graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Daniel Yaqubi, Hamed Ghasemian Zoeram","submitted_at":"2015-10-18T14:13:46Z","abstract_excerpt":"A tree is called k-ended tree if it has at most k leaves, where a leaf is a vertex of degree one. In this paper we prove that every 3-regular connected graph with n vertices such that n is greater than 8 has spanning sub tree with at most [(2n+4)/9]-ended tree. At the end we give a conjecture about spanning k-ended trees on 3-regular connected graphs."},"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":"1510.05246","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-10-18T14:13:46Z","cross_cats_sorted":[],"title_canon_sha256":"64985f49bd3dca93cd2d2f105cd4502dfd4f688382a600e90f68f9acee1cda0b","abstract_canon_sha256":"f4fd979ddd0961ea94f4bf537b09ee1f57336fe6020b6b796cd47da7d2e0acb4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:13.086813Z","signature_b64":"If3UduqRla7b/+FbCyCIPe9FpTWIC0DoNohLjUxltAZ0HqNMHgVJrM9z74CalizLLd5vI2yd+Ttuy68KOjQYAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9dddf9f3151da2cc6fde7e3e05dd3376de4a4338a59b285093e8718b92bacac0","last_reissued_at":"2026-05-18T01:12:13.086401Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:13.086401Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Spanning k-ended trees of 3-regular connected graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Daniel Yaqubi, Hamed Ghasemian Zoeram","submitted_at":"2015-10-18T14:13:46Z","abstract_excerpt":"A tree is called k-ended tree if it has at most k leaves, where a leaf is a vertex of degree one. In this paper we prove that every 3-regular connected graph with n vertices such that n is greater than 8 has spanning sub tree with at most [(2n+4)/9]-ended tree. At the end we give a conjecture about spanning k-ended trees on 3-regular connected graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.05246","kind":"arxiv","version":2},"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":"1510.05246","created_at":"2026-05-18T01:12:13.086480+00:00"},{"alias_kind":"arxiv_version","alias_value":"1510.05246v2","created_at":"2026-05-18T01:12:13.086480+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.05246","created_at":"2026-05-18T01:12:13.086480+00:00"},{"alias_kind":"pith_short_12","alias_value":"TXO7T4YVDWRM","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_16","alias_value":"TXO7T4YVDWRMY366","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_8","alias_value":"TXO7T4YV","created_at":"2026-05-18T12:29:42.218222+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/TXO7T4YVDWRMY366PY7ALXJTO3","json":"https://pith.science/pith/TXO7T4YVDWRMY366PY7ALXJTO3.json","graph_json":"https://pith.science/api/pith-number/TXO7T4YVDWRMY366PY7ALXJTO3/graph.json","events_json":"https://pith.science/api/pith-number/TXO7T4YVDWRMY366PY7ALXJTO3/events.json","paper":"https://pith.science/paper/TXO7T4YV"},"agent_actions":{"view_html":"https://pith.science/pith/TXO7T4YVDWRMY366PY7ALXJTO3","download_json":"https://pith.science/pith/TXO7T4YVDWRMY366PY7ALXJTO3.json","view_paper":"https://pith.science/paper/TXO7T4YV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1510.05246&json=true","fetch_graph":"https://pith.science/api/pith-number/TXO7T4YVDWRMY366PY7ALXJTO3/graph.json","fetch_events":"https://pith.science/api/pith-number/TXO7T4YVDWRMY366PY7ALXJTO3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TXO7T4YVDWRMY366PY7ALXJTO3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TXO7T4YVDWRMY366PY7ALXJTO3/action/storage_attestation","attest_author":"https://pith.science/pith/TXO7T4YVDWRMY366PY7ALXJTO3/action/author_attestation","sign_citation":"https://pith.science/pith/TXO7T4YVDWRMY366PY7ALXJTO3/action/citation_signature","submit_replication":"https://pith.science/pith/TXO7T4YVDWRMY366PY7ALXJTO3/action/replication_record"}},"created_at":"2026-05-18T01:12:13.086480+00:00","updated_at":"2026-05-18T01:12:13.086480+00:00"}