{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:DWS3PFPCDJDYJXAFJ6DD7AWPYB","short_pith_number":"pith:DWS3PFPC","canonical_record":{"source":{"id":"2307.15260","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-07-28T02:06:42Z","cross_cats_sorted":[],"title_canon_sha256":"3f7416327850e3a46dbb1defedc579f2e928b4a441c5ab3385ced4e1732ee12d","abstract_canon_sha256":"1e514ea841da296f325b40e12e0cf51db7a9979854ac6829a181be52133aef68"},"schema_version":"1.0"},"canonical_sha256":"1da5b795e21a4784dc054f863f82cfc07865195a24a6eb4ba67d9267ed9db5bd","source":{"kind":"arxiv","id":"2307.15260","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2307.15260","created_at":"2026-07-05T06:35:32Z"},{"alias_kind":"arxiv_version","alias_value":"2307.15260v1","created_at":"2026-07-05T06:35:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.15260","created_at":"2026-07-05T06:35:32Z"},{"alias_kind":"pith_short_12","alias_value":"DWS3PFPCDJDY","created_at":"2026-07-05T06:35:32Z"},{"alias_kind":"pith_short_16","alias_value":"DWS3PFPCDJDYJXAF","created_at":"2026-07-05T06:35:32Z"},{"alias_kind":"pith_short_8","alias_value":"DWS3PFPC","created_at":"2026-07-05T06:35:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:DWS3PFPCDJDYJXAFJ6DD7AWPYB","target":"record","payload":{"canonical_record":{"source":{"id":"2307.15260","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-07-28T02:06:42Z","cross_cats_sorted":[],"title_canon_sha256":"3f7416327850e3a46dbb1defedc579f2e928b4a441c5ab3385ced4e1732ee12d","abstract_canon_sha256":"1e514ea841da296f325b40e12e0cf51db7a9979854ac6829a181be52133aef68"},"schema_version":"1.0"},"canonical_sha256":"1da5b795e21a4784dc054f863f82cfc07865195a24a6eb4ba67d9267ed9db5bd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:35:32.687601Z","signature_b64":"RhGKdZu6GzR+iOXcVYrWcLiUFBrD7XOgtAmVNPkBuovXuWHxrxZ8tWGXf4E5qmtrAtYvguQs8mvexUXGbUZfAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1da5b795e21a4784dc054f863f82cfc07865195a24a6eb4ba67d9267ed9db5bd","last_reissued_at":"2026-07-05T06:35:32.687196Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:35:32.687196Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2307.15260","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-07-05T06:35:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4kAvvlKVcbHANGlXnkV5QbzVeOopyNf/R8Wf4wy9FAbbQAjDqdRTX/F0qFm8O1VAyBZmsYNb+swCMeqTsQfQDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T18:06:50.160717Z"},"content_sha256":"bd30a6de6cae34a7c3006dbe6e82349bc107b5e22030d01dc958c02f45535017","schema_version":"1.0","event_id":"sha256:bd30a6de6cae34a7c3006dbe6e82349bc107b5e22030d01dc958c02f45535017"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:DWS3PFPCDJDYJXAFJ6DD7AWPYB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"QAOA with fewer qubits: a coupling framework to solve larger-scale Max-Cut problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Guojing Tian, Xiaoming Sun, Yiren Lu","submitted_at":"2023-07-28T02:06:42Z","abstract_excerpt":"Maximum cut (Max-Cut) problem is one of the most important combinatorial optimization problems because of its various applications in real life, and recently Quantum Approximate Optimization Algorithm (QAOA) has been widely employed to solve it. However, as the size of the problem increases, the number of qubits required will become larger. With the aim of saving qubits, we propose a coupling framework for designing QAOA circuits to solve larger-scale Max-Cut problem. This framework relies on a classical algorithm that approximately solves a certain variant of Max-Cut, and we derive an approxi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.15260","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2307.15260/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-05T06:35:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hRqetEW/KOdeDGhtFHuJX6bT350w4HhiIaG0lo8vf7kG0CtHuOQTm2BgLU3jHNVOjjDO03FWOl3aNak9l4KJCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T18:06:50.161118Z"},"content_sha256":"77f4bfb8229fa5b6c27addaacc90658499236f30126be3cdc596bc8f6fdd7f19","schema_version":"1.0","event_id":"sha256:77f4bfb8229fa5b6c27addaacc90658499236f30126be3cdc596bc8f6fdd7f19"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DWS3PFPCDJDYJXAFJ6DD7AWPYB/bundle.json","state_url":"https://pith.science/pith/DWS3PFPCDJDYJXAFJ6DD7AWPYB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DWS3PFPCDJDYJXAFJ6DD7AWPYB/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-03T18:06:50Z","links":{"resolver":"https://pith.science/pith/DWS3PFPCDJDYJXAFJ6DD7AWPYB","bundle":"https://pith.science/pith/DWS3PFPCDJDYJXAFJ6DD7AWPYB/bundle.json","state":"https://pith.science/pith/DWS3PFPCDJDYJXAFJ6DD7AWPYB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DWS3PFPCDJDYJXAFJ6DD7AWPYB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:DWS3PFPCDJDYJXAFJ6DD7AWPYB","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":"1e514ea841da296f325b40e12e0cf51db7a9979854ac6829a181be52133aef68","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-07-28T02:06:42Z","title_canon_sha256":"3f7416327850e3a46dbb1defedc579f2e928b4a441c5ab3385ced4e1732ee12d"},"schema_version":"1.0","source":{"id":"2307.15260","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2307.15260","created_at":"2026-07-05T06:35:32Z"},{"alias_kind":"arxiv_version","alias_value":"2307.15260v1","created_at":"2026-07-05T06:35:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.15260","created_at":"2026-07-05T06:35:32Z"},{"alias_kind":"pith_short_12","alias_value":"DWS3PFPCDJDY","created_at":"2026-07-05T06:35:32Z"},{"alias_kind":"pith_short_16","alias_value":"DWS3PFPCDJDYJXAF","created_at":"2026-07-05T06:35:32Z"},{"alias_kind":"pith_short_8","alias_value":"DWS3PFPC","created_at":"2026-07-05T06:35:32Z"}],"graph_snapshots":[{"event_id":"sha256:77f4bfb8229fa5b6c27addaacc90658499236f30126be3cdc596bc8f6fdd7f19","target":"graph","created_at":"2026-07-05T06:35:32Z","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/2307.15260/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Maximum cut (Max-Cut) problem is one of the most important combinatorial optimization problems because of its various applications in real life, and recently Quantum Approximate Optimization Algorithm (QAOA) has been widely employed to solve it. However, as the size of the problem increases, the number of qubits required will become larger. With the aim of saving qubits, we propose a coupling framework for designing QAOA circuits to solve larger-scale Max-Cut problem. This framework relies on a classical algorithm that approximately solves a certain variant of Max-Cut, and we derive an approxi","authors_text":"Guojing Tian, Xiaoming Sun, Yiren Lu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-07-28T02:06:42Z","title":"QAOA with fewer qubits: a coupling framework to solve larger-scale Max-Cut problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.15260","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:bd30a6de6cae34a7c3006dbe6e82349bc107b5e22030d01dc958c02f45535017","target":"record","created_at":"2026-07-05T06:35:32Z","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":"1e514ea841da296f325b40e12e0cf51db7a9979854ac6829a181be52133aef68","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-07-28T02:06:42Z","title_canon_sha256":"3f7416327850e3a46dbb1defedc579f2e928b4a441c5ab3385ced4e1732ee12d"},"schema_version":"1.0","source":{"id":"2307.15260","kind":"arxiv","version":1}},"canonical_sha256":"1da5b795e21a4784dc054f863f82cfc07865195a24a6eb4ba67d9267ed9db5bd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1da5b795e21a4784dc054f863f82cfc07865195a24a6eb4ba67d9267ed9db5bd","first_computed_at":"2026-07-05T06:35:32.687196Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:35:32.687196Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RhGKdZu6GzR+iOXcVYrWcLiUFBrD7XOgtAmVNPkBuovXuWHxrxZ8tWGXf4E5qmtrAtYvguQs8mvexUXGbUZfAw==","signature_status":"signed_v1","signed_at":"2026-07-05T06:35:32.687601Z","signed_message":"canonical_sha256_bytes"},"source_id":"2307.15260","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bd30a6de6cae34a7c3006dbe6e82349bc107b5e22030d01dc958c02f45535017","sha256:77f4bfb8229fa5b6c27addaacc90658499236f30126be3cdc596bc8f6fdd7f19"],"state_sha256":"02f905a2fee2bb628f310596fe179e32563bb254e018ad1826bec360ac7120f6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uM3G6HAgqXrNUmhJgh4iRbpi4c35aUZ1gtKhpvR6ucoxPW5PKBkxwPKGuP/rVBQA2im73Xb8sFSpcv1xGEk7AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-03T18:06:50.163697Z","bundle_sha256":"f47ab24b1e9680b76a5a51169020cec47e186035cf8d79a85695ce172cb7d9f5"}}