{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:UDATZQQSOOGPXLEJ7PQSIW2XR5","short_pith_number":"pith:UDATZQQS","schema_version":"1.0","canonical_sha256":"a0c13cc212738cfbac89fbe1245b578f7f3219e6c47cef251a3bcf61734ff52a","source":{"kind":"arxiv","id":"1107.1219","version":2},"attestation_state":"computed","paper":{"title":"Large matchings in uniform hypergraphs and the conjectures of Erdos and Samuels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Andrzej Rucinski, Benny Sudakov, Hao Huang, Noga Alon, Peter Frankl, Vojtech Rodl","submitted_at":"2011-07-06T18:42:32Z","abstract_excerpt":"In this paper we study conditions which guarantee the existence of perfect matchings and perfect fractional matchings in uniform hypergraphs. We reduce this problem to an old conjecture by Erd\\H{o}s on estimating the maximum number of edges in a hypergraph when the (fractional) matching number is given, which we are able to solve in some special cases using probabilistic techniques. Based on these results, we obtain some general theorems on the minimum $d$-degree ensuring the existence of perfect (fractional) matchings. In particular, we asymptotically determine the minimum vertex degree which"},"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":"1107.1219","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-07-06T18:42:32Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"5b6b91ade966142d14c4a1f94fb297fbcdc7d0efd3f385d56ab48368b04f8cdf","abstract_canon_sha256":"8464f53a131b9fccfd3844fe90be7ea9be3c86a74b309eb0874721893292e393"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:03:32.311245Z","signature_b64":"pDpAIy3C5CcZcQz5B0kRL11pwFmMkXF+KaGQaS/fzlEQx8ZRQD7Dva7DoLTnFPwePptljuePZpUB6cmIvm5VBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a0c13cc212738cfbac89fbe1245b578f7f3219e6c47cef251a3bcf61734ff52a","last_reissued_at":"2026-05-18T04:03:32.310548Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:03:32.310548Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Large matchings in uniform hypergraphs and the conjectures of Erdos and Samuels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Andrzej Rucinski, Benny Sudakov, Hao Huang, Noga Alon, Peter Frankl, Vojtech Rodl","submitted_at":"2011-07-06T18:42:32Z","abstract_excerpt":"In this paper we study conditions which guarantee the existence of perfect matchings and perfect fractional matchings in uniform hypergraphs. We reduce this problem to an old conjecture by Erd\\H{o}s on estimating the maximum number of edges in a hypergraph when the (fractional) matching number is given, which we are able to solve in some special cases using probabilistic techniques. Based on these results, we obtain some general theorems on the minimum $d$-degree ensuring the existence of perfect (fractional) matchings. In particular, we asymptotically determine the minimum vertex degree which"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.1219","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":"1107.1219","created_at":"2026-05-18T04:03:32.310659+00:00"},{"alias_kind":"arxiv_version","alias_value":"1107.1219v2","created_at":"2026-05-18T04:03:32.310659+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.1219","created_at":"2026-05-18T04:03:32.310659+00:00"},{"alias_kind":"pith_short_12","alias_value":"UDATZQQSOOGP","created_at":"2026-05-18T12:26:42.757692+00:00"},{"alias_kind":"pith_short_16","alias_value":"UDATZQQSOOGPXLEJ","created_at":"2026-05-18T12:26:42.757692+00:00"},{"alias_kind":"pith_short_8","alias_value":"UDATZQQS","created_at":"2026-05-18T12:26:42.757692+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/UDATZQQSOOGPXLEJ7PQSIW2XR5","json":"https://pith.science/pith/UDATZQQSOOGPXLEJ7PQSIW2XR5.json","graph_json":"https://pith.science/api/pith-number/UDATZQQSOOGPXLEJ7PQSIW2XR5/graph.json","events_json":"https://pith.science/api/pith-number/UDATZQQSOOGPXLEJ7PQSIW2XR5/events.json","paper":"https://pith.science/paper/UDATZQQS"},"agent_actions":{"view_html":"https://pith.science/pith/UDATZQQSOOGPXLEJ7PQSIW2XR5","download_json":"https://pith.science/pith/UDATZQQSOOGPXLEJ7PQSIW2XR5.json","view_paper":"https://pith.science/paper/UDATZQQS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1107.1219&json=true","fetch_graph":"https://pith.science/api/pith-number/UDATZQQSOOGPXLEJ7PQSIW2XR5/graph.json","fetch_events":"https://pith.science/api/pith-number/UDATZQQSOOGPXLEJ7PQSIW2XR5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UDATZQQSOOGPXLEJ7PQSIW2XR5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UDATZQQSOOGPXLEJ7PQSIW2XR5/action/storage_attestation","attest_author":"https://pith.science/pith/UDATZQQSOOGPXLEJ7PQSIW2XR5/action/author_attestation","sign_citation":"https://pith.science/pith/UDATZQQSOOGPXLEJ7PQSIW2XR5/action/citation_signature","submit_replication":"https://pith.science/pith/UDATZQQSOOGPXLEJ7PQSIW2XR5/action/replication_record"}},"created_at":"2026-05-18T04:03:32.310659+00:00","updated_at":"2026-05-18T04:03:32.310659+00:00"}