{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:I7QSHWGZUV3ZT3BHYCQODU2PLT","short_pith_number":"pith:I7QSHWGZ","canonical_record":{"source":{"id":"1806.04080","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2018-06-11T16:02:43Z","cross_cats_sorted":[],"title_canon_sha256":"94e22582c6d1561451c21594c3b2e76785092abbfeadcefe91c053c333a881bd","abstract_canon_sha256":"fe0c763238bca771c058de15bfc02e61fc9ef21fe89221424f68ae6014efbd55"},"schema_version":"1.0"},"canonical_sha256":"47e123d8d9a57799ec27c0a0e1d34f5ccb10f16ee35ec572c1f101771402659d","source":{"kind":"arxiv","id":"1806.04080","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.04080","created_at":"2026-05-18T00:13:38Z"},{"alias_kind":"arxiv_version","alias_value":"1806.04080v1","created_at":"2026-05-18T00:13:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.04080","created_at":"2026-05-18T00:13:38Z"},{"alias_kind":"pith_short_12","alias_value":"I7QSHWGZUV3Z","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"I7QSHWGZUV3ZT3BH","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"I7QSHWGZ","created_at":"2026-05-18T12:32:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:I7QSHWGZUV3ZT3BHYCQODU2PLT","target":"record","payload":{"canonical_record":{"source":{"id":"1806.04080","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2018-06-11T16:02:43Z","cross_cats_sorted":[],"title_canon_sha256":"94e22582c6d1561451c21594c3b2e76785092abbfeadcefe91c053c333a881bd","abstract_canon_sha256":"fe0c763238bca771c058de15bfc02e61fc9ef21fe89221424f68ae6014efbd55"},"schema_version":"1.0"},"canonical_sha256":"47e123d8d9a57799ec27c0a0e1d34f5ccb10f16ee35ec572c1f101771402659d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:13:38.588929Z","signature_b64":"Ke+IBqyGwtU4ylaN7k4SICdQqUEeEks/LjfHEkIRPAdU8U/kcJqdbBPiHC2CjUZbJ2eAP44VW5CsgruRcKK9CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"47e123d8d9a57799ec27c0a0e1d34f5ccb10f16ee35ec572c1f101771402659d","last_reissued_at":"2026-05-18T00:13:38.588224Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:13:38.588224Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.04080","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-18T00:13:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T1lUzdiX8AzlHsFGPPRSf/WbC7NvRSLmxyIvrId7HBzl2o0M/cIIy/dDUm/8bGO2H46Qo2RvHr7W7CjWFmV0Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T19:42:22.076745Z"},"content_sha256":"85de7580d33edfe744a7fd54d8c9004658c2248724149d735f8999d74a266d9d","schema_version":"1.0","event_id":"sha256:85de7580d33edfe744a7fd54d8c9004658c2248724149d735f8999d74a266d9d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:I7QSHWGZUV3ZT3BHYCQODU2PLT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Hardness of Satisfiability with Bounded Occurrences in the Polynomial-Time Hierarchy","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Amnon Ta-Shma, Ishay Haviv, Oded Regev","submitted_at":"2018-06-11T16:02:43Z","abstract_excerpt":"$ \\newcommand{\\eps}{\\epsilon} \\newcommand{\\NP}{\\mathsf{NP}} \\newcommand{\\YES}{\\mathsf{YES}} \\newcommand{\\NO}{\\mathsf{NO}} \\newcommand{\\myminus}{\\text{-}}\\newcommand{\\Bsat}{{\\mathsf{B}}} \\newcommand{\\threesat}{\\rm{3}\\myminus\\mathsf{SAT}} \\newcommand{\\gapthreesat}{\\mathsf{\\forall\\exists}\\myminus{\\rm{3}}\\myminus\\mathsf{SAT}} $In 1991, Papadimitriou and Yannakakis gave a reduction implying the $\\NP$-hardness of approximating the problem $\\threesat$ with bounded occurrences. Their reduction is based on expander graphs. We present an analogue of this result for the second level of the polynomial-tim"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.04080","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-18T00:13:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pPA+Diw0ycA3cnJOCbpfmqPxsgZvvwhb6sDtYJKT5eMKQ8NOBv+OHdRdzVFevx00JnbuSBzwuis+6NYwYaoTBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T19:42:22.077087Z"},"content_sha256":"b134ae2a842b52f57a3d3e413bd7a02211520b610d52931fc9c492cc27f0256d","schema_version":"1.0","event_id":"sha256:b134ae2a842b52f57a3d3e413bd7a02211520b610d52931fc9c492cc27f0256d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/I7QSHWGZUV3ZT3BHYCQODU2PLT/bundle.json","state_url":"https://pith.science/pith/I7QSHWGZUV3ZT3BHYCQODU2PLT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/I7QSHWGZUV3ZT3BHYCQODU2PLT/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-01T19:42:22Z","links":{"resolver":"https://pith.science/pith/I7QSHWGZUV3ZT3BHYCQODU2PLT","bundle":"https://pith.science/pith/I7QSHWGZUV3ZT3BHYCQODU2PLT/bundle.json","state":"https://pith.science/pith/I7QSHWGZUV3ZT3BHYCQODU2PLT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/I7QSHWGZUV3ZT3BHYCQODU2PLT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:I7QSHWGZUV3ZT3BHYCQODU2PLT","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":"fe0c763238bca771c058de15bfc02e61fc9ef21fe89221424f68ae6014efbd55","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2018-06-11T16:02:43Z","title_canon_sha256":"94e22582c6d1561451c21594c3b2e76785092abbfeadcefe91c053c333a881bd"},"schema_version":"1.0","source":{"id":"1806.04080","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.04080","created_at":"2026-05-18T00:13:38Z"},{"alias_kind":"arxiv_version","alias_value":"1806.04080v1","created_at":"2026-05-18T00:13:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.04080","created_at":"2026-05-18T00:13:38Z"},{"alias_kind":"pith_short_12","alias_value":"I7QSHWGZUV3Z","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"I7QSHWGZUV3ZT3BH","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"I7QSHWGZ","created_at":"2026-05-18T12:32:28Z"}],"graph_snapshots":[{"event_id":"sha256:b134ae2a842b52f57a3d3e413bd7a02211520b610d52931fc9c492cc27f0256d","target":"graph","created_at":"2026-05-18T00:13:38Z","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":"$ \\newcommand{\\eps}{\\epsilon} \\newcommand{\\NP}{\\mathsf{NP}} \\newcommand{\\YES}{\\mathsf{YES}} \\newcommand{\\NO}{\\mathsf{NO}} \\newcommand{\\myminus}{\\text{-}}\\newcommand{\\Bsat}{{\\mathsf{B}}} \\newcommand{\\threesat}{\\rm{3}\\myminus\\mathsf{SAT}} \\newcommand{\\gapthreesat}{\\mathsf{\\forall\\exists}\\myminus{\\rm{3}}\\myminus\\mathsf{SAT}} $In 1991, Papadimitriou and Yannakakis gave a reduction implying the $\\NP$-hardness of approximating the problem $\\threesat$ with bounded occurrences. Their reduction is based on expander graphs. We present an analogue of this result for the second level of the polynomial-tim","authors_text":"Amnon Ta-Shma, Ishay Haviv, Oded Regev","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2018-06-11T16:02:43Z","title":"On the Hardness of Satisfiability with Bounded Occurrences in the Polynomial-Time Hierarchy"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.04080","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:85de7580d33edfe744a7fd54d8c9004658c2248724149d735f8999d74a266d9d","target":"record","created_at":"2026-05-18T00:13:38Z","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":"fe0c763238bca771c058de15bfc02e61fc9ef21fe89221424f68ae6014efbd55","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2018-06-11T16:02:43Z","title_canon_sha256":"94e22582c6d1561451c21594c3b2e76785092abbfeadcefe91c053c333a881bd"},"schema_version":"1.0","source":{"id":"1806.04080","kind":"arxiv","version":1}},"canonical_sha256":"47e123d8d9a57799ec27c0a0e1d34f5ccb10f16ee35ec572c1f101771402659d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"47e123d8d9a57799ec27c0a0e1d34f5ccb10f16ee35ec572c1f101771402659d","first_computed_at":"2026-05-18T00:13:38.588224Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:13:38.588224Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ke+IBqyGwtU4ylaN7k4SICdQqUEeEks/LjfHEkIRPAdU8U/kcJqdbBPiHC2CjUZbJ2eAP44VW5CsgruRcKK9CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:13:38.588929Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.04080","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:85de7580d33edfe744a7fd54d8c9004658c2248724149d735f8999d74a266d9d","sha256:b134ae2a842b52f57a3d3e413bd7a02211520b610d52931fc9c492cc27f0256d"],"state_sha256":"c6d2a6b28c64e4db4efab726308b7448248b7e8eecd3c52c40e52ba4ddc4ff90"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lA8OAH7SK+s9SuD5Qg2VPqLVfavBvnJgfvhwgJz2XvGwXoZZ3fQ9VQQypk5KwtwwykcroG7XrBiS7ALBWuXcBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T19:42:22.078989Z","bundle_sha256":"4c0d59270182456b49bce1f43f3a782ff59211fd7b9f072117c8387349dc676f"}}