{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:CIGD66YSDASV6PKG5QT4BGJYIL","short_pith_number":"pith:CIGD66YS","canonical_record":{"source":{"id":"1209.0738","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-09-04T19:06:51Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"1d0f41ff33bf4b8b78260e0c619507c6761ab6006e3064c0457686a5665ae532","abstract_canon_sha256":"4e703f19d64929b863e112af267ed58946861ead01db9d6529ce00704cff16be"},"schema_version":"1.0"},"canonical_sha256":"120c3f7b1218255f3d46ec27c0993842f3c42d2b43f6bd5fb46e974d875fa150","source":{"kind":"arxiv","id":"1209.0738","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.0738","created_at":"2026-05-18T02:49:46Z"},{"alias_kind":"arxiv_version","alias_value":"1209.0738v3","created_at":"2026-05-18T02:49:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.0738","created_at":"2026-05-18T02:49:46Z"},{"alias_kind":"pith_short_12","alias_value":"CIGD66YSDASV","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"CIGD66YSDASV6PKG","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"CIGD66YS","created_at":"2026-05-18T12:27:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:CIGD66YSDASV6PKG5QT4BGJYIL","target":"record","payload":{"canonical_record":{"source":{"id":"1209.0738","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-09-04T19:06:51Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"1d0f41ff33bf4b8b78260e0c619507c6761ab6006e3064c0457686a5665ae532","abstract_canon_sha256":"4e703f19d64929b863e112af267ed58946861ead01db9d6529ce00704cff16be"},"schema_version":"1.0"},"canonical_sha256":"120c3f7b1218255f3d46ec27c0993842f3c42d2b43f6bd5fb46e974d875fa150","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:49:46.197381Z","signature_b64":"uA5iZBFZHJ9mM8ug/19mNUlx7XB+Z+3DJWBtagzSneLQg1uF5c85scLfYnYRwX/shmAbKYuqTTGvPZXf2tzTDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"120c3f7b1218255f3d46ec27c0993842f3c42d2b43f6bd5fb46e974d875fa150","last_reissued_at":"2026-05-18T02:49:46.196931Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:49:46.196931Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1209.0738","source_version":3,"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:49:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kY6YPfHp62o/S5pVWoyllglpLPq7x6x+5Cs0g+ZchWihvkwzRiCq2vNUB+zNGWJ3et69d5fd140dYvN11hxkAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T03:52:22.156964Z"},"content_sha256":"a36efdb7d3e519b7a27a4a1a7ab531d9efd002dac62f0fcdbd700547bc465655","schema_version":"1.0","event_id":"sha256:a36efdb7d3e519b7a27a4a1a7ab531d9efd002dac62f0fcdbd700547bc465655"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:CIGD66YSDASV6PKG5QT4BGJYIL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sparse coding for multitask and transfer learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Andreas Maurer, Bernardino Romera-Paredes, Massimiliano Pontil","submitted_at":"2012-09-04T19:06:51Z","abstract_excerpt":"We investigate the use of sparse coding and dictionary learning in the context of multitask and transfer learning. The central assumption of our learning method is that the tasks parameters are well approximated by sparse linear combinations of the atoms of a dictionary on a high or infinite dimensional space. This assumption, together with the large quantity of available data in the multitask and transfer learning settings, allows a principled choice of the dictionary. We provide bounds on the generalization error of this approach, for both settings. Numerical experiments on one synthetic and"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.0738","kind":"arxiv","version":3},"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:49:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"497Jr02gtqrD+gikZQ/B5ngjGcl4PUj9uZm7FaF8uhDaO2t5D82YilZxRowYAKTzwcQ8cWHTd0joRu+UkTQJBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T03:52:22.157310Z"},"content_sha256":"bb03cfc35a5a4287ff5a1cd8730f9a4229b9f9d18a7c71a00ac17e85575520d0","schema_version":"1.0","event_id":"sha256:bb03cfc35a5a4287ff5a1cd8730f9a4229b9f9d18a7c71a00ac17e85575520d0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CIGD66YSDASV6PKG5QT4BGJYIL/bundle.json","state_url":"https://pith.science/pith/CIGD66YSDASV6PKG5QT4BGJYIL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CIGD66YSDASV6PKG5QT4BGJYIL/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-06-20T03:52:22Z","links":{"resolver":"https://pith.science/pith/CIGD66YSDASV6PKG5QT4BGJYIL","bundle":"https://pith.science/pith/CIGD66YSDASV6PKG5QT4BGJYIL/bundle.json","state":"https://pith.science/pith/CIGD66YSDASV6PKG5QT4BGJYIL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CIGD66YSDASV6PKG5QT4BGJYIL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:CIGD66YSDASV6PKG5QT4BGJYIL","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":"4e703f19d64929b863e112af267ed58946861ead01db9d6529ce00704cff16be","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-09-04T19:06:51Z","title_canon_sha256":"1d0f41ff33bf4b8b78260e0c619507c6761ab6006e3064c0457686a5665ae532"},"schema_version":"1.0","source":{"id":"1209.0738","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.0738","created_at":"2026-05-18T02:49:46Z"},{"alias_kind":"arxiv_version","alias_value":"1209.0738v3","created_at":"2026-05-18T02:49:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.0738","created_at":"2026-05-18T02:49:46Z"},{"alias_kind":"pith_short_12","alias_value":"CIGD66YSDASV","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"CIGD66YSDASV6PKG","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"CIGD66YS","created_at":"2026-05-18T12:27:01Z"}],"graph_snapshots":[{"event_id":"sha256:bb03cfc35a5a4287ff5a1cd8730f9a4229b9f9d18a7c71a00ac17e85575520d0","target":"graph","created_at":"2026-05-18T02:49:46Z","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":"We investigate the use of sparse coding and dictionary learning in the context of multitask and transfer learning. The central assumption of our learning method is that the tasks parameters are well approximated by sparse linear combinations of the atoms of a dictionary on a high or infinite dimensional space. This assumption, together with the large quantity of available data in the multitask and transfer learning settings, allows a principled choice of the dictionary. We provide bounds on the generalization error of this approach, for both settings. Numerical experiments on one synthetic and","authors_text":"Andreas Maurer, Bernardino Romera-Paredes, Massimiliano Pontil","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-09-04T19:06:51Z","title":"Sparse coding for multitask and transfer learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.0738","kind":"arxiv","version":3},"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:a36efdb7d3e519b7a27a4a1a7ab531d9efd002dac62f0fcdbd700547bc465655","target":"record","created_at":"2026-05-18T02:49:46Z","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":"4e703f19d64929b863e112af267ed58946861ead01db9d6529ce00704cff16be","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-09-04T19:06:51Z","title_canon_sha256":"1d0f41ff33bf4b8b78260e0c619507c6761ab6006e3064c0457686a5665ae532"},"schema_version":"1.0","source":{"id":"1209.0738","kind":"arxiv","version":3}},"canonical_sha256":"120c3f7b1218255f3d46ec27c0993842f3c42d2b43f6bd5fb46e974d875fa150","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"120c3f7b1218255f3d46ec27c0993842f3c42d2b43f6bd5fb46e974d875fa150","first_computed_at":"2026-05-18T02:49:46.196931Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:49:46.196931Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uA5iZBFZHJ9mM8ug/19mNUlx7XB+Z+3DJWBtagzSneLQg1uF5c85scLfYnYRwX/shmAbKYuqTTGvPZXf2tzTDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:49:46.197381Z","signed_message":"canonical_sha256_bytes"},"source_id":"1209.0738","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a36efdb7d3e519b7a27a4a1a7ab531d9efd002dac62f0fcdbd700547bc465655","sha256:bb03cfc35a5a4287ff5a1cd8730f9a4229b9f9d18a7c71a00ac17e85575520d0"],"state_sha256":"064f16513b0139953968185ffbd4582c4b125aa65ec6556b8e3b57d84fe2d267"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f91Cf58PWWNIETFXEfNOiHQYPrgkxSCZjVXrw8sx5pgu54kQrlKoNsAvgzpkvFvsTKT4t38rRJkJXHd0v28ODg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T03:52:22.159280Z","bundle_sha256":"efb9547983835f0dc48a6ee1fc37ba186c127f8926e1b8a2e26e623a86eb4bda"}}