{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:4BU7VILBFOGMJLUOQL756IQVDZ","short_pith_number":"pith:4BU7VILB","canonical_record":{"source":{"id":"1504.03923","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-04-15T14:12:58Z","cross_cats_sorted":[],"title_canon_sha256":"cf239de6cd8d708274e372b8be0012cf64a162669ab5f21d825af14443008c0d","abstract_canon_sha256":"2d87aacf36217e25fbfc40adcee8ec8f315e040a1b1d355c8d206507e938d678"},"schema_version":"1.0"},"canonical_sha256":"e069faa1612b8cc4ae8e82ffdf22151e686d3af19dfafa37deba67a0f650136c","source":{"kind":"arxiv","id":"1504.03923","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.03923","created_at":"2026-05-18T01:30:15Z"},{"alias_kind":"arxiv_version","alias_value":"1504.03923v3","created_at":"2026-05-18T01:30:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.03923","created_at":"2026-05-18T01:30:15Z"},{"alias_kind":"pith_short_12","alias_value":"4BU7VILBFOGM","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"4BU7VILBFOGMJLUO","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"4BU7VILB","created_at":"2026-05-18T12:29:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:4BU7VILBFOGMJLUOQL756IQVDZ","target":"record","payload":{"canonical_record":{"source":{"id":"1504.03923","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-04-15T14:12:58Z","cross_cats_sorted":[],"title_canon_sha256":"cf239de6cd8d708274e372b8be0012cf64a162669ab5f21d825af14443008c0d","abstract_canon_sha256":"2d87aacf36217e25fbfc40adcee8ec8f315e040a1b1d355c8d206507e938d678"},"schema_version":"1.0"},"canonical_sha256":"e069faa1612b8cc4ae8e82ffdf22151e686d3af19dfafa37deba67a0f650136c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:30:15.216007Z","signature_b64":"Wz76ZbhIxshTCvQbevLKZ77lenVstR2VhStegylWXBl7VyKYZsRJ1fPEkOwcibiNcy2Xb+tKu483+st9c1+4Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e069faa1612b8cc4ae8e82ffdf22151e686d3af19dfafa37deba67a0f650136c","last_reissued_at":"2026-05-18T01:30:15.215474Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:30:15.215474Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1504.03923","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-18T01:30:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nlts+DUXi/xE8BtPG3McWq/JmbkLJw3MZuT/JnEJe9ZpzZHW/ddMaYIioE9MDgtq1Hglxhl8mkfXwnc8iPmYBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T09:36:08.234280Z"},"content_sha256":"733fbf2cb9ff5132a86cec81af11f2ecf8bb86dbe71cb4da9bf252db6741e79b","schema_version":"1.0","event_id":"sha256:733fbf2cb9ff5132a86cec81af11f2ecf8bb86dbe71cb4da9bf252db6741e79b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:4BU7VILBFOGMJLUOQL756IQVDZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"$2^{(\\log N)^{1/10-o(1)}}$ Hardness for Hypergraph Coloring","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Sangxia Huang","submitted_at":"2015-04-15T14:12:58Z","abstract_excerpt":"We show that it is quasi-NP-hard to color 2-colorable 8-uniform hypergraphs with $2^{(\\log N)^{1/10-o(1)}}$ colors, where $N$ is the number of vertices. There has been much focus on hardness of hypergraph coloring recently. Guruswami, H{\\aa}stad, Harsha, Srinivasan and Varma showed that it is quasi-NP-hard to color 2-colorable 8-uniform hypergraphs with $2^{2^{\\Omega(\\sqrt{\\log\\log N})}}$ colors. Their result is obtained by composing standard Label Cover with an inner-verifier based on Low Degree Long Code, using Reed-Muller code testing results by Dinur and Guruswami. Using a different approa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.03923","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-18T01:30:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6KcoxTEk72YkobEw/nA9JYpqvdIWLaCensDaVCsOffAjOicigQPS4FKlIeLABi8wU+2kipwBTY9pocqUkd8WDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T09:36:08.235048Z"},"content_sha256":"1f4bae151e0bc4e8358b9e3e1f5143b510e1c1da51126978c90caab5553ccba9","schema_version":"1.0","event_id":"sha256:1f4bae151e0bc4e8358b9e3e1f5143b510e1c1da51126978c90caab5553ccba9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4BU7VILBFOGMJLUOQL756IQVDZ/bundle.json","state_url":"https://pith.science/pith/4BU7VILBFOGMJLUOQL756IQVDZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4BU7VILBFOGMJLUOQL756IQVDZ/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-06-10T09:36:08Z","links":{"resolver":"https://pith.science/pith/4BU7VILBFOGMJLUOQL756IQVDZ","bundle":"https://pith.science/pith/4BU7VILBFOGMJLUOQL756IQVDZ/bundle.json","state":"https://pith.science/pith/4BU7VILBFOGMJLUOQL756IQVDZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4BU7VILBFOGMJLUOQL756IQVDZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:4BU7VILBFOGMJLUOQL756IQVDZ","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":"2d87aacf36217e25fbfc40adcee8ec8f315e040a1b1d355c8d206507e938d678","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-04-15T14:12:58Z","title_canon_sha256":"cf239de6cd8d708274e372b8be0012cf64a162669ab5f21d825af14443008c0d"},"schema_version":"1.0","source":{"id":"1504.03923","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.03923","created_at":"2026-05-18T01:30:15Z"},{"alias_kind":"arxiv_version","alias_value":"1504.03923v3","created_at":"2026-05-18T01:30:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.03923","created_at":"2026-05-18T01:30:15Z"},{"alias_kind":"pith_short_12","alias_value":"4BU7VILBFOGM","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"4BU7VILBFOGMJLUO","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"4BU7VILB","created_at":"2026-05-18T12:29:05Z"}],"graph_snapshots":[{"event_id":"sha256:1f4bae151e0bc4e8358b9e3e1f5143b510e1c1da51126978c90caab5553ccba9","target":"graph","created_at":"2026-05-18T01:30:15Z","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 show that it is quasi-NP-hard to color 2-colorable 8-uniform hypergraphs with $2^{(\\log N)^{1/10-o(1)}}$ colors, where $N$ is the number of vertices. There has been much focus on hardness of hypergraph coloring recently. Guruswami, H{\\aa}stad, Harsha, Srinivasan and Varma showed that it is quasi-NP-hard to color 2-colorable 8-uniform hypergraphs with $2^{2^{\\Omega(\\sqrt{\\log\\log N})}}$ colors. Their result is obtained by composing standard Label Cover with an inner-verifier based on Low Degree Long Code, using Reed-Muller code testing results by Dinur and Guruswami. Using a different approa","authors_text":"Sangxia Huang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-04-15T14:12:58Z","title":"$2^{(\\log N)^{1/10-o(1)}}$ Hardness for Hypergraph Coloring"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.03923","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:733fbf2cb9ff5132a86cec81af11f2ecf8bb86dbe71cb4da9bf252db6741e79b","target":"record","created_at":"2026-05-18T01:30:15Z","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":"2d87aacf36217e25fbfc40adcee8ec8f315e040a1b1d355c8d206507e938d678","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-04-15T14:12:58Z","title_canon_sha256":"cf239de6cd8d708274e372b8be0012cf64a162669ab5f21d825af14443008c0d"},"schema_version":"1.0","source":{"id":"1504.03923","kind":"arxiv","version":3}},"canonical_sha256":"e069faa1612b8cc4ae8e82ffdf22151e686d3af19dfafa37deba67a0f650136c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e069faa1612b8cc4ae8e82ffdf22151e686d3af19dfafa37deba67a0f650136c","first_computed_at":"2026-05-18T01:30:15.215474Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:30:15.215474Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Wz76ZbhIxshTCvQbevLKZ77lenVstR2VhStegylWXBl7VyKYZsRJ1fPEkOwcibiNcy2Xb+tKu483+st9c1+4Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:30:15.216007Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.03923","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:733fbf2cb9ff5132a86cec81af11f2ecf8bb86dbe71cb4da9bf252db6741e79b","sha256:1f4bae151e0bc4e8358b9e3e1f5143b510e1c1da51126978c90caab5553ccba9"],"state_sha256":"b5f5d66d63eca5e8ee6286c33d2415f7cd04608f99f0fc335c80b754f71990f0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+++z1Xuu5Xr8xLmzQidkAB8W5RiCes+W/tGgs9Xf9rboXPFy4lzwgPSsqQDO2unZkCcRSxwBIcTdqJMdz3C7Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T09:36:08.239338Z","bundle_sha256":"df194964c9335f69a92d73e64e7acc1e460009ccf1467296a344de223d37c4fd"}}