{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:QI54XRTMM5DFMXNJSSTZZCOQVJ","short_pith_number":"pith:QI54XRTM","schema_version":"1.0","canonical_sha256":"823bcbc66c6746565da994a79c89d0aa40fe60882844e7413cf82013c53bad6a","source":{"kind":"arxiv","id":"2404.16784","version":2},"attestation_state":"computed","paper":{"title":"Harnessing Inferior Solutions For Superior Outcomes: Obtaining Robust Solutions From Quantum Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"quant-ph","authors_text":"Michael Trebing, Pascal Halffmann, Steve Lenk","submitted_at":"2024-04-25T17:32:55Z","abstract_excerpt":"In the rapidly advancing domain of quantum optimization, the confluence of quantum algorithms such as Quantum Annealing (QA) and the Quantum Approximate Optimization Algorithm (QAOA) with robust optimization methodologies presents a cutting-edge frontier. Although it seems natural to apply quantum algorithms when facing uncertainty, this has barely been approached.\n  In this paper we adapt the aforementioned quantum optimization techniques to tackle robust optimization problems. By leveraging the inherent stochasticity of quantum annealing and adjusting the parameters and evaluation functions "},"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":"2404.16784","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-04-25T17:32:55Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"01d565d60f4cf78adfcb4b75aeb32e3b4a5846c657bc7b54a6c90e4855e35b7b","abstract_canon_sha256":"c3f290115cde4b54236125cf75a238bb05a449c8fa414665d5125f3289740675"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:18:07.715621Z","signature_b64":"j3QxuqreED0KJQSpISm6uD3W8dPhJPt0B7jg0mAxgwKRHp7WcgQFalXS0qjsEncxzyQF2yotxsntUJ5g0kLsDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"823bcbc66c6746565da994a79c89d0aa40fe60882844e7413cf82013c53bad6a","last_reissued_at":"2026-07-05T08:18:07.715181Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:18:07.715181Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Harnessing Inferior Solutions For Superior Outcomes: Obtaining Robust Solutions From Quantum Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"quant-ph","authors_text":"Michael Trebing, Pascal Halffmann, Steve Lenk","submitted_at":"2024-04-25T17:32:55Z","abstract_excerpt":"In the rapidly advancing domain of quantum optimization, the confluence of quantum algorithms such as Quantum Annealing (QA) and the Quantum Approximate Optimization Algorithm (QAOA) with robust optimization methodologies presents a cutting-edge frontier. Although it seems natural to apply quantum algorithms when facing uncertainty, this has barely been approached.\n  In this paper we adapt the aforementioned quantum optimization techniques to tackle robust optimization problems. By leveraging the inherent stochasticity of quantum annealing and adjusting the parameters and evaluation functions "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.16784","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/2404.16784/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":"2404.16784","created_at":"2026-07-05T08:18:07.715235+00:00"},{"alias_kind":"arxiv_version","alias_value":"2404.16784v2","created_at":"2026-07-05T08:18:07.715235+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.16784","created_at":"2026-07-05T08:18:07.715235+00:00"},{"alias_kind":"pith_short_12","alias_value":"QI54XRTMM5DF","created_at":"2026-07-05T08:18:07.715235+00:00"},{"alias_kind":"pith_short_16","alias_value":"QI54XRTMM5DFMXNJ","created_at":"2026-07-05T08:18:07.715235+00:00"},{"alias_kind":"pith_short_8","alias_value":"QI54XRTM","created_at":"2026-07-05T08:18:07.715235+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QI54XRTMM5DFMXNJSSTZZCOQVJ","json":"https://pith.science/pith/QI54XRTMM5DFMXNJSSTZZCOQVJ.json","graph_json":"https://pith.science/api/pith-number/QI54XRTMM5DFMXNJSSTZZCOQVJ/graph.json","events_json":"https://pith.science/api/pith-number/QI54XRTMM5DFMXNJSSTZZCOQVJ/events.json","paper":"https://pith.science/paper/QI54XRTM"},"agent_actions":{"view_html":"https://pith.science/pith/QI54XRTMM5DFMXNJSSTZZCOQVJ","download_json":"https://pith.science/pith/QI54XRTMM5DFMXNJSSTZZCOQVJ.json","view_paper":"https://pith.science/paper/QI54XRTM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2404.16784&json=true","fetch_graph":"https://pith.science/api/pith-number/QI54XRTMM5DFMXNJSSTZZCOQVJ/graph.json","fetch_events":"https://pith.science/api/pith-number/QI54XRTMM5DFMXNJSSTZZCOQVJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QI54XRTMM5DFMXNJSSTZZCOQVJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QI54XRTMM5DFMXNJSSTZZCOQVJ/action/storage_attestation","attest_author":"https://pith.science/pith/QI54XRTMM5DFMXNJSSTZZCOQVJ/action/author_attestation","sign_citation":"https://pith.science/pith/QI54XRTMM5DFMXNJSSTZZCOQVJ/action/citation_signature","submit_replication":"https://pith.science/pith/QI54XRTMM5DFMXNJSSTZZCOQVJ/action/replication_record"}},"created_at":"2026-07-05T08:18:07.715235+00:00","updated_at":"2026-07-05T08:18:07.715235+00:00"}