{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:NGSGLSUSSIGT6PAJNUUWBANKOO","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":"664a0ba8adbb62d1fbddc71d5666b8f839a321065c1e8d830f6e93c0f0c41359","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-22T18:38:59Z","title_canon_sha256":"46ef831404b35b8690213dbcd8a12599494d82b377a3a843213727d3afd475d3"},"schema_version":"1.0","source":{"id":"1805.08809","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.08809","created_at":"2026-05-18T00:03:36Z"},{"alias_kind":"arxiv_version","alias_value":"1805.08809v3","created_at":"2026-05-18T00:03:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.08809","created_at":"2026-05-18T00:03:36Z"},{"alias_kind":"pith_short_12","alias_value":"NGSGLSUSSIGT","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"NGSGLSUSSIGT6PAJ","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"NGSGLSUS","created_at":"2026-05-18T12:32:40Z"}],"graph_snapshots":[{"event_id":"sha256:09194ea3a2a96ddb708711886f75befe80ef18a546e0fb7f45b4f32290dba7e0","target":"graph","created_at":"2026-05-18T00:03:36Z","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":"Machine learning has witnessed tremendous success in solving tasks depending on a single hyperparameter. When considering simultaneously a finite number of tasks, multi-task learning enables one to account for the similarities of the tasks via appropriate regularizers. A step further consists of learning a continuum of tasks for various loss functions. A promising approach, called \\emph{Parametric Task Learning}, has paved the way in the continuum setting for affine models and piecewise-linear loss functions. In this work, we introduce a novel approach called \\emph{Infinite Task Learning} whos","authors_text":"Alex Lambert, Florence d'Alch\\'e-Buc, Maxime Sangnier, Romain Brault, Zolt\\'an Szab\\'o","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-22T18:38:59Z","title":"Infinite-Task Learning with RKHSs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.08809","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:903a592459de34114653abc3e7679a61c1302f76570e2782b3b2f2a93b0fe407","target":"record","created_at":"2026-05-18T00:03:36Z","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":"664a0ba8adbb62d1fbddc71d5666b8f839a321065c1e8d830f6e93c0f0c41359","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-22T18:38:59Z","title_canon_sha256":"46ef831404b35b8690213dbcd8a12599494d82b377a3a843213727d3afd475d3"},"schema_version":"1.0","source":{"id":"1805.08809","kind":"arxiv","version":3}},"canonical_sha256":"69a465ca92920d3f3c096d296081aa739717b82f04c0f84aeb2b7a917f8f73e4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"69a465ca92920d3f3c096d296081aa739717b82f04c0f84aeb2b7a917f8f73e4","first_computed_at":"2026-05-18T00:03:36.850125Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:03:36.850125Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4cQxk77yDVAioJD/+TWJG51LzaPrRmASrE4czW8hjhxSquBdGR/pSN22xEZI+6mfAs9afcxO3tBElrqQsAFCDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:03:36.850696Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.08809","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:903a592459de34114653abc3e7679a61c1302f76570e2782b3b2f2a93b0fe407","sha256:09194ea3a2a96ddb708711886f75befe80ef18a546e0fb7f45b4f32290dba7e0"],"state_sha256":"2ac6d3ea8f09f6583ea672b759082cda22e7f2ee6b13ca233241ffc301011629"}