{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:O4PTHAPCG5NGQVESMBEFGNUAMY","short_pith_number":"pith:O4PTHAPC","schema_version":"1.0","canonical_sha256":"771f3381e2375a6854926048533680662d57b6a52433de504885445684d060b3","source":{"kind":"arxiv","id":"2605.21208","version":1},"attestation_state":"computed","paper":{"title":"On degree bounds of $k$-uniform hypergraphs with bounded matching number","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Haixiang Zhang, Mei Lu, Mengyu Cao","submitted_at":"2026-05-20T14:04:54Z","abstract_excerpt":"We study the connection between the degree sequence of a $k$-uniform hypergraph and the size of its largest matching. Let $\\mathcal{F}$ be a $k$-uniform hypergraph on $n$ vertices and let $d_1 \\ge d_2 \\ge \\dots \\ge d_n$ be the vertex degrees arranged in non-increasing order. For integers $k\\ge 2$, $s\\ge 2$ and $n > 2sk$, we prove that if the $(2sk+1)$-th largest degree satisfies $d_{2sk+1} > \\binom{n-1}{k-1} - \\binom{n-s}{k-1},$ then $\\mathcal{F}$ contains a matching of size at least $s$. This can be viewed as a generalization of theorems by Lu, Guo, and Jiang (2023) and Huang and Rao (2026). "},"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":"2605.21208","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-20T14:04:54Z","cross_cats_sorted":[],"title_canon_sha256":"2b8a722fb945dcab753d16e3a2f25b9136c824615e7225ac13a13b0c7957923a","abstract_canon_sha256":"9844b933732e2bde1057a020422294611e5484c1e66c983447662c471758deb6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-21T01:05:43.533624Z","signature_b64":"JEg78k1ivFuGzyWTAn+BdPziOiqfb4WlKpw/VpywnvEi57v6K6hI0foDn/U7eWytqy0pKGqdQazOlj3MjLAPCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"771f3381e2375a6854926048533680662d57b6a52433de504885445684d060b3","last_reissued_at":"2026-05-21T01:05:43.532937Z","signature_status":"signed_v1","first_computed_at":"2026-05-21T01:05:43.532937Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On degree bounds of $k$-uniform hypergraphs with bounded matching number","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Haixiang Zhang, Mei Lu, Mengyu Cao","submitted_at":"2026-05-20T14:04:54Z","abstract_excerpt":"We study the connection between the degree sequence of a $k$-uniform hypergraph and the size of its largest matching. Let $\\mathcal{F}$ be a $k$-uniform hypergraph on $n$ vertices and let $d_1 \\ge d_2 \\ge \\dots \\ge d_n$ be the vertex degrees arranged in non-increasing order. For integers $k\\ge 2$, $s\\ge 2$ and $n > 2sk$, we prove that if the $(2sk+1)$-th largest degree satisfies $d_{2sk+1} > \\binom{n-1}{k-1} - \\binom{n-s}{k-1},$ then $\\mathcal{F}$ contains a matching of size at least $s$. This can be viewed as a generalization of theorems by Lu, Guo, and Jiang (2023) and Huang and Rao (2026). "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.21208","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/2605.21208/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":"2605.21208","created_at":"2026-05-21T01:05:43.533054+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.21208v1","created_at":"2026-05-21T01:05:43.533054+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.21208","created_at":"2026-05-21T01:05:43.533054+00:00"},{"alias_kind":"pith_short_12","alias_value":"O4PTHAPCG5NG","created_at":"2026-05-21T01:05:43.533054+00:00"},{"alias_kind":"pith_short_16","alias_value":"O4PTHAPCG5NGQVES","created_at":"2026-05-21T01:05:43.533054+00:00"},{"alias_kind":"pith_short_8","alias_value":"O4PTHAPC","created_at":"2026-05-21T01:05:43.533054+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/O4PTHAPCG5NGQVESMBEFGNUAMY","json":"https://pith.science/pith/O4PTHAPCG5NGQVESMBEFGNUAMY.json","graph_json":"https://pith.science/api/pith-number/O4PTHAPCG5NGQVESMBEFGNUAMY/graph.json","events_json":"https://pith.science/api/pith-number/O4PTHAPCG5NGQVESMBEFGNUAMY/events.json","paper":"https://pith.science/paper/O4PTHAPC"},"agent_actions":{"view_html":"https://pith.science/pith/O4PTHAPCG5NGQVESMBEFGNUAMY","download_json":"https://pith.science/pith/O4PTHAPCG5NGQVESMBEFGNUAMY.json","view_paper":"https://pith.science/paper/O4PTHAPC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.21208&json=true","fetch_graph":"https://pith.science/api/pith-number/O4PTHAPCG5NGQVESMBEFGNUAMY/graph.json","fetch_events":"https://pith.science/api/pith-number/O4PTHAPCG5NGQVESMBEFGNUAMY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/O4PTHAPCG5NGQVESMBEFGNUAMY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/O4PTHAPCG5NGQVESMBEFGNUAMY/action/storage_attestation","attest_author":"https://pith.science/pith/O4PTHAPCG5NGQVESMBEFGNUAMY/action/author_attestation","sign_citation":"https://pith.science/pith/O4PTHAPCG5NGQVESMBEFGNUAMY/action/citation_signature","submit_replication":"https://pith.science/pith/O4PTHAPCG5NGQVESMBEFGNUAMY/action/replication_record"}},"created_at":"2026-05-21T01:05:43.533054+00:00","updated_at":"2026-05-21T01:05:43.533054+00:00"}