{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:GLQWUYD2LH3DIMEXQZAG26VDAS","short_pith_number":"pith:GLQWUYD2","schema_version":"1.0","canonical_sha256":"32e16a607a59f634309786406d7aa30489a69f9455ce65e0759c9e1512797f44","source":{"kind":"arxiv","id":"2411.15294","version":2},"attestation_state":"computed","paper":{"title":"Imperfect-Information Games on Quantum Computers: A Case Study in Skat","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.ET","cs.GT"],"primary_cat":"quant-ph","authors_text":"Erik Schulze, Gabriel Maresch, Stefan Edelkamp, Ulrich Armbr\\\"uster","submitted_at":"2024-11-22T18:19:33Z","abstract_excerpt":"For decades it is known that Quantum Computers might serve as a tool to solve a very specific kind of problems that have long thought to be incalculable. Some of those problems are of a combinatorial nature, with the quantum advantage arising from the exploding size of a huge decision tree. Although this is of high interest as well, there are more opportunities to make use of the quantum advantage among non-perfect information games with a limited amount of steps within the game. Even though it is not possible to answer the question for the winning move in a specific situation, people are rath"},"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.15294","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-11-22T18:19:33Z","cross_cats_sorted":["cs.ET","cs.GT"],"title_canon_sha256":"f19decbf695617bc75dd6887b08b1208caf6ce9fa4ab59b02e81ff05cac96b4a","abstract_canon_sha256":"9bc0ee9b04d1f8cc94149cb79ebf1b97112d283a571bf35fc17d69b131f7c926"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:02:47.352507Z","signature_b64":"RXyQ0H+WoWSM53Mwz0CcTRTBKyz3H03gVA9EmFY30FySKiJP2ecNcyQ8cYAeSaE23jD81dUwkJXThTkkwU0vBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"32e16a607a59f634309786406d7aa30489a69f9455ce65e0759c9e1512797f44","last_reissued_at":"2026-05-20T00:02:47.351816Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:02:47.351816Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Imperfect-Information Games on Quantum Computers: A Case Study in Skat","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.ET","cs.GT"],"primary_cat":"quant-ph","authors_text":"Erik Schulze, Gabriel Maresch, Stefan Edelkamp, Ulrich Armbr\\\"uster","submitted_at":"2024-11-22T18:19:33Z","abstract_excerpt":"For decades it is known that Quantum Computers might serve as a tool to solve a very specific kind of problems that have long thought to be incalculable. Some of those problems are of a combinatorial nature, with the quantum advantage arising from the exploding size of a huge decision tree. Although this is of high interest as well, there are more opportunities to make use of the quantum advantage among non-perfect information games with a limited amount of steps within the game. Even though it is not possible to answer the question for the winning move in a specific situation, people are rath"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.15294","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/2411.15294/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.15294","created_at":"2026-05-20T00:02:47.351926+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.15294v2","created_at":"2026-05-20T00:02:47.351926+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.15294","created_at":"2026-05-20T00:02:47.351926+00:00"},{"alias_kind":"pith_short_12","alias_value":"GLQWUYD2LH3D","created_at":"2026-05-20T00:02:47.351926+00:00"},{"alias_kind":"pith_short_16","alias_value":"GLQWUYD2LH3DIMEX","created_at":"2026-05-20T00:02:47.351926+00:00"},{"alias_kind":"pith_short_8","alias_value":"GLQWUYD2","created_at":"2026-05-20T00:02:47.351926+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/GLQWUYD2LH3DIMEXQZAG26VDAS","json":"https://pith.science/pith/GLQWUYD2LH3DIMEXQZAG26VDAS.json","graph_json":"https://pith.science/api/pith-number/GLQWUYD2LH3DIMEXQZAG26VDAS/graph.json","events_json":"https://pith.science/api/pith-number/GLQWUYD2LH3DIMEXQZAG26VDAS/events.json","paper":"https://pith.science/paper/GLQWUYD2"},"agent_actions":{"view_html":"https://pith.science/pith/GLQWUYD2LH3DIMEXQZAG26VDAS","download_json":"https://pith.science/pith/GLQWUYD2LH3DIMEXQZAG26VDAS.json","view_paper":"https://pith.science/paper/GLQWUYD2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.15294&json=true","fetch_graph":"https://pith.science/api/pith-number/GLQWUYD2LH3DIMEXQZAG26VDAS/graph.json","fetch_events":"https://pith.science/api/pith-number/GLQWUYD2LH3DIMEXQZAG26VDAS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GLQWUYD2LH3DIMEXQZAG26VDAS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GLQWUYD2LH3DIMEXQZAG26VDAS/action/storage_attestation","attest_author":"https://pith.science/pith/GLQWUYD2LH3DIMEXQZAG26VDAS/action/author_attestation","sign_citation":"https://pith.science/pith/GLQWUYD2LH3DIMEXQZAG26VDAS/action/citation_signature","submit_replication":"https://pith.science/pith/GLQWUYD2LH3DIMEXQZAG26VDAS/action/replication_record"}},"created_at":"2026-05-20T00:02:47.351926+00:00","updated_at":"2026-05-20T00:02:47.351926+00:00"}