{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:ZNNIYQW3GJ7Z5UFV3OLFODYWF7","short_pith_number":"pith:ZNNIYQW3","canonical_record":{"source":{"id":"1504.02650","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-04-10T12:09:48Z","cross_cats_sorted":[],"title_canon_sha256":"47167adea63fe4d733619805f8dbc6356745d2a4fde4ca5ed8caba6d75f23536","abstract_canon_sha256":"628d59c79c933e9c16952c9ab1d09d4f5b6163b6383661b216ac6f0d8119f854"},"schema_version":"1.0"},"canonical_sha256":"cb5a8c42db327f9ed0b5db96570f162fdd8aea03acb1eb0aaa2769a085f924a6","source":{"kind":"arxiv","id":"1504.02650","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.02650","created_at":"2026-05-18T02:19:06Z"},{"alias_kind":"arxiv_version","alias_value":"1504.02650v1","created_at":"2026-05-18T02:19:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.02650","created_at":"2026-05-18T02:19:06Z"},{"alias_kind":"pith_short_12","alias_value":"ZNNIYQW3GJ7Z","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"ZNNIYQW3GJ7Z5UFV","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"ZNNIYQW3","created_at":"2026-05-18T12:29:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:ZNNIYQW3GJ7Z5UFV3OLFODYWF7","target":"record","payload":{"canonical_record":{"source":{"id":"1504.02650","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-04-10T12:09:48Z","cross_cats_sorted":[],"title_canon_sha256":"47167adea63fe4d733619805f8dbc6356745d2a4fde4ca5ed8caba6d75f23536","abstract_canon_sha256":"628d59c79c933e9c16952c9ab1d09d4f5b6163b6383661b216ac6f0d8119f854"},"schema_version":"1.0"},"canonical_sha256":"cb5a8c42db327f9ed0b5db96570f162fdd8aea03acb1eb0aaa2769a085f924a6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:19:06.992986Z","signature_b64":"P26rvVVNSrtuGavYf7DVcJ8co1t1V6RJPXcbVCu8Fu787BGyoP0/Ti/9rLLzpUQuc/v0/GAL56ZraZclOp5xBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cb5a8c42db327f9ed0b5db96570f162fdd8aea03acb1eb0aaa2769a085f924a6","last_reissued_at":"2026-05-18T02:19:06.992288Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:19:06.992288Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1504.02650","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:19:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZL+XnBIUY3YtMzwpgP/L0WLXW78EzB2eMMs2dYUltLLN3ZcFCfrmrJS+EKIRJ2NHT9gjuUQd80VIBDao8rcxAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T10:48:13.044578Z"},"content_sha256":"e743d39c5d59fa40b48da3d380eb75b3c5db5ca2c27698b2de218fab8aa620e5","schema_version":"1.0","event_id":"sha256:e743d39c5d59fa40b48da3d380eb75b3c5db5ca2c27698b2de218fab8aa620e5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:ZNNIYQW3GJ7Z5UFV3OLFODYWF7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Transversals in $4$-Uniform Hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Anders Yeo, Michael A. Henning","submitted_at":"2015-04-10T12:09:48Z","abstract_excerpt":"Let $H$ be a $3$-regular $4$-uniform hypergraph on $n$ vertices. The transversal number $\\tau(H)$ of $H$ is the minimum number of vertices that intersect every edge. Lai and Chang [J. Combin. Theory Ser. B 50 (1990), 129--133] proved that $\\tau(H) \\le 7n/18$. Thomass\\'{e} and Yeo [Combinatorica 27 (2007), 473--487] improved this bound and showed that $\\tau(H) \\le 8n/21$. We provide a further improvement and prove that $\\tau(H) \\le 3n/8$, which is best possible due to a hypergraph of order eight. More generally, we show that if $H$ is a $4$-uniform hypergraph on $n$ vertices and $m$ edges with "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.02650","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:19:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wj8MdOQY7kaYRbqeEVgwmD0VKDRKJD5aF3eQPcoqtN+s5v8RH6mxjyQFxvvpX7juwr9fWoVs255gdd2EFcmvDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T10:48:13.044923Z"},"content_sha256":"d030b5e1aead205b67ba5c693ba5b490bc011f32ef5ba4e7af5ea359e406b5e6","schema_version":"1.0","event_id":"sha256:d030b5e1aead205b67ba5c693ba5b490bc011f32ef5ba4e7af5ea359e406b5e6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZNNIYQW3GJ7Z5UFV3OLFODYWF7/bundle.json","state_url":"https://pith.science/pith/ZNNIYQW3GJ7Z5UFV3OLFODYWF7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZNNIYQW3GJ7Z5UFV3OLFODYWF7/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-01T10:48:13Z","links":{"resolver":"https://pith.science/pith/ZNNIYQW3GJ7Z5UFV3OLFODYWF7","bundle":"https://pith.science/pith/ZNNIYQW3GJ7Z5UFV3OLFODYWF7/bundle.json","state":"https://pith.science/pith/ZNNIYQW3GJ7Z5UFV3OLFODYWF7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZNNIYQW3GJ7Z5UFV3OLFODYWF7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:ZNNIYQW3GJ7Z5UFV3OLFODYWF7","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":"628d59c79c933e9c16952c9ab1d09d4f5b6163b6383661b216ac6f0d8119f854","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-04-10T12:09:48Z","title_canon_sha256":"47167adea63fe4d733619805f8dbc6356745d2a4fde4ca5ed8caba6d75f23536"},"schema_version":"1.0","source":{"id":"1504.02650","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.02650","created_at":"2026-05-18T02:19:06Z"},{"alias_kind":"arxiv_version","alias_value":"1504.02650v1","created_at":"2026-05-18T02:19:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.02650","created_at":"2026-05-18T02:19:06Z"},{"alias_kind":"pith_short_12","alias_value":"ZNNIYQW3GJ7Z","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"ZNNIYQW3GJ7Z5UFV","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"ZNNIYQW3","created_at":"2026-05-18T12:29:52Z"}],"graph_snapshots":[{"event_id":"sha256:d030b5e1aead205b67ba5c693ba5b490bc011f32ef5ba4e7af5ea359e406b5e6","target":"graph","created_at":"2026-05-18T02:19:06Z","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":"Let $H$ be a $3$-regular $4$-uniform hypergraph on $n$ vertices. The transversal number $\\tau(H)$ of $H$ is the minimum number of vertices that intersect every edge. Lai and Chang [J. Combin. Theory Ser. B 50 (1990), 129--133] proved that $\\tau(H) \\le 7n/18$. Thomass\\'{e} and Yeo [Combinatorica 27 (2007), 473--487] improved this bound and showed that $\\tau(H) \\le 8n/21$. We provide a further improvement and prove that $\\tau(H) \\le 3n/8$, which is best possible due to a hypergraph of order eight. More generally, we show that if $H$ is a $4$-uniform hypergraph on $n$ vertices and $m$ edges with ","authors_text":"Anders Yeo, Michael A. Henning","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-04-10T12:09:48Z","title":"Transversals in $4$-Uniform Hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.02650","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:e743d39c5d59fa40b48da3d380eb75b3c5db5ca2c27698b2de218fab8aa620e5","target":"record","created_at":"2026-05-18T02:19:06Z","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":"628d59c79c933e9c16952c9ab1d09d4f5b6163b6383661b216ac6f0d8119f854","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-04-10T12:09:48Z","title_canon_sha256":"47167adea63fe4d733619805f8dbc6356745d2a4fde4ca5ed8caba6d75f23536"},"schema_version":"1.0","source":{"id":"1504.02650","kind":"arxiv","version":1}},"canonical_sha256":"cb5a8c42db327f9ed0b5db96570f162fdd8aea03acb1eb0aaa2769a085f924a6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cb5a8c42db327f9ed0b5db96570f162fdd8aea03acb1eb0aaa2769a085f924a6","first_computed_at":"2026-05-18T02:19:06.992288Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:19:06.992288Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"P26rvVVNSrtuGavYf7DVcJ8co1t1V6RJPXcbVCu8Fu787BGyoP0/Ti/9rLLzpUQuc/v0/GAL56ZraZclOp5xBg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:19:06.992986Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.02650","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e743d39c5d59fa40b48da3d380eb75b3c5db5ca2c27698b2de218fab8aa620e5","sha256:d030b5e1aead205b67ba5c693ba5b490bc011f32ef5ba4e7af5ea359e406b5e6"],"state_sha256":"a0fdfc972624b8fb47d26ae6b4340c3c32c65286d3d5f43a146edfaced7b1fa4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q4mHE9Jo57EFokuyoVVgOxBpb4gJcjcbnD0SSf8Yj2Jt9OfmW5ywYV0mPj4U2l0iXcPs98xcHkxNgmI08qyWCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T10:48:13.046742Z","bundle_sha256":"e00e596771ba46f802ff83a6a0f5fdf931a5d0c3fe7a29545046b3e5b3ba078b"}}