{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:RW2RVIAO252BNFVS25D6MHQX42","short_pith_number":"pith:RW2RVIAO","canonical_record":{"source":{"id":"2405.09169","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-05-15T08:07:52Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"7b77b3c3c95a1073a8350cd6cd1bd269ce962e30fdb1c70140928683036d2633","abstract_canon_sha256":"75d2dd7c2fd8357fdc057576d58ff7996b5cc238887126f5968b511de281cd2d"},"schema_version":"1.0"},"canonical_sha256":"8db51aa00ed7741696b2d747e61e17e6af28606802d676121625257bbb91cfc5","source":{"kind":"arxiv","id":"2405.09169","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2405.09169","created_at":"2026-07-05T11:49:03Z"},{"alias_kind":"arxiv_version","alias_value":"2405.09169v3","created_at":"2026-07-05T11:49:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.09169","created_at":"2026-07-05T11:49:03Z"},{"alias_kind":"pith_short_12","alias_value":"RW2RVIAO252B","created_at":"2026-07-05T11:49:03Z"},{"alias_kind":"pith_short_16","alias_value":"RW2RVIAO252BNFVS","created_at":"2026-07-05T11:49:03Z"},{"alias_kind":"pith_short_8","alias_value":"RW2RVIAO","created_at":"2026-07-05T11:49:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:RW2RVIAO252BNFVS25D6MHQX42","target":"record","payload":{"canonical_record":{"source":{"id":"2405.09169","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-05-15T08:07:52Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"7b77b3c3c95a1073a8350cd6cd1bd269ce962e30fdb1c70140928683036d2633","abstract_canon_sha256":"75d2dd7c2fd8357fdc057576d58ff7996b5cc238887126f5968b511de281cd2d"},"schema_version":"1.0"},"canonical_sha256":"8db51aa00ed7741696b2d747e61e17e6af28606802d676121625257bbb91cfc5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:49:03.511167Z","signature_b64":"cs8DFeaXXasDvE+zNIrXHTg9ne3h5Qv85xn8mH+iY6XCTsNKWqJAWOT1NF23X3H/3THmssOWnUGRCqTDMUpJAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8db51aa00ed7741696b2d747e61e17e6af28606802d676121625257bbb91cfc5","last_reissued_at":"2026-07-05T11:49:03.510627Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:49:03.510627Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2405.09169","source_version":3,"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-07-05T11:49:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E5hOBa0gyoeEDPVw5AG+2DiE86OFHw1L00izGX0D+/oyijW7p/tK/IhNyqj/hVoOnVx9FXo1jAX6S48i2cz5Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T13:14:18.822211Z"},"content_sha256":"d85b2318f1171b017b650629fe874b6b04e3ba5d9ef25642c6c30df17e423e51","schema_version":"1.0","event_id":"sha256:d85b2318f1171b017b650629fe874b6b04e3ba5d9ef25642c6c30df17e423e51"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:RW2RVIAO252BNFVS25D6MHQX42","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Towards a Linear-Ramp QAOA protocol: Evidence of a scaling advantage in solving some combinatorial optimization problems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"quant-ph","authors_text":"J. A. Montanez-Barrera, Kristel Michielsen","submitted_at":"2024-05-15T08:07:52Z","abstract_excerpt":"The Quantum Approximate Optimization Algorithm (QAOA) is a promising algorithm for solving combinatorial optimization problems (COPs), with performance governed by variational parameters $\\{\\gamma_i, \\beta_i\\}_{i=0}^{p-1}$. While most prior work has focused on classically optimizing these parameters, we demonstrate that fixed linear ramp schedules, linear ramp QAOA (LR-QAOA), can efficiently approximate optimal solutions across diverse COPs. Simulations with up to $N_q=42$ qubits and $p=400$ layers suggest that the success probability scales as $P(x^*) \\approx 2^{-\\eta(p) N_q + C}$, where $\\et"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.09169","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/2405.09169/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-07-05T11:49:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r//TCG/DP7XL86B3WyP+LzJ8QbxAhxzPg+mMQdCq1h+cw3i7xhRDhlinHZtfYONpbBl55E6mIxkubc0ROAMCAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T13:14:18.822740Z"},"content_sha256":"daa30924adbe84837c77c0b4c85d2cbffa716c568ddf24bb3c561ff6af8fab57","schema_version":"1.0","event_id":"sha256:daa30924adbe84837c77c0b4c85d2cbffa716c568ddf24bb3c561ff6af8fab57"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RW2RVIAO252BNFVS25D6MHQX42/bundle.json","state_url":"https://pith.science/pith/RW2RVIAO252BNFVS25D6MHQX42/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RW2RVIAO252BNFVS25D6MHQX42/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-08-08T13:14:18Z","links":{"resolver":"https://pith.science/pith/RW2RVIAO252BNFVS25D6MHQX42","bundle":"https://pith.science/pith/RW2RVIAO252BNFVS25D6MHQX42/bundle.json","state":"https://pith.science/pith/RW2RVIAO252BNFVS25D6MHQX42/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RW2RVIAO252BNFVS25D6MHQX42/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:RW2RVIAO252BNFVS25D6MHQX42","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":"75d2dd7c2fd8357fdc057576d58ff7996b5cc238887126f5968b511de281cd2d","cross_cats_sorted":["math.OC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-05-15T08:07:52Z","title_canon_sha256":"7b77b3c3c95a1073a8350cd6cd1bd269ce962e30fdb1c70140928683036d2633"},"schema_version":"1.0","source":{"id":"2405.09169","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2405.09169","created_at":"2026-07-05T11:49:03Z"},{"alias_kind":"arxiv_version","alias_value":"2405.09169v3","created_at":"2026-07-05T11:49:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.09169","created_at":"2026-07-05T11:49:03Z"},{"alias_kind":"pith_short_12","alias_value":"RW2RVIAO252B","created_at":"2026-07-05T11:49:03Z"},{"alias_kind":"pith_short_16","alias_value":"RW2RVIAO252BNFVS","created_at":"2026-07-05T11:49:03Z"},{"alias_kind":"pith_short_8","alias_value":"RW2RVIAO","created_at":"2026-07-05T11:49:03Z"}],"graph_snapshots":[{"event_id":"sha256:daa30924adbe84837c77c0b4c85d2cbffa716c568ddf24bb3c561ff6af8fab57","target":"graph","created_at":"2026-07-05T11:49:03Z","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/2405.09169/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The Quantum Approximate Optimization Algorithm (QAOA) is a promising algorithm for solving combinatorial optimization problems (COPs), with performance governed by variational parameters $\\{\\gamma_i, \\beta_i\\}_{i=0}^{p-1}$. While most prior work has focused on classically optimizing these parameters, we demonstrate that fixed linear ramp schedules, linear ramp QAOA (LR-QAOA), can efficiently approximate optimal solutions across diverse COPs. Simulations with up to $N_q=42$ qubits and $p=400$ layers suggest that the success probability scales as $P(x^*) \\approx 2^{-\\eta(p) N_q + C}$, where $\\et","authors_text":"J. A. Montanez-Barrera, Kristel Michielsen","cross_cats":["math.OC"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-05-15T08:07:52Z","title":"Towards a Linear-Ramp QAOA protocol: Evidence of a scaling advantage in solving some combinatorial optimization problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.09169","kind":"arxiv","version":3},"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:d85b2318f1171b017b650629fe874b6b04e3ba5d9ef25642c6c30df17e423e51","target":"record","created_at":"2026-07-05T11:49:03Z","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":"75d2dd7c2fd8357fdc057576d58ff7996b5cc238887126f5968b511de281cd2d","cross_cats_sorted":["math.OC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-05-15T08:07:52Z","title_canon_sha256":"7b77b3c3c95a1073a8350cd6cd1bd269ce962e30fdb1c70140928683036d2633"},"schema_version":"1.0","source":{"id":"2405.09169","kind":"arxiv","version":3}},"canonical_sha256":"8db51aa00ed7741696b2d747e61e17e6af28606802d676121625257bbb91cfc5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8db51aa00ed7741696b2d747e61e17e6af28606802d676121625257bbb91cfc5","first_computed_at":"2026-07-05T11:49:03.510627Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:49:03.510627Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cs8DFeaXXasDvE+zNIrXHTg9ne3h5Qv85xn8mH+iY6XCTsNKWqJAWOT1NF23X3H/3THmssOWnUGRCqTDMUpJAw==","signature_status":"signed_v1","signed_at":"2026-07-05T11:49:03.511167Z","signed_message":"canonical_sha256_bytes"},"source_id":"2405.09169","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d85b2318f1171b017b650629fe874b6b04e3ba5d9ef25642c6c30df17e423e51","sha256:daa30924adbe84837c77c0b4c85d2cbffa716c568ddf24bb3c561ff6af8fab57"],"state_sha256":"69ad25295f66a6ab97d67b269c6bb07c10a5d1afd97301f865868d184b7606b4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KChH8fm8T5eGPaQJSweQSkZiKZtUGcmerSi3zPfJJhmcnETy6rsZZTDgGIaiIHuI2EJ7p7ywkjrTaVa25KVrCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T13:14:18.827664Z","bundle_sha256":"be59d3ba2ad7960c7c4aec43603ac018fd35cccf4175771c4b016d1fb527f4c5"}}