{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:GBDMULTRTLRJYFPZ5ALHUQK4RO","short_pith_number":"pith:GBDMULTR","schema_version":"1.0","canonical_sha256":"3046ca2e719ae29c15f9e8167a415c8ba6bda51a90756aedaf2387b38a3f6039","source":{"kind":"arxiv","id":"1611.08850","version":1},"attestation_state":"computed","paper":{"title":"Every 4-regular 4-uniform hypergraph has a 2-coloring with a free vertex","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":"2016-11-27T14:18:46Z","abstract_excerpt":"In this paper, we continue the study of $2$-colorings in hypergraphs. A hypergraph is $2$-colorable if there is a $2$-coloring of the vertices with no monochromatic hyperedge. It is known (see Thomassen [J. Amer. Math. Soc. 5 (1992), 217--229]) that every $4$-uniform $4$-regular hypergraph is $2$-colorable. Our main result in this paper is a strengthening of this result. For this purpose, we define a vertex in a hypergraph $H$ to be a free vertex in $H$ if we can $2$-color $V(H) \\setminus \\{v\\}$ such that every hyperedge in $H$ contains vertices of both colors (where $v$ has no color). We prov"},"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":"1611.08850","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-27T14:18:46Z","cross_cats_sorted":[],"title_canon_sha256":"26776e09cc863fb6817cdc0e661233e14a1cc1eb44d64fb686363340fb12da50","abstract_canon_sha256":"b22a2251f3ecff9e8de1931b8331ba31c167604529b5f07a842c995393e0be8a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:56:30.108552Z","signature_b64":"+uyW9bjldvnxc722EmqKAzGThz1mRfX6t7dLASHklerKyA11uZG7gx//VPtHg9tSv1TlHtuZUCV/6phpMr+hAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3046ca2e719ae29c15f9e8167a415c8ba6bda51a90756aedaf2387b38a3f6039","last_reissued_at":"2026-05-18T00:56:30.107949Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:56:30.107949Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Every 4-regular 4-uniform hypergraph has a 2-coloring with a free vertex","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":"2016-11-27T14:18:46Z","abstract_excerpt":"In this paper, we continue the study of $2$-colorings in hypergraphs. A hypergraph is $2$-colorable if there is a $2$-coloring of the vertices with no monochromatic hyperedge. It is known (see Thomassen [J. Amer. Math. Soc. 5 (1992), 217--229]) that every $4$-uniform $4$-regular hypergraph is $2$-colorable. Our main result in this paper is a strengthening of this result. For this purpose, we define a vertex in a hypergraph $H$ to be a free vertex in $H$ if we can $2$-color $V(H) \\setminus \\{v\\}$ such that every hyperedge in $H$ contains vertices of both colors (where $v$ has no color). We prov"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.08850","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":"1611.08850","created_at":"2026-05-18T00:56:30.108038+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.08850v1","created_at":"2026-05-18T00:56:30.108038+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.08850","created_at":"2026-05-18T00:56:30.108038+00:00"},{"alias_kind":"pith_short_12","alias_value":"GBDMULTRTLRJ","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_16","alias_value":"GBDMULTRTLRJYFPZ","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_8","alias_value":"GBDMULTR","created_at":"2026-05-18T12:30:15.759754+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/GBDMULTRTLRJYFPZ5ALHUQK4RO","json":"https://pith.science/pith/GBDMULTRTLRJYFPZ5ALHUQK4RO.json","graph_json":"https://pith.science/api/pith-number/GBDMULTRTLRJYFPZ5ALHUQK4RO/graph.json","events_json":"https://pith.science/api/pith-number/GBDMULTRTLRJYFPZ5ALHUQK4RO/events.json","paper":"https://pith.science/paper/GBDMULTR"},"agent_actions":{"view_html":"https://pith.science/pith/GBDMULTRTLRJYFPZ5ALHUQK4RO","download_json":"https://pith.science/pith/GBDMULTRTLRJYFPZ5ALHUQK4RO.json","view_paper":"https://pith.science/paper/GBDMULTR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.08850&json=true","fetch_graph":"https://pith.science/api/pith-number/GBDMULTRTLRJYFPZ5ALHUQK4RO/graph.json","fetch_events":"https://pith.science/api/pith-number/GBDMULTRTLRJYFPZ5ALHUQK4RO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GBDMULTRTLRJYFPZ5ALHUQK4RO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GBDMULTRTLRJYFPZ5ALHUQK4RO/action/storage_attestation","attest_author":"https://pith.science/pith/GBDMULTRTLRJYFPZ5ALHUQK4RO/action/author_attestation","sign_citation":"https://pith.science/pith/GBDMULTRTLRJYFPZ5ALHUQK4RO/action/citation_signature","submit_replication":"https://pith.science/pith/GBDMULTRTLRJYFPZ5ALHUQK4RO/action/replication_record"}},"created_at":"2026-05-18T00:56:30.108038+00:00","updated_at":"2026-05-18T00:56:30.108038+00:00"}