{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:N4KJV73XHC3EIBVD5PAZDUOURJ","short_pith_number":"pith:N4KJV73X","schema_version":"1.0","canonical_sha256":"6f149aff7738b64406a3ebc191d1d48a73994c8f3e3faff25ff2fab487d8de13","source":{"kind":"arxiv","id":"1904.01163","version":1},"attestation_state":"computed","paper":{"title":"Simplified inpproximability of hypergraph coloring via t-agreeing families","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":"2019-04-02T01:31:59Z","abstract_excerpt":"We reprove the results on the hardness of approximating hypergraph coloring using a different technique based on bounds on the size of extremal $t$-agreeing families of $[q]^n$. Specifically, using theorems of Frankl-Tokushige [FT99], Ahlswede-Khachatrian [AK98] and Frankl [F76] on the size of such families, we give simple and unified proofs of quasi NP-hardness of the following problems:\n  $\\bullet$ coloring a $3$ colorable $4$-uniform hypergraph with $(\\log n)^\\delta$ many colors\n  $\\bullet$ coloring a $3$ colorable $3$-uniform hypergraph with $\\tilde{O}(\\sqrt{\\log \\log n})$ many colors\n  $\\"},"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":"1904.01163","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-04-02T01:31:59Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"35d980756b345ad7f22600cf1df30128aebb7b2b28d42b83c4bda4ed6e09f725","abstract_canon_sha256":"d00173b4a9e3e753651bb259dd8185ed7918336914a07128201def3dbda43ac0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:49:35.721064Z","signature_b64":"0ZbWW8BPEvJ+QM5ITEOA9Sa9j/jbT+YpT1oauD29BABjgXYwjX5d5j75rWBLnKLMaDFTEQq7hI/ddHVJbQMjBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6f149aff7738b64406a3ebc191d1d48a73994c8f3e3faff25ff2fab487d8de13","last_reissued_at":"2026-05-17T23:49:35.720587Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:49:35.720587Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Simplified inpproximability of hypergraph coloring via t-agreeing families","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":"2019-04-02T01:31:59Z","abstract_excerpt":"We reprove the results on the hardness of approximating hypergraph coloring using a different technique based on bounds on the size of extremal $t$-agreeing families of $[q]^n$. Specifically, using theorems of Frankl-Tokushige [FT99], Ahlswede-Khachatrian [AK98] and Frankl [F76] on the size of such families, we give simple and unified proofs of quasi NP-hardness of the following problems:\n  $\\bullet$ coloring a $3$ colorable $4$-uniform hypergraph with $(\\log n)^\\delta$ many colors\n  $\\bullet$ coloring a $3$ colorable $3$-uniform hypergraph with $\\tilde{O}(\\sqrt{\\log \\log n})$ many colors\n  $\\"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.01163","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":"1904.01163","created_at":"2026-05-17T23:49:35.720668+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.01163v1","created_at":"2026-05-17T23:49:35.720668+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.01163","created_at":"2026-05-17T23:49:35.720668+00:00"},{"alias_kind":"pith_short_12","alias_value":"N4KJV73XHC3E","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_16","alias_value":"N4KJV73XHC3EIBVD","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_8","alias_value":"N4KJV73X","created_at":"2026-05-18T12:33:24.271573+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/N4KJV73XHC3EIBVD5PAZDUOURJ","json":"https://pith.science/pith/N4KJV73XHC3EIBVD5PAZDUOURJ.json","graph_json":"https://pith.science/api/pith-number/N4KJV73XHC3EIBVD5PAZDUOURJ/graph.json","events_json":"https://pith.science/api/pith-number/N4KJV73XHC3EIBVD5PAZDUOURJ/events.json","paper":"https://pith.science/paper/N4KJV73X"},"agent_actions":{"view_html":"https://pith.science/pith/N4KJV73XHC3EIBVD5PAZDUOURJ","download_json":"https://pith.science/pith/N4KJV73XHC3EIBVD5PAZDUOURJ.json","view_paper":"https://pith.science/paper/N4KJV73X","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.01163&json=true","fetch_graph":"https://pith.science/api/pith-number/N4KJV73XHC3EIBVD5PAZDUOURJ/graph.json","fetch_events":"https://pith.science/api/pith-number/N4KJV73XHC3EIBVD5PAZDUOURJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N4KJV73XHC3EIBVD5PAZDUOURJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N4KJV73XHC3EIBVD5PAZDUOURJ/action/storage_attestation","attest_author":"https://pith.science/pith/N4KJV73XHC3EIBVD5PAZDUOURJ/action/author_attestation","sign_citation":"https://pith.science/pith/N4KJV73XHC3EIBVD5PAZDUOURJ/action/citation_signature","submit_replication":"https://pith.science/pith/N4KJV73XHC3EIBVD5PAZDUOURJ/action/replication_record"}},"created_at":"2026-05-17T23:49:35.720668+00:00","updated_at":"2026-05-17T23:49:35.720668+00:00"}