{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:OXO7VZANBCQHDGLN7VXV555Z2M","short_pith_number":"pith:OXO7VZAN","canonical_record":{"source":{"id":"2107.00677","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2021-07-01T18:02:36Z","cross_cats_sorted":[],"title_canon_sha256":"6b02daef33d5e37457acf5b956e4826998872e8a10da77a10b39b6f563cb928d","abstract_canon_sha256":"16557cbca0d2a360e33e23b16d235523da65b44860a81e1ed9a02cfe5bf7564f"},"schema_version":"1.0"},"canonical_sha256":"75ddfae40d08a071996dfd6f5ef7b9d302524c36ca15d88f1cf375ec5eb2ba5a","source":{"kind":"arxiv","id":"2107.00677","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2107.00677","created_at":"2026-07-05T02:58:43Z"},{"alias_kind":"arxiv_version","alias_value":"2107.00677v2","created_at":"2026-07-05T02:58:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2107.00677","created_at":"2026-07-05T02:58:43Z"},{"alias_kind":"pith_short_12","alias_value":"OXO7VZANBCQH","created_at":"2026-07-05T02:58:43Z"},{"alias_kind":"pith_short_16","alias_value":"OXO7VZANBCQHDGLN","created_at":"2026-07-05T02:58:43Z"},{"alias_kind":"pith_short_8","alias_value":"OXO7VZAN","created_at":"2026-07-05T02:58:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:OXO7VZANBCQHDGLN7VXV555Z2M","target":"record","payload":{"canonical_record":{"source":{"id":"2107.00677","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2021-07-01T18:02:36Z","cross_cats_sorted":[],"title_canon_sha256":"6b02daef33d5e37457acf5b956e4826998872e8a10da77a10b39b6f563cb928d","abstract_canon_sha256":"16557cbca0d2a360e33e23b16d235523da65b44860a81e1ed9a02cfe5bf7564f"},"schema_version":"1.0"},"canonical_sha256":"75ddfae40d08a071996dfd6f5ef7b9d302524c36ca15d88f1cf375ec5eb2ba5a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:58:43.466542Z","signature_b64":"SEiyh9Ww3EgwmeftgSsPuqjPMJUgQ2W1AJCmkkV5mrO9Ex9SMiRNPH4cpHtTJFmUk4RiQNfK0WIPt7xWhrAqDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"75ddfae40d08a071996dfd6f5ef7b9d302524c36ca15d88f1cf375ec5eb2ba5a","last_reissued_at":"2026-07-05T02:58:43.466054Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:58:43.466054Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2107.00677","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-05T02:58:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"giZM1HqgS1Gz19JRddftjmr3TmqNxCCNv6A4AhwXtOQNM1oaiWMfngS3Era4MSt6infS1KlZ0qB0EQBNmopCDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T02:23:47.974214Z"},"content_sha256":"ba5a6adc8d50672d8b6b986f7c1f8c67d540ab7b3af524b5a515a62b05c40462","schema_version":"1.0","event_id":"sha256:ba5a6adc8d50672d8b6b986f7c1f8c67d540ab7b3af524b5a515a62b05c40462"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:OXO7VZANBCQHDGLN7VXV555Z2M","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The fixed angle conjecture for QAOA on regular MaxCut graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Danylo Lykov, Jonathan Wurtz","submitted_at":"2021-07-01T18:02:36Z","abstract_excerpt":"The quantum approximate optimization algorithm (QAOA) is a near-term combinatorial optimization algorithm suitable for noisy quantum devices. However, little is known about performance guarantees for $p>2$. A recent work \\cite{Wurtz_guarantee} computing MaxCut performance guarantees for 3-regular graphs conjectures that any $d$-regular graph evaluated at particular fixed angles has an approximation ratio greater than some worst-case guarantee. In this work, we provide numerical evidence for this fixed angle conjecture for $p<12$. We compute and provide these angles via numerical optimization a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2107.00677","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/2107.00677/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-05T02:58:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YqclhNDnempb/FacZ7J8fNq1HeoF3jYdvtaHav1Bovt9L7Kh798WZpjZjsoGYq5+W5iQgSlV0vsdZBQ9iGzyBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T02:23:47.974876Z"},"content_sha256":"f7eeb4562494769d2436730322977ed07181fd0fbfeee1856c0274a365b6e379","schema_version":"1.0","event_id":"sha256:f7eeb4562494769d2436730322977ed07181fd0fbfeee1856c0274a365b6e379"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OXO7VZANBCQHDGLN7VXV555Z2M/bundle.json","state_url":"https://pith.science/pith/OXO7VZANBCQHDGLN7VXV555Z2M/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OXO7VZANBCQHDGLN7VXV555Z2M/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-07-07T02:23:47Z","links":{"resolver":"https://pith.science/pith/OXO7VZANBCQHDGLN7VXV555Z2M","bundle":"https://pith.science/pith/OXO7VZANBCQHDGLN7VXV555Z2M/bundle.json","state":"https://pith.science/pith/OXO7VZANBCQHDGLN7VXV555Z2M/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OXO7VZANBCQHDGLN7VXV555Z2M/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:OXO7VZANBCQHDGLN7VXV555Z2M","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":"16557cbca0d2a360e33e23b16d235523da65b44860a81e1ed9a02cfe5bf7564f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2021-07-01T18:02:36Z","title_canon_sha256":"6b02daef33d5e37457acf5b956e4826998872e8a10da77a10b39b6f563cb928d"},"schema_version":"1.0","source":{"id":"2107.00677","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2107.00677","created_at":"2026-07-05T02:58:43Z"},{"alias_kind":"arxiv_version","alias_value":"2107.00677v2","created_at":"2026-07-05T02:58:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2107.00677","created_at":"2026-07-05T02:58:43Z"},{"alias_kind":"pith_short_12","alias_value":"OXO7VZANBCQH","created_at":"2026-07-05T02:58:43Z"},{"alias_kind":"pith_short_16","alias_value":"OXO7VZANBCQHDGLN","created_at":"2026-07-05T02:58:43Z"},{"alias_kind":"pith_short_8","alias_value":"OXO7VZAN","created_at":"2026-07-05T02:58:43Z"}],"graph_snapshots":[{"event_id":"sha256:f7eeb4562494769d2436730322977ed07181fd0fbfeee1856c0274a365b6e379","target":"graph","created_at":"2026-07-05T02:58:43Z","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/2107.00677/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 a near-term combinatorial optimization algorithm suitable for noisy quantum devices. However, little is known about performance guarantees for $p>2$. A recent work \\cite{Wurtz_guarantee} computing MaxCut performance guarantees for 3-regular graphs conjectures that any $d$-regular graph evaluated at particular fixed angles has an approximation ratio greater than some worst-case guarantee. In this work, we provide numerical evidence for this fixed angle conjecture for $p<12$. We compute and provide these angles via numerical optimization a","authors_text":"Danylo Lykov, Jonathan Wurtz","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2021-07-01T18:02:36Z","title":"The fixed angle conjecture for QAOA on regular MaxCut graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2107.00677","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:ba5a6adc8d50672d8b6b986f7c1f8c67d540ab7b3af524b5a515a62b05c40462","target":"record","created_at":"2026-07-05T02:58:43Z","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":"16557cbca0d2a360e33e23b16d235523da65b44860a81e1ed9a02cfe5bf7564f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2021-07-01T18:02:36Z","title_canon_sha256":"6b02daef33d5e37457acf5b956e4826998872e8a10da77a10b39b6f563cb928d"},"schema_version":"1.0","source":{"id":"2107.00677","kind":"arxiv","version":2}},"canonical_sha256":"75ddfae40d08a071996dfd6f5ef7b9d302524c36ca15d88f1cf375ec5eb2ba5a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"75ddfae40d08a071996dfd6f5ef7b9d302524c36ca15d88f1cf375ec5eb2ba5a","first_computed_at":"2026-07-05T02:58:43.466054Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:58:43.466054Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SEiyh9Ww3EgwmeftgSsPuqjPMJUgQ2W1AJCmkkV5mrO9Ex9SMiRNPH4cpHtTJFmUk4RiQNfK0WIPt7xWhrAqDg==","signature_status":"signed_v1","signed_at":"2026-07-05T02:58:43.466542Z","signed_message":"canonical_sha256_bytes"},"source_id":"2107.00677","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ba5a6adc8d50672d8b6b986f7c1f8c67d540ab7b3af524b5a515a62b05c40462","sha256:f7eeb4562494769d2436730322977ed07181fd0fbfeee1856c0274a365b6e379"],"state_sha256":"66f7cb5cb278d677c5455dfd1a77b3bb9c1c56fc334c678b470fc5ba3c675e96"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BcNYk16xvfKQstVfWa5cXhxzEg3jw8CgKjvc3DCLRUJXF+bhsodFugHcyZyPObFb7wJYf5DQWBIxCUDkntNVAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T02:23:47.977799Z","bundle_sha256":"737ba8c369cce7347bf753cfe4a8851ec3b7b371a5c38eb65e2f505a73aad74a"}}