{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:UAW2AIEJ3FEPOKAIWG2VDQZENE","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":"98fa3ee06cfbe9ec45add3ab39e3d674dc26ac878a7895ad35734904358b2a0f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-11-22T09:16:04Z","title_canon_sha256":"bf58ad5044c9f83b2b51307773659b38c2bde56ea5a10e9bb04c55f8a9c181c3"},"schema_version":"1.0","source":{"id":"1711.08185","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.08185","created_at":"2026-05-18T00:29:50Z"},{"alias_kind":"arxiv_version","alias_value":"1711.08185v1","created_at":"2026-05-18T00:29:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.08185","created_at":"2026-05-18T00:29:50Z"},{"alias_kind":"pith_short_12","alias_value":"UAW2AIEJ3FEP","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"UAW2AIEJ3FEPOKAI","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"UAW2AIEJ","created_at":"2026-05-18T12:31:46Z"}],"graph_snapshots":[{"event_id":"sha256:990e57f4c65b98bbc66807bd9834950b9e37673372f440567e6fb2703d328d1c","target":"graph","created_at":"2026-05-18T00:29:50Z","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":"Let $H$ be a $k$-partite $k$-graph with $n$ vertices in each partition class, and let $\\delta_{k-1}(H)$ denote the minimum co-degree of $H$. We characterize those $H$ with $\\delta_{k-1}(H) \\geq n/2$ and with no perfect matching. As a consequence we give an affirmative answer to the following question of R\\\"odl and Ruci\\'nski: If $k$ is even or $n \\not\\equiv 2 \\pmod 4$, does $\\delta_{k-1}(H) \\geq n/2$ imply that $H$ has a perfect matching? We also give an example indicating that it is not sufficient to impose this degree bound on only two types of $(k-1)$-sets.","authors_text":"Hongliang Lu, Xingxing Yu, Yan Wang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-11-22T09:16:04Z","title":"Minimum co-degree condition for perfect matchings in k-partite k-graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.08185","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:64f0be85bb2f39aa7ad3fa194829b371ce4f80a0bc9cc110d1b631323c8b83a2","target":"record","created_at":"2026-05-18T00:29:50Z","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":"98fa3ee06cfbe9ec45add3ab39e3d674dc26ac878a7895ad35734904358b2a0f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-11-22T09:16:04Z","title_canon_sha256":"bf58ad5044c9f83b2b51307773659b38c2bde56ea5a10e9bb04c55f8a9c181c3"},"schema_version":"1.0","source":{"id":"1711.08185","kind":"arxiv","version":1}},"canonical_sha256":"a02da02089d948f72808b1b551c3246906234a3ae31cbe45ef92b1be9dc635f5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a02da02089d948f72808b1b551c3246906234a3ae31cbe45ef92b1be9dc635f5","first_computed_at":"2026-05-18T00:29:50.461178Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:29:50.461178Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/RzakApaajzCcVq3TTPBj8XdfixeNOBTZ1l/VGHAL/A1F/mAzuZX2uO5C8Tghgx01ecxhl9O8RbBPrILTVmECg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:29:50.461679Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.08185","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:64f0be85bb2f39aa7ad3fa194829b371ce4f80a0bc9cc110d1b631323c8b83a2","sha256:990e57f4c65b98bbc66807bd9834950b9e37673372f440567e6fb2703d328d1c"],"state_sha256":"b3930a6616be3d6d823e8d39cd63c51cae069c4a0131bd169289a541de507ac8"}