{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:GBDMULTRTLRJYFPZ5ALHUQK4RO","short_pith_number":"pith:GBDMULTR","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"},"canonical_sha256":"3046ca2e719ae29c15f9e8167a415c8ba6bda51a90756aedaf2387b38a3f6039","source":{"kind":"arxiv","id":"1611.08850","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.08850","created_at":"2026-05-18T00:56:30Z"},{"alias_kind":"arxiv_version","alias_value":"1611.08850v1","created_at":"2026-05-18T00:56:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.08850","created_at":"2026-05-18T00:56:30Z"},{"alias_kind":"pith_short_12","alias_value":"GBDMULTRTLRJ","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"GBDMULTRTLRJYFPZ","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"GBDMULTR","created_at":"2026-05-18T12:30:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:GBDMULTRTLRJYFPZ5ALHUQK4RO","target":"record","payload":{"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"},"canonical_sha256":"3046ca2e719ae29c15f9e8167a415c8ba6bda51a90756aedaf2387b38a3f6039","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"},"source_kind":"arxiv","source_id":"1611.08850","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-18T00:56:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ABuBNtFAjHs9GUTOiSpiO46VRodMknuzcmcc6F8H3FkDiLN6YhTrAL1JHz0BtYXmH6wPRXfRpgjqdUlYA/WHAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T02:40:02.267417Z"},"content_sha256":"66be92e908533465f0abddb87e068539a671ccd5cce2ce2b8fd7acf773f37ae8","schema_version":"1.0","event_id":"sha256:66be92e908533465f0abddb87e068539a671ccd5cce2ce2b8fd7acf773f37ae8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:GBDMULTRTLRJYFPZ5ALHUQK4RO","target":"graph","payload":{"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"},"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-18T00:56:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aMOLwdjlKHzBzzTWrxgGpZe/HNlyTx/ubDteJdFomVzzDbft5dngh8s2r6I4ecsEmST4YSujHu1KwWJq7WnCDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T02:40:02.267925Z"},"content_sha256":"e804b33282d4be3d78a05a31463c1eef63cf48ff83087e4c92a0b4cadf159035","schema_version":"1.0","event_id":"sha256:e804b33282d4be3d78a05a31463c1eef63cf48ff83087e4c92a0b4cadf159035"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GBDMULTRTLRJYFPZ5ALHUQK4RO/bundle.json","state_url":"https://pith.science/pith/GBDMULTRTLRJYFPZ5ALHUQK4RO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GBDMULTRTLRJYFPZ5ALHUQK4RO/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-01T02:40:02Z","links":{"resolver":"https://pith.science/pith/GBDMULTRTLRJYFPZ5ALHUQK4RO","bundle":"https://pith.science/pith/GBDMULTRTLRJYFPZ5ALHUQK4RO/bundle.json","state":"https://pith.science/pith/GBDMULTRTLRJYFPZ5ALHUQK4RO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GBDMULTRTLRJYFPZ5ALHUQK4RO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:GBDMULTRTLRJYFPZ5ALHUQK4RO","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":"b22a2251f3ecff9e8de1931b8331ba31c167604529b5f07a842c995393e0be8a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-27T14:18:46Z","title_canon_sha256":"26776e09cc863fb6817cdc0e661233e14a1cc1eb44d64fb686363340fb12da50"},"schema_version":"1.0","source":{"id":"1611.08850","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.08850","created_at":"2026-05-18T00:56:30Z"},{"alias_kind":"arxiv_version","alias_value":"1611.08850v1","created_at":"2026-05-18T00:56:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.08850","created_at":"2026-05-18T00:56:30Z"},{"alias_kind":"pith_short_12","alias_value":"GBDMULTRTLRJ","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"GBDMULTRTLRJYFPZ","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"GBDMULTR","created_at":"2026-05-18T12:30:15Z"}],"graph_snapshots":[{"event_id":"sha256:e804b33282d4be3d78a05a31463c1eef63cf48ff83087e4c92a0b4cadf159035","target":"graph","created_at":"2026-05-18T00:56:30Z","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":"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","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":"2016-11-27T14:18:46Z","title":"Every 4-regular 4-uniform hypergraph has a 2-coloring with a free vertex"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.08850","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:66be92e908533465f0abddb87e068539a671ccd5cce2ce2b8fd7acf773f37ae8","target":"record","created_at":"2026-05-18T00:56:30Z","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":"b22a2251f3ecff9e8de1931b8331ba31c167604529b5f07a842c995393e0be8a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-27T14:18:46Z","title_canon_sha256":"26776e09cc863fb6817cdc0e661233e14a1cc1eb44d64fb686363340fb12da50"},"schema_version":"1.0","source":{"id":"1611.08850","kind":"arxiv","version":1}},"canonical_sha256":"3046ca2e719ae29c15f9e8167a415c8ba6bda51a90756aedaf2387b38a3f6039","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3046ca2e719ae29c15f9e8167a415c8ba6bda51a90756aedaf2387b38a3f6039","first_computed_at":"2026-05-18T00:56:30.107949Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:56:30.107949Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+uyW9bjldvnxc722EmqKAzGThz1mRfX6t7dLASHklerKyA11uZG7gx//VPtHg9tSv1TlHtuZUCV/6phpMr+hAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:56:30.108552Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.08850","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:66be92e908533465f0abddb87e068539a671ccd5cce2ce2b8fd7acf773f37ae8","sha256:e804b33282d4be3d78a05a31463c1eef63cf48ff83087e4c92a0b4cadf159035"],"state_sha256":"48b54036fec7c7961e742f359748cdcb2c6f0c206ee1d4918afce208f1cee8df"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Gyibx8pYZNQxD+qmyw1Su7knYPkjcgyuLq3nkQr3XZFsxXg7xWtWWZ6KYsC19nSxiaFljOMCS8II7eQugC5JDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T02:40:02.270416Z","bundle_sha256":"5c36c723ac3f3a60dfe5494f9ba1032a15ba29731d5e35c7bac805c8f0a75882"}}