{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:TQDLWXITEFCYTHNYMWEFOEZ747","short_pith_number":"pith:TQDLWXIT","schema_version":"1.0","canonical_sha256":"9c06bb5d132145899db8658857133fe7c3a3756fcf41d9237182f63bf9497e7f","source":{"kind":"arxiv","id":"2504.03832","version":2},"attestation_state":"computed","paper":{"title":"Quantum Optimization Benchmarking Library - The Intractable Decathlon","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"quant-ph","authors_text":"Alejandro Gomez Cadavid, Anurag Ramesh, Christa Zoufal, Corey O'Meara, Daniel J. Egger, David E. Bernal Neira, David Van Bulck, Giacomo Nannicini, Giorgio Cortiana, Jhon A. Montanez-Barrera, Justin Pauckert, Koji Nakano, Manuel Proissl, Maximilian Schicker, Mitsuharu Takeori, Naeimeh Mohseni, Narendra N. Hegade, Noriaki Shimada, Pedro Maciel Xavier, Raoul Heese, Rhea Huang, Stefan Woerner, Thomas Kleinert, Thorsten Koch, Toshinari Itoko, Victor Valls, Ying Chen","submitted_at":"2025-04-04T18:00:00Z","abstract_excerpt":"Through recent progress in hardware development, quantum computers have advanced to the point where benchmarking of (heuristic) quantum algorithms at scale is within reach. Particularly in combinatorial optimization - where most algorithms are heuristics - it is key to empirically analyze their performance on hardware and track progress towards quantum advantage. To this extent, we present ten optimization problem classes that are difficult for existing classical algorithms and can (mostly) be linked to practically relevant applications, with the goal to enable systematic, fair, and comparable"},"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.03832","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-04-04T18:00:00Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"37ae89d607a57cf895b2f3f0a2aecd0ffa4121cee274abf3e8fe7be34006d117","abstract_canon_sha256":"e925ecf695dc8279fe8977b705c290f9b56245e84322c543080bb7af9a0de04a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:00:49.171847Z","signature_b64":"YMxWgb+t6HjOwR/MOMF2B7oXDnTWSwfbmwKIjyWfklHeD78dJJ5SqS7uNTXXPW7lKfXB+IahzrwaxuIVftFtBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9c06bb5d132145899db8658857133fe7c3a3756fcf41d9237182f63bf9497e7f","last_reissued_at":"2026-07-05T12:00:49.171335Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:00:49.171335Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum Optimization Benchmarking Library - The Intractable Decathlon","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"quant-ph","authors_text":"Alejandro Gomez Cadavid, Anurag Ramesh, Christa Zoufal, Corey O'Meara, Daniel J. Egger, David E. Bernal Neira, David Van Bulck, Giacomo Nannicini, Giorgio Cortiana, Jhon A. Montanez-Barrera, Justin Pauckert, Koji Nakano, Manuel Proissl, Maximilian Schicker, Mitsuharu Takeori, Naeimeh Mohseni, Narendra N. Hegade, Noriaki Shimada, Pedro Maciel Xavier, Raoul Heese, Rhea Huang, Stefan Woerner, Thomas Kleinert, Thorsten Koch, Toshinari Itoko, Victor Valls, Ying Chen","submitted_at":"2025-04-04T18:00:00Z","abstract_excerpt":"Through recent progress in hardware development, quantum computers have advanced to the point where benchmarking of (heuristic) quantum algorithms at scale is within reach. Particularly in combinatorial optimization - where most algorithms are heuristics - it is key to empirically analyze their performance on hardware and track progress towards quantum advantage. To this extent, we present ten optimization problem classes that are difficult for existing classical algorithms and can (mostly) be linked to practically relevant applications, with the goal to enable systematic, fair, and comparable"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.03832","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.03832/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.03832","created_at":"2026-07-05T12:00:49.171393+00:00"},{"alias_kind":"arxiv_version","alias_value":"2504.03832v2","created_at":"2026-07-05T12:00:49.171393+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.03832","created_at":"2026-07-05T12:00:49.171393+00:00"},{"alias_kind":"pith_short_12","alias_value":"TQDLWXITEFCY","created_at":"2026-07-05T12:00:49.171393+00:00"},{"alias_kind":"pith_short_16","alias_value":"TQDLWXITEFCYTHNY","created_at":"2026-07-05T12:00:49.171393+00:00"},{"alias_kind":"pith_short_8","alias_value":"TQDLWXIT","created_at":"2026-07-05T12:00:49.171393+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":11,"internal_anchor_count":11,"sample":[{"citing_arxiv_id":"2606.28866","citing_title":"Quantum Variational Approaches to the Maximum Independent Set Problem at Utility Scale","ref_index":47,"is_internal_anchor":true},{"citing_arxiv_id":"2606.05311","citing_title":"Setting angles in quantum approximate optimization at utility-scale","ref_index":146,"is_internal_anchor":true},{"citing_arxiv_id":"2606.28866","citing_title":"Quantum Variational Approaches to the Maximum Independent Set Problem at Utility Scale","ref_index":47,"is_internal_anchor":true},{"citing_arxiv_id":"2605.30252","citing_title":"Quantum optimization beyond QUBO for industrial logistics and scheduling","ref_index":21,"is_internal_anchor":true},{"citing_arxiv_id":"2503.17115","citing_title":"A quantum wire approach to weighted combinatorial graph optimisation problems","ref_index":43,"is_internal_anchor":true},{"citing_arxiv_id":"2605.18985","citing_title":"Efficient Fourier-Based Linear Combination of Unitaries and Applications in Quantum Optimization","ref_index":23,"is_internal_anchor":true},{"citing_arxiv_id":"2507.05045","citing_title":"GPU accelerated variant of Schroeppel-Shamir's algorithm for solving the market split problem","ref_index":6,"is_internal_anchor":true},{"citing_arxiv_id":"2510.06337","citing_title":"Recent quantum runtime (dis)advantages","ref_index":39,"is_internal_anchor":true},{"citing_arxiv_id":"2604.25162","citing_title":"Experimental Workflows for Combinatorial Optimization: Towards Quantum Advantage","ref_index":14,"is_internal_anchor":true},{"citing_arxiv_id":"2604.24580","citing_title":"Spectral Gap Informed Ramp QAOA","ref_index":15,"is_internal_anchor":true},{"citing_arxiv_id":"2604.21908","citing_title":"Efficient Classical Simulation of Heuristic Peaked Quantum Circuits","ref_index":10,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TQDLWXITEFCYTHNYMWEFOEZ747","json":"https://pith.science/pith/TQDLWXITEFCYTHNYMWEFOEZ747.json","graph_json":"https://pith.science/api/pith-number/TQDLWXITEFCYTHNYMWEFOEZ747/graph.json","events_json":"https://pith.science/api/pith-number/TQDLWXITEFCYTHNYMWEFOEZ747/events.json","paper":"https://pith.science/paper/TQDLWXIT"},"agent_actions":{"view_html":"https://pith.science/pith/TQDLWXITEFCYTHNYMWEFOEZ747","download_json":"https://pith.science/pith/TQDLWXITEFCYTHNYMWEFOEZ747.json","view_paper":"https://pith.science/paper/TQDLWXIT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2504.03832&json=true","fetch_graph":"https://pith.science/api/pith-number/TQDLWXITEFCYTHNYMWEFOEZ747/graph.json","fetch_events":"https://pith.science/api/pith-number/TQDLWXITEFCYTHNYMWEFOEZ747/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TQDLWXITEFCYTHNYMWEFOEZ747/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TQDLWXITEFCYTHNYMWEFOEZ747/action/storage_attestation","attest_author":"https://pith.science/pith/TQDLWXITEFCYTHNYMWEFOEZ747/action/author_attestation","sign_citation":"https://pith.science/pith/TQDLWXITEFCYTHNYMWEFOEZ747/action/citation_signature","submit_replication":"https://pith.science/pith/TQDLWXITEFCYTHNYMWEFOEZ747/action/replication_record"}},"created_at":"2026-07-05T12:00:49.171393+00:00","updated_at":"2026-07-05T12:00:49.171393+00:00"}