{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:WBGXC5TLL35O5XYDU63VSXFKIH","short_pith_number":"pith:WBGXC5TL","canonical_record":{"source":{"id":"1209.1055","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-09-05T17:40:27Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"00d7c3d58eecea3c5d7175bd56df5de19fa48b8c8523a656f6dde2c585ba1586","abstract_canon_sha256":"e52ed162599d8cbbeea52453c6ec4fa9fada01636a2bb1ead09348142584e975"},"schema_version":"1.0"},"canonical_sha256":"b04d71766b5efaeedf03a7b7595caa41d726e5be9beea37569a29793e17e1c2c","source":{"kind":"arxiv","id":"1209.1055","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.1055","created_at":"2026-05-18T01:01:34Z"},{"alias_kind":"arxiv_version","alias_value":"1209.1055v1","created_at":"2026-05-18T01:01:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.1055","created_at":"2026-05-18T01:01:34Z"},{"alias_kind":"pith_short_12","alias_value":"WBGXC5TLL35O","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"WBGXC5TLL35O5XYD","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"WBGXC5TL","created_at":"2026-05-18T12:27:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:WBGXC5TLL35O5XYDU63VSXFKIH","target":"record","payload":{"canonical_record":{"source":{"id":"1209.1055","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-09-05T17:40:27Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"00d7c3d58eecea3c5d7175bd56df5de19fa48b8c8523a656f6dde2c585ba1586","abstract_canon_sha256":"e52ed162599d8cbbeea52453c6ec4fa9fada01636a2bb1ead09348142584e975"},"schema_version":"1.0"},"canonical_sha256":"b04d71766b5efaeedf03a7b7595caa41d726e5be9beea37569a29793e17e1c2c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:01:34.860748Z","signature_b64":"MMoBYOBlg5907CQ/YwVWmlYqiBtpcHRNHnTG0/erbFNz0XcvT9h7jZkfvRdvYnHlQRDvXHzaKdWIpW/8xwifBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b04d71766b5efaeedf03a7b7595caa41d726e5be9beea37569a29793e17e1c2c","last_reissued_at":"2026-05-18T01:01:34.860124Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:01:34.860124Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1209.1055","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-18T01:01:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SAdmhOuPTJ5IpzJ5lD+T4UfTgYp2KMj68ZBXwzYnH7cGxJE9mEHKDju8fLvtx5lSm7LrNXGWQmm2h/Uiv3KIBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T00:08:02.680093Z"},"content_sha256":"3be4f600f35b2c489375c91a372c8070fe6c35af7e10397a938e2d8256ceed0c","schema_version":"1.0","event_id":"sha256:3be4f600f35b2c489375c91a372c8070fe6c35af7e10397a938e2d8256ceed0c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:WBGXC5TLL35O5XYDU63VSXFKIH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Hardness of approximation for quantum problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Julia Kempe, Sevag Gharibian","submitted_at":"2012-09-05T17:40:27Z","abstract_excerpt":"The polynomial hierarchy plays a central role in classical complexity theory. Here, we define a quantum generalization of the polynomial hierarchy, and initiate its study. We show that not only are there natural complete problems for the second level of this quantum hierarchy, but that these problems are in fact hard to approximate. Using these techniques, we also obtain hardness of approximation for the class QCMA. Our approach is based on the use of dispersers, and is inspired by the classical results of Umans regarding hardness of approximation for the second level of the classical polynomi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.1055","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-18T01:01:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VJcJpimYumJSetKxKa1YJ2j6edHm5usdA2PlEeyyfDgcprKiP3ASX8JnYujfvAl4osm/wFBGXIIRLeYiksTbDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T00:08:02.680453Z"},"content_sha256":"26c2700b1fa614e9cf965a3f451fb375868e3b12e87c0dd1b885faf95d27108b","schema_version":"1.0","event_id":"sha256:26c2700b1fa614e9cf965a3f451fb375868e3b12e87c0dd1b885faf95d27108b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WBGXC5TLL35O5XYDU63VSXFKIH/bundle.json","state_url":"https://pith.science/pith/WBGXC5TLL35O5XYDU63VSXFKIH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WBGXC5TLL35O5XYDU63VSXFKIH/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-02T00:08:02Z","links":{"resolver":"https://pith.science/pith/WBGXC5TLL35O5XYDU63VSXFKIH","bundle":"https://pith.science/pith/WBGXC5TLL35O5XYDU63VSXFKIH/bundle.json","state":"https://pith.science/pith/WBGXC5TLL35O5XYDU63VSXFKIH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WBGXC5TLL35O5XYDU63VSXFKIH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:WBGXC5TLL35O5XYDU63VSXFKIH","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":"e52ed162599d8cbbeea52453c6ec4fa9fada01636a2bb1ead09348142584e975","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-09-05T17:40:27Z","title_canon_sha256":"00d7c3d58eecea3c5d7175bd56df5de19fa48b8c8523a656f6dde2c585ba1586"},"schema_version":"1.0","source":{"id":"1209.1055","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.1055","created_at":"2026-05-18T01:01:34Z"},{"alias_kind":"arxiv_version","alias_value":"1209.1055v1","created_at":"2026-05-18T01:01:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.1055","created_at":"2026-05-18T01:01:34Z"},{"alias_kind":"pith_short_12","alias_value":"WBGXC5TLL35O","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"WBGXC5TLL35O5XYD","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"WBGXC5TL","created_at":"2026-05-18T12:27:25Z"}],"graph_snapshots":[{"event_id":"sha256:26c2700b1fa614e9cf965a3f451fb375868e3b12e87c0dd1b885faf95d27108b","target":"graph","created_at":"2026-05-18T01:01:34Z","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":"The polynomial hierarchy plays a central role in classical complexity theory. Here, we define a quantum generalization of the polynomial hierarchy, and initiate its study. We show that not only are there natural complete problems for the second level of this quantum hierarchy, but that these problems are in fact hard to approximate. Using these techniques, we also obtain hardness of approximation for the class QCMA. Our approach is based on the use of dispersers, and is inspired by the classical results of Umans regarding hardness of approximation for the second level of the classical polynomi","authors_text":"Julia Kempe, Sevag Gharibian","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-09-05T17:40:27Z","title":"Hardness of approximation for quantum problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.1055","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:3be4f600f35b2c489375c91a372c8070fe6c35af7e10397a938e2d8256ceed0c","target":"record","created_at":"2026-05-18T01:01:34Z","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":"e52ed162599d8cbbeea52453c6ec4fa9fada01636a2bb1ead09348142584e975","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-09-05T17:40:27Z","title_canon_sha256":"00d7c3d58eecea3c5d7175bd56df5de19fa48b8c8523a656f6dde2c585ba1586"},"schema_version":"1.0","source":{"id":"1209.1055","kind":"arxiv","version":1}},"canonical_sha256":"b04d71766b5efaeedf03a7b7595caa41d726e5be9beea37569a29793e17e1c2c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b04d71766b5efaeedf03a7b7595caa41d726e5be9beea37569a29793e17e1c2c","first_computed_at":"2026-05-18T01:01:34.860124Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:01:34.860124Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MMoBYOBlg5907CQ/YwVWmlYqiBtpcHRNHnTG0/erbFNz0XcvT9h7jZkfvRdvYnHlQRDvXHzaKdWIpW/8xwifBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:01:34.860748Z","signed_message":"canonical_sha256_bytes"},"source_id":"1209.1055","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3be4f600f35b2c489375c91a372c8070fe6c35af7e10397a938e2d8256ceed0c","sha256:26c2700b1fa614e9cf965a3f451fb375868e3b12e87c0dd1b885faf95d27108b"],"state_sha256":"c6e70e969b488b6c53843ab5e30532ab84c9a42fa26bb6e9da7c8bf23a298806"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HURJZGr85yVUdSo2RhjigTVKtZn+cnzOREGebzEHReQe8tWoJGyRgENiK3ZnuN+C5XI9ALNJzIfJ7SfGUjDmCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T00:08:02.682538Z","bundle_sha256":"2f13ce7c4527a3f053154d66806ec45ecd3042d4412f67f01432fcef6214af08"}}