{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:4CX7PHYRNDUXBAMKQHGYW3KGPK","short_pith_number":"pith:4CX7PHYR","schema_version":"1.0","canonical_sha256":"e0aff79f1168e970818a81cd8b6d467aaae90c02e178dfe4ef8d2df72d543200","source":{"kind":"arxiv","id":"1311.7407","version":1},"attestation_state":"computed","paper":{"title":"Super-polylogarithmic hypergraph coloring hardness via low-degree long codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Girish Varma, Johan Hastad, Prahladh Harsha, Srikanth Srinivasan, Venkatesan Guruswami","submitted_at":"2013-11-28T19:44:53Z","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"},"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":"1311.7407","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-11-28T19:44:53Z","cross_cats_sorted":[],"title_canon_sha256":"6eb439d27f3fa8c2c89982d119896f8698b56c99bcda62e3d7f89cfceb779cc3","abstract_canon_sha256":"bf50128601d081f6fdc54b60e5a825857b93d06be5144c3917c2ade0ce0cb8d4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:49:08.807547Z","signature_b64":"pHWoGUGCqdMm/rYwoXbtNTyzKryPE94utnYC5ufVd3U7Ll6x/mC0zqd5GaNF2XeIJ8sLg+beDDNuCGoEFOxrDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e0aff79f1168e970818a81cd8b6d467aaae90c02e178dfe4ef8d2df72d543200","last_reissued_at":"2026-05-18T00:49:08.807019Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:49:08.807019Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Super-polylogarithmic hypergraph coloring hardness via low-degree long codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Girish Varma, Johan Hastad, Prahladh Harsha, Srikanth Srinivasan, Venkatesan Guruswami","submitted_at":"2013-11-28T19:44:53Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.7407","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":"1311.7407","created_at":"2026-05-18T00:49:08.807097+00:00"},{"alias_kind":"arxiv_version","alias_value":"1311.7407v1","created_at":"2026-05-18T00:49:08.807097+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.7407","created_at":"2026-05-18T00:49:08.807097+00:00"},{"alias_kind":"pith_short_12","alias_value":"4CX7PHYRNDUX","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_16","alias_value":"4CX7PHYRNDUXBAMK","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_8","alias_value":"4CX7PHYR","created_at":"2026-05-18T12:27:32.513160+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/4CX7PHYRNDUXBAMKQHGYW3KGPK","json":"https://pith.science/pith/4CX7PHYRNDUXBAMKQHGYW3KGPK.json","graph_json":"https://pith.science/api/pith-number/4CX7PHYRNDUXBAMKQHGYW3KGPK/graph.json","events_json":"https://pith.science/api/pith-number/4CX7PHYRNDUXBAMKQHGYW3KGPK/events.json","paper":"https://pith.science/paper/4CX7PHYR"},"agent_actions":{"view_html":"https://pith.science/pith/4CX7PHYRNDUXBAMKQHGYW3KGPK","download_json":"https://pith.science/pith/4CX7PHYRNDUXBAMKQHGYW3KGPK.json","view_paper":"https://pith.science/paper/4CX7PHYR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1311.7407&json=true","fetch_graph":"https://pith.science/api/pith-number/4CX7PHYRNDUXBAMKQHGYW3KGPK/graph.json","fetch_events":"https://pith.science/api/pith-number/4CX7PHYRNDUXBAMKQHGYW3KGPK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4CX7PHYRNDUXBAMKQHGYW3KGPK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4CX7PHYRNDUXBAMKQHGYW3KGPK/action/storage_attestation","attest_author":"https://pith.science/pith/4CX7PHYRNDUXBAMKQHGYW3KGPK/action/author_attestation","sign_citation":"https://pith.science/pith/4CX7PHYRNDUXBAMKQHGYW3KGPK/action/citation_signature","submit_replication":"https://pith.science/pith/4CX7PHYRNDUXBAMKQHGYW3KGPK/action/replication_record"}},"created_at":"2026-05-18T00:49:08.807097+00:00","updated_at":"2026-05-18T00:49:08.807097+00:00"}