{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:SFZQOFE7Q7D6362VJKHD5UX2CH","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":"9c6c12080675e4bd2aa8427924161936cc68ef9782bf0723b695b82b07dfbe59","cross_cats_sorted":["math.PR"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-12-27T17:35:47Z","title_canon_sha256":"0c7236724be7430c8c80addfc00677a396d29be7257aef57ff2cb4c5791343c9"},"schema_version":"1.0","source":{"id":"2412.19756","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.19756","created_at":"2026-07-05T10:13:06Z"},{"alias_kind":"arxiv_version","alias_value":"2412.19756v2","created_at":"2026-07-05T10:13:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.19756","created_at":"2026-07-05T10:13:06Z"},{"alias_kind":"pith_short_12","alias_value":"SFZQOFE7Q7D6","created_at":"2026-07-05T10:13:06Z"},{"alias_kind":"pith_short_16","alias_value":"SFZQOFE7Q7D6362V","created_at":"2026-07-05T10:13:06Z"},{"alias_kind":"pith_short_8","alias_value":"SFZQOFE7","created_at":"2026-07-05T10:13:06Z"}],"graph_snapshots":[{"event_id":"sha256:aecd95e91f9f579bdf961d332f534a1b44ab568f10a3318fd724107b699fedb4","target":"graph","created_at":"2026-07-05T10:13:06Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2412.19756/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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.","authors_text":"Ilay Hoshen, Maksim Zhukovskii, Sahar Diskin","cross_cats":["math.PR"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-12-27T17:35:47Z","title":"Tree tilings in random regular graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.19756","kind":"arxiv","version":2},"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:c25da8aa6bc0ef4b4c2739d3aa93cd3116485f03bc42d65c5b84f755a12a3b3c","target":"record","created_at":"2026-07-05T10:13:06Z","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":"9c6c12080675e4bd2aa8427924161936cc68ef9782bf0723b695b82b07dfbe59","cross_cats_sorted":["math.PR"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-12-27T17:35:47Z","title_canon_sha256":"0c7236724be7430c8c80addfc00677a396d29be7257aef57ff2cb4c5791343c9"},"schema_version":"1.0","source":{"id":"2412.19756","kind":"arxiv","version":2}},"canonical_sha256":"917307149f87c7edfb554a8e3ed2fa11cd00c6bd6448329d3367476c205dfd9c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"917307149f87c7edfb554a8e3ed2fa11cd00c6bd6448329d3367476c205dfd9c","first_computed_at":"2026-07-05T10:13:06.890960Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:13:06.890960Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Eb2lcP8RyQu0PVsGrtvKqDjsT8FeSqX8nNMvl9lMdJqqafceGVTdbmCDo7eD0vt0cN+zgyD1BHKMdLFLL5HmBw==","signature_status":"signed_v1","signed_at":"2026-07-05T10:13:06.891482Z","signed_message":"canonical_sha256_bytes"},"source_id":"2412.19756","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c25da8aa6bc0ef4b4c2739d3aa93cd3116485f03bc42d65c5b84f755a12a3b3c","sha256:aecd95e91f9f579bdf961d332f534a1b44ab568f10a3318fd724107b699fedb4"],"state_sha256":"2962b60730445d74deaa59faddea5acd36c16c33d30735152c4d10b2cbd8a90b"}