{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:65ZGPLNWR5TOYZIFDZWMHF5MKT","short_pith_number":"pith:65ZGPLNW","canonical_record":{"source":{"id":"1504.03106","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-04-13T09:27:23Z","cross_cats_sorted":["cs.CV"],"title_canon_sha256":"45f65c39a8524dab9af0937f508dac050c699aeb59a0c78784b52394cd1ea9a3","abstract_canon_sha256":"b4a3490db7eab2d557c648be41f42e8d68f0860a9d324360e92b84c19f05c754"},"schema_version":"1.0"},"canonical_sha256":"f77267adb68f66ec65051e6cc397ac54c77d84c8eae832928816a69b4ac9f397","source":{"kind":"arxiv","id":"1504.03106","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.03106","created_at":"2026-05-18T02:18:59Z"},{"alias_kind":"arxiv_version","alias_value":"1504.03106v1","created_at":"2026-05-18T02:18:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.03106","created_at":"2026-05-18T02:18:59Z"},{"alias_kind":"pith_short_12","alias_value":"65ZGPLNWR5TO","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"65ZGPLNWR5TOYZIF","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"65ZGPLNW","created_at":"2026-05-18T12:29:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:65ZGPLNWR5TOYZIFDZWMHF5MKT","target":"record","payload":{"canonical_record":{"source":{"id":"1504.03106","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-04-13T09:27:23Z","cross_cats_sorted":["cs.CV"],"title_canon_sha256":"45f65c39a8524dab9af0937f508dac050c699aeb59a0c78784b52394cd1ea9a3","abstract_canon_sha256":"b4a3490db7eab2d557c648be41f42e8d68f0860a9d324360e92b84c19f05c754"},"schema_version":"1.0"},"canonical_sha256":"f77267adb68f66ec65051e6cc397ac54c77d84c8eae832928816a69b4ac9f397","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:18:59.198207Z","signature_b64":"qPvoo+sTkqsFnl6UwXjqtyjFi1BLb77rzAMmiYXkbpo9fCQZ0orn2WadLckfaWucyebTifjp6z+NicBx6aTDAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f77267adb68f66ec65051e6cc397ac54c77d84c8eae832928816a69b4ac9f397","last_reissued_at":"2026-05-18T02:18:59.197495Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:18:59.197495Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1504.03106","source_version":1,"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-18T02:18:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AEIXl06KtHuPb2mFJRXmQ2ZkdDI0odmnl+dY3yvjChiMTa/+F8eofIe+a1v0sXCycH6wpkBL6F6RKTL2u1VvAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T12:02:58.598440Z"},"content_sha256":"f8ee754bbaac8387b5bdb95b46e9dce9193246190ebd0817fd34a93d2a1f69bb","schema_version":"1.0","event_id":"sha256:f8ee754bbaac8387b5bdb95b46e9dce9193246190ebd0817fd34a93d2a1f69bb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:65ZGPLNWR5TOYZIFDZWMHF5MKT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning Multiple Visual Tasks while Discovering their Structure","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"cs.LG","authors_text":"Carlo Ciliberto, Lorenzo Rosasco, Silvia Villa","submitted_at":"2015-04-13T09:27:23Z","abstract_excerpt":"Multi-task learning is a natural approach for computer vision applications that require the simultaneous solution of several distinct but related problems, e.g. object detection, classification, tracking of multiple agents, or denoising, to name a few. The key idea is that exploring task relatedness (structure) can lead to improved performances.\n  In this paper, we propose and study a novel sparse, non-parametric approach exploiting the theory of Reproducing Kernel Hilbert Spaces for vector-valued functions. We develop a suitable regularization framework which can be formulated as a convex opt"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.03106","kind":"arxiv","version":1},"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-18T02:18:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SBK29hHarWZOCODMGcv+EtwY2vB/fxY13h8uQ829iDw0uP3ClvQRdCFliZ9FkrChP42R3VCqpsF/W8OXd/VsBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T12:02:58.599165Z"},"content_sha256":"b78ed97b7f8bca8a8b8c6d54b5591adb8d783cf0a9d37c5ab4f97788c51b4360","schema_version":"1.0","event_id":"sha256:b78ed97b7f8bca8a8b8c6d54b5591adb8d783cf0a9d37c5ab4f97788c51b4360"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/65ZGPLNWR5TOYZIFDZWMHF5MKT/bundle.json","state_url":"https://pith.science/pith/65ZGPLNWR5TOYZIFDZWMHF5MKT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/65ZGPLNWR5TOYZIFDZWMHF5MKT/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-25T12:02:58Z","links":{"resolver":"https://pith.science/pith/65ZGPLNWR5TOYZIFDZWMHF5MKT","bundle":"https://pith.science/pith/65ZGPLNWR5TOYZIFDZWMHF5MKT/bundle.json","state":"https://pith.science/pith/65ZGPLNWR5TOYZIFDZWMHF5MKT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/65ZGPLNWR5TOYZIFDZWMHF5MKT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:65ZGPLNWR5TOYZIFDZWMHF5MKT","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":"b4a3490db7eab2d557c648be41f42e8d68f0860a9d324360e92b84c19f05c754","cross_cats_sorted":["cs.CV"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-04-13T09:27:23Z","title_canon_sha256":"45f65c39a8524dab9af0937f508dac050c699aeb59a0c78784b52394cd1ea9a3"},"schema_version":"1.0","source":{"id":"1504.03106","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.03106","created_at":"2026-05-18T02:18:59Z"},{"alias_kind":"arxiv_version","alias_value":"1504.03106v1","created_at":"2026-05-18T02:18:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.03106","created_at":"2026-05-18T02:18:59Z"},{"alias_kind":"pith_short_12","alias_value":"65ZGPLNWR5TO","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"65ZGPLNWR5TOYZIF","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"65ZGPLNW","created_at":"2026-05-18T12:29:07Z"}],"graph_snapshots":[{"event_id":"sha256:b78ed97b7f8bca8a8b8c6d54b5591adb8d783cf0a9d37c5ab4f97788c51b4360","target":"graph","created_at":"2026-05-18T02:18:59Z","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 learning is a natural approach for computer vision applications that require the simultaneous solution of several distinct but related problems, e.g. object detection, classification, tracking of multiple agents, or denoising, to name a few. The key idea is that exploring task relatedness (structure) can lead to improved performances.\n  In this paper, we propose and study a novel sparse, non-parametric approach exploiting the theory of Reproducing Kernel Hilbert Spaces for vector-valued functions. We develop a suitable regularization framework which can be formulated as a convex opt","authors_text":"Carlo Ciliberto, Lorenzo Rosasco, Silvia Villa","cross_cats":["cs.CV"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-04-13T09:27:23Z","title":"Learning Multiple Visual Tasks while Discovering their Structure"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.03106","kind":"arxiv","version":1},"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:f8ee754bbaac8387b5bdb95b46e9dce9193246190ebd0817fd34a93d2a1f69bb","target":"record","created_at":"2026-05-18T02:18:59Z","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":"b4a3490db7eab2d557c648be41f42e8d68f0860a9d324360e92b84c19f05c754","cross_cats_sorted":["cs.CV"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-04-13T09:27:23Z","title_canon_sha256":"45f65c39a8524dab9af0937f508dac050c699aeb59a0c78784b52394cd1ea9a3"},"schema_version":"1.0","source":{"id":"1504.03106","kind":"arxiv","version":1}},"canonical_sha256":"f77267adb68f66ec65051e6cc397ac54c77d84c8eae832928816a69b4ac9f397","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f77267adb68f66ec65051e6cc397ac54c77d84c8eae832928816a69b4ac9f397","first_computed_at":"2026-05-18T02:18:59.197495Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:18:59.197495Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qPvoo+sTkqsFnl6UwXjqtyjFi1BLb77rzAMmiYXkbpo9fCQZ0orn2WadLckfaWucyebTifjp6z+NicBx6aTDAA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:18:59.198207Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.03106","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f8ee754bbaac8387b5bdb95b46e9dce9193246190ebd0817fd34a93d2a1f69bb","sha256:b78ed97b7f8bca8a8b8c6d54b5591adb8d783cf0a9d37c5ab4f97788c51b4360"],"state_sha256":"a8835448d8ad9537a2b6351de69edbd16e6ce2c5d2181700dc70353ba12c1af1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xV1VgtH5VLK5K9zsRPSpIeCXKuXnsd2RZ8d1hhNVPzWQ4QcRyQDEpfyVW5R9zvaCd3GokBuuktfsXJzLvubHDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T12:02:58.603051Z","bundle_sha256":"66665a96d4adc960599ae67791f0de85c73ecbe755b804fda53d05a7ad46a7c5"}}