{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:D5WLRMPN5C6FO25H5WNNMA7GPU","short_pith_number":"pith:D5WLRMPN","schema_version":"1.0","canonical_sha256":"1f6cb8b1ede8bc576ba7ed9ad603e67d0aba3a4abab2c34ef93cf6584de7668a","source":{"kind":"arxiv","id":"1509.02577","version":1},"attestation_state":"computed","paper":{"title":"Exact minimum codegree threshold for $K^- _4$-factors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Allan Lo, Andrew Treglown, Jie Han, Yi Zhao","submitted_at":"2015-09-08T23:16:33Z","abstract_excerpt":"Given hypergraphs $F$ and $H$, an $F$-factor in $H$ is a set of vertex-disjoint copies of $F$ which cover all the vertices in $H$. Let $K^- _4$ denote the $3$-uniform hypergraph with $4$ vertices and $3$ edges. We show that for sufficiently large $n\\in 4 \\mathbb N$, every $3$-uniform hypergraph $H$ on $n$ vertices with minimum codegree at least $n/2-1$ contains a $K^- _4$-factor. Our bound on the minimum codegree here is best-possible. It resolves a conjecture of Lo and Markstr\\\"om for large hypergraphs, who earlier proved an asymptotically exact version of this result. Our proof makes use of "},"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":"1509.02577","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-08T23:16:33Z","cross_cats_sorted":[],"title_canon_sha256":"6a0f72b3b5d886da28f0c5db408a6270059fa1b408711413121cbb25ecf6c85f","abstract_canon_sha256":"6378ef607599ef2f580965f63e512411ed194a6d38f8fc5c0b98b38c26668e77"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:33:34.700072Z","signature_b64":"Werb0RS7SVyKLRs083QEo9VIyT8wk9XGqrclOvv5cZyuNlJNLoCpd08Z+INBKlXubKHz9n5g83gLfwBQKL4QAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1f6cb8b1ede8bc576ba7ed9ad603e67d0aba3a4abab2c34ef93cf6584de7668a","last_reissued_at":"2026-05-18T01:33:34.699336Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:33:34.699336Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exact minimum codegree threshold for $K^- _4$-factors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Allan Lo, Andrew Treglown, Jie Han, Yi Zhao","submitted_at":"2015-09-08T23:16:33Z","abstract_excerpt":"Given hypergraphs $F$ and $H$, an $F$-factor in $H$ is a set of vertex-disjoint copies of $F$ which cover all the vertices in $H$. Let $K^- _4$ denote the $3$-uniform hypergraph with $4$ vertices and $3$ edges. We show that for sufficiently large $n\\in 4 \\mathbb N$, every $3$-uniform hypergraph $H$ on $n$ vertices with minimum codegree at least $n/2-1$ contains a $K^- _4$-factor. Our bound on the minimum codegree here is best-possible. It resolves a conjecture of Lo and Markstr\\\"om for large hypergraphs, who earlier proved an asymptotically exact version of this result. Our proof makes use of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.02577","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":"1509.02577","created_at":"2026-05-18T01:33:34.699466+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.02577v1","created_at":"2026-05-18T01:33:34.699466+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.02577","created_at":"2026-05-18T01:33:34.699466+00:00"},{"alias_kind":"pith_short_12","alias_value":"D5WLRMPN5C6F","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_16","alias_value":"D5WLRMPN5C6FO25H","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_8","alias_value":"D5WLRMPN","created_at":"2026-05-18T12:29:17.054201+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/D5WLRMPN5C6FO25H5WNNMA7GPU","json":"https://pith.science/pith/D5WLRMPN5C6FO25H5WNNMA7GPU.json","graph_json":"https://pith.science/api/pith-number/D5WLRMPN5C6FO25H5WNNMA7GPU/graph.json","events_json":"https://pith.science/api/pith-number/D5WLRMPN5C6FO25H5WNNMA7GPU/events.json","paper":"https://pith.science/paper/D5WLRMPN"},"agent_actions":{"view_html":"https://pith.science/pith/D5WLRMPN5C6FO25H5WNNMA7GPU","download_json":"https://pith.science/pith/D5WLRMPN5C6FO25H5WNNMA7GPU.json","view_paper":"https://pith.science/paper/D5WLRMPN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.02577&json=true","fetch_graph":"https://pith.science/api/pith-number/D5WLRMPN5C6FO25H5WNNMA7GPU/graph.json","fetch_events":"https://pith.science/api/pith-number/D5WLRMPN5C6FO25H5WNNMA7GPU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/D5WLRMPN5C6FO25H5WNNMA7GPU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/D5WLRMPN5C6FO25H5WNNMA7GPU/action/storage_attestation","attest_author":"https://pith.science/pith/D5WLRMPN5C6FO25H5WNNMA7GPU/action/author_attestation","sign_citation":"https://pith.science/pith/D5WLRMPN5C6FO25H5WNNMA7GPU/action/citation_signature","submit_replication":"https://pith.science/pith/D5WLRMPN5C6FO25H5WNNMA7GPU/action/replication_record"}},"created_at":"2026-05-18T01:33:34.699466+00:00","updated_at":"2026-05-18T01:33:34.699466+00:00"}