{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:PNLLKCBUOFKKK5MJTPK72C6CIT","short_pith_number":"pith:PNLLKCBU","schema_version":"1.0","canonical_sha256":"7b56b508347154a575899bd5fd0bc244f59e3ab9b65f63c27023d701857fdbb4","source":{"kind":"arxiv","id":"1606.03953","version":2},"attestation_state":"computed","paper":{"title":"Optimal packings of bounded degree trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Daniela K\\\"uhn, Deryk Osthus, Felix Joos, Jaehoon Kim","submitted_at":"2016-06-13T13:59:25Z","abstract_excerpt":"We prove that if $T_1,\\dots, T_n$ is a sequence of bounded degree trees so that $T_i$ has $i$ vertices, then $K_n$ has a decomposition into $T_1,\\dots, T_n$. This shows that the tree packing conjecture of Gy\\'arf\\'as and Lehel from 1976 holds for all bounded degree trees (in fact, we can allow the first $o(n)$ trees to have arbitrary degrees). Similarly, we show that Ringel's conjecture from 1963 holds for all bounded degree trees. We deduce these results from a more general theorem, which yields decompositions of dense quasi-random graphs into suitable families of bounded degree graphs. Our p"},"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":"1606.03953","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-06-13T13:59:25Z","cross_cats_sorted":[],"title_canon_sha256":"e1307453037d9833a9042925783aec0fbe18f8d57e88c23361ba7a68fc19d2af","abstract_canon_sha256":"4eb9e74fc00e95274d17729dea1c643ede59b218f78c265850ecee0c0c4ef82d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:26.297071Z","signature_b64":"q2rRWgI97Cq1I9jf90WmPvw/0Pr+Y96Ub2a07Mp4jZTrXBDr/ydpiXnUGg11+23yr8T96dC2CQ6DvIjgcnZCAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7b56b508347154a575899bd5fd0bc244f59e3ab9b65f63c27023d701857fdbb4","last_reissued_at":"2026-05-17T23:51:26.296585Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:26.296585Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal packings of bounded degree trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Daniela K\\\"uhn, Deryk Osthus, Felix Joos, Jaehoon Kim","submitted_at":"2016-06-13T13:59:25Z","abstract_excerpt":"We prove that if $T_1,\\dots, T_n$ is a sequence of bounded degree trees so that $T_i$ has $i$ vertices, then $K_n$ has a decomposition into $T_1,\\dots, T_n$. This shows that the tree packing conjecture of Gy\\'arf\\'as and Lehel from 1976 holds for all bounded degree trees (in fact, we can allow the first $o(n)$ trees to have arbitrary degrees). Similarly, we show that Ringel's conjecture from 1963 holds for all bounded degree trees. We deduce these results from a more general theorem, which yields decompositions of dense quasi-random graphs into suitable families of bounded degree graphs. Our p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.03953","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":"1606.03953","created_at":"2026-05-17T23:51:26.296662+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.03953v2","created_at":"2026-05-17T23:51:26.296662+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.03953","created_at":"2026-05-17T23:51:26.296662+00:00"},{"alias_kind":"pith_short_12","alias_value":"PNLLKCBUOFKK","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_16","alias_value":"PNLLKCBUOFKKK5MJ","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_8","alias_value":"PNLLKCBU","created_at":"2026-05-18T12:30:39.010887+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/PNLLKCBUOFKKK5MJTPK72C6CIT","json":"https://pith.science/pith/PNLLKCBUOFKKK5MJTPK72C6CIT.json","graph_json":"https://pith.science/api/pith-number/PNLLKCBUOFKKK5MJTPK72C6CIT/graph.json","events_json":"https://pith.science/api/pith-number/PNLLKCBUOFKKK5MJTPK72C6CIT/events.json","paper":"https://pith.science/paper/PNLLKCBU"},"agent_actions":{"view_html":"https://pith.science/pith/PNLLKCBUOFKKK5MJTPK72C6CIT","download_json":"https://pith.science/pith/PNLLKCBUOFKKK5MJTPK72C6CIT.json","view_paper":"https://pith.science/paper/PNLLKCBU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.03953&json=true","fetch_graph":"https://pith.science/api/pith-number/PNLLKCBUOFKKK5MJTPK72C6CIT/graph.json","fetch_events":"https://pith.science/api/pith-number/PNLLKCBUOFKKK5MJTPK72C6CIT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PNLLKCBUOFKKK5MJTPK72C6CIT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PNLLKCBUOFKKK5MJTPK72C6CIT/action/storage_attestation","attest_author":"https://pith.science/pith/PNLLKCBUOFKKK5MJTPK72C6CIT/action/author_attestation","sign_citation":"https://pith.science/pith/PNLLKCBUOFKKK5MJTPK72C6CIT/action/citation_signature","submit_replication":"https://pith.science/pith/PNLLKCBUOFKKK5MJTPK72C6CIT/action/replication_record"}},"created_at":"2026-05-17T23:51:26.296662+00:00","updated_at":"2026-05-17T23:51:26.296662+00:00"}