{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:HXJDJBWDFGCDDBS5WNCZAJROHO","short_pith_number":"pith:HXJDJBWD","schema_version":"1.0","canonical_sha256":"3dd23486c3298431865db34590262e3bb18fe16e3b183103eea1229d267b2332","source":{"kind":"arxiv","id":"2504.08577","version":2},"attestation_state":"computed","paper":{"title":"Extrapolation method to optimize linear-ramp QAOA parameters: Evaluation of QAOA runtime scaling","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Florentin Reiter, Gerhard Hellstern, Karthik Jayadevan, Martin Zaefferer, Thomas Wellens, Vanessa Dehn","submitted_at":"2025-04-11T14:30:26Z","abstract_excerpt":"The Quantum Approximate Optimization Algorithm (QAOA) has been suggested as a promising candidate for the solution of combinatorial optimization problems. Yet, whether - or under what conditions - it may offer an advantage compared to classical algorithms remains to be proven. Using the standard variational form of QAOA requires a high number of circuit parameters that have to be optimized at a sufficiently large depth, which constitutes a bottleneck for achieving a potential scaling advantage. The linear-ramp QAOA (LR-QAOA) has been proposed to address this issue, as it relies on only two par"},"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":"2504.08577","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-04-11T14:30:26Z","cross_cats_sorted":[],"title_canon_sha256":"037da234ee11140318fbf6ad5982452db68837e8e1c7d2cb734e9f3456fa52e1","abstract_canon_sha256":"f50338a1862122a83623e753a9dff85fe8ed803f55c2b78344022ef4fb8bc447"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-01T02:03:23.284182Z","signature_b64":"abg1D0TqrT2OO7StZ0Cqju3ZoqZHkQy/pKy5iu8kGhYx/Ec4YwkJUNb42hwHeedqlEagIxoJHvNTlKobmGOQBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3dd23486c3298431865db34590262e3bb18fe16e3b183103eea1229d267b2332","last_reissued_at":"2026-06-01T02:03:23.281848Z","signature_status":"signed_v1","first_computed_at":"2026-06-01T02:03:23.281848Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Extrapolation method to optimize linear-ramp QAOA parameters: Evaluation of QAOA runtime scaling","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Florentin Reiter, Gerhard Hellstern, Karthik Jayadevan, Martin Zaefferer, Thomas Wellens, Vanessa Dehn","submitted_at":"2025-04-11T14:30:26Z","abstract_excerpt":"The Quantum Approximate Optimization Algorithm (QAOA) has been suggested as a promising candidate for the solution of combinatorial optimization problems. Yet, whether - or under what conditions - it may offer an advantage compared to classical algorithms remains to be proven. Using the standard variational form of QAOA requires a high number of circuit parameters that have to be optimized at a sufficiently large depth, which constitutes a bottleneck for achieving a potential scaling advantage. The linear-ramp QAOA (LR-QAOA) has been proposed to address this issue, as it relies on only two par"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.08577","kind":"arxiv","version":2},"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/2504.08577/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":"2504.08577","created_at":"2026-06-01T02:03:23.282025+00:00"},{"alias_kind":"arxiv_version","alias_value":"2504.08577v2","created_at":"2026-06-01T02:03:23.282025+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.08577","created_at":"2026-06-01T02:03:23.282025+00:00"},{"alias_kind":"pith_short_12","alias_value":"HXJDJBWDFGCD","created_at":"2026-06-01T02:03:23.282025+00:00"},{"alias_kind":"pith_short_16","alias_value":"HXJDJBWDFGCDDBS5","created_at":"2026-06-01T02:03:23.282025+00:00"},{"alias_kind":"pith_short_8","alias_value":"HXJDJBWD","created_at":"2026-06-01T02:03:23.282025+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2604.11758","citing_title":"Hybrid Quantum-Classical Optimization Workflows for the Shipment Selection Problem","ref_index":13,"is_internal_anchor":true},{"citing_arxiv_id":"2604.06106","citing_title":"Nonvariational quantum optimisation approaches to pangenome-guided sequence assembly","ref_index":17,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HXJDJBWDFGCDDBS5WNCZAJROHO","json":"https://pith.science/pith/HXJDJBWDFGCDDBS5WNCZAJROHO.json","graph_json":"https://pith.science/api/pith-number/HXJDJBWDFGCDDBS5WNCZAJROHO/graph.json","events_json":"https://pith.science/api/pith-number/HXJDJBWDFGCDDBS5WNCZAJROHO/events.json","paper":"https://pith.science/paper/HXJDJBWD"},"agent_actions":{"view_html":"https://pith.science/pith/HXJDJBWDFGCDDBS5WNCZAJROHO","download_json":"https://pith.science/pith/HXJDJBWDFGCDDBS5WNCZAJROHO.json","view_paper":"https://pith.science/paper/HXJDJBWD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2504.08577&json=true","fetch_graph":"https://pith.science/api/pith-number/HXJDJBWDFGCDDBS5WNCZAJROHO/graph.json","fetch_events":"https://pith.science/api/pith-number/HXJDJBWDFGCDDBS5WNCZAJROHO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HXJDJBWDFGCDDBS5WNCZAJROHO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HXJDJBWDFGCDDBS5WNCZAJROHO/action/storage_attestation","attest_author":"https://pith.science/pith/HXJDJBWDFGCDDBS5WNCZAJROHO/action/author_attestation","sign_citation":"https://pith.science/pith/HXJDJBWDFGCDDBS5WNCZAJROHO/action/citation_signature","submit_replication":"https://pith.science/pith/HXJDJBWDFGCDDBS5WNCZAJROHO/action/replication_record"}},"created_at":"2026-06-01T02:03:23.282025+00:00","updated_at":"2026-06-01T02:03:23.282025+00:00"}