{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:LZMKSKKEM2SKRRKANBWLQGWSIF","short_pith_number":"pith:LZMKSKKE","canonical_record":{"source":{"id":"1502.04755","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-02-17T00:19:38Z","cross_cats_sorted":[],"title_canon_sha256":"f429f179d000837d326b5962bd6cafff97ce49b54bd9e5f177afc29cb6a40a72","abstract_canon_sha256":"e539c1da6a6e17bbabd32799a277c8bd42ad8715baac70eca6772ca475dbdc20"},"schema_version":"1.0"},"canonical_sha256":"5e58a9294466a4a8c540686cb81ad24179e404a7791d95fd66ab7832a7afe3fb","source":{"kind":"arxiv","id":"1502.04755","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.04755","created_at":"2026-05-18T02:26:58Z"},{"alias_kind":"arxiv_version","alias_value":"1502.04755v1","created_at":"2026-05-18T02:26:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.04755","created_at":"2026-05-18T02:26:58Z"},{"alias_kind":"pith_short_12","alias_value":"LZMKSKKEM2SK","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"LZMKSKKEM2SKRRKA","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"LZMKSKKE","created_at":"2026-05-18T12:29:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:LZMKSKKEM2SKRRKANBWLQGWSIF","target":"record","payload":{"canonical_record":{"source":{"id":"1502.04755","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-02-17T00:19:38Z","cross_cats_sorted":[],"title_canon_sha256":"f429f179d000837d326b5962bd6cafff97ce49b54bd9e5f177afc29cb6a40a72","abstract_canon_sha256":"e539c1da6a6e17bbabd32799a277c8bd42ad8715baac70eca6772ca475dbdc20"},"schema_version":"1.0"},"canonical_sha256":"5e58a9294466a4a8c540686cb81ad24179e404a7791d95fd66ab7832a7afe3fb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:26:58.406979Z","signature_b64":"wT4ENdclACUgVkmreblGMBvJPRd08A0We1T44fbLkNj8zLIaxED1aEK7WqKkTpZsPO1nSns62wE+fR4pMrOjDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5e58a9294466a4a8c540686cb81ad24179e404a7791d95fd66ab7832a7afe3fb","last_reissued_at":"2026-05-18T02:26:58.406589Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:26:58.406589Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1502.04755","source_version":1,"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-18T02:26:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YhueevCDn+8r+8zYoA+6cvRrHW9cUk8kLtbebwCRCvaRrhVmqNsuAp23YEmTQr9yJAZHLoTLTQIfwQEUHFEiAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T02:55:27.649637Z"},"content_sha256":"2bb71a26fa462c9802317ce356196c00b3692b9560526b36674aaa8edd45a6c8","schema_version":"1.0","event_id":"sha256:2bb71a26fa462c9802317ce356196c00b3692b9560526b36674aaa8edd45a6c8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:LZMKSKKEM2SKRRKANBWLQGWSIF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Decomposition of Sparse Graphs into Forests: The Nine Dragon Tree Conjecture for $k \\le 2$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alexandr Kostochka, Douglas B. West, Min Chen, Seog-Jin Kim, Xuding Zhu","submitted_at":"2015-02-17T00:19:38Z","abstract_excerpt":"For a loopless multigraph $G$, the fractional arboricity $Arb(G)$ is the maximum of $\\frac{|E(H)|}{|V(H)|-1}$ over all subgraphs $H$ with at least two vertices. Generalizing the Nash-Williams Arboricity Theorem, the Nine Dragon Tree Conjecture asserts that if $Arb(G)\\le k+\\frac{d}{k+d+1}$, then $G$ decomposes into $k+1$ forests with one having maximum degree at most $d$. The conjecture was previously proved for $d=k+1$ and for $k=1$ when $d \\le 6$. We prove it for all $d$ when $k \\le 2$, except for $(k,d)=(2,1)$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.04755","kind":"arxiv","version":1},"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-18T02:26:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fSpPQJqTnkZ/6SZ78xHHppih4ZBqF56whOc17R9x+sUMVNI3iJBEkOYqaPj1BsxTSkgznifk1J1/t8clD44ICg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T02:55:27.650383Z"},"content_sha256":"0c01ad7a587554112c1e912670860ffb0b28c8a82c9c871557593724bfb0a1a5","schema_version":"1.0","event_id":"sha256:0c01ad7a587554112c1e912670860ffb0b28c8a82c9c871557593724bfb0a1a5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LZMKSKKEM2SKRRKANBWLQGWSIF/bundle.json","state_url":"https://pith.science/pith/LZMKSKKEM2SKRRKANBWLQGWSIF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LZMKSKKEM2SKRRKANBWLQGWSIF/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-31T02:55:27Z","links":{"resolver":"https://pith.science/pith/LZMKSKKEM2SKRRKANBWLQGWSIF","bundle":"https://pith.science/pith/LZMKSKKEM2SKRRKANBWLQGWSIF/bundle.json","state":"https://pith.science/pith/LZMKSKKEM2SKRRKANBWLQGWSIF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LZMKSKKEM2SKRRKANBWLQGWSIF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:LZMKSKKEM2SKRRKANBWLQGWSIF","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":"e539c1da6a6e17bbabd32799a277c8bd42ad8715baac70eca6772ca475dbdc20","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-02-17T00:19:38Z","title_canon_sha256":"f429f179d000837d326b5962bd6cafff97ce49b54bd9e5f177afc29cb6a40a72"},"schema_version":"1.0","source":{"id":"1502.04755","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.04755","created_at":"2026-05-18T02:26:58Z"},{"alias_kind":"arxiv_version","alias_value":"1502.04755v1","created_at":"2026-05-18T02:26:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.04755","created_at":"2026-05-18T02:26:58Z"},{"alias_kind":"pith_short_12","alias_value":"LZMKSKKEM2SK","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"LZMKSKKEM2SKRRKA","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"LZMKSKKE","created_at":"2026-05-18T12:29:29Z"}],"graph_snapshots":[{"event_id":"sha256:0c01ad7a587554112c1e912670860ffb0b28c8a82c9c871557593724bfb0a1a5","target":"graph","created_at":"2026-05-18T02:26:58Z","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 a loopless multigraph $G$, the fractional arboricity $Arb(G)$ is the maximum of $\\frac{|E(H)|}{|V(H)|-1}$ over all subgraphs $H$ with at least two vertices. Generalizing the Nash-Williams Arboricity Theorem, the Nine Dragon Tree Conjecture asserts that if $Arb(G)\\le k+\\frac{d}{k+d+1}$, then $G$ decomposes into $k+1$ forests with one having maximum degree at most $d$. The conjecture was previously proved for $d=k+1$ and for $k=1$ when $d \\le 6$. We prove it for all $d$ when $k \\le 2$, except for $(k,d)=(2,1)$.","authors_text":"Alexandr Kostochka, Douglas B. West, Min Chen, Seog-Jin Kim, Xuding Zhu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-02-17T00:19:38Z","title":"Decomposition of Sparse Graphs into Forests: The Nine Dragon Tree Conjecture for $k \\le 2$"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.04755","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:2bb71a26fa462c9802317ce356196c00b3692b9560526b36674aaa8edd45a6c8","target":"record","created_at":"2026-05-18T02:26:58Z","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":"e539c1da6a6e17bbabd32799a277c8bd42ad8715baac70eca6772ca475dbdc20","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-02-17T00:19:38Z","title_canon_sha256":"f429f179d000837d326b5962bd6cafff97ce49b54bd9e5f177afc29cb6a40a72"},"schema_version":"1.0","source":{"id":"1502.04755","kind":"arxiv","version":1}},"canonical_sha256":"5e58a9294466a4a8c540686cb81ad24179e404a7791d95fd66ab7832a7afe3fb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5e58a9294466a4a8c540686cb81ad24179e404a7791d95fd66ab7832a7afe3fb","first_computed_at":"2026-05-18T02:26:58.406589Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:26:58.406589Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wT4ENdclACUgVkmreblGMBvJPRd08A0We1T44fbLkNj8zLIaxED1aEK7WqKkTpZsPO1nSns62wE+fR4pMrOjDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:26:58.406979Z","signed_message":"canonical_sha256_bytes"},"source_id":"1502.04755","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2bb71a26fa462c9802317ce356196c00b3692b9560526b36674aaa8edd45a6c8","sha256:0c01ad7a587554112c1e912670860ffb0b28c8a82c9c871557593724bfb0a1a5"],"state_sha256":"4c20fe855b8c7ce62543215f752d7d6b2471a596cae1aaceaed2fffa693a3248"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CbwDBaHU+alD+geqlXU5gQrBcUd9lwM2bFZua6myzx98QaUUD06LQ9O9qSTOLIGiVA5QjRzamEk4XX+MaIocAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T02:55:27.654537Z","bundle_sha256":"684f1ca182f860c1144c4f4ab179c146000c13056711f3c0daf887e4d1452ddf"}}