{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:65ZGPLNWR5TOYZIFDZWMHF5MKT","short_pith_number":"pith:65ZGPLNW","schema_version":"1.0","canonical_sha256":"f77267adb68f66ec65051e6cc397ac54c77d84c8eae832928816a69b4ac9f397","source":{"kind":"arxiv","id":"1504.03106","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1504.03106","created_at":"2026-05-18T02:18:59.197620+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.03106v1","created_at":"2026-05-18T02:18:59.197620+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.03106","created_at":"2026-05-18T02:18:59.197620+00:00"},{"alias_kind":"pith_short_12","alias_value":"65ZGPLNWR5TO","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_16","alias_value":"65ZGPLNWR5TOYZIF","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_8","alias_value":"65ZGPLNW","created_at":"2026-05-18T12:29:07.941421+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/65ZGPLNWR5TOYZIFDZWMHF5MKT","json":"https://pith.science/pith/65ZGPLNWR5TOYZIFDZWMHF5MKT.json","graph_json":"https://pith.science/api/pith-number/65ZGPLNWR5TOYZIFDZWMHF5MKT/graph.json","events_json":"https://pith.science/api/pith-number/65ZGPLNWR5TOYZIFDZWMHF5MKT/events.json","paper":"https://pith.science/paper/65ZGPLNW"},"agent_actions":{"view_html":"https://pith.science/pith/65ZGPLNWR5TOYZIFDZWMHF5MKT","download_json":"https://pith.science/pith/65ZGPLNWR5TOYZIFDZWMHF5MKT.json","view_paper":"https://pith.science/paper/65ZGPLNW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.03106&json=true","fetch_graph":"https://pith.science/api/pith-number/65ZGPLNWR5TOYZIFDZWMHF5MKT/graph.json","fetch_events":"https://pith.science/api/pith-number/65ZGPLNWR5TOYZIFDZWMHF5MKT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/65ZGPLNWR5TOYZIFDZWMHF5MKT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/65ZGPLNWR5TOYZIFDZWMHF5MKT/action/storage_attestation","attest_author":"https://pith.science/pith/65ZGPLNWR5TOYZIFDZWMHF5MKT/action/author_attestation","sign_citation":"https://pith.science/pith/65ZGPLNWR5TOYZIFDZWMHF5MKT/action/citation_signature","submit_replication":"https://pith.science/pith/65ZGPLNWR5TOYZIFDZWMHF5MKT/action/replication_record"}},"created_at":"2026-05-18T02:18:59.197620+00:00","updated_at":"2026-05-18T02:18:59.197620+00:00"}