{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:QNZHJPTPRSEHAST2W3JLLUAIST","short_pith_number":"pith:QNZHJPTP","schema_version":"1.0","canonical_sha256":"837274be6f8c88704a7ab6d2b5d00894c5b317c2792346d44859284d3b383883","source":{"kind":"arxiv","id":"1905.08768","version":3},"attestation_state":"computed","paper":{"title":"Multistart Methods for Quantum Approximate Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Ilya Safro, Jeffrey Larson, Ruslan Shaydulin","submitted_at":"2019-05-21T17:39:38Z","abstract_excerpt":"Hybrid quantum-classical algorithms such as the quantum approximate optimization algorithm (QAOA) are considered one of the most promising approaches for leveraging near-term quantum computers for practical applications. Such algorithms are often implemented in a variational form, combining classical optimization methods with a quantum machine to find parameters to maximize performance. The quality of the QAOA solution depends heavily on quality of the parameters produced by the classical optimizer. Moreover, the presence of multiple local optima in the space of parameters makes it harder for "},"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":"1905.08768","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-05-21T17:39:38Z","cross_cats_sorted":[],"title_canon_sha256":"0ddd0f0832a75b8f138b85cdd4a96f4967883d5557fed40719e8476f2290dee8","abstract_canon_sha256":"19e64d672087ae21e7788fa274f0d3727ecb57e662ed2f127e38235dc219d768"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:31:54.846161Z","signature_b64":"DaXlimm4QZ/1u3hlVj7Ee6Coh8vOPr7OHyj9wnLHKe9TcJLGRCZ7NR+0pFG5i25DYg+gAVxhehtSU+hAWFLkDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"837274be6f8c88704a7ab6d2b5d00894c5b317c2792346d44859284d3b383883","last_reissued_at":"2026-07-05T04:31:54.845680Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:31:54.845680Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multistart Methods for Quantum Approximate Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Ilya Safro, Jeffrey Larson, Ruslan Shaydulin","submitted_at":"2019-05-21T17:39:38Z","abstract_excerpt":"Hybrid quantum-classical algorithms such as the quantum approximate optimization algorithm (QAOA) are considered one of the most promising approaches for leveraging near-term quantum computers for practical applications. Such algorithms are often implemented in a variational form, combining classical optimization methods with a quantum machine to find parameters to maximize performance. The quality of the QAOA solution depends heavily on quality of the parameters produced by the classical optimizer. Moreover, the presence of multiple local optima in the space of parameters makes it harder for "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.08768","kind":"arxiv","version":3},"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/1905.08768/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":"1905.08768","created_at":"2026-07-05T04:31:54.845753+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.08768v3","created_at":"2026-07-05T04:31:54.845753+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.08768","created_at":"2026-07-05T04:31:54.845753+00:00"},{"alias_kind":"pith_short_12","alias_value":"QNZHJPTPRSEH","created_at":"2026-07-05T04:31:54.845753+00:00"},{"alias_kind":"pith_short_16","alias_value":"QNZHJPTPRSEHAST2","created_at":"2026-07-05T04:31:54.845753+00:00"},{"alias_kind":"pith_short_8","alias_value":"QNZHJPTP","created_at":"2026-07-05T04:31:54.845753+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.28866","citing_title":"Quantum Variational Approaches to the Maximum Independent Set Problem at Utility Scale","ref_index":35,"is_internal_anchor":false},{"citing_arxiv_id":"2606.28866","citing_title":"Quantum Variational Approaches to the Maximum Independent Set Problem at Utility Scale","ref_index":35,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QNZHJPTPRSEHAST2W3JLLUAIST","json":"https://pith.science/pith/QNZHJPTPRSEHAST2W3JLLUAIST.json","graph_json":"https://pith.science/api/pith-number/QNZHJPTPRSEHAST2W3JLLUAIST/graph.json","events_json":"https://pith.science/api/pith-number/QNZHJPTPRSEHAST2W3JLLUAIST/events.json","paper":"https://pith.science/paper/QNZHJPTP"},"agent_actions":{"view_html":"https://pith.science/pith/QNZHJPTPRSEHAST2W3JLLUAIST","download_json":"https://pith.science/pith/QNZHJPTPRSEHAST2W3JLLUAIST.json","view_paper":"https://pith.science/paper/QNZHJPTP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.08768&json=true","fetch_graph":"https://pith.science/api/pith-number/QNZHJPTPRSEHAST2W3JLLUAIST/graph.json","fetch_events":"https://pith.science/api/pith-number/QNZHJPTPRSEHAST2W3JLLUAIST/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QNZHJPTPRSEHAST2W3JLLUAIST/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QNZHJPTPRSEHAST2W3JLLUAIST/action/storage_attestation","attest_author":"https://pith.science/pith/QNZHJPTPRSEHAST2W3JLLUAIST/action/author_attestation","sign_citation":"https://pith.science/pith/QNZHJPTPRSEHAST2W3JLLUAIST/action/citation_signature","submit_replication":"https://pith.science/pith/QNZHJPTPRSEHAST2W3JLLUAIST/action/replication_record"}},"created_at":"2026-07-05T04:31:54.845753+00:00","updated_at":"2026-07-05T04:31:54.845753+00:00"}