{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:O4RRZ5NJCZN7GC4NIVHLCS4VOO","short_pith_number":"pith:O4RRZ5NJ","schema_version":"1.0","canonical_sha256":"77231cf5a9165bf30b8d454eb14b95738fd55dc63b6d9ad91613f0c115c7c145","source":{"kind":"arxiv","id":"2302.02278","version":2},"attestation_state":"computed","paper":{"title":"Optimization Applications as Quantum Performance Benchmarks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Carleton Coffrin, Catherine McGeoch, David E. Bernal Neira, Joshua Apanavicius, Pratik Sathe, Thomas Lubinski","submitted_at":"2023-02-05T01:56:06Z","abstract_excerpt":"Combinatorial optimization is anticipated to be one of the primary use cases for quantum computation in the coming years. The Quantum Approximate Optimization Algorithm (QAOA) and Quantum Annealing (QA) can potentially demonstrate significant run-time performance benefits over current state-of-the-art solutions. Inspired by existing methods to characterize classical optimization algorithms, we analyze the solution quality obtained by solving Max-Cut problems using gate-model quantum devices and a quantum annealing device. This is used to guide the development of an advanced benchmarking framew"},"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":"2302.02278","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-02-05T01:56:06Z","cross_cats_sorted":[],"title_canon_sha256":"e45b0664afdc18f9087b10ea4fc4bfa8ab5032344163142bc77c01fe6691cd9c","abstract_canon_sha256":"4a195c7e4e07cbf5ec7cb14dce09c2bed4b7822134d5ade117136c1bcf75423a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:48:56.486509Z","signature_b64":"AdEh3V8tE5qSGkWj6x4Yk2G1WPTBu/GhoKsGbM2WZnugiRPgy8XX4tqa0tm0Fi+btr4zw+HyK1AB2WLCatVuBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"77231cf5a9165bf30b8d454eb14b95738fd55dc63b6d9ad91613f0c115c7c145","last_reissued_at":"2026-07-05T10:48:56.486029Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:48:56.486029Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimization Applications as Quantum Performance Benchmarks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Carleton Coffrin, Catherine McGeoch, David E. Bernal Neira, Joshua Apanavicius, Pratik Sathe, Thomas Lubinski","submitted_at":"2023-02-05T01:56:06Z","abstract_excerpt":"Combinatorial optimization is anticipated to be one of the primary use cases for quantum computation in the coming years. The Quantum Approximate Optimization Algorithm (QAOA) and Quantum Annealing (QA) can potentially demonstrate significant run-time performance benefits over current state-of-the-art solutions. Inspired by existing methods to characterize classical optimization algorithms, we analyze the solution quality obtained by solving Max-Cut problems using gate-model quantum devices and a quantum annealing device. This is used to guide the development of an advanced benchmarking framew"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.02278","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/2302.02278/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":"2302.02278","created_at":"2026-07-05T10:48:56.486079+00:00"},{"alias_kind":"arxiv_version","alias_value":"2302.02278v2","created_at":"2026-07-05T10:48:56.486079+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.02278","created_at":"2026-07-05T10:48:56.486079+00:00"},{"alias_kind":"pith_short_12","alias_value":"O4RRZ5NJCZN7","created_at":"2026-07-05T10:48:56.486079+00:00"},{"alias_kind":"pith_short_16","alias_value":"O4RRZ5NJCZN7GC4N","created_at":"2026-07-05T10:48:56.486079+00:00"},{"alias_kind":"pith_short_8","alias_value":"O4RRZ5NJ","created_at":"2026-07-05T10:48:56.486079+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.16584","citing_title":"Quantum Annealing Hyperparameter Analysis for Optimal Sensor Placement in Production Environments","ref_index":12,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/O4RRZ5NJCZN7GC4NIVHLCS4VOO","json":"https://pith.science/pith/O4RRZ5NJCZN7GC4NIVHLCS4VOO.json","graph_json":"https://pith.science/api/pith-number/O4RRZ5NJCZN7GC4NIVHLCS4VOO/graph.json","events_json":"https://pith.science/api/pith-number/O4RRZ5NJCZN7GC4NIVHLCS4VOO/events.json","paper":"https://pith.science/paper/O4RRZ5NJ"},"agent_actions":{"view_html":"https://pith.science/pith/O4RRZ5NJCZN7GC4NIVHLCS4VOO","download_json":"https://pith.science/pith/O4RRZ5NJCZN7GC4NIVHLCS4VOO.json","view_paper":"https://pith.science/paper/O4RRZ5NJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2302.02278&json=true","fetch_graph":"https://pith.science/api/pith-number/O4RRZ5NJCZN7GC4NIVHLCS4VOO/graph.json","fetch_events":"https://pith.science/api/pith-number/O4RRZ5NJCZN7GC4NIVHLCS4VOO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/O4RRZ5NJCZN7GC4NIVHLCS4VOO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/O4RRZ5NJCZN7GC4NIVHLCS4VOO/action/storage_attestation","attest_author":"https://pith.science/pith/O4RRZ5NJCZN7GC4NIVHLCS4VOO/action/author_attestation","sign_citation":"https://pith.science/pith/O4RRZ5NJCZN7GC4NIVHLCS4VOO/action/citation_signature","submit_replication":"https://pith.science/pith/O4RRZ5NJCZN7GC4NIVHLCS4VOO/action/replication_record"}},"created_at":"2026-07-05T10:48:56.486079+00:00","updated_at":"2026-07-05T10:48:56.486079+00:00"}