{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:IN7URJSMARCN6DAAPX4J7QIK5B","short_pith_number":"pith:IN7URJSM","schema_version":"1.0","canonical_sha256":"437f48a64c0444df0c007df89fc10ae8730556b4c3ac596129e802d913b31094","source":{"kind":"arxiv","id":"2410.16363","version":1},"attestation_state":"computed","paper":{"title":"Learning to generate high-dimensional distributions with low-dimensional quantum Boltzmann machines","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["physics.comp-ph"],"primary_cat":"quant-ph","authors_text":"Cenk T\\\"uys\\\"uz, Enrico Rinaldi, Karl Jansen, Luuk Coopmans, Maria Demidik, Matthias Rosenkranz, Vincent Croft, Yacine Haddad","submitted_at":"2024-10-21T18:00:01Z","abstract_excerpt":"In recent years, researchers have been exploring ways to generalize Boltzmann machines (BMs) to quantum systems, leading to the development of variations such as fully-visible and restricted quantum Boltzmann machines (QBMs). Due to the non-commuting nature of their Hamiltonians, restricted QBMs face trainability issues, whereas fully-visible QBMs have emerged as a more tractable option, as recent results demonstrate their sample-efficient trainability. These results position fully-visible QBMs as a favorable choice, offering potential improvements over fully-visible BMs without suffering from"},"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":"2410.16363","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-10-21T18:00:01Z","cross_cats_sorted":["physics.comp-ph"],"title_canon_sha256":"2d63c1b14d6cda2c7ee90d0f58eae27d4c452b2eaa29e9d4f2bd3e948aceaab4","abstract_canon_sha256":"bb486af41730b20ba95730d99dde0eabe1124cff2d3d82c9d4ba6bd492e6b78d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:23:35.175416Z","signature_b64":"+GyTbnoQE27kcx3+clBfzEWtNWGSddT6wDaan0Vv5HgBvG3uZXCLPCuUKtzC0yrEk0EClNcQ2i0cZyUsFTK8Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"437f48a64c0444df0c007df89fc10ae8730556b4c3ac596129e802d913b31094","last_reissued_at":"2026-07-05T09:23:35.174894Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:23:35.174894Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning to generate high-dimensional distributions with low-dimensional quantum Boltzmann machines","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["physics.comp-ph"],"primary_cat":"quant-ph","authors_text":"Cenk T\\\"uys\\\"uz, Enrico Rinaldi, Karl Jansen, Luuk Coopmans, Maria Demidik, Matthias Rosenkranz, Vincent Croft, Yacine Haddad","submitted_at":"2024-10-21T18:00:01Z","abstract_excerpt":"In recent years, researchers have been exploring ways to generalize Boltzmann machines (BMs) to quantum systems, leading to the development of variations such as fully-visible and restricted quantum Boltzmann machines (QBMs). Due to the non-commuting nature of their Hamiltonians, restricted QBMs face trainability issues, whereas fully-visible QBMs have emerged as a more tractable option, as recent results demonstrate their sample-efficient trainability. These results position fully-visible QBMs as a favorable choice, offering potential improvements over fully-visible BMs without suffering from"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.16363","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/2410.16363/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":"2410.16363","created_at":"2026-07-05T09:23:35.174956+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.16363v1","created_at":"2026-07-05T09:23:35.174956+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.16363","created_at":"2026-07-05T09:23:35.174956+00:00"},{"alias_kind":"pith_short_12","alias_value":"IN7URJSMARCN","created_at":"2026-07-05T09:23:35.174956+00:00"},{"alias_kind":"pith_short_16","alias_value":"IN7URJSMARCN6DAA","created_at":"2026-07-05T09:23:35.174956+00:00"},{"alias_kind":"pith_short_8","alias_value":"IN7URJSM","created_at":"2026-07-05T09:23:35.174956+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.28483","citing_title":"Quantum Fourier Generative Models Trainable at Large Scale","ref_index":15,"is_internal_anchor":false},{"citing_arxiv_id":"2604.23382","citing_title":"Non-unitary extension of Grover's search algorithm","ref_index":80,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IN7URJSMARCN6DAAPX4J7QIK5B","json":"https://pith.science/pith/IN7URJSMARCN6DAAPX4J7QIK5B.json","graph_json":"https://pith.science/api/pith-number/IN7URJSMARCN6DAAPX4J7QIK5B/graph.json","events_json":"https://pith.science/api/pith-number/IN7URJSMARCN6DAAPX4J7QIK5B/events.json","paper":"https://pith.science/paper/IN7URJSM"},"agent_actions":{"view_html":"https://pith.science/pith/IN7URJSMARCN6DAAPX4J7QIK5B","download_json":"https://pith.science/pith/IN7URJSMARCN6DAAPX4J7QIK5B.json","view_paper":"https://pith.science/paper/IN7URJSM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.16363&json=true","fetch_graph":"https://pith.science/api/pith-number/IN7URJSMARCN6DAAPX4J7QIK5B/graph.json","fetch_events":"https://pith.science/api/pith-number/IN7URJSMARCN6DAAPX4J7QIK5B/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IN7URJSMARCN6DAAPX4J7QIK5B/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IN7URJSMARCN6DAAPX4J7QIK5B/action/storage_attestation","attest_author":"https://pith.science/pith/IN7URJSMARCN6DAAPX4J7QIK5B/action/author_attestation","sign_citation":"https://pith.science/pith/IN7URJSMARCN6DAAPX4J7QIK5B/action/citation_signature","submit_replication":"https://pith.science/pith/IN7URJSMARCN6DAAPX4J7QIK5B/action/replication_record"}},"created_at":"2026-07-05T09:23:35.174956+00:00","updated_at":"2026-07-05T09:23:35.174956+00:00"}