{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:SFZQOFE7Q7D6362VJKHD5UX2CH","short_pith_number":"pith:SFZQOFE7","schema_version":"1.0","canonical_sha256":"917307149f87c7edfb554a8e3ed2fa11cd00c6bd6448329d3367476c205dfd9c","source":{"kind":"arxiv","id":"2412.19756","version":2},"attestation_state":"computed","paper":{"title":"Tree tilings in random regular graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Ilay Hoshen, Maksim Zhukovskii, Sahar Diskin","submitted_at":"2024-12-27T17:35:47Z","abstract_excerpt":"We show that for every $\\epsilon>0$ there exists a sufficiently large $d_0\\in \\mathbb{N}$ such that for every $d\\ge d_0$, whp the random $d$-regular graph $G(n,d)$ contains a $T$-factor for every tree $T$ on at most $(1-\\epsilon)d/\\ln d$ vertices. This is best possible since, for large enough integer $d$, whp $G(n,d)$ does not contain a $\\frac{(1+\\epsilon)d}{\\ln d}$-star-factor. Our method gives a randomised algorithm which whp finds said $T$-factor and whose expected running time is $O(n^{1+o(1)})$, as well as an efficient deterministic counterpart."},"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":"2412.19756","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-12-27T17:35:47Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"0c7236724be7430c8c80addfc00677a396d29be7257aef57ff2cb4c5791343c9","abstract_canon_sha256":"9c6c12080675e4bd2aa8427924161936cc68ef9782bf0723b695b82b07dfbe59"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:13:06.891482Z","signature_b64":"Eb2lcP8RyQu0PVsGrtvKqDjsT8FeSqX8nNMvl9lMdJqqafceGVTdbmCDo7eD0vt0cN+zgyD1BHKMdLFLL5HmBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"917307149f87c7edfb554a8e3ed2fa11cd00c6bd6448329d3367476c205dfd9c","last_reissued_at":"2026-07-05T10:13:06.890960Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:13:06.890960Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tree tilings in random regular graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Ilay Hoshen, Maksim Zhukovskii, Sahar Diskin","submitted_at":"2024-12-27T17:35:47Z","abstract_excerpt":"We show that for every $\\epsilon>0$ there exists a sufficiently large $d_0\\in \\mathbb{N}$ such that for every $d\\ge d_0$, whp the random $d$-regular graph $G(n,d)$ contains a $T$-factor for every tree $T$ on at most $(1-\\epsilon)d/\\ln d$ vertices. This is best possible since, for large enough integer $d$, whp $G(n,d)$ does not contain a $\\frac{(1+\\epsilon)d}{\\ln d}$-star-factor. Our method gives a randomised algorithm which whp finds said $T$-factor and whose expected running time is $O(n^{1+o(1)})$, as well as an efficient deterministic counterpart."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.19756","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2412.19756/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2412.19756","created_at":"2026-07-05T10:13:06.891024+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.19756v2","created_at":"2026-07-05T10:13:06.891024+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.19756","created_at":"2026-07-05T10:13:06.891024+00:00"},{"alias_kind":"pith_short_12","alias_value":"SFZQOFE7Q7D6","created_at":"2026-07-05T10:13:06.891024+00:00"},{"alias_kind":"pith_short_16","alias_value":"SFZQOFE7Q7D6362V","created_at":"2026-07-05T10:13:06.891024+00:00"},{"alias_kind":"pith_short_8","alias_value":"SFZQOFE7","created_at":"2026-07-05T10:13:06.891024+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/SFZQOFE7Q7D6362VJKHD5UX2CH","json":"https://pith.science/pith/SFZQOFE7Q7D6362VJKHD5UX2CH.json","graph_json":"https://pith.science/api/pith-number/SFZQOFE7Q7D6362VJKHD5UX2CH/graph.json","events_json":"https://pith.science/api/pith-number/SFZQOFE7Q7D6362VJKHD5UX2CH/events.json","paper":"https://pith.science/paper/SFZQOFE7"},"agent_actions":{"view_html":"https://pith.science/pith/SFZQOFE7Q7D6362VJKHD5UX2CH","download_json":"https://pith.science/pith/SFZQOFE7Q7D6362VJKHD5UX2CH.json","view_paper":"https://pith.science/paper/SFZQOFE7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.19756&json=true","fetch_graph":"https://pith.science/api/pith-number/SFZQOFE7Q7D6362VJKHD5UX2CH/graph.json","fetch_events":"https://pith.science/api/pith-number/SFZQOFE7Q7D6362VJKHD5UX2CH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SFZQOFE7Q7D6362VJKHD5UX2CH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SFZQOFE7Q7D6362VJKHD5UX2CH/action/storage_attestation","attest_author":"https://pith.science/pith/SFZQOFE7Q7D6362VJKHD5UX2CH/action/author_attestation","sign_citation":"https://pith.science/pith/SFZQOFE7Q7D6362VJKHD5UX2CH/action/citation_signature","submit_replication":"https://pith.science/pith/SFZQOFE7Q7D6362VJKHD5UX2CH/action/replication_record"}},"created_at":"2026-07-05T10:13:06.891024+00:00","updated_at":"2026-07-05T10:13:06.891024+00:00"}