{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:SSJPV4CFORGX3RXL6QUAW3FIWL","short_pith_number":"pith:SSJPV4CF","canonical_record":{"source":{"id":"1803.07551","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-03-20T17:51:10Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"b9580765fdd01d8709ea42d878e69281037d90871d8eb7378e50fa3e5d328a13","abstract_canon_sha256":"fd6a0a4a549c80b9b8fb0b5264759860e32e668b37fb716e656832be1d49bf89"},"schema_version":"1.0"},"canonical_sha256":"9492faf045744d7dc6ebf4280b6ca8b2d864ab28a738ce22565429039894b8db","source":{"kind":"arxiv","id":"1803.07551","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.07551","created_at":"2026-05-18T00:11:17Z"},{"alias_kind":"arxiv_version","alias_value":"1803.07551v2","created_at":"2026-05-18T00:11:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.07551","created_at":"2026-05-18T00:11:17Z"},{"alias_kind":"pith_short_12","alias_value":"SSJPV4CFORGX","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"SSJPV4CFORGX3RXL","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"SSJPV4CF","created_at":"2026-05-18T12:32:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:SSJPV4CFORGX3RXL6QUAW3FIWL","target":"record","payload":{"canonical_record":{"source":{"id":"1803.07551","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-03-20T17:51:10Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"b9580765fdd01d8709ea42d878e69281037d90871d8eb7378e50fa3e5d328a13","abstract_canon_sha256":"fd6a0a4a549c80b9b8fb0b5264759860e32e668b37fb716e656832be1d49bf89"},"schema_version":"1.0"},"canonical_sha256":"9492faf045744d7dc6ebf4280b6ca8b2d864ab28a738ce22565429039894b8db","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:11:17.685637Z","signature_b64":"eEHHASMtqnkSnANcyKR5/lF+F3Q64cFpi2tYZhQy7lDHmqHf2FHyGgSZpeDnVO2zUddkxb7lbJMyZEdyhsIXDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9492faf045744d7dc6ebf4280b6ca8b2d864ab28a738ce22565429039894b8db","last_reissued_at":"2026-05-18T00:11:17.684945Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:11:17.684945Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.07551","source_version":2,"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:11:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z8HhUmyFxnm50aH7cgSGzg57DhsYfXgdV73PRcvS7NZLV6eyhodElw07TwQbfhHRX9Nh1g4WpJQGrqXt5xs7CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:26:08.538411Z"},"content_sha256":"bf92fb21e1063cc94d4f2d65ad017d6c255aece342c3dc182b80298627dc9baf","schema_version":"1.0","event_id":"sha256:bf92fb21e1063cc94d4f2d65ad017d6c255aece342c3dc182b80298627dc9baf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:SSJPV4CFORGX3RXL6QUAW3FIWL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Meta Reinforcement Learning with Latent Variable Gaussian Processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Katja Hofmann, Marc Peter Deisenroth, Steind\\'or S{\\ae}mundsson","submitted_at":"2018-03-20T17:51:10Z","abstract_excerpt":"Learning from small data sets is critical in many practical applications where data collection is time consuming or expensive, e.g., robotics, animal experiments or drug design. Meta learning is one way to increase the data efficiency of learning algorithms by generalizing learned concepts from a set of training tasks to unseen, but related, tasks. Often, this relationship between tasks is hard coded or relies in some other way on human expertise. In this paper, we frame meta learning as a hierarchical latent variable model and infer the relationship between tasks automatically from data. We a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.07551","kind":"arxiv","version":2},"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:11:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"efm3jcKiL09K17GTDBqzKpqH/g9fQQac3woxrZkhfKEPxAAXrCF1zDz/ejcCFkM/3JLfvoH42wribc6jUC/VCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:26:08.539324Z"},"content_sha256":"391aeab7b00f6e3bc9c60b600d1baa2e90ea12ce83556328863b3f8a78abde00","schema_version":"1.0","event_id":"sha256:391aeab7b00f6e3bc9c60b600d1baa2e90ea12ce83556328863b3f8a78abde00"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SSJPV4CFORGX3RXL6QUAW3FIWL/bundle.json","state_url":"https://pith.science/pith/SSJPV4CFORGX3RXL6QUAW3FIWL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SSJPV4CFORGX3RXL6QUAW3FIWL/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-25T18:26:08Z","links":{"resolver":"https://pith.science/pith/SSJPV4CFORGX3RXL6QUAW3FIWL","bundle":"https://pith.science/pith/SSJPV4CFORGX3RXL6QUAW3FIWL/bundle.json","state":"https://pith.science/pith/SSJPV4CFORGX3RXL6QUAW3FIWL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SSJPV4CFORGX3RXL6QUAW3FIWL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:SSJPV4CFORGX3RXL6QUAW3FIWL","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":"fd6a0a4a549c80b9b8fb0b5264759860e32e668b37fb716e656832be1d49bf89","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-03-20T17:51:10Z","title_canon_sha256":"b9580765fdd01d8709ea42d878e69281037d90871d8eb7378e50fa3e5d328a13"},"schema_version":"1.0","source":{"id":"1803.07551","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.07551","created_at":"2026-05-18T00:11:17Z"},{"alias_kind":"arxiv_version","alias_value":"1803.07551v2","created_at":"2026-05-18T00:11:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.07551","created_at":"2026-05-18T00:11:17Z"},{"alias_kind":"pith_short_12","alias_value":"SSJPV4CFORGX","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"SSJPV4CFORGX3RXL","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"SSJPV4CF","created_at":"2026-05-18T12:32:53Z"}],"graph_snapshots":[{"event_id":"sha256:391aeab7b00f6e3bc9c60b600d1baa2e90ea12ce83556328863b3f8a78abde00","target":"graph","created_at":"2026-05-18T00:11:17Z","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":"Learning from small data sets is critical in many practical applications where data collection is time consuming or expensive, e.g., robotics, animal experiments or drug design. Meta learning is one way to increase the data efficiency of learning algorithms by generalizing learned concepts from a set of training tasks to unseen, but related, tasks. Often, this relationship between tasks is hard coded or relies in some other way on human expertise. In this paper, we frame meta learning as a hierarchical latent variable model and infer the relationship between tasks automatically from data. We a","authors_text":"Katja Hofmann, Marc Peter Deisenroth, Steind\\'or S{\\ae}mundsson","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-03-20T17:51:10Z","title":"Meta Reinforcement Learning with Latent Variable Gaussian Processes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.07551","kind":"arxiv","version":2},"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:bf92fb21e1063cc94d4f2d65ad017d6c255aece342c3dc182b80298627dc9baf","target":"record","created_at":"2026-05-18T00:11:17Z","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":"fd6a0a4a549c80b9b8fb0b5264759860e32e668b37fb716e656832be1d49bf89","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-03-20T17:51:10Z","title_canon_sha256":"b9580765fdd01d8709ea42d878e69281037d90871d8eb7378e50fa3e5d328a13"},"schema_version":"1.0","source":{"id":"1803.07551","kind":"arxiv","version":2}},"canonical_sha256":"9492faf045744d7dc6ebf4280b6ca8b2d864ab28a738ce22565429039894b8db","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9492faf045744d7dc6ebf4280b6ca8b2d864ab28a738ce22565429039894b8db","first_computed_at":"2026-05-18T00:11:17.684945Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:11:17.684945Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"eEHHASMtqnkSnANcyKR5/lF+F3Q64cFpi2tYZhQy7lDHmqHf2FHyGgSZpeDnVO2zUddkxb7lbJMyZEdyhsIXDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:11:17.685637Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.07551","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bf92fb21e1063cc94d4f2d65ad017d6c255aece342c3dc182b80298627dc9baf","sha256:391aeab7b00f6e3bc9c60b600d1baa2e90ea12ce83556328863b3f8a78abde00"],"state_sha256":"b4b19746058e0a45f8adaebf97902ae91494876d9f4635570b2608630618a17d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tf90qyGVL/+VmYTPCwyzCRTtbpFOhsOk3r7Ik/iX18BFJVCMc8xPQ8OtJb0kAD+Jn6S0P6xljt5fN15BNpY+CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T18:26:08.543652Z","bundle_sha256":"a86df8451657a9b11cfa30ad1ca7d534184b93d9a524ef1789a07669e0e86d65"}}