{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:CO6OYPBLYOC27TNUNQXE6UU2S6","short_pith_number":"pith:CO6OYPBL","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"},"canonical_sha256":"13bcec3c2bc385afcdb46c2e4f529a97adef0e8d03b0d802393d95dd9b96080a","source":{"kind":"arxiv","id":"1308.3247","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.3247","created_at":"2026-05-18T03:11:12Z"},{"alias_kind":"arxiv_version","alias_value":"1308.3247v2","created_at":"2026-05-18T03:11:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.3247","created_at":"2026-05-18T03:11:12Z"},{"alias_kind":"pith_short_12","alias_value":"CO6OYPBLYOC2","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"CO6OYPBLYOC27TNU","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"CO6OYPBL","created_at":"2026-05-18T12:27:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:CO6OYPBLYOC27TNUNQXE6UU2S6","target":"record","payload":{"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"},"canonical_sha256":"13bcec3c2bc385afcdb46c2e4f529a97adef0e8d03b0d802393d95dd9b96080a","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"},"source_kind":"arxiv","source_id":"1308.3247","source_version":2,"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-18T03:11:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"65RD88wtVFZqEtlhRtrhoFjunDkF0dat81+72VpfIZpDzRRjgxZlAnlRd+heS/OsxPR1ui29NfyFMd95i39HAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T02:53:21.489273Z"},"content_sha256":"f07668ebfd552667fc53fb3c5adfd1c7e46c3b7c834c99f5fe9c2e59e0edfa24","schema_version":"1.0","event_id":"sha256:f07668ebfd552667fc53fb3c5adfd1c7e46c3b7c834c99f5fe9c2e59e0edfa24"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:CO6OYPBLYOC27TNUNQXE6UU2S6","target":"graph","payload":{"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"},"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-18T03:11:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VF72dF4J/5D0mry1VHdW6oho4hCo4DAuhHTIVgJ6U35oY4nacs4Zo6+UNtFn6qMq9K6DEVWLToylgidv4z/7Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T02:53:21.489956Z"},"content_sha256":"f389a0629498033bbe05e247bb1469112028f5cb830e4a06f9fbd1f872ff33c6","schema_version":"1.0","event_id":"sha256:f389a0629498033bbe05e247bb1469112028f5cb830e4a06f9fbd1f872ff33c6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CO6OYPBLYOC27TNUNQXE6UU2S6/bundle.json","state_url":"https://pith.science/pith/CO6OYPBLYOC27TNUNQXE6UU2S6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CO6OYPBLYOC27TNUNQXE6UU2S6/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-27T02:53:21Z","links":{"resolver":"https://pith.science/pith/CO6OYPBLYOC27TNUNQXE6UU2S6","bundle":"https://pith.science/pith/CO6OYPBLYOC27TNUNQXE6UU2S6/bundle.json","state":"https://pith.science/pith/CO6OYPBLYOC27TNUNQXE6UU2S6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CO6OYPBLYOC27TNUNQXE6UU2S6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:CO6OYPBLYOC27TNUNQXE6UU2S6","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":"99e0ee632edd129a2bad5849b846db8452e0d26e659024a0d292e16acd070957","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-08-14T20:34:05Z","title_canon_sha256":"f81b5691fd8b9c1a51ec96b1d846250fb87248d5ca9738425791f63b5128ebb8"},"schema_version":"1.0","source":{"id":"1308.3247","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.3247","created_at":"2026-05-18T03:11:12Z"},{"alias_kind":"arxiv_version","alias_value":"1308.3247v2","created_at":"2026-05-18T03:11:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.3247","created_at":"2026-05-18T03:11:12Z"},{"alias_kind":"pith_short_12","alias_value":"CO6OYPBLYOC2","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"CO6OYPBLYOC27TNU","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"CO6OYPBL","created_at":"2026-05-18T12:27:40Z"}],"graph_snapshots":[{"event_id":"sha256:f389a0629498033bbe05e247bb1469112028f5cb830e4a06f9fbd1f872ff33c6","target":"graph","created_at":"2026-05-18T03:11:12Z","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":"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 ","authors_text":"Rishi Saket, Subhash Khot","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-08-14T20:34:05Z","title":"Hardness of Finding Independent Sets in 2-Colorable and Almost 2-Colorable Hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.3247","kind":"arxiv","version":2},"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:f07668ebfd552667fc53fb3c5adfd1c7e46c3b7c834c99f5fe9c2e59e0edfa24","target":"record","created_at":"2026-05-18T03:11:12Z","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":"99e0ee632edd129a2bad5849b846db8452e0d26e659024a0d292e16acd070957","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-08-14T20:34:05Z","title_canon_sha256":"f81b5691fd8b9c1a51ec96b1d846250fb87248d5ca9738425791f63b5128ebb8"},"schema_version":"1.0","source":{"id":"1308.3247","kind":"arxiv","version":2}},"canonical_sha256":"13bcec3c2bc385afcdb46c2e4f529a97adef0e8d03b0d802393d95dd9b96080a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"13bcec3c2bc385afcdb46c2e4f529a97adef0e8d03b0d802393d95dd9b96080a","first_computed_at":"2026-05-18T03:11:12.649269Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:11:12.649269Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"W+5/poE/1qaisR6u97pWo1aEfZhajMYwJO0EdFcacP0VGVzclA0qdAcXpnNjRLRFDRo3imTkrjDzHsr8NXC8AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:11:12.649840Z","signed_message":"canonical_sha256_bytes"},"source_id":"1308.3247","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f07668ebfd552667fc53fb3c5adfd1c7e46c3b7c834c99f5fe9c2e59e0edfa24","sha256:f389a0629498033bbe05e247bb1469112028f5cb830e4a06f9fbd1f872ff33c6"],"state_sha256":"a33bfe47b02c7e4f9e93ac1a93ab7d6460d9671f06e283c2713a975894bcac3d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ugrRmpfrE6Vc8o8H6o9UG+nRanO33RFij6dbZv3iYUhdJR2z6uWNSHPD4Tfj1FKX9cswyq4dqGQmw/oj8sqoCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T02:53:21.493261Z","bundle_sha256":"50d257e6e514612c977fed4e41bf84d09c798519357e199c0a8d9c36b5c8ae15"}}