{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:6PRWBMMHXKHPPZP2JWFAYXRTYD","short_pith_number":"pith:6PRWBMMH","schema_version":"1.0","canonical_sha256":"f3e360b187ba8ef7e5fa4d8a0c5e33c0cf8d4de621b72dda1b0f9c273cae8d1a","source":{"kind":"arxiv","id":"1805.05742","version":1},"attestation_state":"computed","paper":{"title":"Codegree conditions for tilling balanced complete $3$-partite $3$-graphs and generalized 4-cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Boyuan Liu, Xinmin Hou, Yue Ma","submitted_at":"2018-05-15T12:59:03Z","abstract_excerpt":"Given two $k$-graphs $F$ and $H$, a perfect $F$-tiling (also called an $F$-factor) in $H$ is a set of vertex disjoint copies of $F$ that together cover the vertex set of $H$. Let $t_{k-1}(n, F)$ be the smallest integer $t$ such that every $k$-graph $H$ on $n$ vertices with minimum codegree at least $t$ contains a perfect $F$-tiling. Mycroft (JCTA, 2016) determined the asymptotic values of $t_{k-1}(n, F)$ for $k$-partite $k$-graphs $F$. Mycroft also conjectured that the error terms $o(n)$ in $t_{k-1}(n, F)$ can be replaced by a constant that depends only on $F$. In this paper, we improve the er"},"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":"1805.05742","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-15T12:59:03Z","cross_cats_sorted":[],"title_canon_sha256":"adf8270ad8dae19a3a8e9c181ebf844ffeabf55c042156103251fb7891d8d031","abstract_canon_sha256":"57ccc93cdd6bfc97b50395d31c09ab959389ac0dd1504ba9c3911bbf13fec594"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:53.828208Z","signature_b64":"ygedqnKePR5xHXTRi5xKJhhGxEIlB3HJU8AETPhslaX0lsy2jBOB9EV27W+7tfXkTfcHNBrQeOGl3wiCvkmZAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f3e360b187ba8ef7e5fa4d8a0c5e33c0cf8d4de621b72dda1b0f9c273cae8d1a","last_reissued_at":"2026-05-18T00:15:53.827592Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:53.827592Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Codegree conditions for tilling balanced complete $3$-partite $3$-graphs and generalized 4-cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Boyuan Liu, Xinmin Hou, Yue Ma","submitted_at":"2018-05-15T12:59:03Z","abstract_excerpt":"Given two $k$-graphs $F$ and $H$, a perfect $F$-tiling (also called an $F$-factor) in $H$ is a set of vertex disjoint copies of $F$ that together cover the vertex set of $H$. Let $t_{k-1}(n, F)$ be the smallest integer $t$ such that every $k$-graph $H$ on $n$ vertices with minimum codegree at least $t$ contains a perfect $F$-tiling. Mycroft (JCTA, 2016) determined the asymptotic values of $t_{k-1}(n, F)$ for $k$-partite $k$-graphs $F$. Mycroft also conjectured that the error terms $o(n)$ in $t_{k-1}(n, F)$ can be replaced by a constant that depends only on $F$. In this paper, we improve the er"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.05742","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":"1805.05742","created_at":"2026-05-18T00:15:53.827687+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.05742v1","created_at":"2026-05-18T00:15:53.827687+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.05742","created_at":"2026-05-18T00:15:53.827687+00:00"},{"alias_kind":"pith_short_12","alias_value":"6PRWBMMHXKHP","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_16","alias_value":"6PRWBMMHXKHPPZP2","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_8","alias_value":"6PRWBMMH","created_at":"2026-05-18T12:32:11.075285+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/6PRWBMMHXKHPPZP2JWFAYXRTYD","json":"https://pith.science/pith/6PRWBMMHXKHPPZP2JWFAYXRTYD.json","graph_json":"https://pith.science/api/pith-number/6PRWBMMHXKHPPZP2JWFAYXRTYD/graph.json","events_json":"https://pith.science/api/pith-number/6PRWBMMHXKHPPZP2JWFAYXRTYD/events.json","paper":"https://pith.science/paper/6PRWBMMH"},"agent_actions":{"view_html":"https://pith.science/pith/6PRWBMMHXKHPPZP2JWFAYXRTYD","download_json":"https://pith.science/pith/6PRWBMMHXKHPPZP2JWFAYXRTYD.json","view_paper":"https://pith.science/paper/6PRWBMMH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.05742&json=true","fetch_graph":"https://pith.science/api/pith-number/6PRWBMMHXKHPPZP2JWFAYXRTYD/graph.json","fetch_events":"https://pith.science/api/pith-number/6PRWBMMHXKHPPZP2JWFAYXRTYD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6PRWBMMHXKHPPZP2JWFAYXRTYD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6PRWBMMHXKHPPZP2JWFAYXRTYD/action/storage_attestation","attest_author":"https://pith.science/pith/6PRWBMMHXKHPPZP2JWFAYXRTYD/action/author_attestation","sign_citation":"https://pith.science/pith/6PRWBMMHXKHPPZP2JWFAYXRTYD/action/citation_signature","submit_replication":"https://pith.science/pith/6PRWBMMHXKHPPZP2JWFAYXRTYD/action/replication_record"}},"created_at":"2026-05-18T00:15:53.827687+00:00","updated_at":"2026-05-18T00:15:53.827687+00:00"}