{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:DWNWMMF2WI3WNNMLMNA4ECGCXK","short_pith_number":"pith:DWNWMMF2","schema_version":"1.0","canonical_sha256":"1d9b6630bab23766b58b6341c208c2bab454f08c68e9509622bf8eaedb0219ad","source":{"kind":"arxiv","id":"1405.6559","version":2},"attestation_state":"computed","paper":{"title":"Embedding bounded degree spanning trees in random graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Richard Montgomery","submitted_at":"2014-05-26T12:59:08Z","abstract_excerpt":"We prove that if a tree $T$ has $n$ vertices and maximum degree at most $\\Delta$, then a copy of $T$ can almost surely be found in the random graph $\\mathcal{G}(n,\\Delta\\log^5 n/n)$."},"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":"1405.6559","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-05-26T12:59:08Z","cross_cats_sorted":[],"title_canon_sha256":"754fa576a51bc683756de2a82fe0f46ea803599fdbb8d1287f741c86ebcfd914","abstract_canon_sha256":"11f4491ad26c0b624f0b382728f516148c5a8b184a1885efef36106f5bb5bba4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:48:56.159815Z","signature_b64":"1kqB0tl2AFilDxUUud3Sj6AB1PKL/DyzzsLAvkmNjjbOTp9CkhKLfYo7WLmhHYcAOcyKaQNMLQiS9dLvfcpVBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1d9b6630bab23766b58b6341c208c2bab454f08c68e9509622bf8eaedb0219ad","last_reissued_at":"2026-05-18T02:48:56.159302Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:48:56.159302Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Embedding bounded degree spanning trees in random graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Richard Montgomery","submitted_at":"2014-05-26T12:59:08Z","abstract_excerpt":"We prove that if a tree $T$ has $n$ vertices and maximum degree at most $\\Delta$, then a copy of $T$ can almost surely be found in the random graph $\\mathcal{G}(n,\\Delta\\log^5 n/n)$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.6559","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":"1405.6559","created_at":"2026-05-18T02:48:56.159387+00:00"},{"alias_kind":"arxiv_version","alias_value":"1405.6559v2","created_at":"2026-05-18T02:48:56.159387+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.6559","created_at":"2026-05-18T02:48:56.159387+00:00"},{"alias_kind":"pith_short_12","alias_value":"DWNWMMF2WI3W","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_16","alias_value":"DWNWMMF2WI3WNNML","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_8","alias_value":"DWNWMMF2","created_at":"2026-05-18T12:28:25.294606+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/DWNWMMF2WI3WNNMLMNA4ECGCXK","json":"https://pith.science/pith/DWNWMMF2WI3WNNMLMNA4ECGCXK.json","graph_json":"https://pith.science/api/pith-number/DWNWMMF2WI3WNNMLMNA4ECGCXK/graph.json","events_json":"https://pith.science/api/pith-number/DWNWMMF2WI3WNNMLMNA4ECGCXK/events.json","paper":"https://pith.science/paper/DWNWMMF2"},"agent_actions":{"view_html":"https://pith.science/pith/DWNWMMF2WI3WNNMLMNA4ECGCXK","download_json":"https://pith.science/pith/DWNWMMF2WI3WNNMLMNA4ECGCXK.json","view_paper":"https://pith.science/paper/DWNWMMF2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1405.6559&json=true","fetch_graph":"https://pith.science/api/pith-number/DWNWMMF2WI3WNNMLMNA4ECGCXK/graph.json","fetch_events":"https://pith.science/api/pith-number/DWNWMMF2WI3WNNMLMNA4ECGCXK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DWNWMMF2WI3WNNMLMNA4ECGCXK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DWNWMMF2WI3WNNMLMNA4ECGCXK/action/storage_attestation","attest_author":"https://pith.science/pith/DWNWMMF2WI3WNNMLMNA4ECGCXK/action/author_attestation","sign_citation":"https://pith.science/pith/DWNWMMF2WI3WNNMLMNA4ECGCXK/action/citation_signature","submit_replication":"https://pith.science/pith/DWNWMMF2WI3WNNMLMNA4ECGCXK/action/replication_record"}},"created_at":"2026-05-18T02:48:56.159387+00:00","updated_at":"2026-05-18T02:48:56.159387+00:00"}