{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:6LXK2AUDIN3REHMAWNDHLLRBJA","short_pith_number":"pith:6LXK2AUD","schema_version":"1.0","canonical_sha256":"f2eead02834377121d80b34675ae214805bbb7b4d9a07c02a3a4c63feaa02bba","source":{"kind":"arxiv","id":"1508.03329","version":1},"attestation_state":"computed","paper":{"title":"Multi-Task Learning with Group-Specific Feature Space Sharing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Georgios C. Anagnostopoulos, Michael Georgiopoulos, Niloofar Yousefi","submitted_at":"2015-08-13T19:58:59Z","abstract_excerpt":"When faced with learning a set of inter-related tasks from a limited amount of usable data, learning each task independently may lead to poor generalization performance. Multi-Task Learning (MTL) exploits the latent relations between tasks and overcomes data scarcity limitations by co-learning all these tasks simultaneously to offer improved performance. We propose a novel Multi-Task Multiple Kernel Learning framework based on Support Vector Machines for binary classification tasks. By considering pair-wise task affinity in terms of similarity between a pair's respective feature spaces, the ne"},"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":"1508.03329","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-08-13T19:58:59Z","cross_cats_sorted":[],"title_canon_sha256":"2a249fb66184951ca4460b1b39f6dcdcd00150ac1ebabbe782331afa2da228b9","abstract_canon_sha256":"109999a6af09e15a1896bc672fc26b82aef428f398ed4ffd52f79f6b2b5695e6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:35:21.076260Z","signature_b64":"vQTH3InhxIKh9QpQxuiOCig5lk5ayPuXmp/HVrScRoFBXmlpG0kxd4/BkRroNeiTNu9VvI2Qu9Li2pUHSRtLAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f2eead02834377121d80b34675ae214805bbb7b4d9a07c02a3a4c63feaa02bba","last_reissued_at":"2026-05-18T01:35:21.075580Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:35:21.075580Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multi-Task Learning with Group-Specific Feature Space Sharing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Georgios C. Anagnostopoulos, Michael Georgiopoulos, Niloofar Yousefi","submitted_at":"2015-08-13T19:58:59Z","abstract_excerpt":"When faced with learning a set of inter-related tasks from a limited amount of usable data, learning each task independently may lead to poor generalization performance. Multi-Task Learning (MTL) exploits the latent relations between tasks and overcomes data scarcity limitations by co-learning all these tasks simultaneously to offer improved performance. We propose a novel Multi-Task Multiple Kernel Learning framework based on Support Vector Machines for binary classification tasks. By considering pair-wise task affinity in terms of similarity between a pair's respective feature spaces, the ne"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.03329","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":"1508.03329","created_at":"2026-05-18T01:35:21.075681+00:00"},{"alias_kind":"arxiv_version","alias_value":"1508.03329v1","created_at":"2026-05-18T01:35:21.075681+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.03329","created_at":"2026-05-18T01:35:21.075681+00:00"},{"alias_kind":"pith_short_12","alias_value":"6LXK2AUDIN3R","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_16","alias_value":"6LXK2AUDIN3REHMA","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_8","alias_value":"6LXK2AUD","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/6LXK2AUDIN3REHMAWNDHLLRBJA","json":"https://pith.science/pith/6LXK2AUDIN3REHMAWNDHLLRBJA.json","graph_json":"https://pith.science/api/pith-number/6LXK2AUDIN3REHMAWNDHLLRBJA/graph.json","events_json":"https://pith.science/api/pith-number/6LXK2AUDIN3REHMAWNDHLLRBJA/events.json","paper":"https://pith.science/paper/6LXK2AUD"},"agent_actions":{"view_html":"https://pith.science/pith/6LXK2AUDIN3REHMAWNDHLLRBJA","download_json":"https://pith.science/pith/6LXK2AUDIN3REHMAWNDHLLRBJA.json","view_paper":"https://pith.science/paper/6LXK2AUD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1508.03329&json=true","fetch_graph":"https://pith.science/api/pith-number/6LXK2AUDIN3REHMAWNDHLLRBJA/graph.json","fetch_events":"https://pith.science/api/pith-number/6LXK2AUDIN3REHMAWNDHLLRBJA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6LXK2AUDIN3REHMAWNDHLLRBJA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6LXK2AUDIN3REHMAWNDHLLRBJA/action/storage_attestation","attest_author":"https://pith.science/pith/6LXK2AUDIN3REHMAWNDHLLRBJA/action/author_attestation","sign_citation":"https://pith.science/pith/6LXK2AUDIN3REHMAWNDHLLRBJA/action/citation_signature","submit_replication":"https://pith.science/pith/6LXK2AUDIN3REHMAWNDHLLRBJA/action/replication_record"}},"created_at":"2026-05-18T01:35:21.075681+00:00","updated_at":"2026-05-18T01:35:21.075681+00:00"}