{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:T4CZ52QTSJIE3CFD5GHRBX53NH","short_pith_number":"pith:T4CZ52QT","schema_version":"1.0","canonical_sha256":"9f059eea1392504d88a3e98f10dfbb69e71ff741fd183810f5301a9e1bc90bb9","source":{"kind":"arxiv","id":"1612.07247","version":2},"attestation_state":"computed","paper":{"title":"Codegree conditions for tiling complete $k$-partite $k$-graphs and loose cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jie Han, Wei Gao, Yi Zhao","submitted_at":"2016-12-21T17:31:15Z","abstract_excerpt":"Given two $k$-graphs ($k$-uniform hypergraphs) $F$ and $H$, a perfect $F$-tiling (or an $F$-factor) in $H$ is a set of vertex disjoint copies of $F$ that together cover the vertex set of $H$. For all complete $k$-partite $k$-graphs $K$, Mycroft proved a minimum codegree condition that guarantees a $K$-factor in an $n$-vertex $k$-graph, which is tight up to an error term $o(n)$. In this paper we improve the error term in Mycroft's result to a sub-linear term that relates to the Tur\\'an number of $K$ when the differences of the sizes of the vertex classes of $K$ are co-prime. Furthermore, we fin"},"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":"1612.07247","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-12-21T17:31:15Z","cross_cats_sorted":[],"title_canon_sha256":"c49c501ce45b3f9509c9c7b06bdeadefafb1d049af0cd1a8fb97154e0ea71b46","abstract_canon_sha256":"c780203fa5e4ba7138071ab2a8761f37ed6a4bc154ab0bc8e51c51e2cf3e93a5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:21.718061Z","signature_b64":"Y/u9hpdubSVpDZbICEJ/5pSnYS78FPSM01gK/auldAEbJk/iWOhYLrTsVc5dPxOHdA4o/o2dt1ejsqvFglXrBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9f059eea1392504d88a3e98f10dfbb69e71ff741fd183810f5301a9e1bc90bb9","last_reissued_at":"2026-05-17T23:51:21.717569Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:21.717569Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Codegree conditions for tiling complete $k$-partite $k$-graphs and loose cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jie Han, Wei Gao, Yi Zhao","submitted_at":"2016-12-21T17:31:15Z","abstract_excerpt":"Given two $k$-graphs ($k$-uniform hypergraphs) $F$ and $H$, a perfect $F$-tiling (or an $F$-factor) in $H$ is a set of vertex disjoint copies of $F$ that together cover the vertex set of $H$. For all complete $k$-partite $k$-graphs $K$, Mycroft proved a minimum codegree condition that guarantees a $K$-factor in an $n$-vertex $k$-graph, which is tight up to an error term $o(n)$. In this paper we improve the error term in Mycroft's result to a sub-linear term that relates to the Tur\\'an number of $K$ when the differences of the sizes of the vertex classes of $K$ are co-prime. Furthermore, we fin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.07247","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":""},"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":"1612.07247","created_at":"2026-05-17T23:51:21.717664+00:00"},{"alias_kind":"arxiv_version","alias_value":"1612.07247v2","created_at":"2026-05-17T23:51:21.717664+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.07247","created_at":"2026-05-17T23:51:21.717664+00:00"},{"alias_kind":"pith_short_12","alias_value":"T4CZ52QTSJIE","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_16","alias_value":"T4CZ52QTSJIE3CFD","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_8","alias_value":"T4CZ52QT","created_at":"2026-05-18T12:30:44.179134+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/T4CZ52QTSJIE3CFD5GHRBX53NH","json":"https://pith.science/pith/T4CZ52QTSJIE3CFD5GHRBX53NH.json","graph_json":"https://pith.science/api/pith-number/T4CZ52QTSJIE3CFD5GHRBX53NH/graph.json","events_json":"https://pith.science/api/pith-number/T4CZ52QTSJIE3CFD5GHRBX53NH/events.json","paper":"https://pith.science/paper/T4CZ52QT"},"agent_actions":{"view_html":"https://pith.science/pith/T4CZ52QTSJIE3CFD5GHRBX53NH","download_json":"https://pith.science/pith/T4CZ52QTSJIE3CFD5GHRBX53NH.json","view_paper":"https://pith.science/paper/T4CZ52QT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1612.07247&json=true","fetch_graph":"https://pith.science/api/pith-number/T4CZ52QTSJIE3CFD5GHRBX53NH/graph.json","fetch_events":"https://pith.science/api/pith-number/T4CZ52QTSJIE3CFD5GHRBX53NH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/T4CZ52QTSJIE3CFD5GHRBX53NH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/T4CZ52QTSJIE3CFD5GHRBX53NH/action/storage_attestation","attest_author":"https://pith.science/pith/T4CZ52QTSJIE3CFD5GHRBX53NH/action/author_attestation","sign_citation":"https://pith.science/pith/T4CZ52QTSJIE3CFD5GHRBX53NH/action/citation_signature","submit_replication":"https://pith.science/pith/T4CZ52QTSJIE3CFD5GHRBX53NH/action/replication_record"}},"created_at":"2026-05-17T23:51:21.717664+00:00","updated_at":"2026-05-17T23:51:21.717664+00:00"}