{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:62DMJJYBCZ32SYGX6WDDVQ6UPZ","short_pith_number":"pith:62DMJJYB","canonical_record":{"source":{"id":"1312.2915","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-12-10T19:04:24Z","cross_cats_sorted":[],"title_canon_sha256":"9a28e628ea8f68ccd23aa943adab389af922e6213a383a84edec1d3a6e525cc2","abstract_canon_sha256":"2d765e830de9d88a802b9b6f8b1ab11f809ed05b86ed6025e5b8d4bac360e935"},"schema_version":"1.0"},"canonical_sha256":"f686c4a7011677a960d7f5863ac3d47e7e8b6c72c47c542c2d2f187cf9b40cef","source":{"kind":"arxiv","id":"1312.2915","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.2915","created_at":"2026-05-18T03:05:08Z"},{"alias_kind":"arxiv_version","alias_value":"1312.2915v1","created_at":"2026-05-18T03:05:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.2915","created_at":"2026-05-18T03:05:08Z"},{"alias_kind":"pith_short_12","alias_value":"62DMJJYBCZ32","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"62DMJJYBCZ32SYGX","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"62DMJJYB","created_at":"2026-05-18T12:27:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:62DMJJYBCZ32SYGX6WDDVQ6UPZ","target":"record","payload":{"canonical_record":{"source":{"id":"1312.2915","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-12-10T19:04:24Z","cross_cats_sorted":[],"title_canon_sha256":"9a28e628ea8f68ccd23aa943adab389af922e6213a383a84edec1d3a6e525cc2","abstract_canon_sha256":"2d765e830de9d88a802b9b6f8b1ab11f809ed05b86ed6025e5b8d4bac360e935"},"schema_version":"1.0"},"canonical_sha256":"f686c4a7011677a960d7f5863ac3d47e7e8b6c72c47c542c2d2f187cf9b40cef","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:05:08.053511Z","signature_b64":"Rx8wyMRt6rXBijHo5Wua+8+WWHMjJuSn4RftwwQMf7YLEfUmfOa2yGDFQNg5lmuA/VRakSFyyQo7PYoGvkR7Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f686c4a7011677a960d7f5863ac3d47e7e8b6c72c47c542c2d2f187cf9b40cef","last_reissued_at":"2026-05-18T03:05:08.052817Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:05:08.052817Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1312.2915","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-18T03:05:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WuYUT85YxDSEixK1zghX3MlnFEozo2qTBJTEbu38LV3WSdLrmNXVSYwJfcG9w6eJBhuBya5FI3LIo73ypXWoBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T14:37:27.749734Z"},"content_sha256":"a530c2a89fe81297f6117504f33496b919839b4df98925087cd2f4c8fe287b28","schema_version":"1.0","event_id":"sha256:a530c2a89fe81297f6117504f33496b919839b4df98925087cd2f4c8fe287b28"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:62DMJJYBCZ32SYGX6WDDVQ6UPZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Hardness of Finding Independent Sets in 2-Colorable Hypergraphs and of Satisfiable CSPs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Rishi Saket","submitted_at":"2013-12-10T19:04:24Z","abstract_excerpt":"This work revisits the PCP Verifiers used in the works of Hastad [Has01], Guruswami et al.[GHS02], Holmerin[Hol02] and Guruswami[Gur00] for satisfiable Max-E3-SAT and Max-Ek-Set-Splitting, and independent set in 2-colorable 4-uniform hypergraphs. We provide simpler and more efficient PCP Verifiers to prove the following improved hardness results: Assuming that NP\\not\\subseteq DTIME(N^{O(loglog N)}),\n  There is no polynomial time algorithm that, given an n-vertex 2-colorable 4-uniform hypergraph, finds an independent set of n/(log n)^c vertices, for some constant c > 0.\n  There is no polynomial"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.2915","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-18T03:05:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2XAYYjf7BPrKZUWGZhCEkp4PpQiZpxTc4FwHakf/Nj+frt8VOBRM+kP1Ch6WaBqgfmlbxkr7FgagqkbpbZpEBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T14:37:27.750411Z"},"content_sha256":"ba946dd99cfecb384ad31b714e4a2e98bde19e96ea1e58dcf49537a681c79435","schema_version":"1.0","event_id":"sha256:ba946dd99cfecb384ad31b714e4a2e98bde19e96ea1e58dcf49537a681c79435"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/62DMJJYBCZ32SYGX6WDDVQ6UPZ/bundle.json","state_url":"https://pith.science/pith/62DMJJYBCZ32SYGX6WDDVQ6UPZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/62DMJJYBCZ32SYGX6WDDVQ6UPZ/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-26T14:37:27Z","links":{"resolver":"https://pith.science/pith/62DMJJYBCZ32SYGX6WDDVQ6UPZ","bundle":"https://pith.science/pith/62DMJJYBCZ32SYGX6WDDVQ6UPZ/bundle.json","state":"https://pith.science/pith/62DMJJYBCZ32SYGX6WDDVQ6UPZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/62DMJJYBCZ32SYGX6WDDVQ6UPZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:62DMJJYBCZ32SYGX6WDDVQ6UPZ","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":"2d765e830de9d88a802b9b6f8b1ab11f809ed05b86ed6025e5b8d4bac360e935","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-12-10T19:04:24Z","title_canon_sha256":"9a28e628ea8f68ccd23aa943adab389af922e6213a383a84edec1d3a6e525cc2"},"schema_version":"1.0","source":{"id":"1312.2915","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.2915","created_at":"2026-05-18T03:05:08Z"},{"alias_kind":"arxiv_version","alias_value":"1312.2915v1","created_at":"2026-05-18T03:05:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.2915","created_at":"2026-05-18T03:05:08Z"},{"alias_kind":"pith_short_12","alias_value":"62DMJJYBCZ32","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"62DMJJYBCZ32SYGX","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"62DMJJYB","created_at":"2026-05-18T12:27:34Z"}],"graph_snapshots":[{"event_id":"sha256:ba946dd99cfecb384ad31b714e4a2e98bde19e96ea1e58dcf49537a681c79435","target":"graph","created_at":"2026-05-18T03:05:08Z","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 revisits the PCP Verifiers used in the works of Hastad [Has01], Guruswami et al.[GHS02], Holmerin[Hol02] and Guruswami[Gur00] for satisfiable Max-E3-SAT and Max-Ek-Set-Splitting, and independent set in 2-colorable 4-uniform hypergraphs. We provide simpler and more efficient PCP Verifiers to prove the following improved hardness results: Assuming that NP\\not\\subseteq DTIME(N^{O(loglog N)}),\n  There is no polynomial time algorithm that, given an n-vertex 2-colorable 4-uniform hypergraph, finds an independent set of n/(log n)^c vertices, for some constant c > 0.\n  There is no polynomial","authors_text":"Rishi Saket","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-12-10T19:04:24Z","title":"Hardness of Finding Independent Sets in 2-Colorable Hypergraphs and of Satisfiable CSPs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.2915","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:a530c2a89fe81297f6117504f33496b919839b4df98925087cd2f4c8fe287b28","target":"record","created_at":"2026-05-18T03:05:08Z","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":"2d765e830de9d88a802b9b6f8b1ab11f809ed05b86ed6025e5b8d4bac360e935","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-12-10T19:04:24Z","title_canon_sha256":"9a28e628ea8f68ccd23aa943adab389af922e6213a383a84edec1d3a6e525cc2"},"schema_version":"1.0","source":{"id":"1312.2915","kind":"arxiv","version":1}},"canonical_sha256":"f686c4a7011677a960d7f5863ac3d47e7e8b6c72c47c542c2d2f187cf9b40cef","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f686c4a7011677a960d7f5863ac3d47e7e8b6c72c47c542c2d2f187cf9b40cef","first_computed_at":"2026-05-18T03:05:08.052817Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:05:08.052817Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Rx8wyMRt6rXBijHo5Wua+8+WWHMjJuSn4RftwwQMf7YLEfUmfOa2yGDFQNg5lmuA/VRakSFyyQo7PYoGvkR7Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:05:08.053511Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.2915","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a530c2a89fe81297f6117504f33496b919839b4df98925087cd2f4c8fe287b28","sha256:ba946dd99cfecb384ad31b714e4a2e98bde19e96ea1e58dcf49537a681c79435"],"state_sha256":"45956712b24d6f2e783c88cdab39cc23d3db93ed9965a8d67ca8394a44049792"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A+i5rleyaBA9jYdpfj/BWMVCEbsL2tjvDHVXoTfI49JoxtaW7Cu2oqb4+6FDrXrUmQiueYEZBceZkHOFRqsqDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T14:37:27.754623Z","bundle_sha256":"7939d62fce02527efc74f5af397521366f583a60f7e2f5db6643ba553a5aefdd"}}