{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:ILUPHE2GE75N2ZNAH5PRIER7KI","short_pith_number":"pith:ILUPHE2G","schema_version":"1.0","canonical_sha256":"42e8f3934627fadd65a03f5f14123f521243dcb55dac3b6bde4195dc711fd659","source":{"kind":"arxiv","id":"1404.3190","version":1},"attestation_state":"computed","paper":{"title":"Pareto-Path Multi-Task Multiple Kernel Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Cong Li, Georgios C. Anagnostopoulos, Michael Georgiopoulos","submitted_at":"2014-04-11T19:15:22Z","abstract_excerpt":"A traditional and intuitively appealing Multi-Task Multiple Kernel Learning (MT-MKL) method is to optimize the sum (thus, the average) of objective functions with (partially) shared kernel function, which allows information sharing amongst tasks. We point out that the obtained solution corresponds to a single point on the Pareto Front (PF) of a Multi-Objective Optimization (MOO) problem, which considers the concurrent optimization of all task objectives involved in the Multi-Task Learning (MTL) problem. Motivated by this last observation and arguing that the former approach is heuristic, we pr"},"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":"1404.3190","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-04-11T19:15:22Z","cross_cats_sorted":[],"title_canon_sha256":"8efe4cc0fa6614acacaa2de6b30de59cec53a12a5a51891c44d794d309ebe202","abstract_canon_sha256":"72cca309f194deeb2cd2bc302c1eba237713fc3714a92928fbca4d1fe873be8a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:54:22.023839Z","signature_b64":"+lbyEPExnxnQwl6lErE35mF1L1c4ID+aP88597cxKrbg+ODjb+cNlRS46hTUu+Uk2emjkso1V8QwTBhcE5/zAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"42e8f3934627fadd65a03f5f14123f521243dcb55dac3b6bde4195dc711fd659","last_reissued_at":"2026-05-18T02:54:22.023478Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:54:22.023478Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Pareto-Path Multi-Task Multiple Kernel Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Cong Li, Georgios C. Anagnostopoulos, Michael Georgiopoulos","submitted_at":"2014-04-11T19:15:22Z","abstract_excerpt":"A traditional and intuitively appealing Multi-Task Multiple Kernel Learning (MT-MKL) method is to optimize the sum (thus, the average) of objective functions with (partially) shared kernel function, which allows information sharing amongst tasks. We point out that the obtained solution corresponds to a single point on the Pareto Front (PF) of a Multi-Objective Optimization (MOO) problem, which considers the concurrent optimization of all task objectives involved in the Multi-Task Learning (MTL) problem. Motivated by this last observation and arguing that the former approach is heuristic, we pr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.3190","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":"1404.3190","created_at":"2026-05-18T02:54:22.023536+00:00"},{"alias_kind":"arxiv_version","alias_value":"1404.3190v1","created_at":"2026-05-18T02:54:22.023536+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.3190","created_at":"2026-05-18T02:54:22.023536+00:00"},{"alias_kind":"pith_short_12","alias_value":"ILUPHE2GE75N","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_16","alias_value":"ILUPHE2GE75N2ZNA","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_8","alias_value":"ILUPHE2G","created_at":"2026-05-18T12:28:33.132498+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/ILUPHE2GE75N2ZNAH5PRIER7KI","json":"https://pith.science/pith/ILUPHE2GE75N2ZNAH5PRIER7KI.json","graph_json":"https://pith.science/api/pith-number/ILUPHE2GE75N2ZNAH5PRIER7KI/graph.json","events_json":"https://pith.science/api/pith-number/ILUPHE2GE75N2ZNAH5PRIER7KI/events.json","paper":"https://pith.science/paper/ILUPHE2G"},"agent_actions":{"view_html":"https://pith.science/pith/ILUPHE2GE75N2ZNAH5PRIER7KI","download_json":"https://pith.science/pith/ILUPHE2GE75N2ZNAH5PRIER7KI.json","view_paper":"https://pith.science/paper/ILUPHE2G","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1404.3190&json=true","fetch_graph":"https://pith.science/api/pith-number/ILUPHE2GE75N2ZNAH5PRIER7KI/graph.json","fetch_events":"https://pith.science/api/pith-number/ILUPHE2GE75N2ZNAH5PRIER7KI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ILUPHE2GE75N2ZNAH5PRIER7KI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ILUPHE2GE75N2ZNAH5PRIER7KI/action/storage_attestation","attest_author":"https://pith.science/pith/ILUPHE2GE75N2ZNAH5PRIER7KI/action/author_attestation","sign_citation":"https://pith.science/pith/ILUPHE2GE75N2ZNAH5PRIER7KI/action/citation_signature","submit_replication":"https://pith.science/pith/ILUPHE2GE75N2ZNAH5PRIER7KI/action/replication_record"}},"created_at":"2026-05-18T02:54:22.023536+00:00","updated_at":"2026-05-18T02:54:22.023536+00:00"}