{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:PQ2N2GUT2HK5WYVIEH4O5OWD3O","short_pith_number":"pith:PQ2N2GUT","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"},"canonical_sha256":"7c34dd1a93d1d5db62a821f8eebac3dba8edabb07ec5ca981b3bd7f895828bdc","source":{"kind":"arxiv","id":"1405.6560","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.6560","created_at":"2026-05-18T02:51:07Z"},{"alias_kind":"arxiv_version","alias_value":"1405.6560v1","created_at":"2026-05-18T02:51:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.6560","created_at":"2026-05-18T02:51:07Z"},{"alias_kind":"pith_short_12","alias_value":"PQ2N2GUT2HK5","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"PQ2N2GUT2HK5WYVI","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"PQ2N2GUT","created_at":"2026-05-18T12:28:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:PQ2N2GUT2HK5WYVIEH4O5OWD3O","target":"record","payload":{"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"},"canonical_sha256":"7c34dd1a93d1d5db62a821f8eebac3dba8edabb07ec5ca981b3bd7f895828bdc","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"},"source_kind":"arxiv","source_id":"1405.6560","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-18T02:51:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+wc8Z2XqrHA1rmL3N5L2Mh4tkYFEv9Sfg6ZgF6TNQgPHRdVKDHzZO6txcu0rSGR6TNR2HseNqOrPJGTbXuXMAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T16:28:10.299119Z"},"content_sha256":"ca20d7c17543eadf92a6483320950524a17129f98f683abbe8d63bcfd01279cf","schema_version":"1.0","event_id":"sha256:ca20d7c17543eadf92a6483320950524a17129f98f683abbe8d63bcfd01279cf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:PQ2N2GUT2HK5WYVIEH4O5OWD3O","target":"graph","payload":{"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"},"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-18T02:51:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7lscxOnQdETgE+Jyu+Ped2mk9yTwgqnL2sFnIT0xEX6vJEpwYMwEsugSFAvaEgOfDlgGVlYGrbQqkhFQg3O7AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T16:28:10.299679Z"},"content_sha256":"18e0f3536f208f72ab2b851220834bd98592c97c4f5027a86d0bc592748f4242","schema_version":"1.0","event_id":"sha256:18e0f3536f208f72ab2b851220834bd98592c97c4f5027a86d0bc592748f4242"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PQ2N2GUT2HK5WYVIEH4O5OWD3O/bundle.json","state_url":"https://pith.science/pith/PQ2N2GUT2HK5WYVIEH4O5OWD3O/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PQ2N2GUT2HK5WYVIEH4O5OWD3O/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-02T16:28:10Z","links":{"resolver":"https://pith.science/pith/PQ2N2GUT2HK5WYVIEH4O5OWD3O","bundle":"https://pith.science/pith/PQ2N2GUT2HK5WYVIEH4O5OWD3O/bundle.json","state":"https://pith.science/pith/PQ2N2GUT2HK5WYVIEH4O5OWD3O/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PQ2N2GUT2HK5WYVIEH4O5OWD3O/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:PQ2N2GUT2HK5WYVIEH4O5OWD3O","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":"fec165c4f6f7396d1cd12860e2844cbbeed148f58f73d0b61f4345e96f093a15","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-05-26T13:02:03Z","title_canon_sha256":"2912c915f91bcdd84e9456006fa266fc33ab36c54a9126b08a1a8df36ceba4f4"},"schema_version":"1.0","source":{"id":"1405.6560","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.6560","created_at":"2026-05-18T02:51:07Z"},{"alias_kind":"arxiv_version","alias_value":"1405.6560v1","created_at":"2026-05-18T02:51:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.6560","created_at":"2026-05-18T02:51:07Z"},{"alias_kind":"pith_short_12","alias_value":"PQ2N2GUT2HK5","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"PQ2N2GUT2HK5WYVI","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"PQ2N2GUT","created_at":"2026-05-18T12:28:43Z"}],"graph_snapshots":[{"event_id":"sha256:18e0f3536f208f72ab2b851220834bd98592c97c4f5027a86d0bc592748f4242","target":"graph","created_at":"2026-05-18T02:51:07Z","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":"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","authors_text":"Richard Montgomery","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-05-26T13:02:03Z","title":"Sharp threshold for embedding combs and other spanning trees in random graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.6560","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:ca20d7c17543eadf92a6483320950524a17129f98f683abbe8d63bcfd01279cf","target":"record","created_at":"2026-05-18T02:51:07Z","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":"fec165c4f6f7396d1cd12860e2844cbbeed148f58f73d0b61f4345e96f093a15","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-05-26T13:02:03Z","title_canon_sha256":"2912c915f91bcdd84e9456006fa266fc33ab36c54a9126b08a1a8df36ceba4f4"},"schema_version":"1.0","source":{"id":"1405.6560","kind":"arxiv","version":1}},"canonical_sha256":"7c34dd1a93d1d5db62a821f8eebac3dba8edabb07ec5ca981b3bd7f895828bdc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7c34dd1a93d1d5db62a821f8eebac3dba8edabb07ec5ca981b3bd7f895828bdc","first_computed_at":"2026-05-18T02:51:07.124478Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:51:07.124478Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mgf+8GNe2cfu9IfMGgGQijp8aMK56kvPHUTGtSjQqw7QH2L5EaDd6gE+mBItN457eLb0Hvhpsi3mn6pjvoBTAw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:51:07.124880Z","signed_message":"canonical_sha256_bytes"},"source_id":"1405.6560","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ca20d7c17543eadf92a6483320950524a17129f98f683abbe8d63bcfd01279cf","sha256:18e0f3536f208f72ab2b851220834bd98592c97c4f5027a86d0bc592748f4242"],"state_sha256":"de882229ce91cc3bb8b6c338b6f7c498dcee37b603b0ed39b2716bc428ea99bc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HTUUQfhB2V+izG6LcqN5OhMJjLXLsvWEVrtyFyp5SoRRJQ70BzfaI1t1Di9a+rmqbGbeXpEjhU2HDQFbis7UAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T16:28:10.303093Z","bundle_sha256":"e21bb8a4e16d7fd72266d5ed77169ad5f509c948cd2a5d251d1af14f0cacd9df"}}