{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:ON2F2IPV4CHUP6IRTTZ3RWZLKS","short_pith_number":"pith:ON2F2IPV","schema_version":"1.0","canonical_sha256":"73745d21f5e08f47f9119cf3b8db2b549f9ed6ac44621bad4646de73c1c7c3a7","source":{"kind":"arxiv","id":"2403.03153","version":1},"attestation_state":"computed","paper":{"title":"Solving non-native combinatorial optimization problems using hybrid quantum-classical algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Jonathan Wurtz, Sheng-Tao Wang, Stefan Sack","submitted_at":"2024-03-05T17:46:04Z","abstract_excerpt":"Combinatorial optimization is a challenging problem applicable in a wide range of fields from logistics to finance. Recently, quantum computing has been used to attempt to solve these problems using a range of algorithms, including parameterized quantum circuits, adiabatic protocols, and quantum annealing. These solutions typically have several challenges: 1) there is little to no performance gain over classical methods, 2) not all constraints and objectives may be efficiently encoded in the quantum ansatz, and 3) the solution domain of the objective function may not be the same as the bit str"},"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":"2403.03153","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-03-05T17:46:04Z","cross_cats_sorted":[],"title_canon_sha256":"8564ef1c0115e4e4bfcdf573302a9b665a4633175d4997ae7c58451cbf374163","abstract_canon_sha256":"f2d60744bc10faa33c56effee79ae94d51bdc55f46a95e6ee5c48799c21f75a7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:52:36.695873Z","signature_b64":"Al5unbwOyWzjQKc7GdIQcZFqwYKrWx3OFXLnM7XYGFNn4USkTOck5tRKQdnlFg0qmQQvZVYEI8UqT68M9sGXCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"73745d21f5e08f47f9119cf3b8db2b549f9ed6ac44621bad4646de73c1c7c3a7","last_reissued_at":"2026-07-05T07:52:36.695470Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:52:36.695470Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Solving non-native combinatorial optimization problems using hybrid quantum-classical algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Jonathan Wurtz, Sheng-Tao Wang, Stefan Sack","submitted_at":"2024-03-05T17:46:04Z","abstract_excerpt":"Combinatorial optimization is a challenging problem applicable in a wide range of fields from logistics to finance. Recently, quantum computing has been used to attempt to solve these problems using a range of algorithms, including parameterized quantum circuits, adiabatic protocols, and quantum annealing. These solutions typically have several challenges: 1) there is little to no performance gain over classical methods, 2) not all constraints and objectives may be efficiently encoded in the quantum ansatz, and 3) the solution domain of the objective function may not be the same as the bit str"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.03153","kind":"arxiv","version":1},"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/2403.03153/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":"2403.03153","created_at":"2026-07-05T07:52:36.695529+00:00"},{"alias_kind":"arxiv_version","alias_value":"2403.03153v1","created_at":"2026-07-05T07:52:36.695529+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.03153","created_at":"2026-07-05T07:52:36.695529+00:00"},{"alias_kind":"pith_short_12","alias_value":"ON2F2IPV4CHU","created_at":"2026-07-05T07:52:36.695529+00:00"},{"alias_kind":"pith_short_16","alias_value":"ON2F2IPV4CHUP6IR","created_at":"2026-07-05T07:52:36.695529+00:00"},{"alias_kind":"pith_short_8","alias_value":"ON2F2IPV","created_at":"2026-07-05T07:52:36.695529+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/ON2F2IPV4CHUP6IRTTZ3RWZLKS","json":"https://pith.science/pith/ON2F2IPV4CHUP6IRTTZ3RWZLKS.json","graph_json":"https://pith.science/api/pith-number/ON2F2IPV4CHUP6IRTTZ3RWZLKS/graph.json","events_json":"https://pith.science/api/pith-number/ON2F2IPV4CHUP6IRTTZ3RWZLKS/events.json","paper":"https://pith.science/paper/ON2F2IPV"},"agent_actions":{"view_html":"https://pith.science/pith/ON2F2IPV4CHUP6IRTTZ3RWZLKS","download_json":"https://pith.science/pith/ON2F2IPV4CHUP6IRTTZ3RWZLKS.json","view_paper":"https://pith.science/paper/ON2F2IPV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2403.03153&json=true","fetch_graph":"https://pith.science/api/pith-number/ON2F2IPV4CHUP6IRTTZ3RWZLKS/graph.json","fetch_events":"https://pith.science/api/pith-number/ON2F2IPV4CHUP6IRTTZ3RWZLKS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ON2F2IPV4CHUP6IRTTZ3RWZLKS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ON2F2IPV4CHUP6IRTTZ3RWZLKS/action/storage_attestation","attest_author":"https://pith.science/pith/ON2F2IPV4CHUP6IRTTZ3RWZLKS/action/author_attestation","sign_citation":"https://pith.science/pith/ON2F2IPV4CHUP6IRTTZ3RWZLKS/action/citation_signature","submit_replication":"https://pith.science/pith/ON2F2IPV4CHUP6IRTTZ3RWZLKS/action/replication_record"}},"created_at":"2026-07-05T07:52:36.695529+00:00","updated_at":"2026-07-05T07:52:36.695529+00:00"}