{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:AV6PPNPN2QUUYVCTG34F56GKTU","short_pith_number":"pith:AV6PPNPN","schema_version":"1.0","canonical_sha256":"057cf7b5edd4294c545336f85ef8ca9d301762c4ae584945f3f107fbe09c1787","source":{"kind":"arxiv","id":"1608.04838","version":2},"attestation_state":"computed","paper":{"title":"Almost 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":"2016-08-17T02:37:11Z","abstract_excerpt":"The minimum co-degree threshold for a perfect matching in a $k$-graph with $n$ vertices was determined by R\\\"odl, Ruci\\'nski and Szemer\\'edi for the case when $n\\equiv 0\\pmod k$. Recently, Han resolved the remaining cases when $n \\not\\equiv 0\\pmod k$, establishing a conjecture of R\\\"odl, Ruci\\'nski and Szemer\\'edi. In this paper, we determine the minimum co-degree threshold for almost perfect matchings in $k$-partite $k$-graphs, answering a question of R\\\"odl and Ruci\\'nski."},"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":"1608.04838","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-08-17T02:37:11Z","cross_cats_sorted":[],"title_canon_sha256":"1e20ee9021c0fa8d7707bfa5f76429082fd8680579c58452aaf98554ab1d59e9","abstract_canon_sha256":"b93ff089d3f7ee96ae5896133e934ffb211ffd4162b8ba834403c6cc7c98050d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:18.784764Z","signature_b64":"Nd8YhW3HopcLCL4/CL9dszpzOTmxOUx3ZB5B4RLHjno+EC5McZoVTDOwP2NFkHFeybr/r/ZprSkysAkD2V09DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"057cf7b5edd4294c545336f85ef8ca9d301762c4ae584945f3f107fbe09c1787","last_reissued_at":"2026-05-18T00:44:18.784235Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:18.784235Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Almost 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":"2016-08-17T02:37:11Z","abstract_excerpt":"The minimum co-degree threshold for a perfect matching in a $k$-graph with $n$ vertices was determined by R\\\"odl, Ruci\\'nski and Szemer\\'edi for the case when $n\\equiv 0\\pmod k$. Recently, Han resolved the remaining cases when $n \\not\\equiv 0\\pmod k$, establishing a conjecture of R\\\"odl, Ruci\\'nski and Szemer\\'edi. In this paper, we determine the minimum co-degree threshold for almost perfect matchings in $k$-partite $k$-graphs, answering a question of R\\\"odl and Ruci\\'nski."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.04838","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":"1608.04838","created_at":"2026-05-18T00:44:18.784307+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.04838v2","created_at":"2026-05-18T00:44:18.784307+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.04838","created_at":"2026-05-18T00:44:18.784307+00:00"},{"alias_kind":"pith_short_12","alias_value":"AV6PPNPN2QUU","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_16","alias_value":"AV6PPNPN2QUUYVCT","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_8","alias_value":"AV6PPNPN","created_at":"2026-05-18T12:30:07.202191+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/AV6PPNPN2QUUYVCTG34F56GKTU","json":"https://pith.science/pith/AV6PPNPN2QUUYVCTG34F56GKTU.json","graph_json":"https://pith.science/api/pith-number/AV6PPNPN2QUUYVCTG34F56GKTU/graph.json","events_json":"https://pith.science/api/pith-number/AV6PPNPN2QUUYVCTG34F56GKTU/events.json","paper":"https://pith.science/paper/AV6PPNPN"},"agent_actions":{"view_html":"https://pith.science/pith/AV6PPNPN2QUUYVCTG34F56GKTU","download_json":"https://pith.science/pith/AV6PPNPN2QUUYVCTG34F56GKTU.json","view_paper":"https://pith.science/paper/AV6PPNPN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.04838&json=true","fetch_graph":"https://pith.science/api/pith-number/AV6PPNPN2QUUYVCTG34F56GKTU/graph.json","fetch_events":"https://pith.science/api/pith-number/AV6PPNPN2QUUYVCTG34F56GKTU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AV6PPNPN2QUUYVCTG34F56GKTU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AV6PPNPN2QUUYVCTG34F56GKTU/action/storage_attestation","attest_author":"https://pith.science/pith/AV6PPNPN2QUUYVCTG34F56GKTU/action/author_attestation","sign_citation":"https://pith.science/pith/AV6PPNPN2QUUYVCTG34F56GKTU/action/citation_signature","submit_replication":"https://pith.science/pith/AV6PPNPN2QUUYVCTG34F56GKTU/action/replication_record"}},"created_at":"2026-05-18T00:44:18.784307+00:00","updated_at":"2026-05-18T00:44:18.784307+00:00"}