{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:PON6N7J3XQVDHVHZHV6ZGGTTFQ","short_pith_number":"pith:PON6N7J3","canonical_record":{"source":{"id":"2205.11762","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2022-05-24T03:49:10Z","cross_cats_sorted":[],"title_canon_sha256":"f9e40af44f8d34aff19ef109e4fdeae9cf1e291cfd5c3230e85bcf0d2e4e1f0d","abstract_canon_sha256":"aa6998f478c9fed21157e05d97e75323e5fd286ad60fe0eeaf17ae34f579dea2"},"schema_version":"1.0"},"canonical_sha256":"7b9be6fd3bbc2a33d4f93d7d931a732c3560b0dc82221b5f81d0c8462cfdd245","source":{"kind":"arxiv","id":"2205.11762","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2205.11762","created_at":"2026-07-05T04:26:08Z"},{"alias_kind":"arxiv_version","alias_value":"2205.11762v1","created_at":"2026-07-05T04:26:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.11762","created_at":"2026-07-05T04:26:08Z"},{"alias_kind":"pith_short_12","alias_value":"PON6N7J3XQVD","created_at":"2026-07-05T04:26:08Z"},{"alias_kind":"pith_short_16","alias_value":"PON6N7J3XQVDHVHZ","created_at":"2026-07-05T04:26:08Z"},{"alias_kind":"pith_short_8","alias_value":"PON6N7J3","created_at":"2026-07-05T04:26:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:PON6N7J3XQVDHVHZHV6ZGGTTFQ","target":"record","payload":{"canonical_record":{"source":{"id":"2205.11762","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2022-05-24T03:49:10Z","cross_cats_sorted":[],"title_canon_sha256":"f9e40af44f8d34aff19ef109e4fdeae9cf1e291cfd5c3230e85bcf0d2e4e1f0d","abstract_canon_sha256":"aa6998f478c9fed21157e05d97e75323e5fd286ad60fe0eeaf17ae34f579dea2"},"schema_version":"1.0"},"canonical_sha256":"7b9be6fd3bbc2a33d4f93d7d931a732c3560b0dc82221b5f81d0c8462cfdd245","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:26:08.157507Z","signature_b64":"CDsX0UTcn8a4NLvJq7kIuzyjiXcKDSZ9IBni7kd/e/cVWzZ4+1HnWoNuyWifUnBBcsXdm90v7ce9S6/eR8X8Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7b9be6fd3bbc2a33d4f93d7d931a732c3560b0dc82221b5f81d0c8462cfdd245","last_reissued_at":"2026-07-05T04:26:08.157077Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:26:08.157077Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2205.11762","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-05T04:26:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5TcimbFe/4SL20h0pRyIyTeASdIOyWYakZ+tKIuJr4FOyIW8ICv/Snz132mrQNfvqSlLNY69U/TsAPTmfiLRBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T23:24:51.657497Z"},"content_sha256":"76b0411da96d94b89b13272825cdca22aac18f3814cbac3cd606af96d318c8e7","schema_version":"1.0","event_id":"sha256:76b0411da96d94b89b13272825cdca22aac18f3814cbac3cd606af96d318c8e7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:PON6N7J3XQVDHVHZHV6ZGGTTFQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"QAOA-in-QAOA: solving large-scale MaxCut problems on small quantum machines","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Dacheng Tao, Xinmei Tian, Yuxuan Du, Zeqiao Zhou","submitted_at":"2022-05-24T03:49:10Z","abstract_excerpt":"The design of fast algorithms for combinatorial optimization greatly contributes to a plethora of domains such as logistics, finance, and chemistry. Quantum approximate optimization algorithms (QAOAs), which utilize the power of quantum machines and inherit the spirit of adiabatic evolution, are novel approaches to tackle combinatorial problems with potential runtime speedups. However, hurdled by the limited quantum resources nowadays, QAOAs are infeasible to manipulate large-scale problems. To address this issue, here we revisit the MaxCut problem via the divide-and-conquer heuristic: seek th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2205.11762","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/2205.11762/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:26:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sh1IkdhGxphjScFPXBJi5ubJSKmQuRBcoTjNS2MmEdjLtOpAiYeZrw5Ve3gXCb27oBpQd0Whw+RdMdP/lsRkCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T23:24:51.658123Z"},"content_sha256":"e296a42ef2b71acd31abc3895bced07d7abb23d92bda72432260f5ca862cb088","schema_version":"1.0","event_id":"sha256:e296a42ef2b71acd31abc3895bced07d7abb23d92bda72432260f5ca862cb088"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PON6N7J3XQVDHVHZHV6ZGGTTFQ/bundle.json","state_url":"https://pith.science/pith/PON6N7J3XQVDHVHZHV6ZGGTTFQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PON6N7J3XQVDHVHZHV6ZGGTTFQ/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-17T23:24:51Z","links":{"resolver":"https://pith.science/pith/PON6N7J3XQVDHVHZHV6ZGGTTFQ","bundle":"https://pith.science/pith/PON6N7J3XQVDHVHZHV6ZGGTTFQ/bundle.json","state":"https://pith.science/pith/PON6N7J3XQVDHVHZHV6ZGGTTFQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PON6N7J3XQVDHVHZHV6ZGGTTFQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:PON6N7J3XQVDHVHZHV6ZGGTTFQ","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":"aa6998f478c9fed21157e05d97e75323e5fd286ad60fe0eeaf17ae34f579dea2","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2022-05-24T03:49:10Z","title_canon_sha256":"f9e40af44f8d34aff19ef109e4fdeae9cf1e291cfd5c3230e85bcf0d2e4e1f0d"},"schema_version":"1.0","source":{"id":"2205.11762","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2205.11762","created_at":"2026-07-05T04:26:08Z"},{"alias_kind":"arxiv_version","alias_value":"2205.11762v1","created_at":"2026-07-05T04:26:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.11762","created_at":"2026-07-05T04:26:08Z"},{"alias_kind":"pith_short_12","alias_value":"PON6N7J3XQVD","created_at":"2026-07-05T04:26:08Z"},{"alias_kind":"pith_short_16","alias_value":"PON6N7J3XQVDHVHZ","created_at":"2026-07-05T04:26:08Z"},{"alias_kind":"pith_short_8","alias_value":"PON6N7J3","created_at":"2026-07-05T04:26:08Z"}],"graph_snapshots":[{"event_id":"sha256:e296a42ef2b71acd31abc3895bced07d7abb23d92bda72432260f5ca862cb088","target":"graph","created_at":"2026-07-05T04:26:08Z","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/2205.11762/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The design of fast algorithms for combinatorial optimization greatly contributes to a plethora of domains such as logistics, finance, and chemistry. Quantum approximate optimization algorithms (QAOAs), which utilize the power of quantum machines and inherit the spirit of adiabatic evolution, are novel approaches to tackle combinatorial problems with potential runtime speedups. However, hurdled by the limited quantum resources nowadays, QAOAs are infeasible to manipulate large-scale problems. To address this issue, here we revisit the MaxCut problem via the divide-and-conquer heuristic: seek th","authors_text":"Dacheng Tao, Xinmei Tian, Yuxuan Du, Zeqiao Zhou","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2022-05-24T03:49:10Z","title":"QAOA-in-QAOA: solving large-scale MaxCut problems on small quantum machines"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2205.11762","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:76b0411da96d94b89b13272825cdca22aac18f3814cbac3cd606af96d318c8e7","target":"record","created_at":"2026-07-05T04:26:08Z","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":"aa6998f478c9fed21157e05d97e75323e5fd286ad60fe0eeaf17ae34f579dea2","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2022-05-24T03:49:10Z","title_canon_sha256":"f9e40af44f8d34aff19ef109e4fdeae9cf1e291cfd5c3230e85bcf0d2e4e1f0d"},"schema_version":"1.0","source":{"id":"2205.11762","kind":"arxiv","version":1}},"canonical_sha256":"7b9be6fd3bbc2a33d4f93d7d931a732c3560b0dc82221b5f81d0c8462cfdd245","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7b9be6fd3bbc2a33d4f93d7d931a732c3560b0dc82221b5f81d0c8462cfdd245","first_computed_at":"2026-07-05T04:26:08.157077Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:26:08.157077Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CDsX0UTcn8a4NLvJq7kIuzyjiXcKDSZ9IBni7kd/e/cVWzZ4+1HnWoNuyWifUnBBcsXdm90v7ce9S6/eR8X8Aw==","signature_status":"signed_v1","signed_at":"2026-07-05T04:26:08.157507Z","signed_message":"canonical_sha256_bytes"},"source_id":"2205.11762","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:76b0411da96d94b89b13272825cdca22aac18f3814cbac3cd606af96d318c8e7","sha256:e296a42ef2b71acd31abc3895bced07d7abb23d92bda72432260f5ca862cb088"],"state_sha256":"e09db2d63c285ee978f4dc29ea8e2087989f816ccd7824ba92ec5a9fe09c99b4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wyzZAuRsXD2SibAd8Rbx0j8VBgqgnqWahyCyUEos8Fzm7RERUhGhmM33HUpGufUDV/xOJDrsBWeE4zHKkiVXAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-17T23:24:51.662735Z","bundle_sha256":"ccdfe111898f1dd05b7d3cd6638d2ff139d10bfc49e341ee5d141075031f56ca"}}