{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:6EN6GBOK2HOONGN2UQK6FYN7VN","short_pith_number":"pith:6EN6GBOK","canonical_record":{"source":{"id":"2112.06143","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"quant-ph","submitted_at":"2021-12-12T04:00:45Z","cross_cats_sorted":[],"title_canon_sha256":"f31e250aabbf127712b07470d6ce96defe9d5dcc678a7b049d8be84be5a288c2","abstract_canon_sha256":"4e088dbd99337328798f791eca1e491cc247c11ea61614d99e71ca7d2ccbdd47"},"schema_version":"1.0"},"canonical_sha256":"f11be305cad1dce699baa415e2e1bfab78072401767a93939dc6a53435f4ad8a","source":{"kind":"arxiv","id":"2112.06143","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2112.06143","created_at":"2026-07-05T04:41:53Z"},{"alias_kind":"arxiv_version","alias_value":"2112.06143v4","created_at":"2026-07-05T04:41:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2112.06143","created_at":"2026-07-05T04:41:53Z"},{"alias_kind":"pith_short_12","alias_value":"6EN6GBOK2HOO","created_at":"2026-07-05T04:41:53Z"},{"alias_kind":"pith_short_16","alias_value":"6EN6GBOK2HOONGN2","created_at":"2026-07-05T04:41:53Z"},{"alias_kind":"pith_short_8","alias_value":"6EN6GBOK","created_at":"2026-07-05T04:41:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:6EN6GBOK2HOONGN2UQK6FYN7VN","target":"record","payload":{"canonical_record":{"source":{"id":"2112.06143","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"quant-ph","submitted_at":"2021-12-12T04:00:45Z","cross_cats_sorted":[],"title_canon_sha256":"f31e250aabbf127712b07470d6ce96defe9d5dcc678a7b049d8be84be5a288c2","abstract_canon_sha256":"4e088dbd99337328798f791eca1e491cc247c11ea61614d99e71ca7d2ccbdd47"},"schema_version":"1.0"},"canonical_sha256":"f11be305cad1dce699baa415e2e1bfab78072401767a93939dc6a53435f4ad8a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:41:53.031262Z","signature_b64":"sSyHb0xA73vVUmd0DCeivw18nP5QShv0fQgD04efH9zTGHt0qT/vXb579upzNXmPJViNzyjxV97be1kYeuZbCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f11be305cad1dce699baa415e2e1bfab78072401767a93939dc6a53435f4ad8a","last_reissued_at":"2026-07-05T04:41:53.030670Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:41:53.030670Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2112.06143","source_version":4,"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-05T04:41:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KYwkMbPNVo1cWwNlfZQ4OucrJJp9E1cgsNpUljYOR9J5Vtnj7Q4SiUtY03jZT6MHY5TLUIVhcA/y/vsl1V8cAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T21:47:45.457798Z"},"content_sha256":"3b19ffde9a58d428f137eccd6887f98e00f890e0341c9c0b894341023a1c4737","schema_version":"1.0","event_id":"sha256:3b19ffde9a58d428f137eccd6887f98e00f890e0341c9c0b894341023a1c4737"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:6EN6GBOK2HOONGN2UQK6FYN7VN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Structured Method for Compilation of QAOA Circuits in Quantum Computing","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Ari B. Hayes, Chi Zhang, Eddy Z. Zhang, Fei Hua, Jason Luo, Lucent Fong, Yanhao Chen, Yuwei Jin","submitted_at":"2021-12-12T04:00:45Z","abstract_excerpt":"Quantum Approximation Optimization Algorithm (QAOA) is a highly advocated variational algorithm for solving the combinatorial optimization problem. One critical feature in the quantum circuit of QAOA algorithm is that it consists of two-qubit operators that commute. The flexibility in reordering the two-qubit gates allows compiler optimizations to generate circuits with better depths, gate count, and fidelity. However, it also imposes significant challenges due to additional freedom exposed in the compilation. Prior studies lack the following: (1) Performance guarantee, (2) Scalability, and (3"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2112.06143","kind":"arxiv","version":4},"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/2112.06143/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-05T04:41:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ly73o2xmmCOKwUuZZlNJavDPP/c756VKD15UsZz+MCMKPqr5IExNty8LHk3jk5xsD1ZeiGhckEJl9A7FZIfJCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T21:47:45.458293Z"},"content_sha256":"b92114de7ff6f992a59d9f7a9a16953aeb5ebbc23df88bb15ab06a9d7db38dd5","schema_version":"1.0","event_id":"sha256:b92114de7ff6f992a59d9f7a9a16953aeb5ebbc23df88bb15ab06a9d7db38dd5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6EN6GBOK2HOONGN2UQK6FYN7VN/bundle.json","state_url":"https://pith.science/pith/6EN6GBOK2HOONGN2UQK6FYN7VN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6EN6GBOK2HOONGN2UQK6FYN7VN/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-03T21:47:45Z","links":{"resolver":"https://pith.science/pith/6EN6GBOK2HOONGN2UQK6FYN7VN","bundle":"https://pith.science/pith/6EN6GBOK2HOONGN2UQK6FYN7VN/bundle.json","state":"https://pith.science/pith/6EN6GBOK2HOONGN2UQK6FYN7VN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6EN6GBOK2HOONGN2UQK6FYN7VN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:6EN6GBOK2HOONGN2UQK6FYN7VN","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":"4e088dbd99337328798f791eca1e491cc247c11ea61614d99e71ca7d2ccbdd47","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"quant-ph","submitted_at":"2021-12-12T04:00:45Z","title_canon_sha256":"f31e250aabbf127712b07470d6ce96defe9d5dcc678a7b049d8be84be5a288c2"},"schema_version":"1.0","source":{"id":"2112.06143","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2112.06143","created_at":"2026-07-05T04:41:53Z"},{"alias_kind":"arxiv_version","alias_value":"2112.06143v4","created_at":"2026-07-05T04:41:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2112.06143","created_at":"2026-07-05T04:41:53Z"},{"alias_kind":"pith_short_12","alias_value":"6EN6GBOK2HOO","created_at":"2026-07-05T04:41:53Z"},{"alias_kind":"pith_short_16","alias_value":"6EN6GBOK2HOONGN2","created_at":"2026-07-05T04:41:53Z"},{"alias_kind":"pith_short_8","alias_value":"6EN6GBOK","created_at":"2026-07-05T04:41:53Z"}],"graph_snapshots":[{"event_id":"sha256:b92114de7ff6f992a59d9f7a9a16953aeb5ebbc23df88bb15ab06a9d7db38dd5","target":"graph","created_at":"2026-07-05T04:41:53Z","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/2112.06143/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Quantum Approximation Optimization Algorithm (QAOA) is a highly advocated variational algorithm for solving the combinatorial optimization problem. One critical feature in the quantum circuit of QAOA algorithm is that it consists of two-qubit operators that commute. The flexibility in reordering the two-qubit gates allows compiler optimizations to generate circuits with better depths, gate count, and fidelity. However, it also imposes significant challenges due to additional freedom exposed in the compilation. Prior studies lack the following: (1) Performance guarantee, (2) Scalability, and (3","authors_text":"Ari B. Hayes, Chi Zhang, Eddy Z. Zhang, Fei Hua, Jason Luo, Lucent Fong, Yanhao Chen, Yuwei Jin","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"quant-ph","submitted_at":"2021-12-12T04:00:45Z","title":"A Structured Method for Compilation of QAOA Circuits in Quantum Computing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2112.06143","kind":"arxiv","version":4},"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:3b19ffde9a58d428f137eccd6887f98e00f890e0341c9c0b894341023a1c4737","target":"record","created_at":"2026-07-05T04:41:53Z","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":"4e088dbd99337328798f791eca1e491cc247c11ea61614d99e71ca7d2ccbdd47","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"quant-ph","submitted_at":"2021-12-12T04:00:45Z","title_canon_sha256":"f31e250aabbf127712b07470d6ce96defe9d5dcc678a7b049d8be84be5a288c2"},"schema_version":"1.0","source":{"id":"2112.06143","kind":"arxiv","version":4}},"canonical_sha256":"f11be305cad1dce699baa415e2e1bfab78072401767a93939dc6a53435f4ad8a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f11be305cad1dce699baa415e2e1bfab78072401767a93939dc6a53435f4ad8a","first_computed_at":"2026-07-05T04:41:53.030670Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:41:53.030670Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sSyHb0xA73vVUmd0DCeivw18nP5QShv0fQgD04efH9zTGHt0qT/vXb579upzNXmPJViNzyjxV97be1kYeuZbCg==","signature_status":"signed_v1","signed_at":"2026-07-05T04:41:53.031262Z","signed_message":"canonical_sha256_bytes"},"source_id":"2112.06143","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3b19ffde9a58d428f137eccd6887f98e00f890e0341c9c0b894341023a1c4737","sha256:b92114de7ff6f992a59d9f7a9a16953aeb5ebbc23df88bb15ab06a9d7db38dd5"],"state_sha256":"049e0a54a7d3a64dbc6b4e3ffb34a2ad44cb717c0b209f5bbcde517fdaf5d2ab"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HXdp6hbeWMS8xZBJnWRBlJo1mEkgUp9dRTK9sJhX1HlbsKuGgHJsFbP2KEB1BBikQ8wjOTpJjGFLE96e8KkOCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-03T21:47:45.463046Z","bundle_sha256":"a496d2e41df7223cdc60b25e9d69d885896f5f8edbb667a42cdab6da421ac41b"}}