{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:JBETWCJZNNLYYULGZWMB4FCVAC","short_pith_number":"pith:JBETWCJZ","schema_version":"1.0","canonical_sha256":"48493b09396b578c5166cd981e145500b2a04c53810f95d00cbefe3260107227","source":{"kind":"arxiv","id":"1203.2667","version":2},"attestation_state":"computed","paper":{"title":"On multipartite Hajnal-Szemer\\'edi theorems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jie Han, Yi Zhao","submitted_at":"2012-03-12T22:19:43Z","abstract_excerpt":"Let $G$ be a $k$-partite graph with $n$ vertices in parts such that each vertex is adjacent to at least $\\delta^*(G)$ vertices in each of the other parts. Magyar and Martin \\cite{MaMa} proved that for $k=3$, if $\\delta^*(G)\\ge 2/3n $ and $n$ is sufficiently large, then $G$ contains a $K_3$-factor (a spanning subgraph consisting of $n$ vertex-disjoint copies of $K_3$) except that $G$ is one particular graph. Martin and Szemer\\'edi \\cite{MaSz} proved that $G$ contains a $K_4$-factor when $\\delta^*(G)\\ge 3/4n$ and $n$ is sufficiently large. Both results were proved by the Regularity Lemma. In thi"},"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":"1203.2667","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-03-12T22:19:43Z","cross_cats_sorted":[],"title_canon_sha256":"527533f70b7e2c0c7bbc1014b9b32feba7051a3f80338e7cf408ed73b71610a7","abstract_canon_sha256":"69fc467ff22337eccc74bf3603480a2c2ad0aacd87f414b188ccf27e47f12a74"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:28:32.145653Z","signature_b64":"cwhROfjCKch1yucgYaRJrfNBayCUBM265Xaz+y1wBfeEiiz37vkL5UBdLMaNH9nXt4Rujxv9Mix5SVZWod7yBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"48493b09396b578c5166cd981e145500b2a04c53810f95d00cbefe3260107227","last_reissued_at":"2026-05-18T02:28:32.144965Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:28:32.144965Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On multipartite Hajnal-Szemer\\'edi theorems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jie Han, Yi Zhao","submitted_at":"2012-03-12T22:19:43Z","abstract_excerpt":"Let $G$ be a $k$-partite graph with $n$ vertices in parts such that each vertex is adjacent to at least $\\delta^*(G)$ vertices in each of the other parts. Magyar and Martin \\cite{MaMa} proved that for $k=3$, if $\\delta^*(G)\\ge 2/3n $ and $n$ is sufficiently large, then $G$ contains a $K_3$-factor (a spanning subgraph consisting of $n$ vertex-disjoint copies of $K_3$) except that $G$ is one particular graph. Martin and Szemer\\'edi \\cite{MaSz} proved that $G$ contains a $K_4$-factor when $\\delta^*(G)\\ge 3/4n$ and $n$ is sufficiently large. Both results were proved by the Regularity Lemma. In thi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.2667","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":"1203.2667","created_at":"2026-05-18T02:28:32.145067+00:00"},{"alias_kind":"arxiv_version","alias_value":"1203.2667v2","created_at":"2026-05-18T02:28:32.145067+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.2667","created_at":"2026-05-18T02:28:32.145067+00:00"},{"alias_kind":"pith_short_12","alias_value":"JBETWCJZNNLY","created_at":"2026-05-18T12:27:11.947152+00:00"},{"alias_kind":"pith_short_16","alias_value":"JBETWCJZNNLYYULG","created_at":"2026-05-18T12:27:11.947152+00:00"},{"alias_kind":"pith_short_8","alias_value":"JBETWCJZ","created_at":"2026-05-18T12:27:11.947152+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/JBETWCJZNNLYYULGZWMB4FCVAC","json":"https://pith.science/pith/JBETWCJZNNLYYULGZWMB4FCVAC.json","graph_json":"https://pith.science/api/pith-number/JBETWCJZNNLYYULGZWMB4FCVAC/graph.json","events_json":"https://pith.science/api/pith-number/JBETWCJZNNLYYULGZWMB4FCVAC/events.json","paper":"https://pith.science/paper/JBETWCJZ"},"agent_actions":{"view_html":"https://pith.science/pith/JBETWCJZNNLYYULGZWMB4FCVAC","download_json":"https://pith.science/pith/JBETWCJZNNLYYULGZWMB4FCVAC.json","view_paper":"https://pith.science/paper/JBETWCJZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1203.2667&json=true","fetch_graph":"https://pith.science/api/pith-number/JBETWCJZNNLYYULGZWMB4FCVAC/graph.json","fetch_events":"https://pith.science/api/pith-number/JBETWCJZNNLYYULGZWMB4FCVAC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JBETWCJZNNLYYULGZWMB4FCVAC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JBETWCJZNNLYYULGZWMB4FCVAC/action/storage_attestation","attest_author":"https://pith.science/pith/JBETWCJZNNLYYULGZWMB4FCVAC/action/author_attestation","sign_citation":"https://pith.science/pith/JBETWCJZNNLYYULGZWMB4FCVAC/action/citation_signature","submit_replication":"https://pith.science/pith/JBETWCJZNNLYYULGZWMB4FCVAC/action/replication_record"}},"created_at":"2026-05-18T02:28:32.145067+00:00","updated_at":"2026-05-18T02:28:32.145067+00:00"}