{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:K3LIHS55LLYU3RPV7F7JDWCJDL","short_pith_number":"pith:K3LIHS55","canonical_record":{"source":{"id":"2410.01476","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-10-02T12:30:05Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"adf1b3fa472790deb201b5b83cee4073e50520ceef99e469b89ac32c68b26ec3","abstract_canon_sha256":"6275de132afc3e37886fabcd83999dae318b428672fba58f20c1847e1d57c30c"},"schema_version":"1.0"},"canonical_sha256":"56d683cbbd5af14dc5f5f97e91d8491ad9a6e24d197a9e70cd3f00167d790743","source":{"kind":"arxiv","id":"2410.01476","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.01476","created_at":"2026-07-05T09:24:38Z"},{"alias_kind":"arxiv_version","alias_value":"2410.01476v2","created_at":"2026-07-05T09:24:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.01476","created_at":"2026-07-05T09:24:38Z"},{"alias_kind":"pith_short_12","alias_value":"K3LIHS55LLYU","created_at":"2026-07-05T09:24:38Z"},{"alias_kind":"pith_short_16","alias_value":"K3LIHS55LLYU3RPV","created_at":"2026-07-05T09:24:38Z"},{"alias_kind":"pith_short_8","alias_value":"K3LIHS55","created_at":"2026-07-05T09:24:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:K3LIHS55LLYU3RPV7F7JDWCJDL","target":"record","payload":{"canonical_record":{"source":{"id":"2410.01476","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-10-02T12:30:05Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"adf1b3fa472790deb201b5b83cee4073e50520ceef99e469b89ac32c68b26ec3","abstract_canon_sha256":"6275de132afc3e37886fabcd83999dae318b428672fba58f20c1847e1d57c30c"},"schema_version":"1.0"},"canonical_sha256":"56d683cbbd5af14dc5f5f97e91d8491ad9a6e24d197a9e70cd3f00167d790743","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:24:38.810452Z","signature_b64":"Mrx0Pg8OiqyDz+sjeu8ut1kKVxQjaawr6O8ZkhIZhdPDHzwUc97zFWqPazK7AuOxm/ldQuTeLTLrEOCubQnnBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"56d683cbbd5af14dc5f5f97e91d8491ad9a6e24d197a9e70cd3f00167d790743","last_reissued_at":"2026-07-05T09:24:38.809937Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:24:38.809937Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2410.01476","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-05T09:24:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pFAIvOJ7lghCIEW2tl+XXDDWZBBSw7YeNPxAazP2MFDBUz0uP/ZnojQvy56+xpMvQJDMFFMBmPVUSoM/d2TYAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-11T13:29:45.138409Z"},"content_sha256":"d4bdb902815b0fc8638ee4a2f975f18990746599de6197b244839871a6937522","schema_version":"1.0","event_id":"sha256:d4bdb902815b0fc8638ee4a2f975f18990746599de6197b244839871a6937522"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:K3LIHS55LLYU3RPV7F7JDWCJDL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Reducing Variance in Meta-Learning via Laplace Approximation for Regression Tasks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Alfredo Reichlin, Danica Kragic, Gustaf Tegn\\'er, Hang Yin, M{\\aa}rten Bj\\\"orkman, Miguel Vasco","submitted_at":"2024-10-02T12:30:05Z","abstract_excerpt":"Given a finite set of sample points, meta-learning algorithms aim to learn an optimal adaptation strategy for new, unseen tasks. Often, this data can be ambiguous as it might belong to different tasks concurrently. This is particularly the case in meta-regression tasks. In such cases, the estimated adaptation strategy is subject to high variance due to the limited amount of support data for each task, which often leads to sub-optimal generalization performance. In this work, we address the problem of variance reduction in gradient-based meta-learning and formalize the class of problems prone t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.01476","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/2410.01476/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-05T09:24:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"budBZFtsWR1OJ7wEe6sV+eXxYQceF3LDYQ/bZ8Xqtl/HZ/IMBmeDmIJfyB1FMqI/Y7R9wobIksuYbEivrw4OCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-11T13:29:45.138797Z"},"content_sha256":"9b79d15cd31d0039779df7155c5c8ea1d8d750d3217db3ca27022cdad066e061","schema_version":"1.0","event_id":"sha256:9b79d15cd31d0039779df7155c5c8ea1d8d750d3217db3ca27022cdad066e061"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/K3LIHS55LLYU3RPV7F7JDWCJDL/bundle.json","state_url":"https://pith.science/pith/K3LIHS55LLYU3RPV7F7JDWCJDL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/K3LIHS55LLYU3RPV7F7JDWCJDL/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-07-11T13:29:45Z","links":{"resolver":"https://pith.science/pith/K3LIHS55LLYU3RPV7F7JDWCJDL","bundle":"https://pith.science/pith/K3LIHS55LLYU3RPV7F7JDWCJDL/bundle.json","state":"https://pith.science/pith/K3LIHS55LLYU3RPV7F7JDWCJDL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/K3LIHS55LLYU3RPV7F7JDWCJDL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:K3LIHS55LLYU3RPV7F7JDWCJDL","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":"6275de132afc3e37886fabcd83999dae318b428672fba58f20c1847e1d57c30c","cross_cats_sorted":["stat.ML"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-10-02T12:30:05Z","title_canon_sha256":"adf1b3fa472790deb201b5b83cee4073e50520ceef99e469b89ac32c68b26ec3"},"schema_version":"1.0","source":{"id":"2410.01476","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.01476","created_at":"2026-07-05T09:24:38Z"},{"alias_kind":"arxiv_version","alias_value":"2410.01476v2","created_at":"2026-07-05T09:24:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.01476","created_at":"2026-07-05T09:24:38Z"},{"alias_kind":"pith_short_12","alias_value":"K3LIHS55LLYU","created_at":"2026-07-05T09:24:38Z"},{"alias_kind":"pith_short_16","alias_value":"K3LIHS55LLYU3RPV","created_at":"2026-07-05T09:24:38Z"},{"alias_kind":"pith_short_8","alias_value":"K3LIHS55","created_at":"2026-07-05T09:24:38Z"}],"graph_snapshots":[{"event_id":"sha256:9b79d15cd31d0039779df7155c5c8ea1d8d750d3217db3ca27022cdad066e061","target":"graph","created_at":"2026-07-05T09:24:38Z","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/2410.01476/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Given a finite set of sample points, meta-learning algorithms aim to learn an optimal adaptation strategy for new, unseen tasks. Often, this data can be ambiguous as it might belong to different tasks concurrently. This is particularly the case in meta-regression tasks. In such cases, the estimated adaptation strategy is subject to high variance due to the limited amount of support data for each task, which often leads to sub-optimal generalization performance. In this work, we address the problem of variance reduction in gradient-based meta-learning and formalize the class of problems prone t","authors_text":"Alfredo Reichlin, Danica Kragic, Gustaf Tegn\\'er, Hang Yin, M{\\aa}rten Bj\\\"orkman, Miguel Vasco","cross_cats":["stat.ML"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-10-02T12:30:05Z","title":"Reducing Variance in Meta-Learning via Laplace Approximation for Regression Tasks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.01476","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:d4bdb902815b0fc8638ee4a2f975f18990746599de6197b244839871a6937522","target":"record","created_at":"2026-07-05T09:24:38Z","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":"6275de132afc3e37886fabcd83999dae318b428672fba58f20c1847e1d57c30c","cross_cats_sorted":["stat.ML"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-10-02T12:30:05Z","title_canon_sha256":"adf1b3fa472790deb201b5b83cee4073e50520ceef99e469b89ac32c68b26ec3"},"schema_version":"1.0","source":{"id":"2410.01476","kind":"arxiv","version":2}},"canonical_sha256":"56d683cbbd5af14dc5f5f97e91d8491ad9a6e24d197a9e70cd3f00167d790743","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"56d683cbbd5af14dc5f5f97e91d8491ad9a6e24d197a9e70cd3f00167d790743","first_computed_at":"2026-07-05T09:24:38.809937Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:24:38.809937Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Mrx0Pg8OiqyDz+sjeu8ut1kKVxQjaawr6O8ZkhIZhdPDHzwUc97zFWqPazK7AuOxm/ldQuTeLTLrEOCubQnnBw==","signature_status":"signed_v1","signed_at":"2026-07-05T09:24:38.810452Z","signed_message":"canonical_sha256_bytes"},"source_id":"2410.01476","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d4bdb902815b0fc8638ee4a2f975f18990746599de6197b244839871a6937522","sha256:9b79d15cd31d0039779df7155c5c8ea1d8d750d3217db3ca27022cdad066e061"],"state_sha256":"98110a4151550a70466650e220eaf6f9e8255a127e8f3002c42264e12414c700"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i2owahzNbUFRoI8wrfJ8YUrDpykHqqO3UL0MR1ccroSIpizmBu/2h0K9iHP+NU8n8lij8Q07k/rWtDCL/AeSBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-11T13:29:45.141333Z","bundle_sha256":"26c9a683c41d1b0164a973d48ad22acb3d8448de3936e94cbe2d8803bc6ab22f"}}