{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:YHTZ5GGZ5PC6ST7TI47W7C77GQ","short_pith_number":"pith:YHTZ5GGZ","canonical_record":{"source":{"id":"1212.3627","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-12-14T22:27:21Z","cross_cats_sorted":[],"title_canon_sha256":"4ba07dcb3c9dd5e23991019a8c4189fe08f82a91a6883c0b5edcfba64fc7836e","abstract_canon_sha256":"72933e7343456e0c0a4e42ba3e320a55bf329fdfc6a2df8b578504770827a148"},"schema_version":"1.0"},"canonical_sha256":"c1e79e98d9ebc5e94ff3473f6f8bff3421d46c65cdd521181e6fe51ff7be016e","source":{"kind":"arxiv","id":"1212.3627","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.3627","created_at":"2026-05-18T03:38:22Z"},{"alias_kind":"arxiv_version","alias_value":"1212.3627v1","created_at":"2026-05-18T03:38:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.3627","created_at":"2026-05-18T03:38:22Z"},{"alias_kind":"pith_short_12","alias_value":"YHTZ5GGZ5PC6","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_16","alias_value":"YHTZ5GGZ5PC6ST7T","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_8","alias_value":"YHTZ5GGZ","created_at":"2026-05-18T12:27:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:YHTZ5GGZ5PC6ST7TI47W7C77GQ","target":"record","payload":{"canonical_record":{"source":{"id":"1212.3627","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-12-14T22:27:21Z","cross_cats_sorted":[],"title_canon_sha256":"4ba07dcb3c9dd5e23991019a8c4189fe08f82a91a6883c0b5edcfba64fc7836e","abstract_canon_sha256":"72933e7343456e0c0a4e42ba3e320a55bf329fdfc6a2df8b578504770827a148"},"schema_version":"1.0"},"canonical_sha256":"c1e79e98d9ebc5e94ff3473f6f8bff3421d46c65cdd521181e6fe51ff7be016e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:38:22.808135Z","signature_b64":"08bz7ix0NsWZCjl70EyvswCXD/OPoUa4Uci6q6h0bUQ/9l3CYw2c0FD+qnEjYe+lOUcNccviNI+kpXPEOE2ADw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c1e79e98d9ebc5e94ff3473f6f8bff3421d46c65cdd521181e6fe51ff7be016e","last_reissued_at":"2026-05-18T03:38:22.807632Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:38:22.807632Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1212.3627","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-18T03:38:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZCP9u45exlsaLMjskpKQg/XV4E8Tp6WHSumgG/xVdjGAYAJIdvo1XX+loJJ+y3dzQJl0Y58VFEXOA++eN6apDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T23:32:19.302107Z"},"content_sha256":"514b67aa8c8103446f30de8dc36e6caa79756cc6db866b1bf34fa43fccf8c427","schema_version":"1.0","event_id":"sha256:514b67aa8c8103446f30de8dc36e6caa79756cc6db866b1bf34fa43fccf8c427"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:YHTZ5GGZ5PC6ST7TI47W7C77GQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the tree packing conjecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Cory Palmer, J\\'ozsef Balogh","submitted_at":"2012-12-14T22:27:21Z","abstract_excerpt":"The Gy\\'arf\\'as tree packing conjecture states that any set of $n-1$ trees $T_{1},T_{2},..., T_{n-1}$ such that $T_i$ has $n-i+1$ vertices pack into $K_n$. We show that $t=1/10n^{1/4}$ trees $T_1,T_2,..., T_t$ such that $T_i$ has $n-i+1$ vertices pack into $K_{n+1}$ (for $n$ large enough). We also prove that any set of $t=1/10n^{1/4}$ trees $T_1,T_2,..., T_t$ such that no tree is a star and $T_i$ has $n-i+1$ vertices pack into $K_{n}$ (for $n$ large enough). Finally, we prove that $t=1/4n^{1/3}$ trees $T_1,T_2,..., T_t$ such that $T_i$ has $n-i+1$ vertices pack into $K_n$ as long as each tree "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.3627","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-18T03:38:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tUIPtjMzCQ5pTGW2A9wn1acv9QN0qTmC/O8t1qZT89jWFaBQdZ2u3VwEg8L7KKgU4Sg4odPBUZVGU6kUxcEHDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T23:32:19.302494Z"},"content_sha256":"504d227de1336f30a2b4f361778476d6629441f0e31e0da8abaef74e77b47efd","schema_version":"1.0","event_id":"sha256:504d227de1336f30a2b4f361778476d6629441f0e31e0da8abaef74e77b47efd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YHTZ5GGZ5PC6ST7TI47W7C77GQ/bundle.json","state_url":"https://pith.science/pith/YHTZ5GGZ5PC6ST7TI47W7C77GQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YHTZ5GGZ5PC6ST7TI47W7C77GQ/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-11T23:32:19Z","links":{"resolver":"https://pith.science/pith/YHTZ5GGZ5PC6ST7TI47W7C77GQ","bundle":"https://pith.science/pith/YHTZ5GGZ5PC6ST7TI47W7C77GQ/bundle.json","state":"https://pith.science/pith/YHTZ5GGZ5PC6ST7TI47W7C77GQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YHTZ5GGZ5PC6ST7TI47W7C77GQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:YHTZ5GGZ5PC6ST7TI47W7C77GQ","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":"72933e7343456e0c0a4e42ba3e320a55bf329fdfc6a2df8b578504770827a148","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-12-14T22:27:21Z","title_canon_sha256":"4ba07dcb3c9dd5e23991019a8c4189fe08f82a91a6883c0b5edcfba64fc7836e"},"schema_version":"1.0","source":{"id":"1212.3627","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.3627","created_at":"2026-05-18T03:38:22Z"},{"alias_kind":"arxiv_version","alias_value":"1212.3627v1","created_at":"2026-05-18T03:38:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.3627","created_at":"2026-05-18T03:38:22Z"},{"alias_kind":"pith_short_12","alias_value":"YHTZ5GGZ5PC6","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_16","alias_value":"YHTZ5GGZ5PC6ST7T","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_8","alias_value":"YHTZ5GGZ","created_at":"2026-05-18T12:27:27Z"}],"graph_snapshots":[{"event_id":"sha256:504d227de1336f30a2b4f361778476d6629441f0e31e0da8abaef74e77b47efd","target":"graph","created_at":"2026-05-18T03:38:22Z","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":"The Gy\\'arf\\'as tree packing conjecture states that any set of $n-1$ trees $T_{1},T_{2},..., T_{n-1}$ such that $T_i$ has $n-i+1$ vertices pack into $K_n$. We show that $t=1/10n^{1/4}$ trees $T_1,T_2,..., T_t$ such that $T_i$ has $n-i+1$ vertices pack into $K_{n+1}$ (for $n$ large enough). We also prove that any set of $t=1/10n^{1/4}$ trees $T_1,T_2,..., T_t$ such that no tree is a star and $T_i$ has $n-i+1$ vertices pack into $K_{n}$ (for $n$ large enough). Finally, we prove that $t=1/4n^{1/3}$ trees $T_1,T_2,..., T_t$ such that $T_i$ has $n-i+1$ vertices pack into $K_n$ as long as each tree ","authors_text":"Cory Palmer, J\\'ozsef Balogh","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-12-14T22:27:21Z","title":"On the tree packing conjecture"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.3627","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:514b67aa8c8103446f30de8dc36e6caa79756cc6db866b1bf34fa43fccf8c427","target":"record","created_at":"2026-05-18T03:38:22Z","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":"72933e7343456e0c0a4e42ba3e320a55bf329fdfc6a2df8b578504770827a148","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-12-14T22:27:21Z","title_canon_sha256":"4ba07dcb3c9dd5e23991019a8c4189fe08f82a91a6883c0b5edcfba64fc7836e"},"schema_version":"1.0","source":{"id":"1212.3627","kind":"arxiv","version":1}},"canonical_sha256":"c1e79e98d9ebc5e94ff3473f6f8bff3421d46c65cdd521181e6fe51ff7be016e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c1e79e98d9ebc5e94ff3473f6f8bff3421d46c65cdd521181e6fe51ff7be016e","first_computed_at":"2026-05-18T03:38:22.807632Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:38:22.807632Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"08bz7ix0NsWZCjl70EyvswCXD/OPoUa4Uci6q6h0bUQ/9l3CYw2c0FD+qnEjYe+lOUcNccviNI+kpXPEOE2ADw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:38:22.808135Z","signed_message":"canonical_sha256_bytes"},"source_id":"1212.3627","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:514b67aa8c8103446f30de8dc36e6caa79756cc6db866b1bf34fa43fccf8c427","sha256:504d227de1336f30a2b4f361778476d6629441f0e31e0da8abaef74e77b47efd"],"state_sha256":"5a28da4819abf8582dae38556574e4c753407e4f90cf7cc42954c3ed3ad7e52a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p96/TKOLJHZOKStXCz0Bpn1H8Uuhw/RnZMG713g32il/zPgeg75bJX4KTS6X5S+N9ltsZ9ORHzS++H1G+W6MCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T23:32:19.306459Z","bundle_sha256":"e386d77b5e941568c896e2ebe8f3e9ea9ba0eb90d839b120306b3f719b2b3dc3"}}