{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:MB3TB5FDM5B6GIQT2SUB2TYZEU","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":"088a0f58758e918d01152162f2bfdd6cc9f3f5c725dc828e72c5e1803680a112","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-03-30T16:13:44Z","title_canon_sha256":"517b2f7a8b1ba8d6c62c3aafa6248cc0133fa478f5e0024bd8d1371cd3ea5f4d"},"schema_version":"1.0","source":{"id":"1503.08730","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.08730","created_at":"2026-05-18T00:38:11Z"},{"alias_kind":"arxiv_version","alias_value":"1503.08730v2","created_at":"2026-05-18T00:38:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.08730","created_at":"2026-05-18T00:38:11Z"},{"alias_kind":"pith_short_12","alias_value":"MB3TB5FDM5B6","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"MB3TB5FDM5B6GIQT","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"MB3TB5FD","created_at":"2026-05-18T12:29:32Z"}],"graph_snapshots":[{"event_id":"sha256:593fe321c1c1d2cccdf818a546966e522742f8858a100b06ed5673d95df5a7ee","target":"graph","created_at":"2026-05-18T00:38:11Z","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 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","authors_text":"Chuanyun Zang, Jie Han, Yi Zhao","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-03-30T16:13:44Z","title":"Minimum vertex degree thresholds for tiling complete 3-partite 3-graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.08730","kind":"arxiv","version":2},"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:13737445661821a13b59ebf62abe688714a7792a067f5e7eb90730f31d94d124","target":"record","created_at":"2026-05-18T00:38:11Z","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":"088a0f58758e918d01152162f2bfdd6cc9f3f5c725dc828e72c5e1803680a112","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-03-30T16:13:44Z","title_canon_sha256":"517b2f7a8b1ba8d6c62c3aafa6248cc0133fa478f5e0024bd8d1371cd3ea5f4d"},"schema_version":"1.0","source":{"id":"1503.08730","kind":"arxiv","version":2}},"canonical_sha256":"607730f4a36743e32213d4a81d4f192501469dfc74ba867929154bde0ed1d5e3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"607730f4a36743e32213d4a81d4f192501469dfc74ba867929154bde0ed1d5e3","first_computed_at":"2026-05-18T00:38:11.903523Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:38:11.903523Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pv4fdkE41i1KviR7ymBF8b3hBDD+JWXFnPdDnTpWGyrtqST4uOJe4BJudSvGkQGMBEEJYLhvHZQXcwM1veR3Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:38:11.903977Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.08730","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:13737445661821a13b59ebf62abe688714a7792a067f5e7eb90730f31d94d124","sha256:593fe321c1c1d2cccdf818a546966e522742f8858a100b06ed5673d95df5a7ee"],"state_sha256":"944cd6939046c0d0e04a110cf88996f0f5081451d9c1bcf6ed68485f53bc6b65"}