{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:PQ2N2GUT2HK5WYVIEH4O5OWD3O","short_pith_number":"pith:PQ2N2GUT","schema_version":"1.0","canonical_sha256":"7c34dd1a93d1d5db62a821f8eebac3dba8edabb07ec5ca981b3bd7f895828bdc","source":{"kind":"arxiv","id":"1405.6560","version":1},"attestation_state":"computed","paper":{"title":"Sharp threshold for embedding combs and other 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-26T13:02:03Z","abstract_excerpt":"When $k|n$, the tree $\\mathrm{Comb}_{n,k}$ consists of a path containing $n/k$ vertices, each of whose vertices has a disjoint path length $k-1$ beginning at it. We show that, for any $k=k(n)$ and $\\epsilon>0$, the binomial random graph $\\mathcal{G}(n,(1+\\epsilon)\\log n/ n)$ almost surely contains $\\mathrm{Comb}_{n,k}$ as a subgraph. This improves a recent result of Kahn, Lubetzky and Wormald. We prove a similar statement for a more general class of trees containing both these combs and all bounded degree spanning trees which have at least $\\epsilon n/ \\log^9n$ disjoint bare paths length $\\lce"},"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.6560","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-05-26T13:02:03Z","cross_cats_sorted":[],"title_canon_sha256":"2912c915f91bcdd84e9456006fa266fc33ab36c54a9126b08a1a8df36ceba4f4","abstract_canon_sha256":"fec165c4f6f7396d1cd12860e2844cbbeed148f58f73d0b61f4345e96f093a15"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:51:07.124880Z","signature_b64":"mgf+8GNe2cfu9IfMGgGQijp8aMK56kvPHUTGtSjQqw7QH2L5EaDd6gE+mBItN457eLb0Hvhpsi3mn6pjvoBTAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7c34dd1a93d1d5db62a821f8eebac3dba8edabb07ec5ca981b3bd7f895828bdc","last_reissued_at":"2026-05-18T02:51:07.124478Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:51:07.124478Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sharp threshold for embedding combs and other 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-26T13:02:03Z","abstract_excerpt":"When $k|n$, the tree $\\mathrm{Comb}_{n,k}$ consists of a path containing $n/k$ vertices, each of whose vertices has a disjoint path length $k-1$ beginning at it. We show that, for any $k=k(n)$ and $\\epsilon>0$, the binomial random graph $\\mathcal{G}(n,(1+\\epsilon)\\log n/ n)$ almost surely contains $\\mathrm{Comb}_{n,k}$ as a subgraph. This improves a recent result of Kahn, Lubetzky and Wormald. We prove a similar statement for a more general class of trees containing both these combs and all bounded degree spanning trees which have at least $\\epsilon n/ \\log^9n$ disjoint bare paths length $\\lce"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.6560","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1405.6560","created_at":"2026-05-18T02:51:07.124537+00:00"},{"alias_kind":"arxiv_version","alias_value":"1405.6560v1","created_at":"2026-05-18T02:51:07.124537+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.6560","created_at":"2026-05-18T02:51:07.124537+00:00"},{"alias_kind":"pith_short_12","alias_value":"PQ2N2GUT2HK5","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_16","alias_value":"PQ2N2GUT2HK5WYVI","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_8","alias_value":"PQ2N2GUT","created_at":"2026-05-18T12:28:43.426989+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/PQ2N2GUT2HK5WYVIEH4O5OWD3O","json":"https://pith.science/pith/PQ2N2GUT2HK5WYVIEH4O5OWD3O.json","graph_json":"https://pith.science/api/pith-number/PQ2N2GUT2HK5WYVIEH4O5OWD3O/graph.json","events_json":"https://pith.science/api/pith-number/PQ2N2GUT2HK5WYVIEH4O5OWD3O/events.json","paper":"https://pith.science/paper/PQ2N2GUT"},"agent_actions":{"view_html":"https://pith.science/pith/PQ2N2GUT2HK5WYVIEH4O5OWD3O","download_json":"https://pith.science/pith/PQ2N2GUT2HK5WYVIEH4O5OWD3O.json","view_paper":"https://pith.science/paper/PQ2N2GUT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1405.6560&json=true","fetch_graph":"https://pith.science/api/pith-number/PQ2N2GUT2HK5WYVIEH4O5OWD3O/graph.json","fetch_events":"https://pith.science/api/pith-number/PQ2N2GUT2HK5WYVIEH4O5OWD3O/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PQ2N2GUT2HK5WYVIEH4O5OWD3O/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PQ2N2GUT2HK5WYVIEH4O5OWD3O/action/storage_attestation","attest_author":"https://pith.science/pith/PQ2N2GUT2HK5WYVIEH4O5OWD3O/action/author_attestation","sign_citation":"https://pith.science/pith/PQ2N2GUT2HK5WYVIEH4O5OWD3O/action/citation_signature","submit_replication":"https://pith.science/pith/PQ2N2GUT2HK5WYVIEH4O5OWD3O/action/replication_record"}},"created_at":"2026-05-18T02:51:07.124537+00:00","updated_at":"2026-05-18T02:51:07.124537+00:00"}