{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:7ATMXGSSM32QPW4EMWFMJ26PNB","short_pith_number":"pith:7ATMXGSS","canonical_record":{"source":{"id":"1803.10520","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-03-28T10:53:37Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"756742dbeae5de2cdca02060e6bd2c81ed888867f286073f03a451746064a7a7","abstract_canon_sha256":"1033020093f0d6b98e34a61e856fa530182adc712b5dc6e3d9a1a9b763db7df1"},"schema_version":"1.0"},"canonical_sha256":"f826cb9a5266f507db84658ac4ebcf6873739d632e841493e021219cc1f00fe9","source":{"kind":"arxiv","id":"1803.10520","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.10520","created_at":"2026-05-17T23:40:36Z"},{"alias_kind":"arxiv_version","alias_value":"1803.10520v1","created_at":"2026-05-17T23:40:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.10520","created_at":"2026-05-17T23:40:36Z"},{"alias_kind":"pith_short_12","alias_value":"7ATMXGSSM32Q","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"7ATMXGSSM32QPW4E","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"7ATMXGSS","created_at":"2026-05-18T12:32:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:7ATMXGSSM32QPW4EMWFMJ26PNB","target":"record","payload":{"canonical_record":{"source":{"id":"1803.10520","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-03-28T10:53:37Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"756742dbeae5de2cdca02060e6bd2c81ed888867f286073f03a451746064a7a7","abstract_canon_sha256":"1033020093f0d6b98e34a61e856fa530182adc712b5dc6e3d9a1a9b763db7df1"},"schema_version":"1.0"},"canonical_sha256":"f826cb9a5266f507db84658ac4ebcf6873739d632e841493e021219cc1f00fe9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:36.539801Z","signature_b64":"0BacmzT3laemG4BMPwuY95nH9jGxeFqHPuUIRURBJ4dMgoLMdHF9+/seUJcrtBXSPKXldxDoowx2UEe+bf1nCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f826cb9a5266f507db84658ac4ebcf6873739d632e841493e021219cc1f00fe9","last_reissued_at":"2026-05-17T23:40:36.539404Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:36.539404Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.10520","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-17T23:40:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Vnndo1FS9pjy9Gke8w3Iwb9q60cwStThzilaFqVP7Gzi2wR6SwouBRoYK4DmOkmAPpCWKo93t/zkCfWc4f0AAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T17:53:50.946721Z"},"content_sha256":"396f1a75e55d1e29d6018636efcf4eba1757d0c743aa1cdfa22316d83f537cbb","schema_version":"1.0","event_id":"sha256:396f1a75e55d1e29d6018636efcf4eba1757d0c743aa1cdfa22316d83f537cbb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:7ATMXGSSM32QPW4EMWFMJ26PNB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Quantum algorithms for training Gaussian Processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"quant-ph","authors_text":"Jack K. Fitzsimons, Joseph F. Fitzsimons, Michael A. Osborne, Stephen J. Roberts, Zhikuan Zhao","submitted_at":"2018-03-28T10:53:37Z","abstract_excerpt":"Gaussian processes (GPs) are important models in supervised machine learning. Training in Gaussian processes refers to selecting the covariance functions and the associated parameters in order to improve the outcome of predictions, the core of which amounts to evaluating the logarithm of the marginal likelihood (LML) of a given model. LML gives a concrete measure of the quality of prediction that a GP model is expected to achieve. The classical computation of LML typically carries a polynomial time overhead with respect to the input size. We propose a quantum algorithm that computes the logari"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.10520","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-17T23:40:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JMgUZkJ5StAMZ2f1s7JXktdiCaSzuxIP1nD8XnrEFeoqugKFvEGMf2jOZkr42iICI1Hf+iieuRXvj4011rLZCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T17:53:50.947069Z"},"content_sha256":"acb862eccaa3804782f1c8b958a3e98641e41d2be32be389ac4bf71c2c35aff1","schema_version":"1.0","event_id":"sha256:acb862eccaa3804782f1c8b958a3e98641e41d2be32be389ac4bf71c2c35aff1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7ATMXGSSM32QPW4EMWFMJ26PNB/bundle.json","state_url":"https://pith.science/pith/7ATMXGSSM32QPW4EMWFMJ26PNB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7ATMXGSSM32QPW4EMWFMJ26PNB/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-29T17:53:50Z","links":{"resolver":"https://pith.science/pith/7ATMXGSSM32QPW4EMWFMJ26PNB","bundle":"https://pith.science/pith/7ATMXGSSM32QPW4EMWFMJ26PNB/bundle.json","state":"https://pith.science/pith/7ATMXGSSM32QPW4EMWFMJ26PNB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7ATMXGSSM32QPW4EMWFMJ26PNB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:7ATMXGSSM32QPW4EMWFMJ26PNB","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":"1033020093f0d6b98e34a61e856fa530182adc712b5dc6e3d9a1a9b763db7df1","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-03-28T10:53:37Z","title_canon_sha256":"756742dbeae5de2cdca02060e6bd2c81ed888867f286073f03a451746064a7a7"},"schema_version":"1.0","source":{"id":"1803.10520","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.10520","created_at":"2026-05-17T23:40:36Z"},{"alias_kind":"arxiv_version","alias_value":"1803.10520v1","created_at":"2026-05-17T23:40:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.10520","created_at":"2026-05-17T23:40:36Z"},{"alias_kind":"pith_short_12","alias_value":"7ATMXGSSM32Q","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"7ATMXGSSM32QPW4E","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"7ATMXGSS","created_at":"2026-05-18T12:32:11Z"}],"graph_snapshots":[{"event_id":"sha256:acb862eccaa3804782f1c8b958a3e98641e41d2be32be389ac4bf71c2c35aff1","target":"graph","created_at":"2026-05-17T23:40:36Z","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":"Gaussian processes (GPs) are important models in supervised machine learning. Training in Gaussian processes refers to selecting the covariance functions and the associated parameters in order to improve the outcome of predictions, the core of which amounts to evaluating the logarithm of the marginal likelihood (LML) of a given model. LML gives a concrete measure of the quality of prediction that a GP model is expected to achieve. The classical computation of LML typically carries a polynomial time overhead with respect to the input size. We propose a quantum algorithm that computes the logari","authors_text":"Jack K. Fitzsimons, Joseph F. Fitzsimons, Michael A. Osborne, Stephen J. Roberts, Zhikuan Zhao","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-03-28T10:53:37Z","title":"Quantum algorithms for training Gaussian Processes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.10520","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:396f1a75e55d1e29d6018636efcf4eba1757d0c743aa1cdfa22316d83f537cbb","target":"record","created_at":"2026-05-17T23:40:36Z","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":"1033020093f0d6b98e34a61e856fa530182adc712b5dc6e3d9a1a9b763db7df1","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-03-28T10:53:37Z","title_canon_sha256":"756742dbeae5de2cdca02060e6bd2c81ed888867f286073f03a451746064a7a7"},"schema_version":"1.0","source":{"id":"1803.10520","kind":"arxiv","version":1}},"canonical_sha256":"f826cb9a5266f507db84658ac4ebcf6873739d632e841493e021219cc1f00fe9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f826cb9a5266f507db84658ac4ebcf6873739d632e841493e021219cc1f00fe9","first_computed_at":"2026-05-17T23:40:36.539404Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:40:36.539404Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0BacmzT3laemG4BMPwuY95nH9jGxeFqHPuUIRURBJ4dMgoLMdHF9+/seUJcrtBXSPKXldxDoowx2UEe+bf1nCg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:40:36.539801Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.10520","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:396f1a75e55d1e29d6018636efcf4eba1757d0c743aa1cdfa22316d83f537cbb","sha256:acb862eccaa3804782f1c8b958a3e98641e41d2be32be389ac4bf71c2c35aff1"],"state_sha256":"7a8f58ece7bcc97fd53b253f7398c2838a3550e590ad4402ce64f31c61e5b3f3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rcSzQ7A2IW5OH3/ULA5cRTeAYIdYPUL3ycfaoPJ//XA3TNZFtAH4sflcvfWi1CB0tUBwv8QAhY1sq6ELe5ndCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T17:53:50.949169Z","bundle_sha256":"07573a64dbc6f6ae31f32f01d62152475ef39a3ad387b84f251c9bf3d9c05244"}}