{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:WQNFZIZXYQLFG3SLFYSHTOBGMK","short_pith_number":"pith:WQNFZIZX","schema_version":"1.0","canonical_sha256":"b41a5ca337c416536e4b2e2479b82662a4fd7f10c7116ab25c2911ff513291a5","source":{"kind":"arxiv","id":"1401.4851","version":1},"attestation_state":"computed","paper":{"title":"A characterization of hypergraphs that achieve equality in the Chv\\'{a}tal-McDiarmid Theorem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Christian L\\\"owenstein, Michael A. Henning","submitted_at":"2014-01-20T10:25:07Z","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"},"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":"1401.4851","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-20T10:25:07Z","cross_cats_sorted":[],"title_canon_sha256":"d42c63be6a706e2aef63ba6a311c16caf0860789ce16a432612d6d5fa95057b0","abstract_canon_sha256":"b4beca313014f0cee07ea938a7c94a922b9a97f1c152c3afdfd25d470cfb7232"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:01:44.307490Z","signature_b64":"NcQByWZB+S4C3QnCBJ6jph3nP3sxD5EWWi3JuIfOskC5id7Or7mSwya/7OkERzZHXKOVWVDxOZFE8jwNfBohDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b41a5ca337c416536e4b2e2479b82662a4fd7f10c7116ab25c2911ff513291a5","last_reissued_at":"2026-05-18T03:01:44.306606Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:01:44.306606Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A characterization of hypergraphs that achieve equality in the Chv\\'{a}tal-McDiarmid Theorem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Christian L\\\"owenstein, Michael A. Henning","submitted_at":"2014-01-20T10:25:07Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.4851","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":""},"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":"1401.4851","created_at":"2026-05-18T03:01:44.306757+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.4851v1","created_at":"2026-05-18T03:01:44.306757+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.4851","created_at":"2026-05-18T03:01:44.306757+00:00"},{"alias_kind":"pith_short_12","alias_value":"WQNFZIZXYQLF","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_16","alias_value":"WQNFZIZXYQLFG3SL","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_8","alias_value":"WQNFZIZX","created_at":"2026-05-18T12:28:54.890064+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/WQNFZIZXYQLFG3SLFYSHTOBGMK","json":"https://pith.science/pith/WQNFZIZXYQLFG3SLFYSHTOBGMK.json","graph_json":"https://pith.science/api/pith-number/WQNFZIZXYQLFG3SLFYSHTOBGMK/graph.json","events_json":"https://pith.science/api/pith-number/WQNFZIZXYQLFG3SLFYSHTOBGMK/events.json","paper":"https://pith.science/paper/WQNFZIZX"},"agent_actions":{"view_html":"https://pith.science/pith/WQNFZIZXYQLFG3SLFYSHTOBGMK","download_json":"https://pith.science/pith/WQNFZIZXYQLFG3SLFYSHTOBGMK.json","view_paper":"https://pith.science/paper/WQNFZIZX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.4851&json=true","fetch_graph":"https://pith.science/api/pith-number/WQNFZIZXYQLFG3SLFYSHTOBGMK/graph.json","fetch_events":"https://pith.science/api/pith-number/WQNFZIZXYQLFG3SLFYSHTOBGMK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WQNFZIZXYQLFG3SLFYSHTOBGMK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WQNFZIZXYQLFG3SLFYSHTOBGMK/action/storage_attestation","attest_author":"https://pith.science/pith/WQNFZIZXYQLFG3SLFYSHTOBGMK/action/author_attestation","sign_citation":"https://pith.science/pith/WQNFZIZXYQLFG3SLFYSHTOBGMK/action/citation_signature","submit_replication":"https://pith.science/pith/WQNFZIZXYQLFG3SLFYSHTOBGMK/action/replication_record"}},"created_at":"2026-05-18T03:01:44.306757+00:00","updated_at":"2026-05-18T03:01:44.306757+00:00"}