{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:ECMCVQO63YWENYXW6D34J4X7K4","short_pith_number":"pith:ECMCVQO6","schema_version":"1.0","canonical_sha256":"20982ac1dede2c46e2f6f0f7c4f2ff57017692699f7feaa9bad31b09090488cb","source":{"kind":"arxiv","id":"1903.12207","version":2},"attestation_state":"computed","paper":{"title":"Uniformity-independent minimum degree conditions for perfect matchings in hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Asaf Ferber, Vishesh Jain","submitted_at":"2019-03-28T18:17:03Z","abstract_excerpt":"In this note, we prove that there exists a universal constant $c=\\frac{43}{50}$ such that for every $k\\in \\mathbb{N}$ and every $d<k/2$, every $k$-uniform hypergraph on $n$ vertices and with minimum $d$-degree at least $(c+o_n(1))\\binom{n-d}{k-d}$ contains a perfect matching. This is the first such bound which is independent of $k$, and therefore, improves all previously known bounds when $k$ is large. Our approach is based on combining the seminal work of Alon et al. with known bounds on a conjectured probabilistic inequality due to Feige."},"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":"1903.12207","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-03-28T18:17:03Z","cross_cats_sorted":[],"title_canon_sha256":"f3bb9083ddfb7ecb2c1b7633500a20e5bc8e708458c2931207ae32a9c66aafe4","abstract_canon_sha256":"e1a6b8f9af6eb649d21aba851130c408d2770a76a3781cd1d9c347ae868eb1fd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:49:08.654013Z","signature_b64":"8j3cokQMlnoKiMGrqGOjYLgm3eNWrqqQ5rUUwQOnxxOdPC1Dc82lHzMEtSIWUgb5KtcU1RvUKjWPiyyJ6LZmBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"20982ac1dede2c46e2f6f0f7c4f2ff57017692699f7feaa9bad31b09090488cb","last_reissued_at":"2026-05-17T23:49:08.653475Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:49:08.653475Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Uniformity-independent minimum degree conditions for perfect matchings in hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Asaf Ferber, Vishesh Jain","submitted_at":"2019-03-28T18:17:03Z","abstract_excerpt":"In this note, we prove that there exists a universal constant $c=\\frac{43}{50}$ such that for every $k\\in \\mathbb{N}$ and every $d<k/2$, every $k$-uniform hypergraph on $n$ vertices and with minimum $d$-degree at least $(c+o_n(1))\\binom{n-d}{k-d}$ contains a perfect matching. This is the first such bound which is independent of $k$, and therefore, improves all previously known bounds when $k$ is large. Our approach is based on combining the seminal work of Alon et al. with known bounds on a conjectured probabilistic inequality due to Feige."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.12207","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":"1903.12207","created_at":"2026-05-17T23:49:08.653571+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.12207v2","created_at":"2026-05-17T23:49:08.653571+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.12207","created_at":"2026-05-17T23:49:08.653571+00:00"},{"alias_kind":"pith_short_12","alias_value":"ECMCVQO63YWE","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_16","alias_value":"ECMCVQO63YWENYXW","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_8","alias_value":"ECMCVQO6","created_at":"2026-05-18T12:33:15.570797+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/ECMCVQO63YWENYXW6D34J4X7K4","json":"https://pith.science/pith/ECMCVQO63YWENYXW6D34J4X7K4.json","graph_json":"https://pith.science/api/pith-number/ECMCVQO63YWENYXW6D34J4X7K4/graph.json","events_json":"https://pith.science/api/pith-number/ECMCVQO63YWENYXW6D34J4X7K4/events.json","paper":"https://pith.science/paper/ECMCVQO6"},"agent_actions":{"view_html":"https://pith.science/pith/ECMCVQO63YWENYXW6D34J4X7K4","download_json":"https://pith.science/pith/ECMCVQO63YWENYXW6D34J4X7K4.json","view_paper":"https://pith.science/paper/ECMCVQO6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.12207&json=true","fetch_graph":"https://pith.science/api/pith-number/ECMCVQO63YWENYXW6D34J4X7K4/graph.json","fetch_events":"https://pith.science/api/pith-number/ECMCVQO63YWENYXW6D34J4X7K4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ECMCVQO63YWENYXW6D34J4X7K4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ECMCVQO63YWENYXW6D34J4X7K4/action/storage_attestation","attest_author":"https://pith.science/pith/ECMCVQO63YWENYXW6D34J4X7K4/action/author_attestation","sign_citation":"https://pith.science/pith/ECMCVQO63YWENYXW6D34J4X7K4/action/citation_signature","submit_replication":"https://pith.science/pith/ECMCVQO63YWENYXW6D34J4X7K4/action/replication_record"}},"created_at":"2026-05-17T23:49:08.653571+00:00","updated_at":"2026-05-17T23:49:08.653571+00:00"}