{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:NBJQ3RLJVKYJNLRXPTNSQG7I74","short_pith_number":"pith:NBJQ3RLJ","canonical_record":{"source":{"id":"1607.07342","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-07-25T16:22:53Z","cross_cats_sorted":[],"title_canon_sha256":"e9bd3fbc9b19942048797bd9ef61dc9d9383ecfa705831bd4d3850be3b959c61","abstract_canon_sha256":"4deacbf779c967dac2f07dafb6fa766fa28856bebbf6e307769fdc12fc0da6e1"},"schema_version":"1.0"},"canonical_sha256":"68530dc569aab096ae377cdb281be8ff238abdb00c7d6e78be6a3f88078c08a4","source":{"kind":"arxiv","id":"1607.07342","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.07342","created_at":"2026-05-18T00:04:17Z"},{"alias_kind":"arxiv_version","alias_value":"1607.07342v1","created_at":"2026-05-18T00:04:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.07342","created_at":"2026-05-18T00:04:17Z"},{"alias_kind":"pith_short_12","alias_value":"NBJQ3RLJVKYJ","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"NBJQ3RLJVKYJNLRX","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"NBJQ3RLJ","created_at":"2026-05-18T12:30:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:NBJQ3RLJVKYJNLRXPTNSQG7I74","target":"record","payload":{"canonical_record":{"source":{"id":"1607.07342","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-07-25T16:22:53Z","cross_cats_sorted":[],"title_canon_sha256":"e9bd3fbc9b19942048797bd9ef61dc9d9383ecfa705831bd4d3850be3b959c61","abstract_canon_sha256":"4deacbf779c967dac2f07dafb6fa766fa28856bebbf6e307769fdc12fc0da6e1"},"schema_version":"1.0"},"canonical_sha256":"68530dc569aab096ae377cdb281be8ff238abdb00c7d6e78be6a3f88078c08a4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:17.951873Z","signature_b64":"gZINXj9pswy6WaNgjE0/CIyZaKXy1CzV9pvaFDJzi3J9C9CCc1udo+Wv+uyuO14I5t+ls4wUkjlyogIjcRFzBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"68530dc569aab096ae377cdb281be8ff238abdb00c7d6e78be6a3f88078c08a4","last_reissued_at":"2026-05-18T00:04:17.951145Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:17.951145Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1607.07342","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-18T00:04:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C10uEdWk4s54Jjkv6z9R7vjYSXZ2D1ZiyUBVjKtGqZq6yPcD/MTwPTf8gmU2Q1jI8dtppX1hjPtyUFbysSnnBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T12:21:54.262941Z"},"content_sha256":"caea211f334aa3164508ecbe4cdecb401f51bfae7c39fe58dc624048c390ae73","schema_version":"1.0","event_id":"sha256:caea211f334aa3164508ecbe4cdecb401f51bfae7c39fe58dc624048c390ae73"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:NBJQ3RLJVKYJNLRXPTNSQG7I74","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Packing trees of unbounded degrees in random graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Asaf Ferber, Wojciech Samotij","submitted_at":"2016-07-25T16:22:53Z","abstract_excerpt":"In this paper, we address the problem of packing large trees in $G_{n,p}$. In particular, we prove the following result. Suppose that $T_1, \\dotsc, T_N$ are $n$-vertex trees, each of which has maximum degree at most $(np)^{1/6} / (\\log n)^6$. Then with high probability, one can find edge-disjoint copies of all the $T_i$ in the random graph $G_{n,p}$, provided that $p \\geq (\\log n)^{36}/n$ and $N \\le (1-\\varepsilon)np/2$ for a positive constant $\\varepsilon$. Moreover, if each $T_i$ has at most $(1-\\alpha)n$ vertices, for some positive $\\alpha$, then the same result holds under the much weaker "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.07342","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-18T00:04:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ydwfg2bxRzLn2alGfpmJAyu9ipqHw8jMe8si4d7jiytqOe7JiS42UT8dbH4jBFkuLgpTAD3yXy1a117UgSnFBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T12:21:54.263289Z"},"content_sha256":"c32ec41db6322ddf412ebdc4dd4ab8b947ca7fee6624dc11e1a1ddb3fbafd5be","schema_version":"1.0","event_id":"sha256:c32ec41db6322ddf412ebdc4dd4ab8b947ca7fee6624dc11e1a1ddb3fbafd5be"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NBJQ3RLJVKYJNLRXPTNSQG7I74/bundle.json","state_url":"https://pith.science/pith/NBJQ3RLJVKYJNLRXPTNSQG7I74/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NBJQ3RLJVKYJNLRXPTNSQG7I74/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-04T12:21:54Z","links":{"resolver":"https://pith.science/pith/NBJQ3RLJVKYJNLRXPTNSQG7I74","bundle":"https://pith.science/pith/NBJQ3RLJVKYJNLRXPTNSQG7I74/bundle.json","state":"https://pith.science/pith/NBJQ3RLJVKYJNLRXPTNSQG7I74/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NBJQ3RLJVKYJNLRXPTNSQG7I74/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:NBJQ3RLJVKYJNLRXPTNSQG7I74","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":"4deacbf779c967dac2f07dafb6fa766fa28856bebbf6e307769fdc12fc0da6e1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-07-25T16:22:53Z","title_canon_sha256":"e9bd3fbc9b19942048797bd9ef61dc9d9383ecfa705831bd4d3850be3b959c61"},"schema_version":"1.0","source":{"id":"1607.07342","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.07342","created_at":"2026-05-18T00:04:17Z"},{"alias_kind":"arxiv_version","alias_value":"1607.07342v1","created_at":"2026-05-18T00:04:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.07342","created_at":"2026-05-18T00:04:17Z"},{"alias_kind":"pith_short_12","alias_value":"NBJQ3RLJVKYJ","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"NBJQ3RLJVKYJNLRX","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"NBJQ3RLJ","created_at":"2026-05-18T12:30:32Z"}],"graph_snapshots":[{"event_id":"sha256:c32ec41db6322ddf412ebdc4dd4ab8b947ca7fee6624dc11e1a1ddb3fbafd5be","target":"graph","created_at":"2026-05-18T00:04:17Z","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":"In this paper, we address the problem of packing large trees in $G_{n,p}$. In particular, we prove the following result. Suppose that $T_1, \\dotsc, T_N$ are $n$-vertex trees, each of which has maximum degree at most $(np)^{1/6} / (\\log n)^6$. Then with high probability, one can find edge-disjoint copies of all the $T_i$ in the random graph $G_{n,p}$, provided that $p \\geq (\\log n)^{36}/n$ and $N \\le (1-\\varepsilon)np/2$ for a positive constant $\\varepsilon$. Moreover, if each $T_i$ has at most $(1-\\alpha)n$ vertices, for some positive $\\alpha$, then the same result holds under the much weaker ","authors_text":"Asaf Ferber, Wojciech Samotij","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-07-25T16:22:53Z","title":"Packing trees of unbounded degrees in random graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.07342","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:caea211f334aa3164508ecbe4cdecb401f51bfae7c39fe58dc624048c390ae73","target":"record","created_at":"2026-05-18T00:04:17Z","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":"4deacbf779c967dac2f07dafb6fa766fa28856bebbf6e307769fdc12fc0da6e1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-07-25T16:22:53Z","title_canon_sha256":"e9bd3fbc9b19942048797bd9ef61dc9d9383ecfa705831bd4d3850be3b959c61"},"schema_version":"1.0","source":{"id":"1607.07342","kind":"arxiv","version":1}},"canonical_sha256":"68530dc569aab096ae377cdb281be8ff238abdb00c7d6e78be6a3f88078c08a4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"68530dc569aab096ae377cdb281be8ff238abdb00c7d6e78be6a3f88078c08a4","first_computed_at":"2026-05-18T00:04:17.951145Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:04:17.951145Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gZINXj9pswy6WaNgjE0/CIyZaKXy1CzV9pvaFDJzi3J9C9CCc1udo+Wv+uyuO14I5t+ls4wUkjlyogIjcRFzBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:04:17.951873Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.07342","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:caea211f334aa3164508ecbe4cdecb401f51bfae7c39fe58dc624048c390ae73","sha256:c32ec41db6322ddf412ebdc4dd4ab8b947ca7fee6624dc11e1a1ddb3fbafd5be"],"state_sha256":"255ba7c9e87f102caa407f9c20fe067bcec3a959a9ab933aa1540f3df5b420f6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vn+y0ySCqSrZLbDrhtJGfKnF/8eLGkdCTH2QU4g9R0lfACrCUZ7WE8/lNGzPWt3TIoCDXnH2rANc+jQql91yDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T12:21:54.265211Z","bundle_sha256":"bd2185aa929849d4368b2c872faba7d2c808832d5ce00ce6c2d510c84536ba04"}}