{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:WGBF5OMQQKUMPO5PTKN5BPDNBA","short_pith_number":"pith:WGBF5OMQ","canonical_record":{"source":{"id":"1804.09332","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-04-25T03:15:44Z","cross_cats_sorted":[],"title_canon_sha256":"a62248a5effc84e40ff466a326fed95d5ccc215ff6dc832f861a5b6fd45329a8","abstract_canon_sha256":"5f8c2abb56825b9dc7be34e1e0c0673359b347b94834434b6bcbd7ee6d981417"},"schema_version":"1.0"},"canonical_sha256":"b1825eb99082a8c7bbaf9a9bd0bc6d080ae7d48a64d21b7eee8692c7ce2e4000","source":{"kind":"arxiv","id":"1804.09332","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.09332","created_at":"2026-05-18T00:02:49Z"},{"alias_kind":"arxiv_version","alias_value":"1804.09332v2","created_at":"2026-05-18T00:02:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.09332","created_at":"2026-05-18T00:02:49Z"},{"alias_kind":"pith_short_12","alias_value":"WGBF5OMQQKUM","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"WGBF5OMQQKUMPO5P","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"WGBF5OMQ","created_at":"2026-05-18T12:32:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:WGBF5OMQQKUMPO5PTKN5BPDNBA","target":"record","payload":{"canonical_record":{"source":{"id":"1804.09332","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-04-25T03:15:44Z","cross_cats_sorted":[],"title_canon_sha256":"a62248a5effc84e40ff466a326fed95d5ccc215ff6dc832f861a5b6fd45329a8","abstract_canon_sha256":"5f8c2abb56825b9dc7be34e1e0c0673359b347b94834434b6bcbd7ee6d981417"},"schema_version":"1.0"},"canonical_sha256":"b1825eb99082a8c7bbaf9a9bd0bc6d080ae7d48a64d21b7eee8692c7ce2e4000","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:49.450856Z","signature_b64":"jKf9HjV67cygumzqOrtAoLFVZiGKreNtkG5e+295ES7d9DaLhAdFcNw7EEmnIj0FmE5imEiLKdNfmZHAcs8qDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b1825eb99082a8c7bbaf9a9bd0bc6d080ae7d48a64d21b7eee8692c7ce2e4000","last_reissued_at":"2026-05-18T00:02:49.450245Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:49.450245Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1804.09332","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-18T00:02:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x+2b8vUZjcid8LKsatVnT9adFTZ/JQMCMdpQ9CEC/pDKTP6NPILThq+jYjj6kLGMJim4LA+zB/F0xwlfQ8UDBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T13:25:36.002249Z"},"content_sha256":"225f102afaa6a08fca1bd67e54e898794e12a95e227045358af380a4b8c50536","schema_version":"1.0","event_id":"sha256:225f102afaa6a08fca1bd67e54e898794e12a95e227045358af380a4b8c50536"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:WGBF5OMQQKUMPO5PTKN5BPDNBA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Spanning trees with at most 4 leaves in $K_{1,5}-$free graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dang Dinh Hanh, Pham Hoang Ha, Yuan Chen","submitted_at":"2018-04-25T03:15:44Z","abstract_excerpt":"In 2009, Kyaw proved that every $n$-vertex connected $K_{1,4}$-free graph $G$ with $\\sigma_4(G)\\geq n-1$ contains a spanning tree with at most $3$ leaves. In this paper, we prove an analogue of Kyaw's result for connected $K_{1,5}$-free graphs. We show that every $n$-vertex connected $K_{1,5}$-free graph $G$ with $\\sigma_5(G)\\geq n-1$ contains a spanning tree with at most $4$ leaves. Moreover, the degree sum condition `$\\sigma_5(G)\\geq n-1$' is best possible."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.09332","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-18T00:02:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eac3ONHJILx7J849a2eiIUXmuzdkx72wyAwVgA1vedA/rj5lkBJ8wfavzJl8Z7AD1ynljveNwCcHlrc85c4DAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T13:25:36.002615Z"},"content_sha256":"2b52811ee2a75062678828809e967d33f770ad92f5026494b294761ac9846c68","schema_version":"1.0","event_id":"sha256:2b52811ee2a75062678828809e967d33f770ad92f5026494b294761ac9846c68"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WGBF5OMQQKUMPO5PTKN5BPDNBA/bundle.json","state_url":"https://pith.science/pith/WGBF5OMQQKUMPO5PTKN5BPDNBA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WGBF5OMQQKUMPO5PTKN5BPDNBA/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-06-24T13:25:36Z","links":{"resolver":"https://pith.science/pith/WGBF5OMQQKUMPO5PTKN5BPDNBA","bundle":"https://pith.science/pith/WGBF5OMQQKUMPO5PTKN5BPDNBA/bundle.json","state":"https://pith.science/pith/WGBF5OMQQKUMPO5PTKN5BPDNBA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WGBF5OMQQKUMPO5PTKN5BPDNBA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:WGBF5OMQQKUMPO5PTKN5BPDNBA","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":"5f8c2abb56825b9dc7be34e1e0c0673359b347b94834434b6bcbd7ee6d981417","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-04-25T03:15:44Z","title_canon_sha256":"a62248a5effc84e40ff466a326fed95d5ccc215ff6dc832f861a5b6fd45329a8"},"schema_version":"1.0","source":{"id":"1804.09332","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.09332","created_at":"2026-05-18T00:02:49Z"},{"alias_kind":"arxiv_version","alias_value":"1804.09332v2","created_at":"2026-05-18T00:02:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.09332","created_at":"2026-05-18T00:02:49Z"},{"alias_kind":"pith_short_12","alias_value":"WGBF5OMQQKUM","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"WGBF5OMQQKUMPO5P","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"WGBF5OMQ","created_at":"2026-05-18T12:32:59Z"}],"graph_snapshots":[{"event_id":"sha256:2b52811ee2a75062678828809e967d33f770ad92f5026494b294761ac9846c68","target":"graph","created_at":"2026-05-18T00:02:49Z","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":"In 2009, Kyaw proved that every $n$-vertex connected $K_{1,4}$-free graph $G$ with $\\sigma_4(G)\\geq n-1$ contains a spanning tree with at most $3$ leaves. In this paper, we prove an analogue of Kyaw's result for connected $K_{1,5}$-free graphs. We show that every $n$-vertex connected $K_{1,5}$-free graph $G$ with $\\sigma_5(G)\\geq n-1$ contains a spanning tree with at most $4$ leaves. Moreover, the degree sum condition `$\\sigma_5(G)\\geq n-1$' is best possible.","authors_text":"Dang Dinh Hanh, Pham Hoang Ha, Yuan Chen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-04-25T03:15:44Z","title":"Spanning trees with at most 4 leaves in $K_{1,5}-$free graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.09332","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:225f102afaa6a08fca1bd67e54e898794e12a95e227045358af380a4b8c50536","target":"record","created_at":"2026-05-18T00:02:49Z","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":"5f8c2abb56825b9dc7be34e1e0c0673359b347b94834434b6bcbd7ee6d981417","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-04-25T03:15:44Z","title_canon_sha256":"a62248a5effc84e40ff466a326fed95d5ccc215ff6dc832f861a5b6fd45329a8"},"schema_version":"1.0","source":{"id":"1804.09332","kind":"arxiv","version":2}},"canonical_sha256":"b1825eb99082a8c7bbaf9a9bd0bc6d080ae7d48a64d21b7eee8692c7ce2e4000","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b1825eb99082a8c7bbaf9a9bd0bc6d080ae7d48a64d21b7eee8692c7ce2e4000","first_computed_at":"2026-05-18T00:02:49.450245Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:02:49.450245Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jKf9HjV67cygumzqOrtAoLFVZiGKreNtkG5e+295ES7d9DaLhAdFcNw7EEmnIj0FmE5imEiLKdNfmZHAcs8qDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:02:49.450856Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.09332","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:225f102afaa6a08fca1bd67e54e898794e12a95e227045358af380a4b8c50536","sha256:2b52811ee2a75062678828809e967d33f770ad92f5026494b294761ac9846c68"],"state_sha256":"750d19d11418a3030b6a01bf870e1f4938acda11377ef9e34060290c7066d208"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NIgTW65/iRwzO8DVBLgaewhV7SQ7mabZZnaPvhMoB0EVWBP8NX+9o/2jj0P74WGglJk9YMeP8Wpe2zIgz4OgBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T13:25:36.004626Z","bundle_sha256":"ff5034ed6b4fb2cc1be6f981b24c83f367d58f7e0d2efa1ae2836719a9929be5"}}