{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:LUKGFTQDNNSSDE5JEU4KRTHOVN","short_pith_number":"pith:LUKGFTQD","schema_version":"1.0","canonical_sha256":"5d1462ce036b652193a92538a8cceeab7544d47e1ead600f0caffd0c927ccd93","source":{"kind":"arxiv","id":"2409.15891","version":1},"attestation_state":"computed","paper":{"title":"Solving Max-3SAT Using QUBO Approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Claudia Linnhoff-Popien, Jonas N\\\"u{\\ss}lein, Michael K\\\"olle, Sebastian Feld, Sebastian Zielinski, Thomas Gabor","submitted_at":"2024-09-24T09:02:34Z","abstract_excerpt":"As contemporary quantum computers do not possess error correction, any calculation performed by these devices can be considered an involuntary approximation. To solve a problem on a quantum annealer, it has to be expressed as an instance of Quadratic Unconstrained Binary Optimization (QUBO). In this work, we thus study whether systematically approximating QUBO representations of the MAX-3SAT problem can improve the solution quality when solved on contemporary quantum hardware, compared to using exact, non-approximated QUBO representations. For a MAX-3SAT instance consisting of a 3SAT formula w"},"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":"2409.15891","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-09-24T09:02:34Z","cross_cats_sorted":[],"title_canon_sha256":"2441316de68cbad4d7cc16be19f0072384d367c1ab7ab378c8570d3cc00e34a0","abstract_canon_sha256":"f1b45b386172119131266fc849c28ecc24911626680cfa4b0127a70d94c8ab93"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:11:01.979520Z","signature_b64":"0F8C/L5DvNVN5GlUzvQ/qXsaG7de8s0IOLfBOx/N4H+Yr48WlMERwV1ho84QN/ATcbVAJUnIFsgiDxdBKHzABw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5d1462ce036b652193a92538a8cceeab7544d47e1ead600f0caffd0c927ccd93","last_reissued_at":"2026-07-05T09:11:01.979085Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:11:01.979085Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Solving Max-3SAT Using QUBO Approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Claudia Linnhoff-Popien, Jonas N\\\"u{\\ss}lein, Michael K\\\"olle, Sebastian Feld, Sebastian Zielinski, Thomas Gabor","submitted_at":"2024-09-24T09:02:34Z","abstract_excerpt":"As contemporary quantum computers do not possess error correction, any calculation performed by these devices can be considered an involuntary approximation. To solve a problem on a quantum annealer, it has to be expressed as an instance of Quadratic Unconstrained Binary Optimization (QUBO). In this work, we thus study whether systematically approximating QUBO representations of the MAX-3SAT problem can improve the solution quality when solved on contemporary quantum hardware, compared to using exact, non-approximated QUBO representations. For a MAX-3SAT instance consisting of a 3SAT formula w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.15891","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/2409.15891/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":"2409.15891","created_at":"2026-07-05T09:11:01.979143+00:00"},{"alias_kind":"arxiv_version","alias_value":"2409.15891v1","created_at":"2026-07-05T09:11:01.979143+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.15891","created_at":"2026-07-05T09:11:01.979143+00:00"},{"alias_kind":"pith_short_12","alias_value":"LUKGFTQDNNSS","created_at":"2026-07-05T09:11:01.979143+00:00"},{"alias_kind":"pith_short_16","alias_value":"LUKGFTQDNNSSDE5J","created_at":"2026-07-05T09:11:01.979143+00:00"},{"alias_kind":"pith_short_8","alias_value":"LUKGFTQD","created_at":"2026-07-05T09:11:01.979143+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/LUKGFTQDNNSSDE5JEU4KRTHOVN","json":"https://pith.science/pith/LUKGFTQDNNSSDE5JEU4KRTHOVN.json","graph_json":"https://pith.science/api/pith-number/LUKGFTQDNNSSDE5JEU4KRTHOVN/graph.json","events_json":"https://pith.science/api/pith-number/LUKGFTQDNNSSDE5JEU4KRTHOVN/events.json","paper":"https://pith.science/paper/LUKGFTQD"},"agent_actions":{"view_html":"https://pith.science/pith/LUKGFTQDNNSSDE5JEU4KRTHOVN","download_json":"https://pith.science/pith/LUKGFTQDNNSSDE5JEU4KRTHOVN.json","view_paper":"https://pith.science/paper/LUKGFTQD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2409.15891&json=true","fetch_graph":"https://pith.science/api/pith-number/LUKGFTQDNNSSDE5JEU4KRTHOVN/graph.json","fetch_events":"https://pith.science/api/pith-number/LUKGFTQDNNSSDE5JEU4KRTHOVN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LUKGFTQDNNSSDE5JEU4KRTHOVN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LUKGFTQDNNSSDE5JEU4KRTHOVN/action/storage_attestation","attest_author":"https://pith.science/pith/LUKGFTQDNNSSDE5JEU4KRTHOVN/action/author_attestation","sign_citation":"https://pith.science/pith/LUKGFTQDNNSSDE5JEU4KRTHOVN/action/citation_signature","submit_replication":"https://pith.science/pith/LUKGFTQDNNSSDE5JEU4KRTHOVN/action/replication_record"}},"created_at":"2026-07-05T09:11:01.979143+00:00","updated_at":"2026-07-05T09:11:01.979143+00:00"}