{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:D5WLRMPN5C6FO25H5WNNMA7GPU","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"6378ef607599ef2f580965f63e512411ed194a6d38f8fc5c0b98b38c26668e77","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-08T23:16:33Z","title_canon_sha256":"6a0f72b3b5d886da28f0c5db408a6270059fa1b408711413121cbb25ecf6c85f"},"schema_version":"1.0","source":{"id":"1509.02577","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.02577","created_at":"2026-05-18T01:33:34Z"},{"alias_kind":"arxiv_version","alias_value":"1509.02577v1","created_at":"2026-05-18T01:33:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.02577","created_at":"2026-05-18T01:33:34Z"},{"alias_kind":"pith_short_12","alias_value":"D5WLRMPN5C6F","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"D5WLRMPN5C6FO25H","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"D5WLRMPN","created_at":"2026-05-18T12:29:17Z"}],"graph_snapshots":[{"event_id":"sha256:459b396f3432bcbfd5dcb0e097d05438948de548ad61bb11c93ce59a25874c69","target":"graph","created_at":"2026-05-18T01:33:34Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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 ","authors_text":"Allan Lo, Andrew Treglown, Jie Han, Yi Zhao","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-08T23:16:33Z","title":"Exact minimum codegree threshold for $K^- _4$-factors"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.02577","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:3e0996a2a7b1146b249c5034490d7cbf1353e4978a3632ea9f044231df028a43","target":"record","created_at":"2026-05-18T01:33:34Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"6378ef607599ef2f580965f63e512411ed194a6d38f8fc5c0b98b38c26668e77","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-08T23:16:33Z","title_canon_sha256":"6a0f72b3b5d886da28f0c5db408a6270059fa1b408711413121cbb25ecf6c85f"},"schema_version":"1.0","source":{"id":"1509.02577","kind":"arxiv","version":1}},"canonical_sha256":"1f6cb8b1ede8bc576ba7ed9ad603e67d0aba3a4abab2c34ef93cf6584de7668a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1f6cb8b1ede8bc576ba7ed9ad603e67d0aba3a4abab2c34ef93cf6584de7668a","first_computed_at":"2026-05-18T01:33:34.699336Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:33:34.699336Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Werb0RS7SVyKLRs083QEo9VIyT8wk9XGqrclOvv5cZyuNlJNLoCpd08Z+INBKlXubKHz9n5g83gLfwBQKL4QAA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:33:34.700072Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.02577","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3e0996a2a7b1146b249c5034490d7cbf1353e4978a3632ea9f044231df028a43","sha256:459b396f3432bcbfd5dcb0e097d05438948de548ad61bb11c93ce59a25874c69"],"state_sha256":"20af4c6cd84fa7b00e243efd7b63936707327deba9c6862dceba4d60912dfc45"}