{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:L5SJYKO3PDAFE45T2JB2B4BFXN","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":"12afe18f7e6b6c227abc0970f2c9df70024d0a1c2799919824b79509f654e2ad","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-11-07T22:20:01Z","title_canon_sha256":"424d36092c28bda72d4be254754d2352e9d7367810587b14a18751ba91b9f122"},"schema_version":"1.0","source":{"id":"2411.05216","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.05216","created_at":"2026-07-05T10:46:21Z"},{"alias_kind":"arxiv_version","alias_value":"2411.05216v2","created_at":"2026-07-05T10:46:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.05216","created_at":"2026-07-05T10:46:21Z"},{"alias_kind":"pith_short_12","alias_value":"L5SJYKO3PDAF","created_at":"2026-07-05T10:46:21Z"},{"alias_kind":"pith_short_16","alias_value":"L5SJYKO3PDAFE45T","created_at":"2026-07-05T10:46:21Z"},{"alias_kind":"pith_short_8","alias_value":"L5SJYKO3","created_at":"2026-07-05T10:46:21Z"}],"graph_snapshots":[{"event_id":"sha256:4d1867e9931a38ac6286012cb13275b58f16fb84038708351b8a43eabb39eeb9","target":"graph","created_at":"2026-07-05T10:46:21Z","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/2411.05216/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 variational quantum algorithm that can be used to approximately solve combinatorial optimization problems. However, a major limitation of QAOA is that it is a \"local\" algorithm for finite circuit depths, meaning it can only optimize over local properties of the graph. In this paper, we present Phantom-QAOA, a new QAOA ansatz that introduces only one additional parameter to the standard ansatz -- regardless of system size -- allowing QAOA to \"see\" more of the graph at a given depth $p$. We achieve this by modifying the target graph to i","authors_text":"Quinn Langfitt, Reuben Tate, Stephan Eidenbenz","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-11-07T22:20:01Z","title":"Phantom Edges in the Problem Hamiltonian: A Method for Increasing Performance and Graph Visibility for QAOA"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.05216","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:5097a86cd86765950d6820cde956d9203eade2a02bbf6a3f1774ddeb3a412d92","target":"record","created_at":"2026-07-05T10:46:21Z","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":"12afe18f7e6b6c227abc0970f2c9df70024d0a1c2799919824b79509f654e2ad","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-11-07T22:20:01Z","title_canon_sha256":"424d36092c28bda72d4be254754d2352e9d7367810587b14a18751ba91b9f122"},"schema_version":"1.0","source":{"id":"2411.05216","kind":"arxiv","version":2}},"canonical_sha256":"5f649c29db78c05273b3d243a0f025bb4882b1f8b6b5744bf3f5555961d7b930","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5f649c29db78c05273b3d243a0f025bb4882b1f8b6b5744bf3f5555961d7b930","first_computed_at":"2026-07-05T10:46:21.384516Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:46:21.384516Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Auhd0jAQKbQAzZ+Uh2yGOMT9WT3ggZNdB+WFaEYitt8c5qeCX5QXcVYN8pIBfv9ULI95L5spCOnCKBWU6nUMDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T10:46:21.385109Z","signed_message":"canonical_sha256_bytes"},"source_id":"2411.05216","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5097a86cd86765950d6820cde956d9203eade2a02bbf6a3f1774ddeb3a412d92","sha256:4d1867e9931a38ac6286012cb13275b58f16fb84038708351b8a43eabb39eeb9"],"state_sha256":"9eba72fa6e876d6e427fe697283dd8984d0d3f503f6927443b6f567244232e3b"}