{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:XA2JDTZHORNZIEL4XBDURRBMQM","short_pith_number":"pith:XA2JDTZH","schema_version":"1.0","canonical_sha256":"b83491cf27745b94117cb84748c42c831217b0292e10ad95157a0ad538847dde","source":{"kind":"arxiv","id":"1104.0642","version":3},"attestation_state":"computed","paper":{"title":"Generalizations of the Tree Packing Conjecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bal\\'azs Keszegh, Cory Palmer, D\\'aniel Gerbner","submitted_at":"2011-04-04T18:05:25Z","abstract_excerpt":"The Gy\\'arf\\'as tree packing conjecture asserts that any set of trees with $2,3, ..., k$ vertices has an (edge-disjoint) packing into the complete graph on $k$ vertices. Gy\\'arf\\'as and Lehel proved that the conjecture holds in some special cases. We address the problem of packing trees into $k$-chromatic graphs. In particular, we prove that if all but three of the trees are stars then they have a packing into any $k$-chromatic graph. We also consider several other generalizations of the conjecture."},"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":"1104.0642","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-04-04T18:05:25Z","cross_cats_sorted":[],"title_canon_sha256":"ac1b6662d739d50f55c14d0413e017a82f1ab253fc7079e27f05ad340a53f179","abstract_canon_sha256":"67ebeca31238dfdfe94680e606c34b75aee37b1cc57bd3e14e1b8af13944298c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:10:35.933393Z","signature_b64":"Q+lLiIQPvoWk/icrOCgwr6RHsYYffpwb1oJLP12ux0ao+9B2UAjuqrQVByam01EzEYr0GJWD5sTxFhkMt5B2CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b83491cf27745b94117cb84748c42c831217b0292e10ad95157a0ad538847dde","last_reissued_at":"2026-05-18T04:10:35.932576Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:10:35.932576Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Generalizations of the Tree Packing Conjecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bal\\'azs Keszegh, Cory Palmer, D\\'aniel Gerbner","submitted_at":"2011-04-04T18:05:25Z","abstract_excerpt":"The Gy\\'arf\\'as tree packing conjecture asserts that any set of trees with $2,3, ..., k$ vertices has an (edge-disjoint) packing into the complete graph on $k$ vertices. Gy\\'arf\\'as and Lehel proved that the conjecture holds in some special cases. We address the problem of packing trees into $k$-chromatic graphs. In particular, we prove that if all but three of the trees are stars then they have a packing into any $k$-chromatic graph. We also consider several other generalizations of the conjecture."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.0642","kind":"arxiv","version":3},"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":"1104.0642","created_at":"2026-05-18T04:10:35.932714+00:00"},{"alias_kind":"arxiv_version","alias_value":"1104.0642v3","created_at":"2026-05-18T04:10:35.932714+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.0642","created_at":"2026-05-18T04:10:35.932714+00:00"},{"alias_kind":"pith_short_12","alias_value":"XA2JDTZHORNZ","created_at":"2026-05-18T12:26:44.992195+00:00"},{"alias_kind":"pith_short_16","alias_value":"XA2JDTZHORNZIEL4","created_at":"2026-05-18T12:26:44.992195+00:00"},{"alias_kind":"pith_short_8","alias_value":"XA2JDTZH","created_at":"2026-05-18T12:26:44.992195+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/XA2JDTZHORNZIEL4XBDURRBMQM","json":"https://pith.science/pith/XA2JDTZHORNZIEL4XBDURRBMQM.json","graph_json":"https://pith.science/api/pith-number/XA2JDTZHORNZIEL4XBDURRBMQM/graph.json","events_json":"https://pith.science/api/pith-number/XA2JDTZHORNZIEL4XBDURRBMQM/events.json","paper":"https://pith.science/paper/XA2JDTZH"},"agent_actions":{"view_html":"https://pith.science/pith/XA2JDTZHORNZIEL4XBDURRBMQM","download_json":"https://pith.science/pith/XA2JDTZHORNZIEL4XBDURRBMQM.json","view_paper":"https://pith.science/paper/XA2JDTZH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1104.0642&json=true","fetch_graph":"https://pith.science/api/pith-number/XA2JDTZHORNZIEL4XBDURRBMQM/graph.json","fetch_events":"https://pith.science/api/pith-number/XA2JDTZHORNZIEL4XBDURRBMQM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XA2JDTZHORNZIEL4XBDURRBMQM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XA2JDTZHORNZIEL4XBDURRBMQM/action/storage_attestation","attest_author":"https://pith.science/pith/XA2JDTZHORNZIEL4XBDURRBMQM/action/author_attestation","sign_citation":"https://pith.science/pith/XA2JDTZHORNZIEL4XBDURRBMQM/action/citation_signature","submit_replication":"https://pith.science/pith/XA2JDTZHORNZIEL4XBDURRBMQM/action/replication_record"}},"created_at":"2026-05-18T04:10:35.932714+00:00","updated_at":"2026-05-18T04:10:35.932714+00:00"}