{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:O4PTHAPCG5NGQVESMBEFGNUAMY","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":"9844b933732e2bde1057a020422294611e5484c1e66c983447662c471758deb6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-20T14:04:54Z","title_canon_sha256":"2b8a722fb945dcab753d16e3a2f25b9136c824615e7225ac13a13b0c7957923a"},"schema_version":"1.0","source":{"id":"2605.21208","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.21208","created_at":"2026-05-21T01:05:43Z"},{"alias_kind":"arxiv_version","alias_value":"2605.21208v1","created_at":"2026-05-21T01:05:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.21208","created_at":"2026-05-21T01:05:43Z"},{"alias_kind":"pith_short_12","alias_value":"O4PTHAPCG5NG","created_at":"2026-05-21T01:05:43Z"},{"alias_kind":"pith_short_16","alias_value":"O4PTHAPCG5NGQVES","created_at":"2026-05-21T01:05:43Z"},{"alias_kind":"pith_short_8","alias_value":"O4PTHAPC","created_at":"2026-05-21T01:05:43Z"}],"graph_snapshots":[{"event_id":"sha256:10877486c378a87dec333e1dd27903c1cf493ed236049ea23d53c8a8a002b602","target":"graph","created_at":"2026-05-21T01:05:43Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2605.21208/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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). ","authors_text":"Haixiang Zhang, Mei Lu, Mengyu Cao","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-20T14:04:54Z","title":"On degree bounds of $k$-uniform hypergraphs with bounded matching number"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.21208","kind":"arxiv","version":1},"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:28b9ac3fce6450ddaace4a1fc597863c3320e33d287e2fd1f0b4b2f4831965a8","target":"record","created_at":"2026-05-21T01:05:43Z","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":"9844b933732e2bde1057a020422294611e5484c1e66c983447662c471758deb6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-20T14:04:54Z","title_canon_sha256":"2b8a722fb945dcab753d16e3a2f25b9136c824615e7225ac13a13b0c7957923a"},"schema_version":"1.0","source":{"id":"2605.21208","kind":"arxiv","version":1}},"canonical_sha256":"771f3381e2375a6854926048533680662d57b6a52433de504885445684d060b3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"771f3381e2375a6854926048533680662d57b6a52433de504885445684d060b3","first_computed_at":"2026-05-21T01:05:43.532937Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-21T01:05:43.532937Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JEg78k1ivFuGzyWTAn+BdPziOiqfb4WlKpw/VpywnvEi57v6K6hI0foDn/U7eWytqy0pKGqdQazOlj3MjLAPCw==","signature_status":"signed_v1","signed_at":"2026-05-21T01:05:43.533624Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.21208","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:28b9ac3fce6450ddaace4a1fc597863c3320e33d287e2fd1f0b4b2f4831965a8","sha256:10877486c378a87dec333e1dd27903c1cf493ed236049ea23d53c8a8a002b602"],"state_sha256":"d6cdea8dbdb96322cae90eb288f35db44b7ac6401b61cd5e2fa315f1a381f359"}