{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:T4O6J4ETD3OQBT2C6WQ4IJ2JD7","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":"5d7eb785b27016cf4c9ec1b9e5cef3fda26f3812f6b389e9f7028f0a4da19a05","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2025-08-29T18:12:20Z","title_canon_sha256":"d4edd754f2ac0163481643d6e4e18b64176785a371b44b72f31ee084a3fa47bf"},"schema_version":"1.0","source":{"id":"2509.00170","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2509.00170","created_at":"2026-07-05T12:02:10Z"},{"alias_kind":"arxiv_version","alias_value":"2509.00170v1","created_at":"2026-07-05T12:02:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.00170","created_at":"2026-07-05T12:02:10Z"},{"alias_kind":"pith_short_12","alias_value":"T4O6J4ETD3OQ","created_at":"2026-07-05T12:02:10Z"},{"alias_kind":"pith_short_16","alias_value":"T4O6J4ETD3OQBT2C","created_at":"2026-07-05T12:02:10Z"},{"alias_kind":"pith_short_8","alias_value":"T4O6J4ET","created_at":"2026-07-05T12:02:10Z"}],"graph_snapshots":[{"event_id":"sha256:f7cdc2173ad2c15176f5dc26dc2b64675b50eaf577aa9373911862321e138344","target":"graph","created_at":"2026-07-05T12:02:10Z","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/2509.00170/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study a cost Hamiltonian compilation problem for the quantum approximate optimization algorithm (QAOA) applied to the Max-Cut problem, focusing on trapped-ion quantum computers. Instead of standard compilation with CNOT and Rz gates, we employ global coupling operations and single-qubit bit flips. Prior work by Rajakumar et al. established that such a compilation is always possible.\n  Minimizing operational error requires short operation sequences. The problem reduces to a low-rank semi-discrete decomposition of the graph's adjacency matrix, where the minimum achievable rank, the graph coup","authors_text":"Illya V. Hicks, Saber Dinpazhouh","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2025-08-29T18:12:20Z","title":"Optimizing Cost Hamiltonian Compilation for Max-Cut QAOA on Unweighted Graphs Using Global Controls and Qubit Bit Flips"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.00170","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:daff031986c5b1c545f1575db99ec9732dc0e2aa1bc2a6f5a95723ec7e7f0b5a","target":"record","created_at":"2026-07-05T12:02:10Z","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":"5d7eb785b27016cf4c9ec1b9e5cef3fda26f3812f6b389e9f7028f0a4da19a05","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2025-08-29T18:12:20Z","title_canon_sha256":"d4edd754f2ac0163481643d6e4e18b64176785a371b44b72f31ee084a3fa47bf"},"schema_version":"1.0","source":{"id":"2509.00170","kind":"arxiv","version":1}},"canonical_sha256":"9f1de4f0931edd00cf42f5a1c427491ff018657a69b9a0d0269996208b110f3f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9f1de4f0931edd00cf42f5a1c427491ff018657a69b9a0d0269996208b110f3f","first_computed_at":"2026-07-05T12:02:10.622252Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T12:02:10.622252Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lEgf59mh44h9e7v+FQtkJ/Rs1DBh8qruwVZ3tlGtgGrj0gh3YmbrZ1GccTMiLQ5RQE5REfV+htWqlZ5Cd6jnBw==","signature_status":"signed_v1","signed_at":"2026-07-05T12:02:10.622782Z","signed_message":"canonical_sha256_bytes"},"source_id":"2509.00170","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:daff031986c5b1c545f1575db99ec9732dc0e2aa1bc2a6f5a95723ec7e7f0b5a","sha256:f7cdc2173ad2c15176f5dc26dc2b64675b50eaf577aa9373911862321e138344"],"state_sha256":"2f25bc81c7c7f72997b2bb99ed0e0d3321a1fcc5882d175216861813aa6bccd6"}