{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:MB3TB5FDM5B6GIQT2SUB2TYZEU","short_pith_number":"pith:MB3TB5FD","schema_version":"1.0","canonical_sha256":"607730f4a36743e32213d4a81d4f192501469dfc74ba867929154bde0ed1d5e3","source":{"kind":"arxiv","id":"1503.08730","version":2},"attestation_state":"computed","paper":{"title":"Minimum vertex degree thresholds for tiling complete 3-partite 3-graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Chuanyun Zang, Jie Han, Yi Zhao","submitted_at":"2015-03-30T16:13:44Z","abstract_excerpt":"Given positive integers $a\\leq b \\leq c$, let $K_{a,b,c}$ be the complete 3-partite 3-uniform hypergraph with three parts of sizes $a,b,c$. Let $H$ be a 3-uniform hypergraph on $n$ vertices where $n$ is divisible by $a+b+c$. We asymptotically determine the minimum vertex degree of $H$ that guarantees a perfect $K_{a, b, c}$-tiling, that is, a spanning subgraph of $H$ consisting of vertex-disjoint copies of $K_{a, b, c}$. This partially answers a question of Mycroft, who proved an analogous result with respect to codegree for $r$-uniform hypergraphs for all $r\\ge 3$. Our proof uses a lattice-ba"},"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":"1503.08730","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-03-30T16:13:44Z","cross_cats_sorted":[],"title_canon_sha256":"517b2f7a8b1ba8d6c62c3aafa6248cc0133fa478f5e0024bd8d1371cd3ea5f4d","abstract_canon_sha256":"088a0f58758e918d01152162f2bfdd6cc9f3f5c725dc828e72c5e1803680a112"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:38:11.903977Z","signature_b64":"pv4fdkE41i1KviR7ymBF8b3hBDD+JWXFnPdDnTpWGyrtqST4uOJe4BJudSvGkQGMBEEJYLhvHZQXcwM1veR3Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"607730f4a36743e32213d4a81d4f192501469dfc74ba867929154bde0ed1d5e3","last_reissued_at":"2026-05-18T00:38:11.903523Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:38:11.903523Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Minimum vertex degree thresholds for tiling complete 3-partite 3-graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Chuanyun Zang, Jie Han, Yi Zhao","submitted_at":"2015-03-30T16:13:44Z","abstract_excerpt":"Given positive integers $a\\leq b \\leq c$, let $K_{a,b,c}$ be the complete 3-partite 3-uniform hypergraph with three parts of sizes $a,b,c$. Let $H$ be a 3-uniform hypergraph on $n$ vertices where $n$ is divisible by $a+b+c$. We asymptotically determine the minimum vertex degree of $H$ that guarantees a perfect $K_{a, b, c}$-tiling, that is, a spanning subgraph of $H$ consisting of vertex-disjoint copies of $K_{a, b, c}$. This partially answers a question of Mycroft, who proved an analogous result with respect to codegree for $r$-uniform hypergraphs for all $r\\ge 3$. Our proof uses a lattice-ba"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.08730","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":"1503.08730","created_at":"2026-05-18T00:38:11.903591+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.08730v2","created_at":"2026-05-18T00:38:11.903591+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.08730","created_at":"2026-05-18T00:38:11.903591+00:00"},{"alias_kind":"pith_short_12","alias_value":"MB3TB5FDM5B6","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_16","alias_value":"MB3TB5FDM5B6GIQT","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_8","alias_value":"MB3TB5FD","created_at":"2026-05-18T12:29:32.376354+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/MB3TB5FDM5B6GIQT2SUB2TYZEU","json":"https://pith.science/pith/MB3TB5FDM5B6GIQT2SUB2TYZEU.json","graph_json":"https://pith.science/api/pith-number/MB3TB5FDM5B6GIQT2SUB2TYZEU/graph.json","events_json":"https://pith.science/api/pith-number/MB3TB5FDM5B6GIQT2SUB2TYZEU/events.json","paper":"https://pith.science/paper/MB3TB5FD"},"agent_actions":{"view_html":"https://pith.science/pith/MB3TB5FDM5B6GIQT2SUB2TYZEU","download_json":"https://pith.science/pith/MB3TB5FDM5B6GIQT2SUB2TYZEU.json","view_paper":"https://pith.science/paper/MB3TB5FD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.08730&json=true","fetch_graph":"https://pith.science/api/pith-number/MB3TB5FDM5B6GIQT2SUB2TYZEU/graph.json","fetch_events":"https://pith.science/api/pith-number/MB3TB5FDM5B6GIQT2SUB2TYZEU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MB3TB5FDM5B6GIQT2SUB2TYZEU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MB3TB5FDM5B6GIQT2SUB2TYZEU/action/storage_attestation","attest_author":"https://pith.science/pith/MB3TB5FDM5B6GIQT2SUB2TYZEU/action/author_attestation","sign_citation":"https://pith.science/pith/MB3TB5FDM5B6GIQT2SUB2TYZEU/action/citation_signature","submit_replication":"https://pith.science/pith/MB3TB5FDM5B6GIQT2SUB2TYZEU/action/replication_record"}},"created_at":"2026-05-18T00:38:11.903591+00:00","updated_at":"2026-05-18T00:38:11.903591+00:00"}