{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:N4KJV73XHC3EIBVD5PAZDUOURJ","short_pith_number":"pith:N4KJV73X","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"},"canonical_sha256":"6f149aff7738b64406a3ebc191d1d48a73994c8f3e3faff25ff2fab487d8de13","source":{"kind":"arxiv","id":"1904.01163","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.01163","created_at":"2026-05-17T23:49:35Z"},{"alias_kind":"arxiv_version","alias_value":"1904.01163v1","created_at":"2026-05-17T23:49:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.01163","created_at":"2026-05-17T23:49:35Z"},{"alias_kind":"pith_short_12","alias_value":"N4KJV73XHC3E","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"N4KJV73XHC3EIBVD","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"N4KJV73X","created_at":"2026-05-18T12:33:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:N4KJV73XHC3EIBVD5PAZDUOURJ","target":"record","payload":{"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"},"canonical_sha256":"6f149aff7738b64406a3ebc191d1d48a73994c8f3e3faff25ff2fab487d8de13","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"},"source_kind":"arxiv","source_id":"1904.01163","source_version":1,"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-17T23:49:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fXfiy8LCZ84fVSgcnu+iycDSw3T4JGlniy/GSdQr47410j9x5dOFDsSrZ3AvE5rJcEykxUqkkTuHt9OdlBduCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T03:28:07.867182Z"},"content_sha256":"04b3e9580b352dee9e3897c0605771422860c9343b11004ceae6733d4646dc5f","schema_version":"1.0","event_id":"sha256:04b3e9580b352dee9e3897c0605771422860c9343b11004ceae6733d4646dc5f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:N4KJV73XHC3EIBVD5PAZDUOURJ","target":"graph","payload":{"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"},"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-17T23:49:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5AnfmlhKw6TbhJA3sW8j7RDrBt56TJjQpVk2vUbapAy3ghDo4MrTK1j/w92anYbU8i5efSxVC4ufUDNVKDVsBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T03:28:07.867549Z"},"content_sha256":"df0d4bb3b4571f526123da2d6cb64afb137b6c3350f99177f30c7c7f051fa0b9","schema_version":"1.0","event_id":"sha256:df0d4bb3b4571f526123da2d6cb64afb137b6c3350f99177f30c7c7f051fa0b9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/N4KJV73XHC3EIBVD5PAZDUOURJ/bundle.json","state_url":"https://pith.science/pith/N4KJV73XHC3EIBVD5PAZDUOURJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/N4KJV73XHC3EIBVD5PAZDUOURJ/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-28T03:28:07Z","links":{"resolver":"https://pith.science/pith/N4KJV73XHC3EIBVD5PAZDUOURJ","bundle":"https://pith.science/pith/N4KJV73XHC3EIBVD5PAZDUOURJ/bundle.json","state":"https://pith.science/pith/N4KJV73XHC3EIBVD5PAZDUOURJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/N4KJV73XHC3EIBVD5PAZDUOURJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:N4KJV73XHC3EIBVD5PAZDUOURJ","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":"d00173b4a9e3e753651bb259dd8185ed7918336914a07128201def3dbda43ac0","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-04-02T01:31:59Z","title_canon_sha256":"35d980756b345ad7f22600cf1df30128aebb7b2b28d42b83c4bda4ed6e09f725"},"schema_version":"1.0","source":{"id":"1904.01163","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.01163","created_at":"2026-05-17T23:49:35Z"},{"alias_kind":"arxiv_version","alias_value":"1904.01163v1","created_at":"2026-05-17T23:49:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.01163","created_at":"2026-05-17T23:49:35Z"},{"alias_kind":"pith_short_12","alias_value":"N4KJV73XHC3E","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"N4KJV73XHC3EIBVD","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"N4KJV73X","created_at":"2026-05-18T12:33:24Z"}],"graph_snapshots":[{"event_id":"sha256:df0d4bb3b4571f526123da2d6cb64afb137b6c3350f99177f30c7c7f051fa0b9","target":"graph","created_at":"2026-05-17T23:49:35Z","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 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  $\\","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":"2019-04-02T01:31:59Z","title":"Simplified inpproximability of hypergraph coloring via t-agreeing families"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.01163","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:04b3e9580b352dee9e3897c0605771422860c9343b11004ceae6733d4646dc5f","target":"record","created_at":"2026-05-17T23:49:35Z","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":"d00173b4a9e3e753651bb259dd8185ed7918336914a07128201def3dbda43ac0","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-04-02T01:31:59Z","title_canon_sha256":"35d980756b345ad7f22600cf1df30128aebb7b2b28d42b83c4bda4ed6e09f725"},"schema_version":"1.0","source":{"id":"1904.01163","kind":"arxiv","version":1}},"canonical_sha256":"6f149aff7738b64406a3ebc191d1d48a73994c8f3e3faff25ff2fab487d8de13","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6f149aff7738b64406a3ebc191d1d48a73994c8f3e3faff25ff2fab487d8de13","first_computed_at":"2026-05-17T23:49:35.720587Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:49:35.720587Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0ZbWW8BPEvJ+QM5ITEOA9Sa9j/jbT+YpT1oauD29BABjgXYwjX5d5j75rWBLnKLMaDFTEQq7hI/ddHVJbQMjBw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:49:35.721064Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.01163","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:04b3e9580b352dee9e3897c0605771422860c9343b11004ceae6733d4646dc5f","sha256:df0d4bb3b4571f526123da2d6cb64afb137b6c3350f99177f30c7c7f051fa0b9"],"state_sha256":"ee121bd78ea811af6852ea21f9d42aee74db8567364634addc38454ae35b8b8a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AktUnbiNdb2XWUs+f8Kp1pYMnlzu1eW0bnaWESXPXiRDsK04HgUASSQltvfCxaXRPAK+8Gfp6LLiXsrYIm5dCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T03:28:07.869565Z","bundle_sha256":"edd994b21041f26182a2425e7696e34dcb56e299d01c4dcb034d5f3a906708f1"}}