{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:WUQWEEWSUJFPWMIRMOJ6MZXF7S","short_pith_number":"pith:WUQWEEWS","canonical_record":{"source":{"id":"1602.07674","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-02-24T20:57:50Z","cross_cats_sorted":[],"title_canon_sha256":"d66faaa66781d6ef7a574dba984321fbcd8d4abd963f5450871a96139bebe8fe","abstract_canon_sha256":"c1a3c2d97a488c39be74fc1324cb9f0542385d6b00e731fd37beaf15da1867a1"},"schema_version":"1.0"},"canonical_sha256":"b5216212d2a24afb31116393e666e5fca86107d7bd6ebf12bd4f4edd17564fab","source":{"kind":"arxiv","id":"1602.07674","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.07674","created_at":"2026-07-05T00:13:11Z"},{"alias_kind":"arxiv_version","alias_value":"1602.07674v2","created_at":"2026-07-05T00:13:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.07674","created_at":"2026-07-05T00:13:11Z"},{"alias_kind":"pith_short_12","alias_value":"WUQWEEWSUJFP","created_at":"2026-07-05T00:13:11Z"},{"alias_kind":"pith_short_16","alias_value":"WUQWEEWSUJFPWMIR","created_at":"2026-07-05T00:13:11Z"},{"alias_kind":"pith_short_8","alias_value":"WUQWEEWS","created_at":"2026-07-05T00:13:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:WUQWEEWSUJFPWMIRMOJ6MZXF7S","target":"record","payload":{"canonical_record":{"source":{"id":"1602.07674","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-02-24T20:57:50Z","cross_cats_sorted":[],"title_canon_sha256":"d66faaa66781d6ef7a574dba984321fbcd8d4abd963f5450871a96139bebe8fe","abstract_canon_sha256":"c1a3c2d97a488c39be74fc1324cb9f0542385d6b00e731fd37beaf15da1867a1"},"schema_version":"1.0"},"canonical_sha256":"b5216212d2a24afb31116393e666e5fca86107d7bd6ebf12bd4f4edd17564fab","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:13:11.368290Z","signature_b64":"4zjTmUdWPEZ+RmSDU8Ge8gvQqEogDf3iAvvgkmZig8cSRlrPJZMOQ/XUJsx4+1yGGB25x8XrR/qoFRa5mv8RDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b5216212d2a24afb31116393e666e5fca86107d7bd6ebf12bd4f4edd17564fab","last_reissued_at":"2026-07-05T00:13:11.367818Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:13:11.367818Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.07674","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-07-05T00:13:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rIZLI7fpfeNghwatAMv4XIzGXYMXRft/yEbN8O7HrKB4NBWcHL+19jX6hnAlMlxp0YDZzo2+5kNOPZuV5HxOCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T15:03:11.835002Z"},"content_sha256":"28cc8ecaea8ad6737d751dfb9706542ca1e12c0035830eb359f87578585f9ff2","schema_version":"1.0","event_id":"sha256:28cc8ecaea8ad6737d751dfb9706542ca1e12c0035830eb359f87578585f9ff2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:WUQWEEWSUJFPWMIRMOJ6MZXF7S","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Quantum Supremacy through the Quantum Approximate Optimization Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Aram W Harrow, Edward Farhi","submitted_at":"2016-02-24T20:57:50Z","abstract_excerpt":"The Quantum Approximate Optimization Algorithm (QAOA) is designed to run on a gate model quantum computer and has shallow depth. It takes as input a combinatorial optimization problem and outputs a string that satisfies a high fraction of the maximum number of clauses that can be satisfied. For certain problems the lowest depth version of the QAOA has provable performance guarantees although there exist classical algorithms that have better guarantees. Here we argue that beyond its possible computational value the QAOA can exhibit a form of Quantum Supremacy in that, based on reasonable comple"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.07674","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1602.07674/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T00:13:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Oa3eiSk4wzJWJABH8XxewgYyfFx9aqIjQvUK1HV7emPMrqNKkdlGLJ3fr7fOH1lRp5/QDlbG5L6aao7QV6xODg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T15:03:11.835816Z"},"content_sha256":"99c6012b77831c713e9120672f4818fdef03d2b8a7c44586f93201d15ed7bc4e","schema_version":"1.0","event_id":"sha256:99c6012b77831c713e9120672f4818fdef03d2b8a7c44586f93201d15ed7bc4e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WUQWEEWSUJFPWMIRMOJ6MZXF7S/bundle.json","state_url":"https://pith.science/pith/WUQWEEWSUJFPWMIRMOJ6MZXF7S/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WUQWEEWSUJFPWMIRMOJ6MZXF7S/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-08-08T15:03:11Z","links":{"resolver":"https://pith.science/pith/WUQWEEWSUJFPWMIRMOJ6MZXF7S","bundle":"https://pith.science/pith/WUQWEEWSUJFPWMIRMOJ6MZXF7S/bundle.json","state":"https://pith.science/pith/WUQWEEWSUJFPWMIRMOJ6MZXF7S/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WUQWEEWSUJFPWMIRMOJ6MZXF7S/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:WUQWEEWSUJFPWMIRMOJ6MZXF7S","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":"c1a3c2d97a488c39be74fc1324cb9f0542385d6b00e731fd37beaf15da1867a1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-02-24T20:57:50Z","title_canon_sha256":"d66faaa66781d6ef7a574dba984321fbcd8d4abd963f5450871a96139bebe8fe"},"schema_version":"1.0","source":{"id":"1602.07674","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.07674","created_at":"2026-07-05T00:13:11Z"},{"alias_kind":"arxiv_version","alias_value":"1602.07674v2","created_at":"2026-07-05T00:13:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.07674","created_at":"2026-07-05T00:13:11Z"},{"alias_kind":"pith_short_12","alias_value":"WUQWEEWSUJFP","created_at":"2026-07-05T00:13:11Z"},{"alias_kind":"pith_short_16","alias_value":"WUQWEEWSUJFPWMIR","created_at":"2026-07-05T00:13:11Z"},{"alias_kind":"pith_short_8","alias_value":"WUQWEEWS","created_at":"2026-07-05T00:13:11Z"}],"graph_snapshots":[{"event_id":"sha256:99c6012b77831c713e9120672f4818fdef03d2b8a7c44586f93201d15ed7bc4e","target":"graph","created_at":"2026-07-05T00:13:11Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1602.07674/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The Quantum Approximate Optimization Algorithm (QAOA) is designed to run on a gate model quantum computer and has shallow depth. It takes as input a combinatorial optimization problem and outputs a string that satisfies a high fraction of the maximum number of clauses that can be satisfied. For certain problems the lowest depth version of the QAOA has provable performance guarantees although there exist classical algorithms that have better guarantees. Here we argue that beyond its possible computational value the QAOA can exhibit a form of Quantum Supremacy in that, based on reasonable comple","authors_text":"Aram W Harrow, Edward Farhi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-02-24T20:57:50Z","title":"Quantum Supremacy through the Quantum Approximate Optimization Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.07674","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:28cc8ecaea8ad6737d751dfb9706542ca1e12c0035830eb359f87578585f9ff2","target":"record","created_at":"2026-07-05T00:13:11Z","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":"c1a3c2d97a488c39be74fc1324cb9f0542385d6b00e731fd37beaf15da1867a1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-02-24T20:57:50Z","title_canon_sha256":"d66faaa66781d6ef7a574dba984321fbcd8d4abd963f5450871a96139bebe8fe"},"schema_version":"1.0","source":{"id":"1602.07674","kind":"arxiv","version":2}},"canonical_sha256":"b5216212d2a24afb31116393e666e5fca86107d7bd6ebf12bd4f4edd17564fab","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b5216212d2a24afb31116393e666e5fca86107d7bd6ebf12bd4f4edd17564fab","first_computed_at":"2026-07-05T00:13:11.367818Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:13:11.367818Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4zjTmUdWPEZ+RmSDU8Ge8gvQqEogDf3iAvvgkmZig8cSRlrPJZMOQ/XUJsx4+1yGGB25x8XrR/qoFRa5mv8RDw==","signature_status":"signed_v1","signed_at":"2026-07-05T00:13:11.368290Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.07674","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:28cc8ecaea8ad6737d751dfb9706542ca1e12c0035830eb359f87578585f9ff2","sha256:99c6012b77831c713e9120672f4818fdef03d2b8a7c44586f93201d15ed7bc4e"],"state_sha256":"8a2e598d05646dd70707daaf8d4e40d1565337233e20630b949eca6e125cbed0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OFCwMPqYs+4PEI4W9SvYPf4n7K2eEXSw6pswDfCuoqa0oN7pOH5hyckAm4fiWvyt1jT8gfUrkjV554eP11cNDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T15:03:11.850019Z","bundle_sha256":"94391361852864ae916a82dcac76d97b5f0184e2d491d42fc6ea89f74df56284"}}