{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:H7W6TS3EQLYRVWIAOJXSI2GENU","short_pith_number":"pith:H7W6TS3E","canonical_record":{"source":{"id":"1708.09354","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-08-30T16:39:44Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"463e7d0a1305a9fd3cf1133d9c156c764605f04759a6b08e222c05bbbad04f71","abstract_canon_sha256":"25efbaed5dc11c5d8ba22f6c541e2c8fe99831b5836090eae972ba68aa215172"},"schema_version":"1.0"},"canonical_sha256":"3fede9cb6482f11ad900726f2468c46d310ba1f77b2d17c8fef4882e89347d95","source":{"kind":"arxiv","id":"1708.09354","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.09354","created_at":"2026-05-18T00:35:08Z"},{"alias_kind":"arxiv_version","alias_value":"1708.09354v3","created_at":"2026-05-18T00:35:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.09354","created_at":"2026-05-18T00:35:08Z"},{"alias_kind":"pith_short_12","alias_value":"H7W6TS3EQLYR","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"H7W6TS3EQLYRVWIA","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"H7W6TS3E","created_at":"2026-05-18T12:31:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:H7W6TS3EQLYRVWIAOJXSI2GENU","target":"record","payload":{"canonical_record":{"source":{"id":"1708.09354","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-08-30T16:39:44Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"463e7d0a1305a9fd3cf1133d9c156c764605f04759a6b08e222c05bbbad04f71","abstract_canon_sha256":"25efbaed5dc11c5d8ba22f6c541e2c8fe99831b5836090eae972ba68aa215172"},"schema_version":"1.0"},"canonical_sha256":"3fede9cb6482f11ad900726f2468c46d310ba1f77b2d17c8fef4882e89347d95","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:35:08.903988Z","signature_b64":"XfQNJvja2BzbQAegzBj78nI6qPEmJ//7z+fAHGZXE1lOql3WQzA5fcLHQ9ASRSInLfwTmAsglHKtgDZaLDsYCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3fede9cb6482f11ad900726f2468c46d310ba1f77b2d17c8fef4882e89347d95","last_reissued_at":"2026-05-18T00:35:08.903593Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:35:08.903593Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.09354","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:35:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CypvA4BVp55hBc38bYt3GP5ygxlbabmiGJ7vC3S/5Fz31+idLoiVlLi7NMqFs6a4Gj8c9b75ZlOK1EfGv6QcDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T22:19:10.463642Z"},"content_sha256":"5c701138cd9bda3c5d27b3d5f8b4009967a8d63237b726fae1c7ee621baa1e58","schema_version":"1.0","event_id":"sha256:5c701138cd9bda3c5d27b3d5f8b4009967a8d63237b726fae1c7ee621baa1e58"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:H7W6TS3EQLYRVWIAOJXSI2GENU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Quantum-enhanced reinforcement learning for finite-episode games with discrete state spaces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"Christian Seidel, David Von Dollen, Florian Neukart, Gabriele Compostella","submitted_at":"2017-08-30T16:39:44Z","abstract_excerpt":"Quantum annealing algorithms belong to the class of metaheuristic tools, applicable for solving binary optimization problems. Hardware implementations of quantum annealing, such as the quantum annealing machines produced by D-Wave Systems, have been subject to multiple analyses in research, with the aim of characterizing the technology's usefulness for optimization and sampling tasks. Here, we present a way to partially embed both Monte Carlo policy iteration for finding an optimal policy on random observations, as well as how to embed (n) sub-optimal state-value functions for approximating an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.09354","kind":"arxiv","version":3},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:35:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5Pb023QnWsOrK/CreZQhgiXuZiaLQq2AjGwaxCZGzO85xmwIDRiRoysEblAkavQ37Vgp5VeAnIuHxULJDJe8BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T22:19:10.464163Z"},"content_sha256":"b22b7bee507fb3e6328f77ad224404749e0c69afc3e88f4d513591a9ecb458b4","schema_version":"1.0","event_id":"sha256:b22b7bee507fb3e6328f77ad224404749e0c69afc3e88f4d513591a9ecb458b4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/H7W6TS3EQLYRVWIAOJXSI2GENU/bundle.json","state_url":"https://pith.science/pith/H7W6TS3EQLYRVWIAOJXSI2GENU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/H7W6TS3EQLYRVWIAOJXSI2GENU/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-01T22:19:10Z","links":{"resolver":"https://pith.science/pith/H7W6TS3EQLYRVWIAOJXSI2GENU","bundle":"https://pith.science/pith/H7W6TS3EQLYRVWIAOJXSI2GENU/bundle.json","state":"https://pith.science/pith/H7W6TS3EQLYRVWIAOJXSI2GENU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/H7W6TS3EQLYRVWIAOJXSI2GENU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:H7W6TS3EQLYRVWIAOJXSI2GENU","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"25efbaed5dc11c5d8ba22f6c541e2c8fe99831b5836090eae972ba68aa215172","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-08-30T16:39:44Z","title_canon_sha256":"463e7d0a1305a9fd3cf1133d9c156c764605f04759a6b08e222c05bbbad04f71"},"schema_version":"1.0","source":{"id":"1708.09354","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.09354","created_at":"2026-05-18T00:35:08Z"},{"alias_kind":"arxiv_version","alias_value":"1708.09354v3","created_at":"2026-05-18T00:35:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.09354","created_at":"2026-05-18T00:35:08Z"},{"alias_kind":"pith_short_12","alias_value":"H7W6TS3EQLYR","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"H7W6TS3EQLYRVWIA","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"H7W6TS3E","created_at":"2026-05-18T12:31:18Z"}],"graph_snapshots":[{"event_id":"sha256:b22b7bee507fb3e6328f77ad224404749e0c69afc3e88f4d513591a9ecb458b4","target":"graph","created_at":"2026-05-18T00:35:08Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Quantum annealing algorithms belong to the class of metaheuristic tools, applicable for solving binary optimization problems. Hardware implementations of quantum annealing, such as the quantum annealing machines produced by D-Wave Systems, have been subject to multiple analyses in research, with the aim of characterizing the technology's usefulness for optimization and sampling tasks. Here, we present a way to partially embed both Monte Carlo policy iteration for finding an optimal policy on random observations, as well as how to embed (n) sub-optimal state-value functions for approximating an","authors_text":"Christian Seidel, David Von Dollen, Florian Neukart, Gabriele Compostella","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-08-30T16:39:44Z","title":"Quantum-enhanced reinforcement learning for finite-episode games with discrete state spaces"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.09354","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:5c701138cd9bda3c5d27b3d5f8b4009967a8d63237b726fae1c7ee621baa1e58","target":"record","created_at":"2026-05-18T00:35:08Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"25efbaed5dc11c5d8ba22f6c541e2c8fe99831b5836090eae972ba68aa215172","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-08-30T16:39:44Z","title_canon_sha256":"463e7d0a1305a9fd3cf1133d9c156c764605f04759a6b08e222c05bbbad04f71"},"schema_version":"1.0","source":{"id":"1708.09354","kind":"arxiv","version":3}},"canonical_sha256":"3fede9cb6482f11ad900726f2468c46d310ba1f77b2d17c8fef4882e89347d95","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3fede9cb6482f11ad900726f2468c46d310ba1f77b2d17c8fef4882e89347d95","first_computed_at":"2026-05-18T00:35:08.903593Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:35:08.903593Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XfQNJvja2BzbQAegzBj78nI6qPEmJ//7z+fAHGZXE1lOql3WQzA5fcLHQ9ASRSInLfwTmAsglHKtgDZaLDsYCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:35:08.903988Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.09354","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5c701138cd9bda3c5d27b3d5f8b4009967a8d63237b726fae1c7ee621baa1e58","sha256:b22b7bee507fb3e6328f77ad224404749e0c69afc3e88f4d513591a9ecb458b4"],"state_sha256":"a6b22206563707fa7603a55639c443df7f16f79e058207eda153450e237a1020"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vzzTMqXbGxEI0FvzvZ2SzjOlSg6gZATNcUF2z8chUDMDikPGEQ3uxnGiBI33GaQ/+gGepmCE1yD4sAlrYZkFAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T22:19:10.466657Z","bundle_sha256":"401d1794ca5374ffe963f6d129eae40de9b08ceed9c796e5d79859f9cb3f94f8"}}