{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:5HKYEC7K5BIFFMCPS3VNIT23K2","short_pith_number":"pith:5HKYEC7K","canonical_record":{"source":{"id":"1709.07903","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-09-22T18:38:31Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"bb38b3247ccb87053e7f2648b6722267a3ce4a9269a3b621f70d194900f7bf9e","abstract_canon_sha256":"dd0b7232e35267c48c992bb274e2ddf29e74bb318b4e80f3bd1d401e4f257f1e"},"schema_version":"1.0"},"canonical_sha256":"e9d5820beae85052b04f96ead44f5b56a01089b2588ba65a4954e4d68e8549eb","source":{"kind":"arxiv","id":"1709.07903","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.07903","created_at":"2026-05-18T00:16:23Z"},{"alias_kind":"arxiv_version","alias_value":"1709.07903v3","created_at":"2026-05-18T00:16:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.07903","created_at":"2026-05-18T00:16:23Z"},{"alias_kind":"pith_short_12","alias_value":"5HKYEC7K5BIF","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"5HKYEC7K5BIFFMCP","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"5HKYEC7K","created_at":"2026-05-18T12:31:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:5HKYEC7K5BIFFMCPS3VNIT23K2","target":"record","payload":{"canonical_record":{"source":{"id":"1709.07903","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-09-22T18:38:31Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"bb38b3247ccb87053e7f2648b6722267a3ce4a9269a3b621f70d194900f7bf9e","abstract_canon_sha256":"dd0b7232e35267c48c992bb274e2ddf29e74bb318b4e80f3bd1d401e4f257f1e"},"schema_version":"1.0"},"canonical_sha256":"e9d5820beae85052b04f96ead44f5b56a01089b2588ba65a4954e4d68e8549eb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:23.607777Z","signature_b64":"7ek0ub6i+gFHF7CJ7QX2X4SUbx4PhfLqhErPRstyK3I99io8f/UpxZE874V/PzUZt5tbhcQR0mZZ0wO8VbrgAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e9d5820beae85052b04f96ead44f5b56a01089b2588ba65a4954e4d68e8549eb","last_reissued_at":"2026-05-18T00:16:23.607189Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:23.607189Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1709.07903","source_version":3,"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:16:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qOKgC4qEzcafOCGR0c+94qjY1lfsaugorKasjrcKCj0J2sFL1r0GsfeMOcRrwb37/JwFWzL3eN7wx5jP1VmpCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T17:29:20.089309Z"},"content_sha256":"9712d4cef7e9dab0af5873967eb138f5fda8effcd7af7c69522a951c27416c4e","schema_version":"1.0","event_id":"sha256:9712d4cef7e9dab0af5873967eb138f5fda8effcd7af7c69522a951c27416c4e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:5HKYEC7K5BIFFMCPS3VNIT23K2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Ensemble Multi-task Gaussian Process Regression with Multiple Latent Processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Eric L. Miller, Weitong Ruan","submitted_at":"2017-09-22T18:38:31Z","abstract_excerpt":"Multi-task/Multi-output learning seeks to exploit correlation among tasks to enhance performance over learning or solving each task independently. In this paper, we investigate this problem in the context of Gaussian Processes (GPs) and propose a new model which learns a mixture of latent processes by decomposing the covariance matrix into a sum of structured hidden components each of which is controlled by a latent GP over input features and a \"weight\" over tasks. From this sum structure, we propose a parallelizable parameter learning algorithm with a predetermined initialization for the \"wei"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.07903","kind":"arxiv","version":3},"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:16:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0OrxE8KedqXXrY1uihgQgmaHfT0vwedFmg7kGxFoPnaQ5HslgmEpTiIzO4vjJTz9I6blgK/j3UaNcMnaXHelAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T17:29:20.089684Z"},"content_sha256":"ae838c0aa31293f18cf120454c4613dc0a151ab074c0d85d8188556cb3bd8c48","schema_version":"1.0","event_id":"sha256:ae838c0aa31293f18cf120454c4613dc0a151ab074c0d85d8188556cb3bd8c48"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5HKYEC7K5BIFFMCPS3VNIT23K2/bundle.json","state_url":"https://pith.science/pith/5HKYEC7K5BIFFMCPS3VNIT23K2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5HKYEC7K5BIFFMCPS3VNIT23K2/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-23T17:29:20Z","links":{"resolver":"https://pith.science/pith/5HKYEC7K5BIFFMCPS3VNIT23K2","bundle":"https://pith.science/pith/5HKYEC7K5BIFFMCPS3VNIT23K2/bundle.json","state":"https://pith.science/pith/5HKYEC7K5BIFFMCPS3VNIT23K2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5HKYEC7K5BIFFMCPS3VNIT23K2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:5HKYEC7K5BIFFMCPS3VNIT23K2","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":"dd0b7232e35267c48c992bb274e2ddf29e74bb318b4e80f3bd1d401e4f257f1e","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-09-22T18:38:31Z","title_canon_sha256":"bb38b3247ccb87053e7f2648b6722267a3ce4a9269a3b621f70d194900f7bf9e"},"schema_version":"1.0","source":{"id":"1709.07903","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.07903","created_at":"2026-05-18T00:16:23Z"},{"alias_kind":"arxiv_version","alias_value":"1709.07903v3","created_at":"2026-05-18T00:16:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.07903","created_at":"2026-05-18T00:16:23Z"},{"alias_kind":"pith_short_12","alias_value":"5HKYEC7K5BIF","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"5HKYEC7K5BIFFMCP","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"5HKYEC7K","created_at":"2026-05-18T12:31:00Z"}],"graph_snapshots":[{"event_id":"sha256:ae838c0aa31293f18cf120454c4613dc0a151ab074c0d85d8188556cb3bd8c48","target":"graph","created_at":"2026-05-18T00:16:23Z","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":"Multi-task/Multi-output learning seeks to exploit correlation among tasks to enhance performance over learning or solving each task independently. In this paper, we investigate this problem in the context of Gaussian Processes (GPs) and propose a new model which learns a mixture of latent processes by decomposing the covariance matrix into a sum of structured hidden components each of which is controlled by a latent GP over input features and a \"weight\" over tasks. From this sum structure, we propose a parallelizable parameter learning algorithm with a predetermined initialization for the \"wei","authors_text":"Eric L. Miller, Weitong Ruan","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-09-22T18:38:31Z","title":"Ensemble Multi-task Gaussian Process Regression with Multiple Latent Processes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.07903","kind":"arxiv","version":3},"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:9712d4cef7e9dab0af5873967eb138f5fda8effcd7af7c69522a951c27416c4e","target":"record","created_at":"2026-05-18T00:16:23Z","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":"dd0b7232e35267c48c992bb274e2ddf29e74bb318b4e80f3bd1d401e4f257f1e","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-09-22T18:38:31Z","title_canon_sha256":"bb38b3247ccb87053e7f2648b6722267a3ce4a9269a3b621f70d194900f7bf9e"},"schema_version":"1.0","source":{"id":"1709.07903","kind":"arxiv","version":3}},"canonical_sha256":"e9d5820beae85052b04f96ead44f5b56a01089b2588ba65a4954e4d68e8549eb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e9d5820beae85052b04f96ead44f5b56a01089b2588ba65a4954e4d68e8549eb","first_computed_at":"2026-05-18T00:16:23.607189Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:16:23.607189Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7ek0ub6i+gFHF7CJ7QX2X4SUbx4PhfLqhErPRstyK3I99io8f/UpxZE874V/PzUZt5tbhcQR0mZZ0wO8VbrgAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:16:23.607777Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.07903","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9712d4cef7e9dab0af5873967eb138f5fda8effcd7af7c69522a951c27416c4e","sha256:ae838c0aa31293f18cf120454c4613dc0a151ab074c0d85d8188556cb3bd8c48"],"state_sha256":"ebfd8342f286e4757f46df62ce0373270504f74fda2c8f6b91828e8b5fb280c5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J1Uf6WFTfKlZ1McRSA3jmSkqu4TNcGS3lXv6Yz6zL8oL1TNGp5SlO50FySIReo7f3oaGgAsX7oSuBcZE/VWzBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T17:29:20.091640Z","bundle_sha256":"bdfa8c4ae588491ed09d475335b302abb2e1aad0cb6495e12057e9909d194ac3"}}