{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:TXO7T4YVDWRMY366PY7ALXJTO3","short_pith_number":"pith:TXO7T4YV","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"},"canonical_sha256":"9dddf9f3151da2cc6fde7e3e05dd3376de4a4338a59b285093e8718b92bacac0","source":{"kind":"arxiv","id":"1510.05246","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.05246","created_at":"2026-05-18T01:12:13Z"},{"alias_kind":"arxiv_version","alias_value":"1510.05246v2","created_at":"2026-05-18T01:12:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.05246","created_at":"2026-05-18T01:12:13Z"},{"alias_kind":"pith_short_12","alias_value":"TXO7T4YVDWRM","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"TXO7T4YVDWRMY366","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"TXO7T4YV","created_at":"2026-05-18T12:29:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:TXO7T4YVDWRMY366PY7ALXJTO3","target":"record","payload":{"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"},"canonical_sha256":"9dddf9f3151da2cc6fde7e3e05dd3376de4a4338a59b285093e8718b92bacac0","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"},"source_kind":"arxiv","source_id":"1510.05246","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:12:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RLE//v8PO62IHvVa0E7ibWFiximNhn9DqeSCbvWOAo78jpMbClZuX/IBkXCZfydLfgqFP0l4S08K/UO2wxdGAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T03:00:24.869767Z"},"content_sha256":"c6d5d8c5fc2ff5d2261c78275a2c3a8a9147074d6d05b029133f899c8b123b26","schema_version":"1.0","event_id":"sha256:c6d5d8c5fc2ff5d2261c78275a2c3a8a9147074d6d05b029133f899c8b123b26"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:TXO7T4YVDWRMY366PY7ALXJTO3","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:12:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b5b/fz9+jy2cSoc/YZnX6W2CYqeuG8FK+oaZY4IvjzjkXDKBqgXaROYy2p2hXg/1rttYk3CyPpx1Xpi4jIkwBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T03:00:24.870122Z"},"content_sha256":"ed75f9e6bec1bc9aad6055fa73d534e624fd0cc093f688d96f3d3d1ea0bfb61e","schema_version":"1.0","event_id":"sha256:ed75f9e6bec1bc9aad6055fa73d534e624fd0cc093f688d96f3d3d1ea0bfb61e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TXO7T4YVDWRMY366PY7ALXJTO3/bundle.json","state_url":"https://pith.science/pith/TXO7T4YVDWRMY366PY7ALXJTO3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TXO7T4YVDWRMY366PY7ALXJTO3/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-28T03:00:24Z","links":{"resolver":"https://pith.science/pith/TXO7T4YVDWRMY366PY7ALXJTO3","bundle":"https://pith.science/pith/TXO7T4YVDWRMY366PY7ALXJTO3/bundle.json","state":"https://pith.science/pith/TXO7T4YVDWRMY366PY7ALXJTO3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TXO7T4YVDWRMY366PY7ALXJTO3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:TXO7T4YVDWRMY366PY7ALXJTO3","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":"f4fd979ddd0961ea94f4bf537b09ee1f57336fe6020b6b796cd47da7d2e0acb4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-10-18T14:13:46Z","title_canon_sha256":"64985f49bd3dca93cd2d2f105cd4502dfd4f688382a600e90f68f9acee1cda0b"},"schema_version":"1.0","source":{"id":"1510.05246","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.05246","created_at":"2026-05-18T01:12:13Z"},{"alias_kind":"arxiv_version","alias_value":"1510.05246v2","created_at":"2026-05-18T01:12:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.05246","created_at":"2026-05-18T01:12:13Z"},{"alias_kind":"pith_short_12","alias_value":"TXO7T4YVDWRM","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"TXO7T4YVDWRMY366","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"TXO7T4YV","created_at":"2026-05-18T12:29:42Z"}],"graph_snapshots":[{"event_id":"sha256:ed75f9e6bec1bc9aad6055fa73d534e624fd0cc093f688d96f3d3d1ea0bfb61e","target":"graph","created_at":"2026-05-18T01:12:13Z","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 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.","authors_text":"Daniel Yaqubi, Hamed Ghasemian Zoeram","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-10-18T14:13:46Z","title":"Spanning k-ended trees of 3-regular connected graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.05246","kind":"arxiv","version":2},"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:c6d5d8c5fc2ff5d2261c78275a2c3a8a9147074d6d05b029133f899c8b123b26","target":"record","created_at":"2026-05-18T01:12:13Z","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":"f4fd979ddd0961ea94f4bf537b09ee1f57336fe6020b6b796cd47da7d2e0acb4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-10-18T14:13:46Z","title_canon_sha256":"64985f49bd3dca93cd2d2f105cd4502dfd4f688382a600e90f68f9acee1cda0b"},"schema_version":"1.0","source":{"id":"1510.05246","kind":"arxiv","version":2}},"canonical_sha256":"9dddf9f3151da2cc6fde7e3e05dd3376de4a4338a59b285093e8718b92bacac0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9dddf9f3151da2cc6fde7e3e05dd3376de4a4338a59b285093e8718b92bacac0","first_computed_at":"2026-05-18T01:12:13.086401Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:12:13.086401Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"If3UduqRla7b/+FbCyCIPe9FpTWIC0DoNohLjUxltAZ0HqNMHgVJrM9z74CalizLLd5vI2yd+Ttuy68KOjQYAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:12:13.086813Z","signed_message":"canonical_sha256_bytes"},"source_id":"1510.05246","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c6d5d8c5fc2ff5d2261c78275a2c3a8a9147074d6d05b029133f899c8b123b26","sha256:ed75f9e6bec1bc9aad6055fa73d534e624fd0cc093f688d96f3d3d1ea0bfb61e"],"state_sha256":"baf1d72878f0a202f9563a2160f72e841d9106485f1daefb2c14cce899337de7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9+Jg9RhKhO0yimOFeN32rvjlbCVCkkYm0qflF3wexEXXmRLAiXw5ulbHid2Jot+O+8VU3R0Q2/eBpL5RZrdrDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T03:00:24.872362Z","bundle_sha256":"1c43c80b5f1acec303f17d60be781499633109d3446190c06de2cf7f5a6fb845"}}