{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:656RMC3OM3C3O5RV2BLGAITMLJ","short_pith_number":"pith:656RMC3O","canonical_record":{"source":{"id":"1811.08419","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-11-20T18:51:07Z","cross_cats_sorted":[],"title_canon_sha256":"1db49e3f04b61f4bbcdb2f148e505b7666ca896c9c015f4cadcdaee6d79aa49b","abstract_canon_sha256":"47132dabfa234b741acbb258ab3070a3433d42e835ccf12d21291b23139bac55"},"schema_version":"1.0"},"canonical_sha256":"f77d160b6e66c5b77635d05660226c5a730ef8b2382b3dcdaf2442b86332422d","source":{"kind":"arxiv","id":"1811.08419","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.08419","created_at":"2026-05-18T00:00:14Z"},{"alias_kind":"arxiv_version","alias_value":"1811.08419v1","created_at":"2026-05-18T00:00:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.08419","created_at":"2026-05-18T00:00:14Z"},{"alias_kind":"pith_short_12","alias_value":"656RMC3OM3C3","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"656RMC3OM3C3O5RV","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"656RMC3O","created_at":"2026-05-18T12:32:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:656RMC3OM3C3O5RV2BLGAITMLJ","target":"record","payload":{"canonical_record":{"source":{"id":"1811.08419","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-11-20T18:51:07Z","cross_cats_sorted":[],"title_canon_sha256":"1db49e3f04b61f4bbcdb2f148e505b7666ca896c9c015f4cadcdaee6d79aa49b","abstract_canon_sha256":"47132dabfa234b741acbb258ab3070a3433d42e835ccf12d21291b23139bac55"},"schema_version":"1.0"},"canonical_sha256":"f77d160b6e66c5b77635d05660226c5a730ef8b2382b3dcdaf2442b86332422d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:14.135061Z","signature_b64":"QdfBYyhuwl38eNxSbB3hxNCKT1xszcKsy3gS77fMqP39k2nViRB8jIT73Isu20ohokLENBvMDU0awVG3P/1tCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f77d160b6e66c5b77635d05660226c5a730ef8b2382b3dcdaf2442b86332422d","last_reissued_at":"2026-05-18T00:00:14.134654Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:14.134654Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.08419","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:00:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+/w0XpwIRtphFtlTYfVF7MA40wleGn1WJ3p1ks5uSrvXfJT/XFsCwrv9MURcqfVQDUNLknF8rgO+4fu9wrJmAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T03:38:20.982521Z"},"content_sha256":"719892d3daf1cc7b98c74eca7de835e42340f24cb67f0029a1518bd41642bf2f","schema_version":"1.0","event_id":"sha256:719892d3daf1cc7b98c74eca7de835e42340f24cb67f0029a1518bd41642bf2f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:656RMC3OM3C3O5RV2BLGAITMLJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Performance of the Quantum Approximate Optimization Algorithm on the Maximum Cut Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Gavin E. Crooks","submitted_at":"2018-11-20T18:51:07Z","abstract_excerpt":"The Quantum Approximate Optimization Algorithm (QAOA) is a promising approach for programming a near-term gate-based hybrid quantum computer to find good approximate solutions of hard combinatorial problems. However, little is currently know about the capabilities of QAOA, or of the difficulty of the requisite parameters optimization. Here, we study the performance of QAOA on the MaxCut combinatorial optimization problem, optimizing the quantum circuits on a classical computer using automatic differentiation and stochastic gradient descent, using QuantumFlow, a quantum circuit simulator implem"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.08419","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:00:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DgvMr8ZyX9oHDZHTxSaNAXRZnjYQuxeIiZmjQFwWMGJqnEYhSWeNzA6QWoz/J86mYNMdyaY/ji2rNNHbOKk5Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T03:38:20.983148Z"},"content_sha256":"ffd2a3303536e17a0080cc801932d04bc89bd98e9283093435eb2360b7b01782","schema_version":"1.0","event_id":"sha256:ffd2a3303536e17a0080cc801932d04bc89bd98e9283093435eb2360b7b01782"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/656RMC3OM3C3O5RV2BLGAITMLJ/bundle.json","state_url":"https://pith.science/pith/656RMC3OM3C3O5RV2BLGAITMLJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/656RMC3OM3C3O5RV2BLGAITMLJ/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-31T03:38:20Z","links":{"resolver":"https://pith.science/pith/656RMC3OM3C3O5RV2BLGAITMLJ","bundle":"https://pith.science/pith/656RMC3OM3C3O5RV2BLGAITMLJ/bundle.json","state":"https://pith.science/pith/656RMC3OM3C3O5RV2BLGAITMLJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/656RMC3OM3C3O5RV2BLGAITMLJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:656RMC3OM3C3O5RV2BLGAITMLJ","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":"47132dabfa234b741acbb258ab3070a3433d42e835ccf12d21291b23139bac55","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-11-20T18:51:07Z","title_canon_sha256":"1db49e3f04b61f4bbcdb2f148e505b7666ca896c9c015f4cadcdaee6d79aa49b"},"schema_version":"1.0","source":{"id":"1811.08419","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.08419","created_at":"2026-05-18T00:00:14Z"},{"alias_kind":"arxiv_version","alias_value":"1811.08419v1","created_at":"2026-05-18T00:00:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.08419","created_at":"2026-05-18T00:00:14Z"},{"alias_kind":"pith_short_12","alias_value":"656RMC3OM3C3","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"656RMC3OM3C3O5RV","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"656RMC3O","created_at":"2026-05-18T12:32:08Z"}],"graph_snapshots":[{"event_id":"sha256:ffd2a3303536e17a0080cc801932d04bc89bd98e9283093435eb2360b7b01782","target":"graph","created_at":"2026-05-18T00:00:14Z","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 Quantum Approximate Optimization Algorithm (QAOA) is a promising approach for programming a near-term gate-based hybrid quantum computer to find good approximate solutions of hard combinatorial problems. However, little is currently know about the capabilities of QAOA, or of the difficulty of the requisite parameters optimization. Here, we study the performance of QAOA on the MaxCut combinatorial optimization problem, optimizing the quantum circuits on a classical computer using automatic differentiation and stochastic gradient descent, using QuantumFlow, a quantum circuit simulator implem","authors_text":"Gavin E. Crooks","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-11-20T18:51:07Z","title":"Performance of the Quantum Approximate Optimization Algorithm on the Maximum Cut Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.08419","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:719892d3daf1cc7b98c74eca7de835e42340f24cb67f0029a1518bd41642bf2f","target":"record","created_at":"2026-05-18T00:00:14Z","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":"47132dabfa234b741acbb258ab3070a3433d42e835ccf12d21291b23139bac55","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-11-20T18:51:07Z","title_canon_sha256":"1db49e3f04b61f4bbcdb2f148e505b7666ca896c9c015f4cadcdaee6d79aa49b"},"schema_version":"1.0","source":{"id":"1811.08419","kind":"arxiv","version":1}},"canonical_sha256":"f77d160b6e66c5b77635d05660226c5a730ef8b2382b3dcdaf2442b86332422d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f77d160b6e66c5b77635d05660226c5a730ef8b2382b3dcdaf2442b86332422d","first_computed_at":"2026-05-18T00:00:14.134654Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:00:14.134654Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QdfBYyhuwl38eNxSbB3hxNCKT1xszcKsy3gS77fMqP39k2nViRB8jIT73Isu20ohokLENBvMDU0awVG3P/1tCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:00:14.135061Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.08419","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:719892d3daf1cc7b98c74eca7de835e42340f24cb67f0029a1518bd41642bf2f","sha256:ffd2a3303536e17a0080cc801932d04bc89bd98e9283093435eb2360b7b01782"],"state_sha256":"1d0784f564a15165bf61686141c79d1ad51cffd83c74fece9653fe9dae64ca4c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G+O5H1Hs+kBOs3SDST8+OpgTMtPbkV8t+w33fEUF1xwIlt3Utb/mNUa1FeH6l1kxOtzFxuomc1P3dv8WOASYAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T03:38:20.986663Z","bundle_sha256":"1def7c6b7ee8ede9b16b7c593bdc9900073be39f5f62f5603fe5b0b4ddd6ac2d"}}