{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:METSMZDE2BNRX7RBCIULDV5N5J","short_pith_number":"pith:METSMZDE","canonical_record":{"source":{"id":"1612.05695","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-12-17T02:33:41Z","cross_cats_sorted":["cs.AI","cs.LG","cs.NE","math.OC"],"title_canon_sha256":"004110f2c4a3ed1428f4511810da033738e4daa407769746af048f19c7b18aad","abstract_canon_sha256":"7b96580288e61a180fce93e87d2aa0a316829aa2c1cdc44ee3db116048280479"},"schema_version":"1.0"},"canonical_sha256":"6127266464d05b1bfe211228b1d7adea4daa72cba96a3f5854b452efb7399a96","source":{"kind":"arxiv","id":"1612.05695","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.05695","created_at":"2026-05-17T23:56:58Z"},{"alias_kind":"arxiv_version","alias_value":"1612.05695v3","created_at":"2026-05-17T23:56:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.05695","created_at":"2026-05-17T23:56:58Z"},{"alias_kind":"pith_short_12","alias_value":"METSMZDE2BNR","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"METSMZDE2BNRX7RB","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"METSMZDE","created_at":"2026-05-18T12:30:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:METSMZDE2BNRX7RBCIULDV5N5J","target":"record","payload":{"canonical_record":{"source":{"id":"1612.05695","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-12-17T02:33:41Z","cross_cats_sorted":["cs.AI","cs.LG","cs.NE","math.OC"],"title_canon_sha256":"004110f2c4a3ed1428f4511810da033738e4daa407769746af048f19c7b18aad","abstract_canon_sha256":"7b96580288e61a180fce93e87d2aa0a316829aa2c1cdc44ee3db116048280479"},"schema_version":"1.0"},"canonical_sha256":"6127266464d05b1bfe211228b1d7adea4daa72cba96a3f5854b452efb7399a96","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:58.906548Z","signature_b64":"3GCVRvcWmyeYQb6cI0VXn7fiNte4JpOzOR7AasHwLNmLMqztv+GeWdSJ7BePUyrtiE/rP+FJubS26V1Yh4DFCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6127266464d05b1bfe211228b1d7adea4daa72cba96a3f5854b452efb7399a96","last_reissued_at":"2026-05-17T23:56:58.905935Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:58.905935Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1612.05695","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-17T23:56:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nkGT+hceMMtxy0jylfKZuMalnH72IY3dqrGn3IYSVswOA/E7NayjpvxydTQRS2N46Tkyc+gFeC8SjCOEgOWwBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T11:30:19.756524Z"},"content_sha256":"d1073ccb894a44740fecf3ca1eaf063899d0564f17de472bdcf66397ea416122","schema_version":"1.0","event_id":"sha256:d1073ccb894a44740fecf3ca1eaf063899d0564f17de472bdcf66397ea416122"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:METSMZDE2BNRX7RBCIULDV5N5J","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Reinforcement Learning Using Quantum Boltzmann Machines","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG","cs.NE","math.OC"],"primary_cat":"quant-ph","authors_text":"Anna Levit, Daniel Crawford, Jaspreet S. Oberoi, Navid Ghadermarzy, Pooya Ronagh","submitted_at":"2016-12-17T02:33:41Z","abstract_excerpt":"We investigate whether quantum annealers with select chip layouts can outperform classical computers in reinforcement learning tasks. We associate a transverse field Ising spin Hamiltonian with a layout of qubits similar to that of a deep Boltzmann machine (DBM) and use simulated quantum annealing (SQA) to numerically simulate quantum sampling from this system. We design a reinforcement learning algorithm in which the set of visible nodes representing the states and actions of an optimal policy are the first and last layers of the deep network. In absence of a transverse field, our simulations"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.05695","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-17T23:56:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CEbTU8Dn+ImwOZ/lKCxkGKMWnL8+sdA0TRqwu23UzowniGPhBWvZeqPluLM3siDpFaPpk+PXzZSnVpFTxgawCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T11:30:19.757227Z"},"content_sha256":"21c29bb725dee92fb97d0ce50ca8339e0a19062f2a360dd3ed646e2f89b77476","schema_version":"1.0","event_id":"sha256:21c29bb725dee92fb97d0ce50ca8339e0a19062f2a360dd3ed646e2f89b77476"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/METSMZDE2BNRX7RBCIULDV5N5J/bundle.json","state_url":"https://pith.science/pith/METSMZDE2BNRX7RBCIULDV5N5J/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/METSMZDE2BNRX7RBCIULDV5N5J/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-05-30T11:30:19Z","links":{"resolver":"https://pith.science/pith/METSMZDE2BNRX7RBCIULDV5N5J","bundle":"https://pith.science/pith/METSMZDE2BNRX7RBCIULDV5N5J/bundle.json","state":"https://pith.science/pith/METSMZDE2BNRX7RBCIULDV5N5J/state.json","well_known_bundle":"https://pith.science/.well-known/pith/METSMZDE2BNRX7RBCIULDV5N5J/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:METSMZDE2BNRX7RBCIULDV5N5J","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":"7b96580288e61a180fce93e87d2aa0a316829aa2c1cdc44ee3db116048280479","cross_cats_sorted":["cs.AI","cs.LG","cs.NE","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-12-17T02:33:41Z","title_canon_sha256":"004110f2c4a3ed1428f4511810da033738e4daa407769746af048f19c7b18aad"},"schema_version":"1.0","source":{"id":"1612.05695","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.05695","created_at":"2026-05-17T23:56:58Z"},{"alias_kind":"arxiv_version","alias_value":"1612.05695v3","created_at":"2026-05-17T23:56:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.05695","created_at":"2026-05-17T23:56:58Z"},{"alias_kind":"pith_short_12","alias_value":"METSMZDE2BNR","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"METSMZDE2BNRX7RB","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"METSMZDE","created_at":"2026-05-18T12:30:32Z"}],"graph_snapshots":[{"event_id":"sha256:21c29bb725dee92fb97d0ce50ca8339e0a19062f2a360dd3ed646e2f89b77476","target":"graph","created_at":"2026-05-17T23:56:58Z","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":"We investigate whether quantum annealers with select chip layouts can outperform classical computers in reinforcement learning tasks. We associate a transverse field Ising spin Hamiltonian with a layout of qubits similar to that of a deep Boltzmann machine (DBM) and use simulated quantum annealing (SQA) to numerically simulate quantum sampling from this system. We design a reinforcement learning algorithm in which the set of visible nodes representing the states and actions of an optimal policy are the first and last layers of the deep network. In absence of a transverse field, our simulations","authors_text":"Anna Levit, Daniel Crawford, Jaspreet S. Oberoi, Navid Ghadermarzy, Pooya Ronagh","cross_cats":["cs.AI","cs.LG","cs.NE","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-12-17T02:33:41Z","title":"Reinforcement Learning Using Quantum Boltzmann Machines"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.05695","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:d1073ccb894a44740fecf3ca1eaf063899d0564f17de472bdcf66397ea416122","target":"record","created_at":"2026-05-17T23:56:58Z","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":"7b96580288e61a180fce93e87d2aa0a316829aa2c1cdc44ee3db116048280479","cross_cats_sorted":["cs.AI","cs.LG","cs.NE","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-12-17T02:33:41Z","title_canon_sha256":"004110f2c4a3ed1428f4511810da033738e4daa407769746af048f19c7b18aad"},"schema_version":"1.0","source":{"id":"1612.05695","kind":"arxiv","version":3}},"canonical_sha256":"6127266464d05b1bfe211228b1d7adea4daa72cba96a3f5854b452efb7399a96","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6127266464d05b1bfe211228b1d7adea4daa72cba96a3f5854b452efb7399a96","first_computed_at":"2026-05-17T23:56:58.905935Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:56:58.905935Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3GCVRvcWmyeYQb6cI0VXn7fiNte4JpOzOR7AasHwLNmLMqztv+GeWdSJ7BePUyrtiE/rP+FJubS26V1Yh4DFCw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:56:58.906548Z","signed_message":"canonical_sha256_bytes"},"source_id":"1612.05695","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d1073ccb894a44740fecf3ca1eaf063899d0564f17de472bdcf66397ea416122","sha256:21c29bb725dee92fb97d0ce50ca8339e0a19062f2a360dd3ed646e2f89b77476"],"state_sha256":"298a242a62f7bdf9f79c4cf7f3b51a1538ce94e64fd1c7f4ed99e6eeeb86edf1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qVISZURJRakux/QDYD8Uk81hDJn0c0+hMQT2or/R9GG54pFEBPwHX61D03Og2HcMEsq+1DdLBy/VCCREKSl3Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T11:30:19.763246Z","bundle_sha256":"5cb4c1a6404a2b7baa28ac7ac87c02929eda512dc63dfef16f6698273c2fb33d"}}