{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:GPMSASKTXQMNO4O7UO7JDZVXJP","short_pith_number":"pith:GPMSASKT","canonical_record":{"source":{"id":"2202.03091","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-02-07T12:07:50Z","cross_cats_sorted":["cs.AI","cs.CV"],"title_canon_sha256":"b5e8071741edd61aadd680cc5141f24662bc5ec9e058847c8934b3cece804526","abstract_canon_sha256":"e9f255de497288745afda342a588089e194f5fa52ca39c8c92f426a73b3c804b"},"schema_version":"1.0"},"canonical_sha256":"33d9204953bc18d771dfa3be91e6b74bcb291dc6cf9688c85e6609ca6eecd441","source":{"kind":"arxiv","id":"2202.03091","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2202.03091","created_at":"2026-07-05T04:28:30Z"},{"alias_kind":"arxiv_version","alias_value":"2202.03091v2","created_at":"2026-07-05T04:28:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2202.03091","created_at":"2026-07-05T04:28:30Z"},{"alias_kind":"pith_short_12","alias_value":"GPMSASKTXQMN","created_at":"2026-07-05T04:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"GPMSASKTXQMNO4O7","created_at":"2026-07-05T04:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"GPMSASKT","created_at":"2026-07-05T04:28:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:GPMSASKTXQMNO4O7UO7JDZVXJP","target":"record","payload":{"canonical_record":{"source":{"id":"2202.03091","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-02-07T12:07:50Z","cross_cats_sorted":["cs.AI","cs.CV"],"title_canon_sha256":"b5e8071741edd61aadd680cc5141f24662bc5ec9e058847c8934b3cece804526","abstract_canon_sha256":"e9f255de497288745afda342a588089e194f5fa52ca39c8c92f426a73b3c804b"},"schema_version":"1.0"},"canonical_sha256":"33d9204953bc18d771dfa3be91e6b74bcb291dc6cf9688c85e6609ca6eecd441","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:28:30.671985Z","signature_b64":"ZkD5jEdJsfV/d60M3bhLQJ0tCtADHvjIW9Xzqz93oeTiKK50Suqb7AtQcUkcSP2obWdU9S2tBrYztE1eXAjXBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"33d9204953bc18d771dfa3be91e6b74bcb291dc6cf9688c85e6609ca6eecd441","last_reissued_at":"2026-07-05T04:28:30.671453Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:28:30.671453Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2202.03091","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:28:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SdoUQYsQkwJyA8yVL1XfeNrZFoR3k9DW/yj+QlScWDOKz6K0RXoGt+c6vQrGth/bPG2ypojiPe//4ZJkpMqHCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T08:38:46.725936Z"},"content_sha256":"a408355752cf7f01c095ffcb47821ce21bb9318e267fc683aa474bfca4021ab9","schema_version":"1.0","event_id":"sha256:a408355752cf7f01c095ffcb47821ce21bb9318e267fc683aa474bfca4021ab9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:GPMSASKTXQMNO4O7UO7JDZVXJP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Auto-Lambda: Disentangling Dynamic Task Relationships","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CV"],"primary_cat":"cs.LG","authors_text":"Andrew J. Davison, Edward Johns, Shikun Liu, Stephen James","submitted_at":"2022-02-07T12:07:50Z","abstract_excerpt":"Understanding the structure of multiple related tasks allows for multi-task learning to improve the generalisation ability of one or all of them. However, it usually requires training each pairwise combination of tasks together in order to capture task relationships, at an extremely high computational cost. In this work, we learn task relationships via an automated weighting framework, named Auto-Lambda. Unlike previous methods where task relationships are assumed to be fixed, Auto-Lambda is a gradient-based meta learning framework which explores continuous, dynamic task relationships via task"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2202.03091","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/2202.03091/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:28:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t92vkxOmS0XKoYVpbiB9z1SeqvmZFejwdmwXNOUeV+YfEMICkLUGA96Pgqe+ktQkK69H7s/PBgutU8hJ84B0DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T08:38:46.726445Z"},"content_sha256":"fbcde6f193bd8491aa1bc42ea66985b56c0f682b94f519253215eb2b7ad8beb3","schema_version":"1.0","event_id":"sha256:fbcde6f193bd8491aa1bc42ea66985b56c0f682b94f519253215eb2b7ad8beb3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GPMSASKTXQMNO4O7UO7JDZVXJP/bundle.json","state_url":"https://pith.science/pith/GPMSASKTXQMNO4O7UO7JDZVXJP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GPMSASKTXQMNO4O7UO7JDZVXJP/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-04T08:38:46Z","links":{"resolver":"https://pith.science/pith/GPMSASKTXQMNO4O7UO7JDZVXJP","bundle":"https://pith.science/pith/GPMSASKTXQMNO4O7UO7JDZVXJP/bundle.json","state":"https://pith.science/pith/GPMSASKTXQMNO4O7UO7JDZVXJP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GPMSASKTXQMNO4O7UO7JDZVXJP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:GPMSASKTXQMNO4O7UO7JDZVXJP","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":"e9f255de497288745afda342a588089e194f5fa52ca39c8c92f426a73b3c804b","cross_cats_sorted":["cs.AI","cs.CV"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-02-07T12:07:50Z","title_canon_sha256":"b5e8071741edd61aadd680cc5141f24662bc5ec9e058847c8934b3cece804526"},"schema_version":"1.0","source":{"id":"2202.03091","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2202.03091","created_at":"2026-07-05T04:28:30Z"},{"alias_kind":"arxiv_version","alias_value":"2202.03091v2","created_at":"2026-07-05T04:28:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2202.03091","created_at":"2026-07-05T04:28:30Z"},{"alias_kind":"pith_short_12","alias_value":"GPMSASKTXQMN","created_at":"2026-07-05T04:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"GPMSASKTXQMNO4O7","created_at":"2026-07-05T04:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"GPMSASKT","created_at":"2026-07-05T04:28:30Z"}],"graph_snapshots":[{"event_id":"sha256:fbcde6f193bd8491aa1bc42ea66985b56c0f682b94f519253215eb2b7ad8beb3","target":"graph","created_at":"2026-07-05T04:28:30Z","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/2202.03091/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Understanding the structure of multiple related tasks allows for multi-task learning to improve the generalisation ability of one or all of them. However, it usually requires training each pairwise combination of tasks together in order to capture task relationships, at an extremely high computational cost. In this work, we learn task relationships via an automated weighting framework, named Auto-Lambda. Unlike previous methods where task relationships are assumed to be fixed, Auto-Lambda is a gradient-based meta learning framework which explores continuous, dynamic task relationships via task","authors_text":"Andrew J. Davison, Edward Johns, Shikun Liu, Stephen James","cross_cats":["cs.AI","cs.CV"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-02-07T12:07:50Z","title":"Auto-Lambda: Disentangling Dynamic Task Relationships"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2202.03091","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:a408355752cf7f01c095ffcb47821ce21bb9318e267fc683aa474bfca4021ab9","target":"record","created_at":"2026-07-05T04:28:30Z","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":"e9f255de497288745afda342a588089e194f5fa52ca39c8c92f426a73b3c804b","cross_cats_sorted":["cs.AI","cs.CV"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-02-07T12:07:50Z","title_canon_sha256":"b5e8071741edd61aadd680cc5141f24662bc5ec9e058847c8934b3cece804526"},"schema_version":"1.0","source":{"id":"2202.03091","kind":"arxiv","version":2}},"canonical_sha256":"33d9204953bc18d771dfa3be91e6b74bcb291dc6cf9688c85e6609ca6eecd441","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"33d9204953bc18d771dfa3be91e6b74bcb291dc6cf9688c85e6609ca6eecd441","first_computed_at":"2026-07-05T04:28:30.671453Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:28:30.671453Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZkD5jEdJsfV/d60M3bhLQJ0tCtADHvjIW9Xzqz93oeTiKK50Suqb7AtQcUkcSP2obWdU9S2tBrYztE1eXAjXBA==","signature_status":"signed_v1","signed_at":"2026-07-05T04:28:30.671985Z","signed_message":"canonical_sha256_bytes"},"source_id":"2202.03091","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a408355752cf7f01c095ffcb47821ce21bb9318e267fc683aa474bfca4021ab9","sha256:fbcde6f193bd8491aa1bc42ea66985b56c0f682b94f519253215eb2b7ad8beb3"],"state_sha256":"dbb62becf97f6cb5b455fe58538802396d13b1cbed019ebed0dad347771a8758"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+teIvOu6SPZB5tp1lTntA3r+3+7YQdlj+Tit7LRYv/rG3RNSd7mWU2aM+MzqYh3u5pBCbGiWCG2sPtbjqdjJCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T08:38:46.731090Z","bundle_sha256":"204bbb6decf6cf09cffb9e59f47edd938f833915f827ce525ab4f892574ee327"}}