{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:XJWHDDF737XZSRW4VCINDQXKTM","short_pith_number":"pith:XJWHDDF7","schema_version":"1.0","canonical_sha256":"ba6c718cbfdfef9946dca890d1c2ea9b1e5fce9b280ed91918ac51a6d5f487f6","source":{"kind":"arxiv","id":"2111.14140","version":2},"attestation_state":"computed","paper":{"title":"Tiling multipartite hypergraphs in Quasi-random Hypergraphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Guanghui Wang, Jie Han, Laihao Ding, Shumin Sun, Wenling Zhou","submitted_at":"2021-11-28T13:38:12Z","abstract_excerpt":"Given $k\\ge 2$ and two $k$-graphs ($k$-uniform hypergraphs) $F$ and $H$, an \\emph{$F$-factor} in $H$ is a set of vertex disjoint copies of $F$ that together covers the vertex set of $H$. Lenz and Mubayi studied the $F$-factor problems in quasi-random $k$-graphs with minimum degree $\\Omega(n^{k-1})$. In particular, they constructed a sequence of $1/8$-dense quasi-random $3$-graphs $H(n)$ with minimum degree $\\Omega(n^2)$ and minimum codegree $\\Omega(n)$ but with no $K_{2,2,2}$-factor. We prove that if $p>1/8$ and $F$ is a $3$-partite $3$-graph with $f$ vertices, then for sufficiently large $n$,"},"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":"2111.14140","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2021-11-28T13:38:12Z","cross_cats_sorted":[],"title_canon_sha256":"bf0d0db4134500f5e1678cb529cadd05b7067be2be9f46572155be7cb9d96c87","abstract_canon_sha256":"7d9bdf0b9e3f3bff57feef651f8209f4de85b351f371162f099d0c8c6629b7ac"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:25:47.500378Z","signature_b64":"8J9HjeYMqWOWK+flOBBFTI5j+aVT1yRxB5z8O6pHnLJb4tzmir2Tb+MnG4jAfew1U7eWc72+V05q8wv4wbfsBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ba6c718cbfdfef9946dca890d1c2ea9b1e5fce9b280ed91918ac51a6d5f487f6","last_reissued_at":"2026-07-05T05:25:47.499819Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:25:47.499819Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tiling multipartite hypergraphs in Quasi-random Hypergraphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Guanghui Wang, Jie Han, Laihao Ding, Shumin Sun, Wenling Zhou","submitted_at":"2021-11-28T13:38:12Z","abstract_excerpt":"Given $k\\ge 2$ and two $k$-graphs ($k$-uniform hypergraphs) $F$ and $H$, an \\emph{$F$-factor} in $H$ is a set of vertex disjoint copies of $F$ that together covers the vertex set of $H$. Lenz and Mubayi studied the $F$-factor problems in quasi-random $k$-graphs with minimum degree $\\Omega(n^{k-1})$. In particular, they constructed a sequence of $1/8$-dense quasi-random $3$-graphs $H(n)$ with minimum degree $\\Omega(n^2)$ and minimum codegree $\\Omega(n)$ but with no $K_{2,2,2}$-factor. We prove that if $p>1/8$ and $F$ is a $3$-partite $3$-graph with $f$ vertices, then for sufficiently large $n$,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2111.14140","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/2111.14140/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":"2111.14140","created_at":"2026-07-05T05:25:47.499875+00:00"},{"alias_kind":"arxiv_version","alias_value":"2111.14140v2","created_at":"2026-07-05T05:25:47.499875+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2111.14140","created_at":"2026-07-05T05:25:47.499875+00:00"},{"alias_kind":"pith_short_12","alias_value":"XJWHDDF737XZ","created_at":"2026-07-05T05:25:47.499875+00:00"},{"alias_kind":"pith_short_16","alias_value":"XJWHDDF737XZSRW4","created_at":"2026-07-05T05:25:47.499875+00:00"},{"alias_kind":"pith_short_8","alias_value":"XJWHDDF7","created_at":"2026-07-05T05:25:47.499875+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/XJWHDDF737XZSRW4VCINDQXKTM","json":"https://pith.science/pith/XJWHDDF737XZSRW4VCINDQXKTM.json","graph_json":"https://pith.science/api/pith-number/XJWHDDF737XZSRW4VCINDQXKTM/graph.json","events_json":"https://pith.science/api/pith-number/XJWHDDF737XZSRW4VCINDQXKTM/events.json","paper":"https://pith.science/paper/XJWHDDF7"},"agent_actions":{"view_html":"https://pith.science/pith/XJWHDDF737XZSRW4VCINDQXKTM","download_json":"https://pith.science/pith/XJWHDDF737XZSRW4VCINDQXKTM.json","view_paper":"https://pith.science/paper/XJWHDDF7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2111.14140&json=true","fetch_graph":"https://pith.science/api/pith-number/XJWHDDF737XZSRW4VCINDQXKTM/graph.json","fetch_events":"https://pith.science/api/pith-number/XJWHDDF737XZSRW4VCINDQXKTM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XJWHDDF737XZSRW4VCINDQXKTM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XJWHDDF737XZSRW4VCINDQXKTM/action/storage_attestation","attest_author":"https://pith.science/pith/XJWHDDF737XZSRW4VCINDQXKTM/action/author_attestation","sign_citation":"https://pith.science/pith/XJWHDDF737XZSRW4VCINDQXKTM/action/citation_signature","submit_replication":"https://pith.science/pith/XJWHDDF737XZSRW4VCINDQXKTM/action/replication_record"}},"created_at":"2026-07-05T05:25:47.499875+00:00","updated_at":"2026-07-05T05:25:47.499875+00:00"}