{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:HXJDJBWDFGCDDBS5WNCZAJROHO","short_pith_number":"pith:HXJDJBWD","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"},"canonical_sha256":"3dd23486c3298431865db34590262e3bb18fe16e3b183103eea1229d267b2332","source":{"kind":"arxiv","id":"2504.08577","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2504.08577","created_at":"2026-06-01T02:03:23Z"},{"alias_kind":"arxiv_version","alias_value":"2504.08577v2","created_at":"2026-06-01T02:03:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.08577","created_at":"2026-06-01T02:03:23Z"},{"alias_kind":"pith_short_12","alias_value":"HXJDJBWDFGCD","created_at":"2026-06-01T02:03:23Z"},{"alias_kind":"pith_short_16","alias_value":"HXJDJBWDFGCDDBS5","created_at":"2026-06-01T02:03:23Z"},{"alias_kind":"pith_short_8","alias_value":"HXJDJBWD","created_at":"2026-06-01T02:03:23Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:HXJDJBWDFGCDDBS5WNCZAJROHO","target":"record","payload":{"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"},"canonical_sha256":"3dd23486c3298431865db34590262e3bb18fe16e3b183103eea1229d267b2332","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"},"source_kind":"arxiv","source_id":"2504.08577","source_version":2,"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-06-01T02:03:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9BgnldjeWRPDBa4oTsXPJXMdS9eNmdctzPGz+km0UHETM8OeTWT+AXJdkEgTrnzu810RMNyJAJkz/FkZjuBxDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T20:33:41.426467Z"},"content_sha256":"999a10dace17f9a559755fe80bda8ba4b2276f83a996d20d1abd91489c42fbe3","schema_version":"1.0","event_id":"sha256:999a10dace17f9a559755fe80bda8ba4b2276f83a996d20d1abd91489c42fbe3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:HXJDJBWDFGCDDBS5WNCZAJROHO","target":"graph","payload":{"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"},"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-06-01T02:03:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"esosnzmyVgX4910MnmB9SBRVeEoV89/tWgdciiv6nEdkHbVkIo9LbzfCj1uElaL4eYitd6IoM/FL+1qJOTT7CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T20:33:41.427248Z"},"content_sha256":"81d088a9e168af736e1a44dfd6fa82ec12385f29903f243d1c30e56128c07107","schema_version":"1.0","event_id":"sha256:81d088a9e168af736e1a44dfd6fa82ec12385f29903f243d1c30e56128c07107"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HXJDJBWDFGCDDBS5WNCZAJROHO/bundle.json","state_url":"https://pith.science/pith/HXJDJBWDFGCDDBS5WNCZAJROHO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HXJDJBWDFGCDDBS5WNCZAJROHO/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-06-08T20:33:41Z","links":{"resolver":"https://pith.science/pith/HXJDJBWDFGCDDBS5WNCZAJROHO","bundle":"https://pith.science/pith/HXJDJBWDFGCDDBS5WNCZAJROHO/bundle.json","state":"https://pith.science/pith/HXJDJBWDFGCDDBS5WNCZAJROHO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HXJDJBWDFGCDDBS5WNCZAJROHO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:HXJDJBWDFGCDDBS5WNCZAJROHO","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":"f50338a1862122a83623e753a9dff85fe8ed803f55c2b78344022ef4fb8bc447","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-04-11T14:30:26Z","title_canon_sha256":"037da234ee11140318fbf6ad5982452db68837e8e1c7d2cb734e9f3456fa52e1"},"schema_version":"1.0","source":{"id":"2504.08577","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2504.08577","created_at":"2026-06-01T02:03:23Z"},{"alias_kind":"arxiv_version","alias_value":"2504.08577v2","created_at":"2026-06-01T02:03:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.08577","created_at":"2026-06-01T02:03:23Z"},{"alias_kind":"pith_short_12","alias_value":"HXJDJBWDFGCD","created_at":"2026-06-01T02:03:23Z"},{"alias_kind":"pith_short_16","alias_value":"HXJDJBWDFGCDDBS5","created_at":"2026-06-01T02:03:23Z"},{"alias_kind":"pith_short_8","alias_value":"HXJDJBWD","created_at":"2026-06-01T02:03:23Z"}],"graph_snapshots":[{"event_id":"sha256:81d088a9e168af736e1a44dfd6fa82ec12385f29903f243d1c30e56128c07107","target":"graph","created_at":"2026-06-01T02:03:23Z","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/2504.08577/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Florentin Reiter, Gerhard Hellstern, Karthik Jayadevan, Martin Zaefferer, Thomas Wellens, Vanessa Dehn","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-04-11T14:30:26Z","title":"Extrapolation method to optimize linear-ramp QAOA parameters: Evaluation of QAOA runtime scaling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.08577","kind":"arxiv","version":2},"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:999a10dace17f9a559755fe80bda8ba4b2276f83a996d20d1abd91489c42fbe3","target":"record","created_at":"2026-06-01T02:03:23Z","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":"f50338a1862122a83623e753a9dff85fe8ed803f55c2b78344022ef4fb8bc447","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-04-11T14:30:26Z","title_canon_sha256":"037da234ee11140318fbf6ad5982452db68837e8e1c7d2cb734e9f3456fa52e1"},"schema_version":"1.0","source":{"id":"2504.08577","kind":"arxiv","version":2}},"canonical_sha256":"3dd23486c3298431865db34590262e3bb18fe16e3b183103eea1229d267b2332","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3dd23486c3298431865db34590262e3bb18fe16e3b183103eea1229d267b2332","first_computed_at":"2026-06-01T02:03:23.281848Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-01T02:03:23.281848Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"abg1D0TqrT2OO7StZ0Cqju3ZoqZHkQy/pKy5iu8kGhYx/Ec4YwkJUNb42hwHeedqlEagIxoJHvNTlKobmGOQBg==","signature_status":"signed_v1","signed_at":"2026-06-01T02:03:23.284182Z","signed_message":"canonical_sha256_bytes"},"source_id":"2504.08577","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:999a10dace17f9a559755fe80bda8ba4b2276f83a996d20d1abd91489c42fbe3","sha256:81d088a9e168af736e1a44dfd6fa82ec12385f29903f243d1c30e56128c07107"],"state_sha256":"321951f8984b4988cc8fd4c1a7d4b9691104734ec77d257b16da925790c8b326"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GgKN5Cj493aL8UPJVNpXziV9Inro14+cnbZ7flJ1Oc66oUJ7sTDJYkyywXuYM1pXGGrKnCQy7BQKC+pyO2FRCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T20:33:41.431569Z","bundle_sha256":"928069fb22a56b589b498ce51e7981fcd19a7fbd788ae126d48e2846f498058f"}}