{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:U7MEFYE7KZ6UP4V4DGPEJZLCUI","short_pith_number":"pith:U7MEFYE7","schema_version":"1.0","canonical_sha256":"a7d842e09f567d47f2bc199e44e562a23380e8b986bf68f07815025e1d5eb9d0","source":{"kind":"arxiv","id":"2005.03247","version":1},"attestation_state":"computed","paper":{"title":"Training and Classification using a Restricted Boltzmann Machine on the D-Wave 2000Q","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Muhammad A. Alam, Raja Selvarajan, Sabre Kais, Travis S. Humble, Vivek Dixit","submitted_at":"2020-05-07T04:43:04Z","abstract_excerpt":"Restricted Boltzmann Machine (RBM) is an energy based, undirected graphical model. It is commonly used for unsupervised and supervised machine learning. Typically, RBM is trained using contrastive divergence (CD). However, training with CD is slow and does not estimate exact gradient of log-likelihood cost function. In this work, the model expectation of gradient learning for RBM has been calculated using a quantum annealer (D-Wave 2000Q), which is much faster than Markov chain Monte Carlo (MCMC) used in CD. Training and classification results are compared with CD. The classification accuracy "},"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":"2005.03247","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-05-07T04:43:04Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"8486fa1fa972a0db7e6391850605dadeb04917cb6e936bc1993b223b8114ca9a","abstract_canon_sha256":"5eff0586511e05c2f00d7bc00c1f906be90ef3bfb4fe08a9fede7870ab2df3b0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:54:13.736156Z","signature_b64":"WXDOwtG/zXzSJGB8wfSZfITmou3CYE+qCDYcTQ4Gbhrm93b5DxG+3EwjNZtXhet9kyZPlisH1ZrulPzwxfwRCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a7d842e09f567d47f2bc199e44e562a23380e8b986bf68f07815025e1d5eb9d0","last_reissued_at":"2026-07-05T02:54:13.735679Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:54:13.735679Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Training and Classification using a Restricted Boltzmann Machine on the D-Wave 2000Q","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Muhammad A. Alam, Raja Selvarajan, Sabre Kais, Travis S. Humble, Vivek Dixit","submitted_at":"2020-05-07T04:43:04Z","abstract_excerpt":"Restricted Boltzmann Machine (RBM) is an energy based, undirected graphical model. It is commonly used for unsupervised and supervised machine learning. Typically, RBM is trained using contrastive divergence (CD). However, training with CD is slow and does not estimate exact gradient of log-likelihood cost function. In this work, the model expectation of gradient learning for RBM has been calculated using a quantum annealer (D-Wave 2000Q), which is much faster than Markov chain Monte Carlo (MCMC) used in CD. Training and classification results are compared with CD. The classification accuracy "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2005.03247","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/2005.03247/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":"2005.03247","created_at":"2026-07-05T02:54:13.735737+00:00"},{"alias_kind":"arxiv_version","alias_value":"2005.03247v1","created_at":"2026-07-05T02:54:13.735737+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2005.03247","created_at":"2026-07-05T02:54:13.735737+00:00"},{"alias_kind":"pith_short_12","alias_value":"U7MEFYE7KZ6U","created_at":"2026-07-05T02:54:13.735737+00:00"},{"alias_kind":"pith_short_16","alias_value":"U7MEFYE7KZ6UP4V4","created_at":"2026-07-05T02:54:13.735737+00:00"},{"alias_kind":"pith_short_8","alias_value":"U7MEFYE7","created_at":"2026-07-05T02:54:13.735737+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.14116","citing_title":"Quantum Boltzmann Machines using Parallel Annealing for Medical Image Classification","ref_index":17,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/U7MEFYE7KZ6UP4V4DGPEJZLCUI","json":"https://pith.science/pith/U7MEFYE7KZ6UP4V4DGPEJZLCUI.json","graph_json":"https://pith.science/api/pith-number/U7MEFYE7KZ6UP4V4DGPEJZLCUI/graph.json","events_json":"https://pith.science/api/pith-number/U7MEFYE7KZ6UP4V4DGPEJZLCUI/events.json","paper":"https://pith.science/paper/U7MEFYE7"},"agent_actions":{"view_html":"https://pith.science/pith/U7MEFYE7KZ6UP4V4DGPEJZLCUI","download_json":"https://pith.science/pith/U7MEFYE7KZ6UP4V4DGPEJZLCUI.json","view_paper":"https://pith.science/paper/U7MEFYE7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2005.03247&json=true","fetch_graph":"https://pith.science/api/pith-number/U7MEFYE7KZ6UP4V4DGPEJZLCUI/graph.json","fetch_events":"https://pith.science/api/pith-number/U7MEFYE7KZ6UP4V4DGPEJZLCUI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/U7MEFYE7KZ6UP4V4DGPEJZLCUI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/U7MEFYE7KZ6UP4V4DGPEJZLCUI/action/storage_attestation","attest_author":"https://pith.science/pith/U7MEFYE7KZ6UP4V4DGPEJZLCUI/action/author_attestation","sign_citation":"https://pith.science/pith/U7MEFYE7KZ6UP4V4DGPEJZLCUI/action/citation_signature","submit_replication":"https://pith.science/pith/U7MEFYE7KZ6UP4V4DGPEJZLCUI/action/replication_record"}},"created_at":"2026-07-05T02:54:13.735737+00:00","updated_at":"2026-07-05T02:54:13.735737+00:00"}