{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:WQNFZIZXYQLFG3SLFYSHTOBGMK","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":"b4beca313014f0cee07ea938a7c94a922b9a97f1c152c3afdfd25d470cfb7232","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-20T10:25:07Z","title_canon_sha256":"d42c63be6a706e2aef63ba6a311c16caf0860789ce16a432612d6d5fa95057b0"},"schema_version":"1.0","source":{"id":"1401.4851","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.4851","created_at":"2026-05-18T03:01:44Z"},{"alias_kind":"arxiv_version","alias_value":"1401.4851v1","created_at":"2026-05-18T03:01:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.4851","created_at":"2026-05-18T03:01:44Z"},{"alias_kind":"pith_short_12","alias_value":"WQNFZIZXYQLF","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"WQNFZIZXYQLFG3SL","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"WQNFZIZX","created_at":"2026-05-18T12:28:54Z"}],"graph_snapshots":[{"event_id":"sha256:e709d2dfe4e38b249ab051b9f4184f2d4f2a06c4e64e8274ce6b83dc4b120b43","target":"graph","created_at":"2026-05-18T03:01:44Z","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"},"paper":{"abstract_excerpt":"For $k \\ge 2$, let $H$ be a $k$-uniform hypergraph on $n$ vertices and $m$ edges. The transversal number $\\tau(H)$ of $H$ is the minimum number of vertices that intersect every edge. Chv\\'{a}tal and McDiarmid [Combinatorica 12 (1992), 19--26] proved that $\\tau(H)\\le ( n + \\left\\lfloor \\frac k2 \\right\\rfloor m )/ ( \\left\\lfloor \\frac{3k}2 \\right\\rfloor )$. When $k = 3$, the connected hypergraphs that achieve equality in the Chv\\'{a}tal-McDiarmid Theorem were characterized by Henning and Yeo [J. Graph Theory 59 (2008), 326--348]. In this paper, we characterize the connected hypergraphs that achi","authors_text":"Christian L\\\"owenstein, Michael A. Henning","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-20T10:25:07Z","title":"A characterization of hypergraphs that achieve equality in the Chv\\'{a}tal-McDiarmid Theorem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.4851","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:dcbd8f37c0d381a7f28bea317157ddb4ab1127da1d1aa893bb5da88a1bcf6bc3","target":"record","created_at":"2026-05-18T03:01:44Z","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":"b4beca313014f0cee07ea938a7c94a922b9a97f1c152c3afdfd25d470cfb7232","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-20T10:25:07Z","title_canon_sha256":"d42c63be6a706e2aef63ba6a311c16caf0860789ce16a432612d6d5fa95057b0"},"schema_version":"1.0","source":{"id":"1401.4851","kind":"arxiv","version":1}},"canonical_sha256":"b41a5ca337c416536e4b2e2479b82662a4fd7f10c7116ab25c2911ff513291a5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b41a5ca337c416536e4b2e2479b82662a4fd7f10c7116ab25c2911ff513291a5","first_computed_at":"2026-05-18T03:01:44.306606Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:01:44.306606Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NcQByWZB+S4C3QnCBJ6jph3nP3sxD5EWWi3JuIfOskC5id7Or7mSwya/7OkERzZHXKOVWVDxOZFE8jwNfBohDw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:01:44.307490Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.4851","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dcbd8f37c0d381a7f28bea317157ddb4ab1127da1d1aa893bb5da88a1bcf6bc3","sha256:e709d2dfe4e38b249ab051b9f4184f2d4f2a06c4e64e8274ce6b83dc4b120b43"],"state_sha256":"81addf42b42410ab48bda74a16f5350473669571b95d5662c915a8305bec6477"}