{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:VYSGJK5MUYZYYE2FGNL7GBDYBU","short_pith_number":"pith:VYSGJK5M","canonical_record":{"source":{"id":"1711.02038","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-11-06T17:44:03Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"fa407d3fa59b19a713ec28187821d5250e47f361ce8ef945cd31a9678123b7b4","abstract_canon_sha256":"5d8ee59cabccc1c19675315d5e7c89722f006a190966b06cd0a48e3c475bd04e"},"schema_version":"1.0"},"canonical_sha256":"ae2464abaca6338c13453357f304780d3c5d2a41ea7849b936df764c514d2fd4","source":{"kind":"arxiv","id":"1711.02038","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.02038","created_at":"2026-05-18T00:31:14Z"},{"alias_kind":"arxiv_version","alias_value":"1711.02038v1","created_at":"2026-05-18T00:31:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.02038","created_at":"2026-05-18T00:31:14Z"},{"alias_kind":"pith_short_12","alias_value":"VYSGJK5MUYZY","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"VYSGJK5MUYZYYE2F","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"VYSGJK5M","created_at":"2026-05-18T12:31:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:VYSGJK5MUYZYYE2FGNL7GBDYBU","target":"record","payload":{"canonical_record":{"source":{"id":"1711.02038","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-11-06T17:44:03Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"fa407d3fa59b19a713ec28187821d5250e47f361ce8ef945cd31a9678123b7b4","abstract_canon_sha256":"5d8ee59cabccc1c19675315d5e7c89722f006a190966b06cd0a48e3c475bd04e"},"schema_version":"1.0"},"canonical_sha256":"ae2464abaca6338c13453357f304780d3c5d2a41ea7849b936df764c514d2fd4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:14.527331Z","signature_b64":"eVemyZsN+y2k+tLhixu+6I/yIUQwAUE3LWH7wRpaJQnrDJTlWlOumuexEWBJtMlTMUH/sI51aEvAWEghdJPqAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ae2464abaca6338c13453357f304780d3c5d2a41ea7849b936df764c514d2fd4","last_reissued_at":"2026-05-18T00:31:14.526543Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:14.526543Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.02038","source_version":1,"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:31:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0srp557ODNYg/U2h370m+uipib+WK9kufG900LypsV8Mh6mz2R0MQjElsfaE7p/g2h6Cm+5Ht5qcS1kw15sIAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T15:39:04.971905Z"},"content_sha256":"41d39c07c0867904e9d951509f5690153652edc2c96d100a98b9f7c5dcc58ec4","schema_version":"1.0","event_id":"sha256:41d39c07c0867904e9d951509f5690153652edc2c96d100a98b9f7c5dcc58ec4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:VYSGJK5MUYZYYE2FGNL7GBDYBU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An efficient quantum algorithm for generative machine learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"quant-ph","authors_text":"Luming Duan, Xun Gao, Zhengyu Zhang","submitted_at":"2017-11-06T17:44:03Z","abstract_excerpt":"A central task in the field of quantum computing is to find applications where quantum computer could provide exponential speedup over any classical computer. Machine learning represents an important field with broad applications where quantum computer may offer significant speedup. Several quantum algorithms for discriminative machine learning have been found based on efficient solving of linear algebraic problems, with potential exponential speedup in runtime under the assumption of effective input from a quantum random access memory. In machine learning, generative models represent another "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.02038","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"},"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:31:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FLoamFr72N09mOfnlG0ncZe0T/PVH3sp+gUDDDMctFKE4TIoFFtYl5gzFGTr/6e+5DoMDpM8GbQE03lBq/KWBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T15:39:04.972257Z"},"content_sha256":"4a5214c5a6fe4c4785cfa015ef8a9811c2dd61c964e50009545b9447345123fb","schema_version":"1.0","event_id":"sha256:4a5214c5a6fe4c4785cfa015ef8a9811c2dd61c964e50009545b9447345123fb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VYSGJK5MUYZYYE2FGNL7GBDYBU/bundle.json","state_url":"https://pith.science/pith/VYSGJK5MUYZYYE2FGNL7GBDYBU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VYSGJK5MUYZYYE2FGNL7GBDYBU/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-09T15:39:04Z","links":{"resolver":"https://pith.science/pith/VYSGJK5MUYZYYE2FGNL7GBDYBU","bundle":"https://pith.science/pith/VYSGJK5MUYZYYE2FGNL7GBDYBU/bundle.json","state":"https://pith.science/pith/VYSGJK5MUYZYYE2FGNL7GBDYBU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VYSGJK5MUYZYYE2FGNL7GBDYBU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:VYSGJK5MUYZYYE2FGNL7GBDYBU","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":"5d8ee59cabccc1c19675315d5e7c89722f006a190966b06cd0a48e3c475bd04e","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-11-06T17:44:03Z","title_canon_sha256":"fa407d3fa59b19a713ec28187821d5250e47f361ce8ef945cd31a9678123b7b4"},"schema_version":"1.0","source":{"id":"1711.02038","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.02038","created_at":"2026-05-18T00:31:14Z"},{"alias_kind":"arxiv_version","alias_value":"1711.02038v1","created_at":"2026-05-18T00:31:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.02038","created_at":"2026-05-18T00:31:14Z"},{"alias_kind":"pith_short_12","alias_value":"VYSGJK5MUYZY","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"VYSGJK5MUYZYYE2F","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"VYSGJK5M","created_at":"2026-05-18T12:31:49Z"}],"graph_snapshots":[{"event_id":"sha256:4a5214c5a6fe4c4785cfa015ef8a9811c2dd61c964e50009545b9447345123fb","target":"graph","created_at":"2026-05-18T00:31:14Z","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":"A central task in the field of quantum computing is to find applications where quantum computer could provide exponential speedup over any classical computer. Machine learning represents an important field with broad applications where quantum computer may offer significant speedup. Several quantum algorithms for discriminative machine learning have been found based on efficient solving of linear algebraic problems, with potential exponential speedup in runtime under the assumption of effective input from a quantum random access memory. In machine learning, generative models represent another ","authors_text":"Luming Duan, Xun Gao, Zhengyu Zhang","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-11-06T17:44:03Z","title":"An efficient quantum algorithm for generative machine learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.02038","kind":"arxiv","version":1},"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:41d39c07c0867904e9d951509f5690153652edc2c96d100a98b9f7c5dcc58ec4","target":"record","created_at":"2026-05-18T00:31:14Z","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":"5d8ee59cabccc1c19675315d5e7c89722f006a190966b06cd0a48e3c475bd04e","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-11-06T17:44:03Z","title_canon_sha256":"fa407d3fa59b19a713ec28187821d5250e47f361ce8ef945cd31a9678123b7b4"},"schema_version":"1.0","source":{"id":"1711.02038","kind":"arxiv","version":1}},"canonical_sha256":"ae2464abaca6338c13453357f304780d3c5d2a41ea7849b936df764c514d2fd4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ae2464abaca6338c13453357f304780d3c5d2a41ea7849b936df764c514d2fd4","first_computed_at":"2026-05-18T00:31:14.526543Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:31:14.526543Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"eVemyZsN+y2k+tLhixu+6I/yIUQwAUE3LWH7wRpaJQnrDJTlWlOumuexEWBJtMlTMUH/sI51aEvAWEghdJPqAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:31:14.527331Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.02038","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:41d39c07c0867904e9d951509f5690153652edc2c96d100a98b9f7c5dcc58ec4","sha256:4a5214c5a6fe4c4785cfa015ef8a9811c2dd61c964e50009545b9447345123fb"],"state_sha256":"b54a8cde3412f37d150168551c949176fd7ab502461f26046fcb16a723222f53"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MYAI4xvtwaxaccAzkpv5faG3lWSEUsCFFIQbnko5R4kJgUpOlF7egiKlG9mLFD2x3tCxxwic8zzc3K0Gq9AaCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T15:39:04.974407Z","bundle_sha256":"0d234e3879234e7ede80f8ddf474d58840598ff18802427610c896785adddbe1"}}