{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:UWMUXKDIV7YONYIDLEYTSRFPR3","short_pith_number":"pith:UWMUXKDI","canonical_record":{"source":{"id":"1704.00246","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-04-02T03:02:20Z","cross_cats_sorted":[],"title_canon_sha256":"992d43110a885fed78950f20a06aeae298b82ffe4c22d1749d8d2c3f62171f10","abstract_canon_sha256":"a8d453dc1ce5d5dbca4d3fc60e430f073ee7d7fb3949d8faf671b01219194c82"},"schema_version":"1.0"},"canonical_sha256":"a5994ba868aff0e6e10359313944af8ed7572571766ce73b60b315651f6de721","source":{"kind":"arxiv","id":"1704.00246","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.00246","created_at":"2026-05-17T23:41:56Z"},{"alias_kind":"arxiv_version","alias_value":"1704.00246v2","created_at":"2026-05-17T23:41:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.00246","created_at":"2026-05-17T23:41:56Z"},{"alias_kind":"pith_short_12","alias_value":"UWMUXKDIV7YO","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"UWMUXKDIV7YONYID","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"UWMUXKDI","created_at":"2026-05-18T12:31:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:UWMUXKDIV7YONYIDLEYTSRFPR3","target":"record","payload":{"canonical_record":{"source":{"id":"1704.00246","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-04-02T03:02:20Z","cross_cats_sorted":[],"title_canon_sha256":"992d43110a885fed78950f20a06aeae298b82ffe4c22d1749d8d2c3f62171f10","abstract_canon_sha256":"a8d453dc1ce5d5dbca4d3fc60e430f073ee7d7fb3949d8faf671b01219194c82"},"schema_version":"1.0"},"canonical_sha256":"a5994ba868aff0e6e10359313944af8ed7572571766ce73b60b315651f6de721","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:56.741082Z","signature_b64":"TX1+KKmVIehjyFNEdeOK88c53Xk4yz2eLCp51NloGArw0WJ7qFR9fMhtGXmo6GMZ7S6qsqNvolYwk3dRI3hlDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a5994ba868aff0e6e10359313944af8ed7572571766ce73b60b315651f6de721","last_reissued_at":"2026-05-17T23:41:56.740431Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:56.740431Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1704.00246","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-17T23:41:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G+K9lRk5hqotng22fefBJXUmIsC293ho0WQZe9JBpLSTIDne8JBUcXT3DUGmbRWxksNWJoRYsyl3Ma4xR261BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T16:49:06.790381Z"},"content_sha256":"9944c53e065b066b83d0e328ffeb8921c1ab07cf00f436afa0081b5561939b6f","schema_version":"1.0","event_id":"sha256:9944c53e065b066b83d0e328ffeb8921c1ab07cf00f436afa0081b5561939b6f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:UWMUXKDIV7YONYIDLEYTSRFPR3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Toughness and spanning trees in $K_4$-minor-free graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dong Ye, M. N. Ellingham, Songling Shan, Xiaoya Zha","submitted_at":"2017-04-02T03:02:20Z","abstract_excerpt":"For an integer $k$, a $k$-tree is a tree with maximum degree at most $k$. More generally, if $f$ is an integer-valued function on vertices, an $f$-tree is a tree in which each vertex $v$ has degree at most $f(v)$. Let $c(G)$ denote the number of components of a graph $G$. We show that if $G$ is a connected $K_4$-minor-free graph and\n  $$\n  c(G-S) \\;\\le\\; \\sum_{v \\in S} (f(v)-1)\n  \\quad\\hbox{for all $S \\subseteq V(G)$ with $S \\ne \\emptyset$}\n  $$ then $G$ has a spanning $f$-tree. Consequently, if $G$ is a $\\frac{1}{k-1}$-tough $K_4$-minor-free graph, then $G$ has a spanning $k$-tree. These resu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.00246","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-17T23:41:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WzxSvid7jyfH5nhuEiw6kz5FWXsuCzJunij7NSY8wj3/xIxUao+nwJQb0iOJc4RtEwz2rFaxX/pfbC34S307Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T16:49:06.790719Z"},"content_sha256":"22db8bdde813456c5944dddc4f7f50ea88ef02f5016246b90b762da66e046c14","schema_version":"1.0","event_id":"sha256:22db8bdde813456c5944dddc4f7f50ea88ef02f5016246b90b762da66e046c14"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UWMUXKDIV7YONYIDLEYTSRFPR3/bundle.json","state_url":"https://pith.science/pith/UWMUXKDIV7YONYIDLEYTSRFPR3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UWMUXKDIV7YONYIDLEYTSRFPR3/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-09T16:49:06Z","links":{"resolver":"https://pith.science/pith/UWMUXKDIV7YONYIDLEYTSRFPR3","bundle":"https://pith.science/pith/UWMUXKDIV7YONYIDLEYTSRFPR3/bundle.json","state":"https://pith.science/pith/UWMUXKDIV7YONYIDLEYTSRFPR3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UWMUXKDIV7YONYIDLEYTSRFPR3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:UWMUXKDIV7YONYIDLEYTSRFPR3","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":"a8d453dc1ce5d5dbca4d3fc60e430f073ee7d7fb3949d8faf671b01219194c82","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-04-02T03:02:20Z","title_canon_sha256":"992d43110a885fed78950f20a06aeae298b82ffe4c22d1749d8d2c3f62171f10"},"schema_version":"1.0","source":{"id":"1704.00246","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.00246","created_at":"2026-05-17T23:41:56Z"},{"alias_kind":"arxiv_version","alias_value":"1704.00246v2","created_at":"2026-05-17T23:41:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.00246","created_at":"2026-05-17T23:41:56Z"},{"alias_kind":"pith_short_12","alias_value":"UWMUXKDIV7YO","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"UWMUXKDIV7YONYID","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"UWMUXKDI","created_at":"2026-05-18T12:31:49Z"}],"graph_snapshots":[{"event_id":"sha256:22db8bdde813456c5944dddc4f7f50ea88ef02f5016246b90b762da66e046c14","target":"graph","created_at":"2026-05-17T23:41:56Z","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":"For an integer $k$, a $k$-tree is a tree with maximum degree at most $k$. More generally, if $f$ is an integer-valued function on vertices, an $f$-tree is a tree in which each vertex $v$ has degree at most $f(v)$. Let $c(G)$ denote the number of components of a graph $G$. We show that if $G$ is a connected $K_4$-minor-free graph and\n  $$\n  c(G-S) \\;\\le\\; \\sum_{v \\in S} (f(v)-1)\n  \\quad\\hbox{for all $S \\subseteq V(G)$ with $S \\ne \\emptyset$}\n  $$ then $G$ has a spanning $f$-tree. Consequently, if $G$ is a $\\frac{1}{k-1}$-tough $K_4$-minor-free graph, then $G$ has a spanning $k$-tree. These resu","authors_text":"Dong Ye, M. N. Ellingham, Songling Shan, Xiaoya Zha","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-04-02T03:02:20Z","title":"Toughness and spanning trees in $K_4$-minor-free graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.00246","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:9944c53e065b066b83d0e328ffeb8921c1ab07cf00f436afa0081b5561939b6f","target":"record","created_at":"2026-05-17T23:41:56Z","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":"a8d453dc1ce5d5dbca4d3fc60e430f073ee7d7fb3949d8faf671b01219194c82","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-04-02T03:02:20Z","title_canon_sha256":"992d43110a885fed78950f20a06aeae298b82ffe4c22d1749d8d2c3f62171f10"},"schema_version":"1.0","source":{"id":"1704.00246","kind":"arxiv","version":2}},"canonical_sha256":"a5994ba868aff0e6e10359313944af8ed7572571766ce73b60b315651f6de721","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a5994ba868aff0e6e10359313944af8ed7572571766ce73b60b315651f6de721","first_computed_at":"2026-05-17T23:41:56.740431Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:41:56.740431Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TX1+KKmVIehjyFNEdeOK88c53Xk4yz2eLCp51NloGArw0WJ7qFR9fMhtGXmo6GMZ7S6qsqNvolYwk3dRI3hlDg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:41:56.741082Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.00246","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9944c53e065b066b83d0e328ffeb8921c1ab07cf00f436afa0081b5561939b6f","sha256:22db8bdde813456c5944dddc4f7f50ea88ef02f5016246b90b762da66e046c14"],"state_sha256":"6747190d5b44e3d17d2787454ca9cc3829f7decbddb205f61548e51057e175be"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Lz6MtFAxC3Rcugl/ZuBnW151A4wi4Gp4RD1v08qjxQiii4wsNXM6/6EZBQ6axXZIBsh+H/jdT//6dmLQ+jnSCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T16:49:06.792619Z","bundle_sha256":"adae4429a944d8220e5c4355ce584e2b0e05efd08bb187bf190a967008d6d214"}}