{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:4CX7PHYRNDUXBAMKQHGYW3KGPK","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":"bf50128601d081f6fdc54b60e5a825857b93d06be5144c3917c2ade0ce0cb8d4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-11-28T19:44:53Z","title_canon_sha256":"6eb439d27f3fa8c2c89982d119896f8698b56c99bcda62e3d7f89cfceb779cc3"},"schema_version":"1.0","source":{"id":"1311.7407","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.7407","created_at":"2026-05-18T00:49:08Z"},{"alias_kind":"arxiv_version","alias_value":"1311.7407v1","created_at":"2026-05-18T00:49:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.7407","created_at":"2026-05-18T00:49:08Z"},{"alias_kind":"pith_short_12","alias_value":"4CX7PHYRNDUX","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"4CX7PHYRNDUXBAMK","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"4CX7PHYR","created_at":"2026-05-18T12:27:32Z"}],"graph_snapshots":[{"event_id":"sha256:043ba912e9419b338cfd8f206736dd9bfa9971585f327a3256239d18a0cd8607","target":"graph","created_at":"2026-05-18T00:49:08Z","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":"We prove improved inapproximability results for hypergraph coloring using the low-degree polynomial code (aka, the 'short code' of Barak et. al. [FOCS 2012]) and the techniques proposed by Dinur and Guruswami [FOCS 2013] to incorporate this code for inapproximability results. In particular, we prove quasi-NP-hardness of the following problems on $n$-vertex hyper-graphs:\n  * Coloring a 2-colorable 8-uniform hypergraph with $2^{2^{\\Omega(\\sqrt{\\log\\log n})}}$ colors.\n  * Coloring a 4-colorable 4-uniform hypergraph with $2^{2^{\\Omega(\\sqrt{\\log\\log n})}}$ colors.\n  * Coloring a 3-colorable 3-unif","authors_text":"Girish Varma, Johan Hastad, Prahladh Harsha, Srikanth Srinivasan, Venkatesan Guruswami","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-11-28T19:44:53Z","title":"Super-polylogarithmic hypergraph coloring hardness via low-degree long codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.7407","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:20f61e5dca3744dbccac130262bfcfb79716c80436ee24978cc7a0f049da426a","target":"record","created_at":"2026-05-18T00:49:08Z","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":"bf50128601d081f6fdc54b60e5a825857b93d06be5144c3917c2ade0ce0cb8d4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-11-28T19:44:53Z","title_canon_sha256":"6eb439d27f3fa8c2c89982d119896f8698b56c99bcda62e3d7f89cfceb779cc3"},"schema_version":"1.0","source":{"id":"1311.7407","kind":"arxiv","version":1}},"canonical_sha256":"e0aff79f1168e970818a81cd8b6d467aaae90c02e178dfe4ef8d2df72d543200","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e0aff79f1168e970818a81cd8b6d467aaae90c02e178dfe4ef8d2df72d543200","first_computed_at":"2026-05-18T00:49:08.807019Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:49:08.807019Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pHWoGUGCqdMm/rYwoXbtNTyzKryPE94utnYC5ufVd3U7Ll6x/mC0zqd5GaNF2XeIJ8sLg+beDDNuCGoEFOxrDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:49:08.807547Z","signed_message":"canonical_sha256_bytes"},"source_id":"1311.7407","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:20f61e5dca3744dbccac130262bfcfb79716c80436ee24978cc7a0f049da426a","sha256:043ba912e9419b338cfd8f206736dd9bfa9971585f327a3256239d18a0cd8607"],"state_sha256":"7ec62136f2b5ea1b09cb4d83d21074290009683483a439bbda7adbbf442cab26"}