{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:BRZJ4AL2EBGNT4NQSFUZCMFQCH","short_pith_number":"pith:BRZJ4AL2","canonical_record":{"source":{"id":"1810.02784","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-10-05T16:39:43Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"e2634ceb2a466c72332af79236d2a389e08f41dc14eca9472a5f41ebdc5b7b83","abstract_canon_sha256":"67a7744507286d10adf5c3928106cac961fd77d970799db81aca3b1ef176e4b6"},"schema_version":"1.0"},"canonical_sha256":"0c729e017a204cd9f1b091699130b011e2fd5ad2b921fd89097e0518cf6be065","source":{"kind":"arxiv","id":"1810.02784","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:BRZJ4AL2EBGNT4NQSFUZCMFQCH","target":"record","payload":{"canonical_record":{"source":{"id":"1810.02784","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-10-05T16:39:43Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"e2634ceb2a466c72332af79236d2a389e08f41dc14eca9472a5f41ebdc5b7b83","abstract_canon_sha256":"67a7744507286d10adf5c3928106cac961fd77d970799db81aca3b1ef176e4b6"},"schema_version":"1.0"},"canonical_sha256":"0c729e017a204cd9f1b091699130b011e2fd5ad2b921fd89097e0518cf6be065","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:37.632261Z","signature_b64":"YlGdUkklVhuxYgnkvkJn85KfRLQ2QFrBXsX7YSPOlSVL6Xt71G6k/2Zorl1zsmu1CkMAicJ1fCEuvPDSRlC0AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0c729e017a204cd9f1b091699130b011e2fd5ad2b921fd89097e0518cf6be065","last_reissued_at":"2026-05-18T00:01:37.631713Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:37.631713Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.02784","source_version":3,"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:01:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Cnc8wDDnLk5J5keE7U3ry1jzj0eXtpqgcoJXKXt3/LywMEScqGeQYmJx/19YMzqzDINH2ETEwy1lkIQhoS23CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T11:35:15.756338Z"},"content_sha256":"e4fbd79d20efdb21a8bba78ead599759bdafe7b81de3843c928589c46abe76c1","schema_version":"1.0","event_id":"sha256:e4fbd79d20efdb21a8bba78ead599759bdafe7b81de3843c928589c46abe76c1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:BRZJ4AL2EBGNT4NQSFUZCMFQCH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improved Inapproximability of Rainbow Coloring","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.CC","authors_text":"Aditya Potukuchi, Amey Bhangale, Per Austrin","submitted_at":"2018-10-05T16:39:43Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.02784","kind":"arxiv","version":3},"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:01:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qa5sSW4QuIoar60d6W3dIs98xYzNWVfK4wPIpR4nxQ/o+k6bxV+V0rg48QO8fa6saVUhIYQFWq82dD4TfSAEDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T11:35:15.756685Z"},"content_sha256":"877fb348efd7425f1a30fcc4fee7378e8fa972b820309b5424696f3c07ee6ab2","schema_version":"1.0","event_id":"sha256:877fb348efd7425f1a30fcc4fee7378e8fa972b820309b5424696f3c07ee6ab2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BRZJ4AL2EBGNT4NQSFUZCMFQCH/bundle.json","state_url":"https://pith.science/pith/BRZJ4AL2EBGNT4NQSFUZCMFQCH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BRZJ4AL2EBGNT4NQSFUZCMFQCH/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-05-28T11:35:15Z","links":{"resolver":"https://pith.science/pith/BRZJ4AL2EBGNT4NQSFUZCMFQCH","bundle":"https://pith.science/pith/BRZJ4AL2EBGNT4NQSFUZCMFQCH/bundle.json","state":"https://pith.science/pith/BRZJ4AL2EBGNT4NQSFUZCMFQCH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BRZJ4AL2EBGNT4NQSFUZCMFQCH/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e0tH4BTRMdia160Yyq2RwIEupKxl/qe/zb62MBwjU0Ntg2lR2xKJ5GSx6GOMPDNx/YTMtxEBSIpSZaZLpREaBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T11:35:15.758558Z","bundle_sha256":"a56e26abd72d65f9948369b54c4510a3980d6b50086171637f3b0ee7b725bf4a"}}