{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:KLZLK7LOXTPK3XTTADKFVFIPSY","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":"7341e427fab54aab5daac824a213cbe42c3349d4156616d1c1d5587554c14f59","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-04-04T02:49:01Z","title_canon_sha256":"2fbb93dcb3008199bb31e52ce5ae676be2c260da49aac33b610467782a9cc216"},"schema_version":"1.0","source":{"id":"1404.1136","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.1136","created_at":"2026-05-18T02:40:56Z"},{"alias_kind":"arxiv_version","alias_value":"1404.1136v3","created_at":"2026-05-18T02:40:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.1136","created_at":"2026-05-18T02:40:56Z"},{"alias_kind":"pith_short_12","alias_value":"KLZLK7LOXTPK","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"KLZLK7LOXTPK3XTT","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"KLZLK7LO","created_at":"2026-05-18T12:28:35Z"}],"graph_snapshots":[{"event_id":"sha256:9307c6bb583a4e58d24954e5d105a35a42189d68bd21d4bd241ab42e72a7e694","target":"graph","created_at":"2026-05-18T02:40:56Z","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$-uniform hypergraph on $n$ vertices where $n$ is a sufficiently large integer not divisible by $k$. We prove that if the minimum $(k-1)$-degree of $H$ is at least $\\lfloor n/k \\rfloor$, then $H$ contains a matching with $\\lfloor n/k\\rfloor$ edges. This confirms a conjecture of R\\\"odl, Ruci\\'nski and Szemer\\'edi, who proved that the minimum $(k-1)$-degree $n/k+O(\\log n)$ suffices. More generally, we show that $H$ contains a matching of size $d$ if its minimum codegree is $d<n/k$, which is also best possible.","authors_text":"Jie Han","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-04-04T02:49:01Z","title":"Near Perfect Matchings in $k$-uniform Hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.1136","kind":"arxiv","version":3},"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:9187e0986db9a8af1f026d502753a8744cf1ecef7eda06158fe2e97bbacfc286","target":"record","created_at":"2026-05-18T02:40:56Z","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":"7341e427fab54aab5daac824a213cbe42c3349d4156616d1c1d5587554c14f59","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-04-04T02:49:01Z","title_canon_sha256":"2fbb93dcb3008199bb31e52ce5ae676be2c260da49aac33b610467782a9cc216"},"schema_version":"1.0","source":{"id":"1404.1136","kind":"arxiv","version":3}},"canonical_sha256":"52f2b57d6ebcdeadde7300d45a950f961a41f7173d34926d9cb8162d523c5908","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"52f2b57d6ebcdeadde7300d45a950f961a41f7173d34926d9cb8162d523c5908","first_computed_at":"2026-05-18T02:40:56.164478Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:40:56.164478Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"q4BcnwXELXq02Cg8Uu0v/807E2lJoqZNkzMIUNdmx5mWvXgpvTEO3hKFi+cl5ZIcsoLlL0MuVJ1lAEl3WTAVCg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:40:56.164916Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.1136","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9187e0986db9a8af1f026d502753a8744cf1ecef7eda06158fe2e97bbacfc286","sha256:9307c6bb583a4e58d24954e5d105a35a42189d68bd21d4bd241ab42e72a7e694"],"state_sha256":"be375d126d3f8e7f72bacd6cddeff37c881b36ac5838c604c5bc3ce63d954160"}