{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:KEZHBNWBZXC5FF7B2RPKSG55XS","short_pith_number":"pith:KEZHBNWB","schema_version":"1.0","canonical_sha256":"513270b6c1cdc5d297e1d45ea91bbdbc8bf0d431a6c55273ba67dc0feb71c523","source":{"kind":"arxiv","id":"2312.02279","version":3},"attestation_state":"computed","paper":{"title":"Challenges and Opportunities in Quantum Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"quant-ph","authors_text":"Amira Abbas, Andreas B\\\"artschi, Andris Ambainis, Benjamin C. B. Symons, Brandon Augustino, Bruce G. Elmegreen, Bryce Fuller, Carleton Coffrin, Christa Zoufal, Constantin Gonciulea, Corey O'Meara, Daniel J. Egger, Dirk Zechiel, Elena Pe\\~na Tapia, Emre Sahin, Filippo Fratini, Georgios Korpas, Gerhard Kircher, Giacomo Nannicini, Giorgio Cortiana, Guglielmo Mazzola, Harry Buhrman, Jakub Marecek, Jon Yard, Julien Gacon, Manuel Proissl, Mira L. Wolf-Bauwens, Naeimeh Mohseni, Nicola Franco, Patrick Rebentrost, Raoul Heese, Sabine Tornow, Sander Gribling, Sebastian Pokutta, Sergiy Zhuk, Sheir Yarkoni, Stefano Mensa, Stefan Woerner, Steve Lenk, Stuart Hadfield, Swati Gupta, Thomas Kleinert, Thorsten Koch, Vanio Markov, Vedran Dunjko, Victor Valls","submitted_at":"2023-12-04T19:00:44Z","abstract_excerpt":"Recent advances in quantum computers are demonstrating the ability to solve problems at a scale beyond brute force classical simulation. As such, a widespread interest in quantum algorithms has developed in many areas, with optimization being one of the most pronounced domains. Across computer science and physics, there are a number of different approaches for major classes of optimization problems, such as combinatorial optimization, convex optimization, non-convex optimization, and stochastic extensions. This work draws on multiple approaches to study quantum optimization. Provably exact ver"},"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":"2312.02279","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2023-12-04T19:00:44Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"555a6374dd68f14adf256b475d2114b4de4e54168bd6f11006ff80ab3d7e407d","abstract_canon_sha256":"ad55240ac933e6a11a8555a286cb8b734425e5c17d9388c661f26a1675bd9f97"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:36:08.739394Z","signature_b64":"xhVgrOVbNAZqgMNLQNxUgAjQmWH8yV4Yp+x9ALw4On3lyXfWaukgltjpKqE/I+0isao+/44KT/ouueQ14NX9Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"513270b6c1cdc5d297e1d45ea91bbdbc8bf0d431a6c55273ba67dc0feb71c523","last_reissued_at":"2026-07-05T09:36:08.738875Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:36:08.738875Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Challenges and Opportunities in Quantum Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"quant-ph","authors_text":"Amira Abbas, Andreas B\\\"artschi, Andris Ambainis, Benjamin C. B. Symons, Brandon Augustino, Bruce G. Elmegreen, Bryce Fuller, Carleton Coffrin, Christa Zoufal, Constantin Gonciulea, Corey O'Meara, Daniel J. Egger, Dirk Zechiel, Elena Pe\\~na Tapia, Emre Sahin, Filippo Fratini, Georgios Korpas, Gerhard Kircher, Giacomo Nannicini, Giorgio Cortiana, Guglielmo Mazzola, Harry Buhrman, Jakub Marecek, Jon Yard, Julien Gacon, Manuel Proissl, Mira L. Wolf-Bauwens, Naeimeh Mohseni, Nicola Franco, Patrick Rebentrost, Raoul Heese, Sabine Tornow, Sander Gribling, Sebastian Pokutta, Sergiy Zhuk, Sheir Yarkoni, Stefano Mensa, Stefan Woerner, Steve Lenk, Stuart Hadfield, Swati Gupta, Thomas Kleinert, Thorsten Koch, Vanio Markov, Vedran Dunjko, Victor Valls","submitted_at":"2023-12-04T19:00:44Z","abstract_excerpt":"Recent advances in quantum computers are demonstrating the ability to solve problems at a scale beyond brute force classical simulation. As such, a widespread interest in quantum algorithms has developed in many areas, with optimization being one of the most pronounced domains. Across computer science and physics, there are a number of different approaches for major classes of optimization problems, such as combinatorial optimization, convex optimization, non-convex optimization, and stochastic extensions. This work draws on multiple approaches to study quantum optimization. Provably exact ver"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.02279","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/2312.02279/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":"2312.02279","created_at":"2026-07-05T09:36:08.738938+00:00"},{"alias_kind":"arxiv_version","alias_value":"2312.02279v3","created_at":"2026-07-05T09:36:08.738938+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.02279","created_at":"2026-07-05T09:36:08.738938+00:00"},{"alias_kind":"pith_short_12","alias_value":"KEZHBNWBZXC5","created_at":"2026-07-05T09:36:08.738938+00:00"},{"alias_kind":"pith_short_16","alias_value":"KEZHBNWBZXC5FF7B","created_at":"2026-07-05T09:36:08.738938+00:00"},{"alias_kind":"pith_short_8","alias_value":"KEZHBNWB","created_at":"2026-07-05T09:36:08.738938+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":6,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2403.11995","citing_title":"Hamiltonian-reconstruction distance as a success metric for the Variational Quantum Eigensolver","ref_index":21,"is_internal_anchor":false},{"citing_arxiv_id":"2412.15665","citing_title":"Quantum Subroutines in Branch-Price-and-Cut for Vehicle Routing","ref_index":5,"is_internal_anchor":false},{"citing_arxiv_id":"2604.02416","citing_title":"Scalable Determination of Penalization Weights for Constrained Optimizations on Approximate Solvers","ref_index":1,"is_internal_anchor":false},{"citing_arxiv_id":"2605.06734","citing_title":"Gated QKAN-FWP: Scalable Quantum-inspired Sequence Learning","ref_index":2,"is_internal_anchor":false},{"citing_arxiv_id":"2605.02066","citing_title":"Accelerating Noisy Variational Quantum Algorithms with Physics-Informed Denoising Networks","ref_index":19,"is_internal_anchor":false},{"citing_arxiv_id":"2605.06656","citing_title":"Why Global LLM Leaderboards Are Misleading: Small Portfolios for Heterogeneous Supervised ML","ref_index":134,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KEZHBNWBZXC5FF7B2RPKSG55XS","json":"https://pith.science/pith/KEZHBNWBZXC5FF7B2RPKSG55XS.json","graph_json":"https://pith.science/api/pith-number/KEZHBNWBZXC5FF7B2RPKSG55XS/graph.json","events_json":"https://pith.science/api/pith-number/KEZHBNWBZXC5FF7B2RPKSG55XS/events.json","paper":"https://pith.science/paper/KEZHBNWB"},"agent_actions":{"view_html":"https://pith.science/pith/KEZHBNWBZXC5FF7B2RPKSG55XS","download_json":"https://pith.science/pith/KEZHBNWBZXC5FF7B2RPKSG55XS.json","view_paper":"https://pith.science/paper/KEZHBNWB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2312.02279&json=true","fetch_graph":"https://pith.science/api/pith-number/KEZHBNWBZXC5FF7B2RPKSG55XS/graph.json","fetch_events":"https://pith.science/api/pith-number/KEZHBNWBZXC5FF7B2RPKSG55XS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KEZHBNWBZXC5FF7B2RPKSG55XS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KEZHBNWBZXC5FF7B2RPKSG55XS/action/storage_attestation","attest_author":"https://pith.science/pith/KEZHBNWBZXC5FF7B2RPKSG55XS/action/author_attestation","sign_citation":"https://pith.science/pith/KEZHBNWBZXC5FF7B2RPKSG55XS/action/citation_signature","submit_replication":"https://pith.science/pith/KEZHBNWBZXC5FF7B2RPKSG55XS/action/replication_record"}},"created_at":"2026-07-05T09:36:08.738938+00:00","updated_at":"2026-07-05T09:36:08.738938+00:00"}