{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:S4VPQSEL5VHSWVQGIQA7WQI4UP","short_pith_number":"pith:S4VPQSEL","canonical_record":{"source":{"id":"2106.04802","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-06-09T04:34:12Z","cross_cats_sorted":[],"title_canon_sha256":"cb08b9ae48b96fd4309789f157c0ccc6c7deaf4bc7123e798ca6e9a50c5d3907","abstract_canon_sha256":"35a7d21f77a9bb66fe56fecda9a44d57c48e32a05c150fa08f919c087d259f3e"},"schema_version":"1.0"},"canonical_sha256":"972af8488bed4f2b56064401fb411ca3e2f3815da0de8244c613377708a39e3a","source":{"kind":"arxiv","id":"2106.04802","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2106.04802","created_at":"2026-07-05T04:06:15Z"},{"alias_kind":"arxiv_version","alias_value":"2106.04802v2","created_at":"2026-07-05T04:06:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.04802","created_at":"2026-07-05T04:06:15Z"},{"alias_kind":"pith_short_12","alias_value":"S4VPQSEL5VHS","created_at":"2026-07-05T04:06:15Z"},{"alias_kind":"pith_short_16","alias_value":"S4VPQSEL5VHSWVQG","created_at":"2026-07-05T04:06:15Z"},{"alias_kind":"pith_short_8","alias_value":"S4VPQSEL","created_at":"2026-07-05T04:06:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:S4VPQSEL5VHSWVQGIQA7WQI4UP","target":"record","payload":{"canonical_record":{"source":{"id":"2106.04802","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-06-09T04:34:12Z","cross_cats_sorted":[],"title_canon_sha256":"cb08b9ae48b96fd4309789f157c0ccc6c7deaf4bc7123e798ca6e9a50c5d3907","abstract_canon_sha256":"35a7d21f77a9bb66fe56fecda9a44d57c48e32a05c150fa08f919c087d259f3e"},"schema_version":"1.0"},"canonical_sha256":"972af8488bed4f2b56064401fb411ca3e2f3815da0de8244c613377708a39e3a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:06:15.142822Z","signature_b64":"gPT+whJ6OXwfyGgviV5ysPNuSuAV1IsQrPjTX7qzkRB2hUMaVTJp+xNBLnFyNqA0aqdc8Kkn8UOnfBOIhujvBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"972af8488bed4f2b56064401fb411ca3e2f3815da0de8244c613377708a39e3a","last_reissued_at":"2026-07-05T04:06:15.142332Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:06:15.142332Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2106.04802","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-07-05T04:06:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nkUGtwFZlRrVZOraGtQ2ew79AzIBY6+bqlzJk0vnAVRMlp1zBdhlJi2kqQd0d/FsI2r1qALFcXzyacJISTdYAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T19:26:29.671812Z"},"content_sha256":"48ef43087c513d64649766030d5c0afd746c9069148981099b40414f29b7962d","schema_version":"1.0","event_id":"sha256:48ef43087c513d64649766030d5c0afd746c9069148981099b40414f29b7962d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:S4VPQSEL5VHSWVQGIQA7WQI4UP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Probabilistic task modelling for meta-learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Cuong C. Nguyen, Gustavo Carneiro, Thanh-Toan Do","submitted_at":"2021-06-09T04:34:12Z","abstract_excerpt":"We propose probabilistic task modelling -- a generative probabilistic model for collections of tasks used in meta-learning. The proposed model combines variational auto-encoding and latent Dirichlet allocation to model each task as a mixture of Gaussian distribution in an embedding space. Such modelling provides an explicit representation of a task through its task-theme mixture. We present an efficient approximation inference technique based on variational inference method for empirical Bayes parameter estimation. We perform empirical evaluations to validate the task uncertainty and task dist"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.04802","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2106.04802/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T04:06:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DIwIse/E0n52LsxenqYqJ1HcFGbyJor/5CbUFw1AqRVMLL2PgJ7uMK5ArQHLSncfRGaA30KUafpW89fq95TiCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T19:26:29.672712Z"},"content_sha256":"65c6c3df094e0b9d623fdaa98cacae9998c8e97bee4e3e4d4e61b2fa0c978afa","schema_version":"1.0","event_id":"sha256:65c6c3df094e0b9d623fdaa98cacae9998c8e97bee4e3e4d4e61b2fa0c978afa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/S4VPQSEL5VHSWVQGIQA7WQI4UP/bundle.json","state_url":"https://pith.science/pith/S4VPQSEL5VHSWVQGIQA7WQI4UP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/S4VPQSEL5VHSWVQGIQA7WQI4UP/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-08-03T19:26:29Z","links":{"resolver":"https://pith.science/pith/S4VPQSEL5VHSWVQGIQA7WQI4UP","bundle":"https://pith.science/pith/S4VPQSEL5VHSWVQGIQA7WQI4UP/bundle.json","state":"https://pith.science/pith/S4VPQSEL5VHSWVQGIQA7WQI4UP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/S4VPQSEL5VHSWVQGIQA7WQI4UP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:S4VPQSEL5VHSWVQGIQA7WQI4UP","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":"35a7d21f77a9bb66fe56fecda9a44d57c48e32a05c150fa08f919c087d259f3e","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-06-09T04:34:12Z","title_canon_sha256":"cb08b9ae48b96fd4309789f157c0ccc6c7deaf4bc7123e798ca6e9a50c5d3907"},"schema_version":"1.0","source":{"id":"2106.04802","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2106.04802","created_at":"2026-07-05T04:06:15Z"},{"alias_kind":"arxiv_version","alias_value":"2106.04802v2","created_at":"2026-07-05T04:06:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.04802","created_at":"2026-07-05T04:06:15Z"},{"alias_kind":"pith_short_12","alias_value":"S4VPQSEL5VHS","created_at":"2026-07-05T04:06:15Z"},{"alias_kind":"pith_short_16","alias_value":"S4VPQSEL5VHSWVQG","created_at":"2026-07-05T04:06:15Z"},{"alias_kind":"pith_short_8","alias_value":"S4VPQSEL","created_at":"2026-07-05T04:06:15Z"}],"graph_snapshots":[{"event_id":"sha256:65c6c3df094e0b9d623fdaa98cacae9998c8e97bee4e3e4d4e61b2fa0c978afa","target":"graph","created_at":"2026-07-05T04:06:15Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2106.04802/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We propose probabilistic task modelling -- a generative probabilistic model for collections of tasks used in meta-learning. The proposed model combines variational auto-encoding and latent Dirichlet allocation to model each task as a mixture of Gaussian distribution in an embedding space. Such modelling provides an explicit representation of a task through its task-theme mixture. We present an efficient approximation inference technique based on variational inference method for empirical Bayes parameter estimation. We perform empirical evaluations to validate the task uncertainty and task dist","authors_text":"Cuong C. Nguyen, Gustavo Carneiro, Thanh-Toan Do","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-06-09T04:34:12Z","title":"Probabilistic task modelling for meta-learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.04802","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:48ef43087c513d64649766030d5c0afd746c9069148981099b40414f29b7962d","target":"record","created_at":"2026-07-05T04:06:15Z","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":"35a7d21f77a9bb66fe56fecda9a44d57c48e32a05c150fa08f919c087d259f3e","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-06-09T04:34:12Z","title_canon_sha256":"cb08b9ae48b96fd4309789f157c0ccc6c7deaf4bc7123e798ca6e9a50c5d3907"},"schema_version":"1.0","source":{"id":"2106.04802","kind":"arxiv","version":2}},"canonical_sha256":"972af8488bed4f2b56064401fb411ca3e2f3815da0de8244c613377708a39e3a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"972af8488bed4f2b56064401fb411ca3e2f3815da0de8244c613377708a39e3a","first_computed_at":"2026-07-05T04:06:15.142332Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:06:15.142332Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gPT+whJ6OXwfyGgviV5ysPNuSuAV1IsQrPjTX7qzkRB2hUMaVTJp+xNBLnFyNqA0aqdc8Kkn8UOnfBOIhujvBA==","signature_status":"signed_v1","signed_at":"2026-07-05T04:06:15.142822Z","signed_message":"canonical_sha256_bytes"},"source_id":"2106.04802","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:48ef43087c513d64649766030d5c0afd746c9069148981099b40414f29b7962d","sha256:65c6c3df094e0b9d623fdaa98cacae9998c8e97bee4e3e4d4e61b2fa0c978afa"],"state_sha256":"b0c99f2f46ace4f688f502f2fe953352de0b9604a4898ff0473cda1c1c06ed79"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Gpu2PK64EsZfMfiEAeiGLLI5rDkNhJ2Gi2fjDymGFbCkJAsnt9bWrxPQ/YwN3SRFgX0iX8WitbJrNlVk0Jn2BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-03T19:26:29.679723Z","bundle_sha256":"789ad9121d4222c517c399501258645d6867d9a555db74787ef79cb465b6f8a5"}}