{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:73D2IUGIZ7XHQTVZC3JMPZEPC3","short_pith_number":"pith:73D2IUGI","schema_version":"1.0","canonical_sha256":"fec7a450c8cfee784eb916d2c7e48f16c7d73cc36ffdaceabd28320d67d90b6c","source":{"kind":"arxiv","id":"2106.07531","version":1},"attestation_state":"computed","paper":{"title":"Transferability of optimal QAOA parameters between random graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Alexey Galda, Danylo Lykov, Ilya Safro, Xiaoyuan Liu, Yuri Alexeev","submitted_at":"2021-06-14T15:57:47Z","abstract_excerpt":"The Quantum approximate optimization algorithm (QAOA) is one of the most promising candidates for achieving quantum advantage through quantum-enhanced combinatorial optimization. In a typical QAOA setup, a set of quantum circuit parameters is optimized to prepare a quantum state used to find the optimal solution of a combinatorial optimization problem. Several empirical observations about optimal parameter concentration effects for special QAOA MaxCut problem instances have been made in recent literature, however, a rigorous study of the subject is still lacking. We show that convergence of th"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2106.07531","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2021-06-14T15:57:47Z","cross_cats_sorted":[],"title_canon_sha256":"62969c35fb84f02486667773d3a18fcc9ce64556bc7d062946444ca4bd28d939","abstract_canon_sha256":"ec391930b150940fd6a1779658da0b8d8d6bd6299922483d6e86169325b18dc2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:49:05.991035Z","signature_b64":"A1CJhVxL0FtJqB29CuGWIwlX1pjjWMPbK3JI3v/OWiCDtJv9w2LM6k0VZG4naANZzyvR+UBBrBAkagNH+NLZAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fec7a450c8cfee784eb916d2c7e48f16c7d73cc36ffdaceabd28320d67d90b6c","last_reissued_at":"2026-07-05T02:49:05.990614Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:49:05.990614Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Transferability of optimal QAOA parameters between random graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Alexey Galda, Danylo Lykov, Ilya Safro, Xiaoyuan Liu, Yuri Alexeev","submitted_at":"2021-06-14T15:57:47Z","abstract_excerpt":"The Quantum approximate optimization algorithm (QAOA) is one of the most promising candidates for achieving quantum advantage through quantum-enhanced combinatorial optimization. In a typical QAOA setup, a set of quantum circuit parameters is optimized to prepare a quantum state used to find the optimal solution of a combinatorial optimization problem. Several empirical observations about optimal parameter concentration effects for special QAOA MaxCut problem instances have been made in recent literature, however, a rigorous study of the subject is still lacking. We show that convergence of th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.07531","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/2106.07531/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2106.07531","created_at":"2026-07-05T02:49:05.990681+00:00"},{"alias_kind":"arxiv_version","alias_value":"2106.07531v1","created_at":"2026-07-05T02:49:05.990681+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.07531","created_at":"2026-07-05T02:49:05.990681+00:00"},{"alias_kind":"pith_short_12","alias_value":"73D2IUGIZ7XH","created_at":"2026-07-05T02:49:05.990681+00:00"},{"alias_kind":"pith_short_16","alias_value":"73D2IUGIZ7XHQTVZ","created_at":"2026-07-05T02:49:05.990681+00:00"},{"alias_kind":"pith_short_8","alias_value":"73D2IUGI","created_at":"2026-07-05T02:49:05.990681+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/73D2IUGIZ7XHQTVZC3JMPZEPC3","json":"https://pith.science/pith/73D2IUGIZ7XHQTVZC3JMPZEPC3.json","graph_json":"https://pith.science/api/pith-number/73D2IUGIZ7XHQTVZC3JMPZEPC3/graph.json","events_json":"https://pith.science/api/pith-number/73D2IUGIZ7XHQTVZC3JMPZEPC3/events.json","paper":"https://pith.science/paper/73D2IUGI"},"agent_actions":{"view_html":"https://pith.science/pith/73D2IUGIZ7XHQTVZC3JMPZEPC3","download_json":"https://pith.science/pith/73D2IUGIZ7XHQTVZC3JMPZEPC3.json","view_paper":"https://pith.science/paper/73D2IUGI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2106.07531&json=true","fetch_graph":"https://pith.science/api/pith-number/73D2IUGIZ7XHQTVZC3JMPZEPC3/graph.json","fetch_events":"https://pith.science/api/pith-number/73D2IUGIZ7XHQTVZC3JMPZEPC3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/73D2IUGIZ7XHQTVZC3JMPZEPC3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/73D2IUGIZ7XHQTVZC3JMPZEPC3/action/storage_attestation","attest_author":"https://pith.science/pith/73D2IUGIZ7XHQTVZC3JMPZEPC3/action/author_attestation","sign_citation":"https://pith.science/pith/73D2IUGIZ7XHQTVZC3JMPZEPC3/action/citation_signature","submit_replication":"https://pith.science/pith/73D2IUGIZ7XHQTVZC3JMPZEPC3/action/replication_record"}},"created_at":"2026-07-05T02:49:05.990681+00:00","updated_at":"2026-07-05T02:49:05.990681+00:00"}