{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2007:BB7QJMNWVOBWVMFV4DVX66HDLV","short_pith_number":"pith:BB7QJMNW","schema_version":"1.0","canonical_sha256":"087f04b1b6ab836ab0b5e0eb7f78e35d642e00e50e52a8445e36b0e203cbbf34","source":{"kind":"arxiv","id":"0704.2937","version":1},"attestation_state":"computed","paper":{"title":"Quantum Parrondo's game with random strategies","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"J. A. Miszczak, J. Kosik, V. Buzek","submitted_at":"2007-04-23T08:07:47Z","abstract_excerpt":"We present a quantum implementation of Parrondo's game with randomly switched strategies using 1) a quantum walk as a source of ``randomness'' and 2) a completely positive (CP) map as a randomized evolution. The game exhibits the same paradox as in the classical setting where a combination of two losing strategies might result in a winning strategy. We show that the CP-map scheme leads to significantly lower net gain than the quantum walk scheme."},"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":"0704.2937","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2007-04-23T08:07:47Z","cross_cats_sorted":[],"title_canon_sha256":"78df288222a970652096b57bcf06d85290c3e58bf78cb3065b77731fb2b7d64d","abstract_canon_sha256":"b3013b569cc92c9a49e4ac1190f4e26130bac2567c0afa4e57e3f5d749fbcddb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:09:24.005192Z","signature_b64":"4luf8kUmgRsY6W9TwElqP2YhdPC7sVNfwrGf/dDrNy6NG2wpIpUVhfYr6ydIaHCOtT//48mxSni4sC7y/9EIAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"087f04b1b6ab836ab0b5e0eb7f78e35d642e00e50e52a8445e36b0e203cbbf34","last_reissued_at":"2026-05-18T04:09:24.004563Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:09:24.004563Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum Parrondo's game with random strategies","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"J. A. Miszczak, J. Kosik, V. Buzek","submitted_at":"2007-04-23T08:07:47Z","abstract_excerpt":"We present a quantum implementation of Parrondo's game with randomly switched strategies using 1) a quantum walk as a source of ``randomness'' and 2) a completely positive (CP) map as a randomized evolution. The game exhibits the same paradox as in the classical setting where a combination of two losing strategies might result in a winning strategy. We show that the CP-map scheme leads to significantly lower net gain than the quantum walk scheme."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0704.2937","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":""},"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":"0704.2937","created_at":"2026-05-18T04:09:24.004661+00:00"},{"alias_kind":"arxiv_version","alias_value":"0704.2937v1","created_at":"2026-05-18T04:09:24.004661+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0704.2937","created_at":"2026-05-18T04:09:24.004661+00:00"},{"alias_kind":"pith_short_12","alias_value":"BB7QJMNWVOBW","created_at":"2026-05-18T12:25:55.427421+00:00"},{"alias_kind":"pith_short_16","alias_value":"BB7QJMNWVOBWVMFV","created_at":"2026-05-18T12:25:55.427421+00:00"},{"alias_kind":"pith_short_8","alias_value":"BB7QJMNW","created_at":"2026-05-18T12:25:55.427421+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/BB7QJMNWVOBWVMFV4DVX66HDLV","json":"https://pith.science/pith/BB7QJMNWVOBWVMFV4DVX66HDLV.json","graph_json":"https://pith.science/api/pith-number/BB7QJMNWVOBWVMFV4DVX66HDLV/graph.json","events_json":"https://pith.science/api/pith-number/BB7QJMNWVOBWVMFV4DVX66HDLV/events.json","paper":"https://pith.science/paper/BB7QJMNW"},"agent_actions":{"view_html":"https://pith.science/pith/BB7QJMNWVOBWVMFV4DVX66HDLV","download_json":"https://pith.science/pith/BB7QJMNWVOBWVMFV4DVX66HDLV.json","view_paper":"https://pith.science/paper/BB7QJMNW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0704.2937&json=true","fetch_graph":"https://pith.science/api/pith-number/BB7QJMNWVOBWVMFV4DVX66HDLV/graph.json","fetch_events":"https://pith.science/api/pith-number/BB7QJMNWVOBWVMFV4DVX66HDLV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BB7QJMNWVOBWVMFV4DVX66HDLV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BB7QJMNWVOBWVMFV4DVX66HDLV/action/storage_attestation","attest_author":"https://pith.science/pith/BB7QJMNWVOBWVMFV4DVX66HDLV/action/author_attestation","sign_citation":"https://pith.science/pith/BB7QJMNWVOBWVMFV4DVX66HDLV/action/citation_signature","submit_replication":"https://pith.science/pith/BB7QJMNWVOBWVMFV4DVX66HDLV/action/replication_record"}},"created_at":"2026-05-18T04:09:24.004661+00:00","updated_at":"2026-05-18T04:09:24.004661+00:00"}