{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:UAW2AIEJ3FEPOKAIWG2VDQZENE","short_pith_number":"pith:UAW2AIEJ","schema_version":"1.0","canonical_sha256":"a02da02089d948f72808b1b551c3246906234a3ae31cbe45ef92b1be9dc635f5","source":{"kind":"arxiv","id":"1711.08185","version":1},"attestation_state":"computed","paper":{"title":"Minimum co-degree condition for perfect matchings in k-partite k-graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hongliang Lu, Xingxing Yu, Yan Wang","submitted_at":"2017-11-22T09:16:04Z","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."},"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":"1711.08185","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-11-22T09:16:04Z","cross_cats_sorted":[],"title_canon_sha256":"bf58ad5044c9f83b2b51307773659b38c2bde56ea5a10e9bb04c55f8a9c181c3","abstract_canon_sha256":"98fa3ee06cfbe9ec45add3ab39e3d674dc26ac878a7895ad35734904358b2a0f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:50.461679Z","signature_b64":"/RzakApaajzCcVq3TTPBj8XdfixeNOBTZ1l/VGHAL/A1F/mAzuZX2uO5C8Tghgx01ecxhl9O8RbBPrILTVmECg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a02da02089d948f72808b1b551c3246906234a3ae31cbe45ef92b1be9dc635f5","last_reissued_at":"2026-05-18T00:29:50.461178Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:50.461178Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Minimum co-degree condition for perfect matchings in k-partite k-graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hongliang Lu, Xingxing Yu, Yan Wang","submitted_at":"2017-11-22T09:16:04Z","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."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.08185","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":"1711.08185","created_at":"2026-05-18T00:29:50.461250+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.08185v1","created_at":"2026-05-18T00:29:50.461250+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.08185","created_at":"2026-05-18T00:29:50.461250+00:00"},{"alias_kind":"pith_short_12","alias_value":"UAW2AIEJ3FEP","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_16","alias_value":"UAW2AIEJ3FEPOKAI","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_8","alias_value":"UAW2AIEJ","created_at":"2026-05-18T12:31:46.661854+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/UAW2AIEJ3FEPOKAIWG2VDQZENE","json":"https://pith.science/pith/UAW2AIEJ3FEPOKAIWG2VDQZENE.json","graph_json":"https://pith.science/api/pith-number/UAW2AIEJ3FEPOKAIWG2VDQZENE/graph.json","events_json":"https://pith.science/api/pith-number/UAW2AIEJ3FEPOKAIWG2VDQZENE/events.json","paper":"https://pith.science/paper/UAW2AIEJ"},"agent_actions":{"view_html":"https://pith.science/pith/UAW2AIEJ3FEPOKAIWG2VDQZENE","download_json":"https://pith.science/pith/UAW2AIEJ3FEPOKAIWG2VDQZENE.json","view_paper":"https://pith.science/paper/UAW2AIEJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.08185&json=true","fetch_graph":"https://pith.science/api/pith-number/UAW2AIEJ3FEPOKAIWG2VDQZENE/graph.json","fetch_events":"https://pith.science/api/pith-number/UAW2AIEJ3FEPOKAIWG2VDQZENE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UAW2AIEJ3FEPOKAIWG2VDQZENE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UAW2AIEJ3FEPOKAIWG2VDQZENE/action/storage_attestation","attest_author":"https://pith.science/pith/UAW2AIEJ3FEPOKAIWG2VDQZENE/action/author_attestation","sign_citation":"https://pith.science/pith/UAW2AIEJ3FEPOKAIWG2VDQZENE/action/citation_signature","submit_replication":"https://pith.science/pith/UAW2AIEJ3FEPOKAIWG2VDQZENE/action/replication_record"}},"created_at":"2026-05-18T00:29:50.461250+00:00","updated_at":"2026-05-18T00:29:50.461250+00:00"}