{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:CO6OYPBLYOC27TNUNQXE6UU2S6","short_pith_number":"pith:CO6OYPBL","schema_version":"1.0","canonical_sha256":"13bcec3c2bc385afcdb46c2e4f529a97adef0e8d03b0d802393d95dd9b96080a","source":{"kind":"arxiv","id":"1308.3247","version":2},"attestation_state":"computed","paper":{"title":"Hardness of Finding Independent Sets in 2-Colorable and Almost 2-Colorable Hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Rishi Saket, Subhash Khot","submitted_at":"2013-08-14T20:34:05Z","abstract_excerpt":"This work studies the hardness of finding independent sets in hypergraphs which are either 2-colorable or are almost 2-colorable, i.e. can be 2-colored after removing a small fraction of vertices and the incident hyperedges. To be precise, say that a hypergraph is (1-eps)-almost 2-colorable if removing an eps fraction of its vertices and all hyperedges incident on them makes the remaining hypergraph 2-colorable. In particular we prove the following results.\n  For an arbitrarily small constant gamma > 0, there is a constant xi > 0, such that, given a 4-uniform hypergraph on n vertices which is "},"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":"1308.3247","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-08-14T20:34:05Z","cross_cats_sorted":[],"title_canon_sha256":"f81b5691fd8b9c1a51ec96b1d846250fb87248d5ca9738425791f63b5128ebb8","abstract_canon_sha256":"99e0ee632edd129a2bad5849b846db8452e0d26e659024a0d292e16acd070957"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:11:12.649840Z","signature_b64":"W+5/poE/1qaisR6u97pWo1aEfZhajMYwJO0EdFcacP0VGVzclA0qdAcXpnNjRLRFDRo3imTkrjDzHsr8NXC8AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"13bcec3c2bc385afcdb46c2e4f529a97adef0e8d03b0d802393d95dd9b96080a","last_reissued_at":"2026-05-18T03:11:12.649269Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:11:12.649269Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hardness of Finding Independent Sets in 2-Colorable and Almost 2-Colorable Hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Rishi Saket, Subhash Khot","submitted_at":"2013-08-14T20:34:05Z","abstract_excerpt":"This work studies the hardness of finding independent sets in hypergraphs which are either 2-colorable or are almost 2-colorable, i.e. can be 2-colored after removing a small fraction of vertices and the incident hyperedges. To be precise, say that a hypergraph is (1-eps)-almost 2-colorable if removing an eps fraction of its vertices and all hyperedges incident on them makes the remaining hypergraph 2-colorable. In particular we prove the following results.\n  For an arbitrarily small constant gamma > 0, there is a constant xi > 0, such that, given a 4-uniform hypergraph on n vertices which is "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.3247","kind":"arxiv","version":2},"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":"1308.3247","created_at":"2026-05-18T03:11:12.649355+00:00"},{"alias_kind":"arxiv_version","alias_value":"1308.3247v2","created_at":"2026-05-18T03:11:12.649355+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.3247","created_at":"2026-05-18T03:11:12.649355+00:00"},{"alias_kind":"pith_short_12","alias_value":"CO6OYPBLYOC2","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_16","alias_value":"CO6OYPBLYOC27TNU","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_8","alias_value":"CO6OYPBL","created_at":"2026-05-18T12:27:40.988391+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/CO6OYPBLYOC27TNUNQXE6UU2S6","json":"https://pith.science/pith/CO6OYPBLYOC27TNUNQXE6UU2S6.json","graph_json":"https://pith.science/api/pith-number/CO6OYPBLYOC27TNUNQXE6UU2S6/graph.json","events_json":"https://pith.science/api/pith-number/CO6OYPBLYOC27TNUNQXE6UU2S6/events.json","paper":"https://pith.science/paper/CO6OYPBL"},"agent_actions":{"view_html":"https://pith.science/pith/CO6OYPBLYOC27TNUNQXE6UU2S6","download_json":"https://pith.science/pith/CO6OYPBLYOC27TNUNQXE6UU2S6.json","view_paper":"https://pith.science/paper/CO6OYPBL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1308.3247&json=true","fetch_graph":"https://pith.science/api/pith-number/CO6OYPBLYOC27TNUNQXE6UU2S6/graph.json","fetch_events":"https://pith.science/api/pith-number/CO6OYPBLYOC27TNUNQXE6UU2S6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CO6OYPBLYOC27TNUNQXE6UU2S6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CO6OYPBLYOC27TNUNQXE6UU2S6/action/storage_attestation","attest_author":"https://pith.science/pith/CO6OYPBLYOC27TNUNQXE6UU2S6/action/author_attestation","sign_citation":"https://pith.science/pith/CO6OYPBLYOC27TNUNQXE6UU2S6/action/citation_signature","submit_replication":"https://pith.science/pith/CO6OYPBLYOC27TNUNQXE6UU2S6/action/replication_record"}},"created_at":"2026-05-18T03:11:12.649355+00:00","updated_at":"2026-05-18T03:11:12.649355+00:00"}