{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:COVLTSWCE2EQWXQXVNN3UON4IG","short_pith_number":"pith:COVLTSWC","schema_version":"1.0","canonical_sha256":"13aab9cac226890b5e17ab5bba39bc41a8e6f566c691bef7d6f7a8064ee6e82e","source":{"kind":"arxiv","id":"2411.04638","version":1},"attestation_state":"computed","paper":{"title":"QCE'24 Tutorial: Quantum Annealing -- Emerging Exploration for Database Optimization","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.DB"],"primary_cat":"quant-ph","authors_text":"Jiaheng Lu, Manuel Sch\\\"onberger, Nitin Nayak, Sven Groppe, Valter Uotila, Wolfgang Mauerer, Zhengtong Yan","submitted_at":"2024-11-07T11:51:51Z","abstract_excerpt":"Quantum annealing is a meta-heuristic approach tailored to solve combinatorial optimization problems with quantum annealers. In this tutorial, we provide a fundamental and comprehensive introduction to quantum annealing and modern data management systems and show quantum annealing's potential benefits and applications in the realm of database optimization. We demonstrate how to apply quantum annealing for selected database optimization problems, which are critical challenges in many data management platforms. The demonstrations include solving join order optimization problems in relational dat"},"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":"2411.04638","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"quant-ph","submitted_at":"2024-11-07T11:51:51Z","cross_cats_sorted":["cs.DB"],"title_canon_sha256":"8b9951fa7fb21dde9f533006530afda39a5db260de70ed3232e73d26a87c1373","abstract_canon_sha256":"9773b3b803de6908c646bec8734d5eab50b8ed9fbfd4135b7b96805fe02b214d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:32:23.206831Z","signature_b64":"ueZf/uU/1qGfsyVlvbgn+65x6reNpc6rMaTuko2qW5VokJoqqvwVHlBhw8zN8N2xd6UV8AEtoRIo7XkrmqVLBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"13aab9cac226890b5e17ab5bba39bc41a8e6f566c691bef7d6f7a8064ee6e82e","last_reissued_at":"2026-07-05T09:32:23.206295Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:32:23.206295Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"QCE'24 Tutorial: Quantum Annealing -- Emerging Exploration for Database Optimization","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.DB"],"primary_cat":"quant-ph","authors_text":"Jiaheng Lu, Manuel Sch\\\"onberger, Nitin Nayak, Sven Groppe, Valter Uotila, Wolfgang Mauerer, Zhengtong Yan","submitted_at":"2024-11-07T11:51:51Z","abstract_excerpt":"Quantum annealing is a meta-heuristic approach tailored to solve combinatorial optimization problems with quantum annealers. In this tutorial, we provide a fundamental and comprehensive introduction to quantum annealing and modern data management systems and show quantum annealing's potential benefits and applications in the realm of database optimization. We demonstrate how to apply quantum annealing for selected database optimization problems, which are critical challenges in many data management platforms. The demonstrations include solving join order optimization problems in relational dat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.04638","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/2411.04638/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":"2411.04638","created_at":"2026-07-05T09:32:23.206371+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.04638v1","created_at":"2026-07-05T09:32:23.206371+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.04638","created_at":"2026-07-05T09:32:23.206371+00:00"},{"alias_kind":"pith_short_12","alias_value":"COVLTSWCE2EQ","created_at":"2026-07-05T09:32:23.206371+00:00"},{"alias_kind":"pith_short_16","alias_value":"COVLTSWCE2EQWXQX","created_at":"2026-07-05T09:32:23.206371+00:00"},{"alias_kind":"pith_short_8","alias_value":"COVLTSWC","created_at":"2026-07-05T09:32:23.206371+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.07552","citing_title":"Quantum Information-Theoretical Size Bounds for Conjunctive Queries with Functional Dependencies","ref_index":37,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/COVLTSWCE2EQWXQXVNN3UON4IG","json":"https://pith.science/pith/COVLTSWCE2EQWXQXVNN3UON4IG.json","graph_json":"https://pith.science/api/pith-number/COVLTSWCE2EQWXQXVNN3UON4IG/graph.json","events_json":"https://pith.science/api/pith-number/COVLTSWCE2EQWXQXVNN3UON4IG/events.json","paper":"https://pith.science/paper/COVLTSWC"},"agent_actions":{"view_html":"https://pith.science/pith/COVLTSWCE2EQWXQXVNN3UON4IG","download_json":"https://pith.science/pith/COVLTSWCE2EQWXQXVNN3UON4IG.json","view_paper":"https://pith.science/paper/COVLTSWC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.04638&json=true","fetch_graph":"https://pith.science/api/pith-number/COVLTSWCE2EQWXQXVNN3UON4IG/graph.json","fetch_events":"https://pith.science/api/pith-number/COVLTSWCE2EQWXQXVNN3UON4IG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/COVLTSWCE2EQWXQXVNN3UON4IG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/COVLTSWCE2EQWXQXVNN3UON4IG/action/storage_attestation","attest_author":"https://pith.science/pith/COVLTSWCE2EQWXQXVNN3UON4IG/action/author_attestation","sign_citation":"https://pith.science/pith/COVLTSWCE2EQWXQXVNN3UON4IG/action/citation_signature","submit_replication":"https://pith.science/pith/COVLTSWCE2EQWXQXVNN3UON4IG/action/replication_record"}},"created_at":"2026-07-05T09:32:23.206371+00:00","updated_at":"2026-07-05T09:32:23.206371+00:00"}