{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:BRZJ4AL2EBGNT4NQSFUZCMFQCH","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":"67a7744507286d10adf5c3928106cac961fd77d970799db81aca3b1ef176e4b6","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-10-05T16:39:43Z","title_canon_sha256":"e2634ceb2a466c72332af79236d2a389e08f41dc14eca9472a5f41ebdc5b7b83"},"schema_version":"1.0","source":{"id":"1810.02784","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.02784","created_at":"2026-05-18T00:01:37Z"},{"alias_kind":"arxiv_version","alias_value":"1810.02784v3","created_at":"2026-05-18T00:01:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.02784","created_at":"2026-05-18T00:01:37Z"},{"alias_kind":"pith_short_12","alias_value":"BRZJ4AL2EBGN","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"BRZJ4AL2EBGNT4NQ","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"BRZJ4AL2","created_at":"2026-05-18T12:32:16Z"}],"graph_snapshots":[{"event_id":"sha256:877fb348efd7425f1a30fcc4fee7378e8fa972b820309b5424696f3c07ee6ab2","target":"graph","created_at":"2026-05-18T00:01:37Z","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":"A rainbow $q$-coloring of a $k$-uniform hypergraph is a $q$-coloring of the vertex set such that every hyperedge contains all $q$ colors.\n  We prove that given a rainbow $(k - 2\\lfloor \\sqrt{k}\\rfloor)$-colorable $k$-uniform hypergraph, it is NP-hard to find a normal $2$-coloring. Previously, this was only known for rainbow $\\lfloor k/2 \\rfloor$-colorable hypergraphs (Guruswami and Lee, SODA 2015).\n  We also study a generalization which we call rainbow $(q, p)$-coloring, defined as a coloring using $q$ colors such that every hyperedge contains at least $p$ colors. We prove that given a rainbow","authors_text":"Aditya Potukuchi, Amey Bhangale, Per Austrin","cross_cats":["cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-10-05T16:39:43Z","title":"Improved Inapproximability of Rainbow Coloring"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.02784","kind":"arxiv","version":3},"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:e4fbd79d20efdb21a8bba78ead599759bdafe7b81de3843c928589c46abe76c1","target":"record","created_at":"2026-05-18T00:01:37Z","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":"67a7744507286d10adf5c3928106cac961fd77d970799db81aca3b1ef176e4b6","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-10-05T16:39:43Z","title_canon_sha256":"e2634ceb2a466c72332af79236d2a389e08f41dc14eca9472a5f41ebdc5b7b83"},"schema_version":"1.0","source":{"id":"1810.02784","kind":"arxiv","version":3}},"canonical_sha256":"0c729e017a204cd9f1b091699130b011e2fd5ad2b921fd89097e0518cf6be065","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0c729e017a204cd9f1b091699130b011e2fd5ad2b921fd89097e0518cf6be065","first_computed_at":"2026-05-18T00:01:37.631713Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:01:37.631713Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YlGdUkklVhuxYgnkvkJn85KfRLQ2QFrBXsX7YSPOlSVL6Xt71G6k/2Zorl1zsmu1CkMAicJ1fCEuvPDSRlC0AA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:01:37.632261Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.02784","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e4fbd79d20efdb21a8bba78ead599759bdafe7b81de3843c928589c46abe76c1","sha256:877fb348efd7425f1a30fcc4fee7378e8fa972b820309b5424696f3c07ee6ab2"],"state_sha256":"f9849cf845107c2b780cafbe0c61ded820266772787eb7afaf371d3a8ecc72ea"}