{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:YEWZZ3ZG2EQZ5YPNWVGDU3FINR","short_pith_number":"pith:YEWZZ3ZG","canonical_record":{"source":{"id":"1007.2326","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-07-14T13:40:19Z","cross_cats_sorted":[],"title_canon_sha256":"2d9d0958895b1cf9286aa37c6e719b220d1b697bef97fc2dfffde811ca7aafcf","abstract_canon_sha256":"8673b7cfe50f589527542d2fa0050c27daecfcd1c7c51717bf9c198033df1bda"},"schema_version":"1.0"},"canonical_sha256":"c12d9cef26d1219ee1edb54c3a6ca86c4412119bab58be864bf557c1053b68eb","source":{"kind":"arxiv","id":"1007.2326","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1007.2326","created_at":"2026-05-18T04:42:03Z"},{"alias_kind":"arxiv_version","alias_value":"1007.2326v2","created_at":"2026-05-18T04:42:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1007.2326","created_at":"2026-05-18T04:42:03Z"},{"alias_kind":"pith_short_12","alias_value":"YEWZZ3ZG2EQZ","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_16","alias_value":"YEWZZ3ZG2EQZ5YPN","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_8","alias_value":"YEWZZ3ZG","created_at":"2026-05-18T12:26:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:YEWZZ3ZG2EQZ5YPNWVGDU3FINR","target":"record","payload":{"canonical_record":{"source":{"id":"1007.2326","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-07-14T13:40:19Z","cross_cats_sorted":[],"title_canon_sha256":"2d9d0958895b1cf9286aa37c6e719b220d1b697bef97fc2dfffde811ca7aafcf","abstract_canon_sha256":"8673b7cfe50f589527542d2fa0050c27daecfcd1c7c51717bf9c198033df1bda"},"schema_version":"1.0"},"canonical_sha256":"c12d9cef26d1219ee1edb54c3a6ca86c4412119bab58be864bf557c1053b68eb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:42:03.849388Z","signature_b64":"uM+I4KsQAU3iGTf1y6Xz3Oil/uPJBNebAKrdm/SHuKmfJt++38RroMW5SZ62hRhlI7PnRKfIsiojbyElOOo9CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c12d9cef26d1219ee1edb54c3a6ca86c4412119bab58be864bf557c1053b68eb","last_reissued_at":"2026-05-18T04:42:03.848922Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:42:03.848922Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1007.2326","source_version":2,"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-18T04:42:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HQmM/7+k1tzJZPglUmCt5MbRGAb9Oxsj+Rf0664fijW4y1lmOjDRivepr9eLTzzV1NFjcMdKEvrRHrVxBDJsBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T07:12:27.059564Z"},"content_sha256":"10a0c1c136e73fca51f1bd0743c2d6f5784fe581ee62510ef30358a3640087c1","schema_version":"1.0","event_id":"sha256:10a0c1c136e73fca51f1bd0743c2d6f5784fe581ee62510ef30358a3640087c1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:YEWZZ3ZG2EQZ5YPNWVGDU3FINR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Embedding spanning trees in random graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Michael Krivelevich","submitted_at":"2010-07-14T13:40:19Z","abstract_excerpt":"We prove that if T is a tree on n vertices wih maximum degree D and the edge probability p(n) satisfies: np>c*max{D*logn,n^{\\epsilon}} for some constant \\epsilon>0, then with high probability the random graph G(n,p) contains a copy of T. The obtained bound on the edge probability is shown to be essentially tight for D=n^{\\Theta(1)}."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1007.2326","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"},"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-18T04:42:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EHR6X+00jlt/rTbJezBC3Ve9xUE+OTXud2qNV79gZyT9QxpQO9qUvNkMHfer7jfW3y/BEzL8rOFBgnwbdEdPAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T07:12:27.060042Z"},"content_sha256":"157e3bcbd826e0a4ea150cf9e9d2d051f4897ef52e194e32fc2690da36b6acc6","schema_version":"1.0","event_id":"sha256:157e3bcbd826e0a4ea150cf9e9d2d051f4897ef52e194e32fc2690da36b6acc6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YEWZZ3ZG2EQZ5YPNWVGDU3FINR/bundle.json","state_url":"https://pith.science/pith/YEWZZ3ZG2EQZ5YPNWVGDU3FINR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YEWZZ3ZG2EQZ5YPNWVGDU3FINR/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-26T07:12:27Z","links":{"resolver":"https://pith.science/pith/YEWZZ3ZG2EQZ5YPNWVGDU3FINR","bundle":"https://pith.science/pith/YEWZZ3ZG2EQZ5YPNWVGDU3FINR/bundle.json","state":"https://pith.science/pith/YEWZZ3ZG2EQZ5YPNWVGDU3FINR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YEWZZ3ZG2EQZ5YPNWVGDU3FINR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:YEWZZ3ZG2EQZ5YPNWVGDU3FINR","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":"8673b7cfe50f589527542d2fa0050c27daecfcd1c7c51717bf9c198033df1bda","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-07-14T13:40:19Z","title_canon_sha256":"2d9d0958895b1cf9286aa37c6e719b220d1b697bef97fc2dfffde811ca7aafcf"},"schema_version":"1.0","source":{"id":"1007.2326","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1007.2326","created_at":"2026-05-18T04:42:03Z"},{"alias_kind":"arxiv_version","alias_value":"1007.2326v2","created_at":"2026-05-18T04:42:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1007.2326","created_at":"2026-05-18T04:42:03Z"},{"alias_kind":"pith_short_12","alias_value":"YEWZZ3ZG2EQZ","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_16","alias_value":"YEWZZ3ZG2EQZ5YPN","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_8","alias_value":"YEWZZ3ZG","created_at":"2026-05-18T12:26:17Z"}],"graph_snapshots":[{"event_id":"sha256:157e3bcbd826e0a4ea150cf9e9d2d051f4897ef52e194e32fc2690da36b6acc6","target":"graph","created_at":"2026-05-18T04:42:03Z","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":"We prove that if T is a tree on n vertices wih maximum degree D and the edge probability p(n) satisfies: np>c*max{D*logn,n^{\\epsilon}} for some constant \\epsilon>0, then with high probability the random graph G(n,p) contains a copy of T. The obtained bound on the edge probability is shown to be essentially tight for D=n^{\\Theta(1)}.","authors_text":"Michael Krivelevich","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-07-14T13:40:19Z","title":"Embedding spanning trees in random graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1007.2326","kind":"arxiv","version":2},"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:10a0c1c136e73fca51f1bd0743c2d6f5784fe581ee62510ef30358a3640087c1","target":"record","created_at":"2026-05-18T04:42:03Z","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":"8673b7cfe50f589527542d2fa0050c27daecfcd1c7c51717bf9c198033df1bda","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-07-14T13:40:19Z","title_canon_sha256":"2d9d0958895b1cf9286aa37c6e719b220d1b697bef97fc2dfffde811ca7aafcf"},"schema_version":"1.0","source":{"id":"1007.2326","kind":"arxiv","version":2}},"canonical_sha256":"c12d9cef26d1219ee1edb54c3a6ca86c4412119bab58be864bf557c1053b68eb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c12d9cef26d1219ee1edb54c3a6ca86c4412119bab58be864bf557c1053b68eb","first_computed_at":"2026-05-18T04:42:03.848922Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:42:03.848922Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uM+I4KsQAU3iGTf1y6Xz3Oil/uPJBNebAKrdm/SHuKmfJt++38RroMW5SZ62hRhlI7PnRKfIsiojbyElOOo9CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:42:03.849388Z","signed_message":"canonical_sha256_bytes"},"source_id":"1007.2326","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:10a0c1c136e73fca51f1bd0743c2d6f5784fe581ee62510ef30358a3640087c1","sha256:157e3bcbd826e0a4ea150cf9e9d2d051f4897ef52e194e32fc2690da36b6acc6"],"state_sha256":"7cb737bfa5f3f82b701510e2197b396615a22c2ae6140dbf68b451bb2a7d40f9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HNRJtsoulQiAAIgejKrm3clogIvyE1yj55gVxlYkIfFSFzOm2O5C8REYXkS20ABn2LQyFnJvQqXUSeUrrn+CAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T07:12:27.062727Z","bundle_sha256":"f0175afe910dbd485131549bfa2c0a70f23ff238ec857c9e302ac1ec09fed6d0"}}