{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:PPKDWZXQ2LZTVIZVG2O7SLKO7W","short_pith_number":"pith:PPKDWZXQ","canonical_record":{"source":{"id":"1802.00045","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-01-31T20:01:37Z","cross_cats_sorted":[],"title_canon_sha256":"3ca63dfdafcc063b60307bcafa254d57ebddfc48305cefa9d16cc2e041801371","abstract_canon_sha256":"7f08c233e15152ce59557068fffe9023e2a9372b2ec9374e35f9b3bdd13ca0cb"},"schema_version":"1.0"},"canonical_sha256":"7bd43b66f0d2f33aa335369df92d4efdb3ea5b6727a131888980ffa95f710783","source":{"kind":"arxiv","id":"1802.00045","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.00045","created_at":"2026-05-18T00:24:36Z"},{"alias_kind":"arxiv_version","alias_value":"1802.00045v1","created_at":"2026-05-18T00:24:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.00045","created_at":"2026-05-18T00:24:36Z"},{"alias_kind":"pith_short_12","alias_value":"PPKDWZXQ2LZT","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"PPKDWZXQ2LZTVIZV","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"PPKDWZXQ","created_at":"2026-05-18T12:32:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:PPKDWZXQ2LZTVIZVG2O7SLKO7W","target":"record","payload":{"canonical_record":{"source":{"id":"1802.00045","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-01-31T20:01:37Z","cross_cats_sorted":[],"title_canon_sha256":"3ca63dfdafcc063b60307bcafa254d57ebddfc48305cefa9d16cc2e041801371","abstract_canon_sha256":"7f08c233e15152ce59557068fffe9023e2a9372b2ec9374e35f9b3bdd13ca0cb"},"schema_version":"1.0"},"canonical_sha256":"7bd43b66f0d2f33aa335369df92d4efdb3ea5b6727a131888980ffa95f710783","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:24:36.924162Z","signature_b64":"ftcUlSeIre7fVgXiyh7KATqSCRUiI+fkyVe2nUzCmuHudRSRANqV110L7uZvOfVPWfSNuGtjngJpJCBYJAEfDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7bd43b66f0d2f33aa335369df92d4efdb3ea5b6727a131888980ffa95f710783","last_reissued_at":"2026-05-18T00:24:36.923639Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:24:36.923639Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.00045","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:24:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mwljVehhf90Kn3LX+jNqYqYfn3pmikbbbbbF6D6KXY0mVd21ankjx2uNd0c6QOhA0Ffoq1M7qzfxO51WTLPbCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T20:22:03.512218Z"},"content_sha256":"2cc998e59224f100c4c8c65a2631d704d93401190dc8a9a0a811d87783a0a8f7","schema_version":"1.0","event_id":"sha256:2cc998e59224f100c4c8c65a2631d704d93401190dc8a9a0a811d87783a0a8f7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:PPKDWZXQ2LZTVIZVG2O7SLKO7W","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Composite Gaussian Processes: Scalable Computation and Performance Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Dave Zachariah, Edith C. H. Ngai, Xiuming Liu","submitted_at":"2018-01-31T20:01:37Z","abstract_excerpt":"Gaussian process (GP) models provide a powerful tool for prediction but are computationally prohibitive using large data sets. In such scenarios, one has to resort to approximate methods. We derive an approximation based on a composite likelihood approach using a general belief updating framework, which leads to a recursive computation of the predictor as well as of learning the hyper-parameters. We then provide an analysis of the derived composite GP model in predictive and information-theoretic terms. Finally, we evaluate the approximation with both synthetic data and a real-world applicatio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.00045","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:24:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"109S2YF+p4tovhbUFO6He3CEsUktlOsAH/Ydvc/KcIrsD5pnWFb/0fjQSIWALY/KtCR6RdiWosrHe2oeQ9vmCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T20:22:03.512947Z"},"content_sha256":"2db66f45436adde74a7c31a8be8d1ba25400f4a978c3ec7a718368cf99ac1570","schema_version":"1.0","event_id":"sha256:2db66f45436adde74a7c31a8be8d1ba25400f4a978c3ec7a718368cf99ac1570"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PPKDWZXQ2LZTVIZVG2O7SLKO7W/bundle.json","state_url":"https://pith.science/pith/PPKDWZXQ2LZTVIZVG2O7SLKO7W/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PPKDWZXQ2LZTVIZVG2O7SLKO7W/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-25T20:22:03Z","links":{"resolver":"https://pith.science/pith/PPKDWZXQ2LZTVIZVG2O7SLKO7W","bundle":"https://pith.science/pith/PPKDWZXQ2LZTVIZVG2O7SLKO7W/bundle.json","state":"https://pith.science/pith/PPKDWZXQ2LZTVIZVG2O7SLKO7W/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PPKDWZXQ2LZTVIZVG2O7SLKO7W/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:PPKDWZXQ2LZTVIZVG2O7SLKO7W","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":"7f08c233e15152ce59557068fffe9023e2a9372b2ec9374e35f9b3bdd13ca0cb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-01-31T20:01:37Z","title_canon_sha256":"3ca63dfdafcc063b60307bcafa254d57ebddfc48305cefa9d16cc2e041801371"},"schema_version":"1.0","source":{"id":"1802.00045","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.00045","created_at":"2026-05-18T00:24:36Z"},{"alias_kind":"arxiv_version","alias_value":"1802.00045v1","created_at":"2026-05-18T00:24:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.00045","created_at":"2026-05-18T00:24:36Z"},{"alias_kind":"pith_short_12","alias_value":"PPKDWZXQ2LZT","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"PPKDWZXQ2LZTVIZV","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"PPKDWZXQ","created_at":"2026-05-18T12:32:46Z"}],"graph_snapshots":[{"event_id":"sha256:2db66f45436adde74a7c31a8be8d1ba25400f4a978c3ec7a718368cf99ac1570","target":"graph","created_at":"2026-05-18T00:24: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 process (GP) models provide a powerful tool for prediction but are computationally prohibitive using large data sets. In such scenarios, one has to resort to approximate methods. We derive an approximation based on a composite likelihood approach using a general belief updating framework, which leads to a recursive computation of the predictor as well as of learning the hyper-parameters. We then provide an analysis of the derived composite GP model in predictive and information-theoretic terms. Finally, we evaluate the approximation with both synthetic data and a real-world applicatio","authors_text":"Dave Zachariah, Edith C. H. Ngai, Xiuming Liu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-01-31T20:01:37Z","title":"Composite Gaussian Processes: Scalable Computation and Performance Analysis"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.00045","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:2cc998e59224f100c4c8c65a2631d704d93401190dc8a9a0a811d87783a0a8f7","target":"record","created_at":"2026-05-18T00:24: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":"7f08c233e15152ce59557068fffe9023e2a9372b2ec9374e35f9b3bdd13ca0cb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-01-31T20:01:37Z","title_canon_sha256":"3ca63dfdafcc063b60307bcafa254d57ebddfc48305cefa9d16cc2e041801371"},"schema_version":"1.0","source":{"id":"1802.00045","kind":"arxiv","version":1}},"canonical_sha256":"7bd43b66f0d2f33aa335369df92d4efdb3ea5b6727a131888980ffa95f710783","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7bd43b66f0d2f33aa335369df92d4efdb3ea5b6727a131888980ffa95f710783","first_computed_at":"2026-05-18T00:24:36.923639Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:24:36.923639Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ftcUlSeIre7fVgXiyh7KATqSCRUiI+fkyVe2nUzCmuHudRSRANqV110L7uZvOfVPWfSNuGtjngJpJCBYJAEfDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:24:36.924162Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.00045","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2cc998e59224f100c4c8c65a2631d704d93401190dc8a9a0a811d87783a0a8f7","sha256:2db66f45436adde74a7c31a8be8d1ba25400f4a978c3ec7a718368cf99ac1570"],"state_sha256":"792a3ea52e6771e0d837ea76e2bf208be0160c4333535093189da8a8fb4b29fa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pEUoGSZxm/L8xLXNmN8xkO43/yALTCV0FDajboq+yl3dx00+74dexmGyfTOg6Zu1itrcSepE6OqW5XVSOQkYDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T20:22:03.516758Z","bundle_sha256":"4328c8501c5deddc6de76d85be55b9f29902e4c85146eeb6f0a9f542979a0989"}}