{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:WUDLFQNZAQN2BLGINSICBRNN5T","short_pith_number":"pith:WUDLFQNZ","schema_version":"1.0","canonical_sha256":"b506b2c1b9041ba0acc86c9020c5adecf2714cd99de138a4da228208ccd41527","source":{"kind":"arxiv","id":"2505.17981","version":1},"attestation_state":"computed","paper":{"title":"Positive codegree thresholds for perfect matchings in hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Camila Z\\'arate-Guer\\'en, Richard Mycroft","submitted_at":"2025-05-23T14:47:33Z","abstract_excerpt":"We give, for each $k \\geq 3$, the precise best possible minimum positive codegree condition for a perfect matching in a large $k$-uniform hypergraph $H$ on $n$ vertices. Specifically we show that, if $n$ is sufficiently large and divisible by $k$, and $H$ has minimum positive codegree $\\delta^+(H) \\geq \\frac{k-1}{k}n - (k-2)$ and no isolated vertices, then $H$ contains a perfect matching. For $k=3$ this was previously established by Halfpap and Magnan, who also gave bounds for $k \\geq 4$ which were tight up to an additive constant."},"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":"2505.17981","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-05-23T14:47:33Z","cross_cats_sorted":[],"title_canon_sha256":"0fee931573ae809a7a05f7e9f73974429c9bd06d798e07be5a57c40f750ed0fa","abstract_canon_sha256":"60d795b47f85857d95e541ff29bcb6e8c6138604cdfbde36265bab0c4719fcd8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:08:34.661283Z","signature_b64":"oyEn3cHiLfqS2mvvOjEn8t0AGG7TEMIS+SFglX/SrpSXeHDEuJ+6bXdvRbuOA5UnWtmX/oNsxbiiD+islTkHBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b506b2c1b9041ba0acc86c9020c5adecf2714cd99de138a4da228208ccd41527","last_reissued_at":"2026-07-05T11:08:34.660837Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:08:34.660837Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Positive codegree thresholds for perfect matchings in hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Camila Z\\'arate-Guer\\'en, Richard Mycroft","submitted_at":"2025-05-23T14:47:33Z","abstract_excerpt":"We give, for each $k \\geq 3$, the precise best possible minimum positive codegree condition for a perfect matching in a large $k$-uniform hypergraph $H$ on $n$ vertices. Specifically we show that, if $n$ is sufficiently large and divisible by $k$, and $H$ has minimum positive codegree $\\delta^+(H) \\geq \\frac{k-1}{k}n - (k-2)$ and no isolated vertices, then $H$ contains a perfect matching. For $k=3$ this was previously established by Halfpap and Magnan, who also gave bounds for $k \\geq 4$ which were tight up to an additive constant."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.17981","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2505.17981/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2505.17981","created_at":"2026-07-05T11:08:34.660894+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.17981v1","created_at":"2026-07-05T11:08:34.660894+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.17981","created_at":"2026-07-05T11:08:34.660894+00:00"},{"alias_kind":"pith_short_12","alias_value":"WUDLFQNZAQN2","created_at":"2026-07-05T11:08:34.660894+00:00"},{"alias_kind":"pith_short_16","alias_value":"WUDLFQNZAQN2BLGI","created_at":"2026-07-05T11:08:34.660894+00:00"},{"alias_kind":"pith_short_8","alias_value":"WUDLFQNZ","created_at":"2026-07-05T11:08:34.660894+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/WUDLFQNZAQN2BLGINSICBRNN5T","json":"https://pith.science/pith/WUDLFQNZAQN2BLGINSICBRNN5T.json","graph_json":"https://pith.science/api/pith-number/WUDLFQNZAQN2BLGINSICBRNN5T/graph.json","events_json":"https://pith.science/api/pith-number/WUDLFQNZAQN2BLGINSICBRNN5T/events.json","paper":"https://pith.science/paper/WUDLFQNZ"},"agent_actions":{"view_html":"https://pith.science/pith/WUDLFQNZAQN2BLGINSICBRNN5T","download_json":"https://pith.science/pith/WUDLFQNZAQN2BLGINSICBRNN5T.json","view_paper":"https://pith.science/paper/WUDLFQNZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.17981&json=true","fetch_graph":"https://pith.science/api/pith-number/WUDLFQNZAQN2BLGINSICBRNN5T/graph.json","fetch_events":"https://pith.science/api/pith-number/WUDLFQNZAQN2BLGINSICBRNN5T/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WUDLFQNZAQN2BLGINSICBRNN5T/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WUDLFQNZAQN2BLGINSICBRNN5T/action/storage_attestation","attest_author":"https://pith.science/pith/WUDLFQNZAQN2BLGINSICBRNN5T/action/author_attestation","sign_citation":"https://pith.science/pith/WUDLFQNZAQN2BLGINSICBRNN5T/action/citation_signature","submit_replication":"https://pith.science/pith/WUDLFQNZAQN2BLGINSICBRNN5T/action/replication_record"}},"created_at":"2026-07-05T11:08:34.660894+00:00","updated_at":"2026-07-05T11:08:34.660894+00:00"}