{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:Y7QKR6TOKOFBRQT4ZKREOEDUC3","short_pith_number":"pith:Y7QKR6TO","canonical_record":{"source":{"id":"1107.4512","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2011-07-22T13:12:42Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"4427e007e0cd7d45e34195aee897a83b3334ff10f49f0800b6fc931d8a4f790a","abstract_canon_sha256":"e77b9835086bac0ae21682a5baa012f86a3c76c898767aafd257814315634ead"},"schema_version":"1.0"},"canonical_sha256":"c7e0a8fa6e538a18c27ccaa247107416e46aee1a1c15f46bc553f9fc33718db3","source":{"kind":"arxiv","id":"1107.4512","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.4512","created_at":"2026-05-18T03:42:32Z"},{"alias_kind":"arxiv_version","alias_value":"1107.4512v3","created_at":"2026-05-18T03:42:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.4512","created_at":"2026-05-18T03:42:32Z"},{"alias_kind":"pith_short_12","alias_value":"Y7QKR6TOKOFB","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"Y7QKR6TOKOFBRQT4","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"Y7QKR6TO","created_at":"2026-05-18T12:26:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:Y7QKR6TOKOFBRQT4ZKREOEDUC3","target":"record","payload":{"canonical_record":{"source":{"id":"1107.4512","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2011-07-22T13:12:42Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"4427e007e0cd7d45e34195aee897a83b3334ff10f49f0800b6fc931d8a4f790a","abstract_canon_sha256":"e77b9835086bac0ae21682a5baa012f86a3c76c898767aafd257814315634ead"},"schema_version":"1.0"},"canonical_sha256":"c7e0a8fa6e538a18c27ccaa247107416e46aee1a1c15f46bc553f9fc33718db3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:42:32.309400Z","signature_b64":"ur+Z7Carhvqv5PTsogAyq06mroc/qIJnbxznstqTUPTSDbwSvHyj4AaWYdD3NL2/A3GLCPMmAGqUWWDaVk0lCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c7e0a8fa6e538a18c27ccaa247107416e46aee1a1c15f46bc553f9fc33718db3","last_reissued_at":"2026-05-18T03:42:32.308736Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:42:32.308736Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1107.4512","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-18T03:42:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uXBqLX7xacZnIvdaD7RZxhy7qseTZ4AL73luGuerJIsyIDLIquKvyizNSGHue5qOjZAw2uQ9poUp09ZPc7jMAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T21:34:36.875455Z"},"content_sha256":"674e098c1b57150e4a7a88d39b875d3587268a126da8d15ad0b1d54a7b5d572c","schema_version":"1.0","event_id":"sha256:674e098c1b57150e4a7a88d39b875d3587268a126da8d15ad0b1d54a7b5d572c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:Y7QKR6TOKOFBRQT4ZKREOEDUC3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multi-task Regression using Minimal Penalties","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Francis Bach (LIENS, INRIA Paris - Rocquencourt), Matthieu Solnon (LIENS, Sylvain Arlot (LIENS","submitted_at":"2011-07-22T13:12:42Z","abstract_excerpt":"In this paper we study the kernel multiple ridge regression framework, which we refer to as multi-task regression, using penalization techniques. The theoretical analysis of this problem shows that the key element appearing for an optimal calibration is the covariance matrix of the noise between the different tasks. We present a new algorithm to estimate this covariance matrix, based on the concept of minimal penalty, which was previously used in the single-task regression framework to estimate the variance of the noise. We show, in a non-asymptotic setting and under mild assumptions on the ta"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.4512","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-18T03:42:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mwng5acOUI2k9Nhekk3JvtHWNjgqxyP0h0/TDT1FuddlHwfUZaL1tbzMUXioQzjJ6cGL6bR4SK5XCQlAxiHpAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T21:34:36.876134Z"},"content_sha256":"68ef079a34dd7eb8bd8c42a69e314be7ad094bb8f2ee7b85440e078b58fe6975","schema_version":"1.0","event_id":"sha256:68ef079a34dd7eb8bd8c42a69e314be7ad094bb8f2ee7b85440e078b58fe6975"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Y7QKR6TOKOFBRQT4ZKREOEDUC3/bundle.json","state_url":"https://pith.science/pith/Y7QKR6TOKOFBRQT4ZKREOEDUC3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Y7QKR6TOKOFBRQT4ZKREOEDUC3/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-31T21:34:36Z","links":{"resolver":"https://pith.science/pith/Y7QKR6TOKOFBRQT4ZKREOEDUC3","bundle":"https://pith.science/pith/Y7QKR6TOKOFBRQT4ZKREOEDUC3/bundle.json","state":"https://pith.science/pith/Y7QKR6TOKOFBRQT4ZKREOEDUC3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Y7QKR6TOKOFBRQT4ZKREOEDUC3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:Y7QKR6TOKOFBRQT4ZKREOEDUC3","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":"e77b9835086bac0ae21682a5baa012f86a3c76c898767aafd257814315634ead","cross_cats_sorted":["stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2011-07-22T13:12:42Z","title_canon_sha256":"4427e007e0cd7d45e34195aee897a83b3334ff10f49f0800b6fc931d8a4f790a"},"schema_version":"1.0","source":{"id":"1107.4512","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.4512","created_at":"2026-05-18T03:42:32Z"},{"alias_kind":"arxiv_version","alias_value":"1107.4512v3","created_at":"2026-05-18T03:42:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.4512","created_at":"2026-05-18T03:42:32Z"},{"alias_kind":"pith_short_12","alias_value":"Y7QKR6TOKOFB","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"Y7QKR6TOKOFBRQT4","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"Y7QKR6TO","created_at":"2026-05-18T12:26:47Z"}],"graph_snapshots":[{"event_id":"sha256:68ef079a34dd7eb8bd8c42a69e314be7ad094bb8f2ee7b85440e078b58fe6975","target":"graph","created_at":"2026-05-18T03:42:32Z","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":"In this paper we study the kernel multiple ridge regression framework, which we refer to as multi-task regression, using penalization techniques. The theoretical analysis of this problem shows that the key element appearing for an optimal calibration is the covariance matrix of the noise between the different tasks. We present a new algorithm to estimate this covariance matrix, based on the concept of minimal penalty, which was previously used in the single-task regression framework to estimate the variance of the noise. We show, in a non-asymptotic setting and under mild assumptions on the ta","authors_text":"Francis Bach (LIENS, INRIA Paris - Rocquencourt), Matthieu Solnon (LIENS, Sylvain Arlot (LIENS","cross_cats":["stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2011-07-22T13:12:42Z","title":"Multi-task Regression using Minimal Penalties"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.4512","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:674e098c1b57150e4a7a88d39b875d3587268a126da8d15ad0b1d54a7b5d572c","target":"record","created_at":"2026-05-18T03:42:32Z","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":"e77b9835086bac0ae21682a5baa012f86a3c76c898767aafd257814315634ead","cross_cats_sorted":["stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2011-07-22T13:12:42Z","title_canon_sha256":"4427e007e0cd7d45e34195aee897a83b3334ff10f49f0800b6fc931d8a4f790a"},"schema_version":"1.0","source":{"id":"1107.4512","kind":"arxiv","version":3}},"canonical_sha256":"c7e0a8fa6e538a18c27ccaa247107416e46aee1a1c15f46bc553f9fc33718db3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c7e0a8fa6e538a18c27ccaa247107416e46aee1a1c15f46bc553f9fc33718db3","first_computed_at":"2026-05-18T03:42:32.308736Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:42:32.308736Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ur+Z7Carhvqv5PTsogAyq06mroc/qIJnbxznstqTUPTSDbwSvHyj4AaWYdD3NL2/A3GLCPMmAGqUWWDaVk0lCw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:42:32.309400Z","signed_message":"canonical_sha256_bytes"},"source_id":"1107.4512","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:674e098c1b57150e4a7a88d39b875d3587268a126da8d15ad0b1d54a7b5d572c","sha256:68ef079a34dd7eb8bd8c42a69e314be7ad094bb8f2ee7b85440e078b58fe6975"],"state_sha256":"5a9aa9301c0ca119583d3a5f3791a94d7c2b75cef60808e5749ec5b9d6fce901"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9hCQE6/OPj4Uk94zzHz2rrPVYm6HYL+iISnOZFO/hqMPnKZM0+/PKD27DH62HOIa83y0ZLuRusXgcKIZnfq4CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T21:34:36.879823Z","bundle_sha256":"4ca699a63b46e6f47ce79afc0283ecf6cb715a510b7dc6fbf0a2c19a8b39fa0e"}}