{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:4JJQYG3LJCY372ITPR4BWXO7Q3","short_pith_number":"pith:4JJQYG3L","schema_version":"1.0","canonical_sha256":"e2530c1b6b48b1bfe9137c781b5ddf86c8c7c19f7d04dd2ead9549fc6349c47d","source":{"kind":"arxiv","id":"2110.10685","version":1},"attestation_state":"computed","paper":{"title":"Predicting parameters for the Quantum Approximate Optimization Algorithm for MAX-CUT from the infinite-size limit","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"quant-ph","authors_text":"Ashley Montanaro, Sami Boulebnane","submitted_at":"2021-10-20T17:58:53Z","abstract_excerpt":"Combinatorial optimization is regarded as a potentially promising application of near and long-term quantum computers. The best-known heuristic quantum algorithm for combinatorial optimization on gate-based devices, the Quantum Approximate Optimization Algorithm (QAOA), has been the subject of many theoretical and empirical studies. Unfortunately, its application to specific combinatorial optimization problems poses several difficulties: among these, few performance guarantees are known, and the variational nature of the algorithm makes it necessary to classically optimize a number of paramete"},"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":"2110.10685","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2021-10-20T17:58:53Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"f54e605c7dc50881763de80ea38bb46f92fa5220194694c40a6703eb4a2c0133","abstract_canon_sha256":"3c540d3da6c75a0576c8384eec15e36a4a7e4fd5747d879b21b1f27286d21f36"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:24:20.366311Z","signature_b64":"tnj+V7Up0wUTclvTytnWnqbtzeIDaRElUxYBvMyejHRtY5wdWXhDZZC29tIb1dhn8f3l3kBWO/vSj4eYsvzfDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e2530c1b6b48b1bfe9137c781b5ddf86c8c7c19f7d04dd2ead9549fc6349c47d","last_reissued_at":"2026-07-05T03:24:20.365838Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:24:20.365838Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Predicting parameters for the Quantum Approximate Optimization Algorithm for MAX-CUT from the infinite-size limit","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"quant-ph","authors_text":"Ashley Montanaro, Sami Boulebnane","submitted_at":"2021-10-20T17:58:53Z","abstract_excerpt":"Combinatorial optimization is regarded as a potentially promising application of near and long-term quantum computers. The best-known heuristic quantum algorithm for combinatorial optimization on gate-based devices, the Quantum Approximate Optimization Algorithm (QAOA), has been the subject of many theoretical and empirical studies. Unfortunately, its application to specific combinatorial optimization problems poses several difficulties: among these, few performance guarantees are known, and the variational nature of the algorithm makes it necessary to classically optimize a number of paramete"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2110.10685","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/2110.10685/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":"2110.10685","created_at":"2026-07-05T03:24:20.365898+00:00"},{"alias_kind":"arxiv_version","alias_value":"2110.10685v1","created_at":"2026-07-05T03:24:20.365898+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2110.10685","created_at":"2026-07-05T03:24:20.365898+00:00"},{"alias_kind":"pith_short_12","alias_value":"4JJQYG3LJCY3","created_at":"2026-07-05T03:24:20.365898+00:00"},{"alias_kind":"pith_short_16","alias_value":"4JJQYG3LJCY372IT","created_at":"2026-07-05T03:24:20.365898+00:00"},{"alias_kind":"pith_short_8","alias_value":"4JJQYG3L","created_at":"2026-07-05T03:24:20.365898+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.09773","citing_title":"From Pauli Strings to Quantum Dynamics: A Unified Characterization","ref_index":195,"is_internal_anchor":false},{"citing_arxiv_id":"2306.11060","citing_title":"PCA and t-SNE analysis in the study of QAOA entangled and non-entangled mixing operators","ref_index":17,"is_internal_anchor":false},{"citing_arxiv_id":"2509.13528","citing_title":"Evaluating the Limits of QAOA Parameter Transfer at High-Rounds on Sparse Ising Models With Geometrically Local Cubic Terms","ref_index":21,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4JJQYG3LJCY372ITPR4BWXO7Q3","json":"https://pith.science/pith/4JJQYG3LJCY372ITPR4BWXO7Q3.json","graph_json":"https://pith.science/api/pith-number/4JJQYG3LJCY372ITPR4BWXO7Q3/graph.json","events_json":"https://pith.science/api/pith-number/4JJQYG3LJCY372ITPR4BWXO7Q3/events.json","paper":"https://pith.science/paper/4JJQYG3L"},"agent_actions":{"view_html":"https://pith.science/pith/4JJQYG3LJCY372ITPR4BWXO7Q3","download_json":"https://pith.science/pith/4JJQYG3LJCY372ITPR4BWXO7Q3.json","view_paper":"https://pith.science/paper/4JJQYG3L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2110.10685&json=true","fetch_graph":"https://pith.science/api/pith-number/4JJQYG3LJCY372ITPR4BWXO7Q3/graph.json","fetch_events":"https://pith.science/api/pith-number/4JJQYG3LJCY372ITPR4BWXO7Q3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4JJQYG3LJCY372ITPR4BWXO7Q3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4JJQYG3LJCY372ITPR4BWXO7Q3/action/storage_attestation","attest_author":"https://pith.science/pith/4JJQYG3LJCY372ITPR4BWXO7Q3/action/author_attestation","sign_citation":"https://pith.science/pith/4JJQYG3LJCY372ITPR4BWXO7Q3/action/citation_signature","submit_replication":"https://pith.science/pith/4JJQYG3LJCY372ITPR4BWXO7Q3/action/replication_record"}},"created_at":"2026-07-05T03:24:20.365898+00:00","updated_at":"2026-07-05T03:24:20.365898+00:00"}