{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:YEWZZ3ZG2EQZ5YPNWVGDU3FINR","short_pith_number":"pith:YEWZZ3ZG","schema_version":"1.0","canonical_sha256":"c12d9cef26d1219ee1edb54c3a6ca86c4412119bab58be864bf557c1053b68eb","source":{"kind":"arxiv","id":"1007.2326","version":2},"attestation_state":"computed","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)}."},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1007.2326","created_at":"2026-05-18T04:42:03.848975+00:00"},{"alias_kind":"arxiv_version","alias_value":"1007.2326v2","created_at":"2026-05-18T04:42:03.848975+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1007.2326","created_at":"2026-05-18T04:42:03.848975+00:00"},{"alias_kind":"pith_short_12","alias_value":"YEWZZ3ZG2EQZ","created_at":"2026-05-18T12:26:17.028572+00:00"},{"alias_kind":"pith_short_16","alias_value":"YEWZZ3ZG2EQZ5YPN","created_at":"2026-05-18T12:26:17.028572+00:00"},{"alias_kind":"pith_short_8","alias_value":"YEWZZ3ZG","created_at":"2026-05-18T12:26:17.028572+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/YEWZZ3ZG2EQZ5YPNWVGDU3FINR","json":"https://pith.science/pith/YEWZZ3ZG2EQZ5YPNWVGDU3FINR.json","graph_json":"https://pith.science/api/pith-number/YEWZZ3ZG2EQZ5YPNWVGDU3FINR/graph.json","events_json":"https://pith.science/api/pith-number/YEWZZ3ZG2EQZ5YPNWVGDU3FINR/events.json","paper":"https://pith.science/paper/YEWZZ3ZG"},"agent_actions":{"view_html":"https://pith.science/pith/YEWZZ3ZG2EQZ5YPNWVGDU3FINR","download_json":"https://pith.science/pith/YEWZZ3ZG2EQZ5YPNWVGDU3FINR.json","view_paper":"https://pith.science/paper/YEWZZ3ZG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1007.2326&json=true","fetch_graph":"https://pith.science/api/pith-number/YEWZZ3ZG2EQZ5YPNWVGDU3FINR/graph.json","fetch_events":"https://pith.science/api/pith-number/YEWZZ3ZG2EQZ5YPNWVGDU3FINR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YEWZZ3ZG2EQZ5YPNWVGDU3FINR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YEWZZ3ZG2EQZ5YPNWVGDU3FINR/action/storage_attestation","attest_author":"https://pith.science/pith/YEWZZ3ZG2EQZ5YPNWVGDU3FINR/action/author_attestation","sign_citation":"https://pith.science/pith/YEWZZ3ZG2EQZ5YPNWVGDU3FINR/action/citation_signature","submit_replication":"https://pith.science/pith/YEWZZ3ZG2EQZ5YPNWVGDU3FINR/action/replication_record"}},"created_at":"2026-05-18T04:42:03.848975+00:00","updated_at":"2026-05-18T04:42:03.848975+00:00"}