{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:ZFXYNMRWEAF2TYRITZXNFBDQVD","short_pith_number":"pith:ZFXYNMRW","schema_version":"1.0","canonical_sha256":"c96f86b236200ba9e2289e6ed28470a8f41aef976df345737fdd9e7bd46c78b2","source":{"kind":"arxiv","id":"1703.00994","version":1},"attestation_state":"computed","paper":{"title":"Co-Clustering for Multitask Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Jaime Carbonell, Keerthiram Murugesan, Yiming Yang","submitted_at":"2017-03-03T00:03:14Z","abstract_excerpt":"This paper presents a new multitask learning framework that learns a shared representation among the tasks, incorporating both task and feature clusters. The jointly-induced clusters yield a shared latent subspace where task relationships are learned more effectively and more generally than in state-of-the-art multitask learning methods. The proposed general framework enables the derivation of more specific or restricted state-of-the-art multitask methods. The paper also proposes a highly-scalable multitask learning algorithm, based on the new framework, using conjugate gradient descent and ge"},"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":"1703.00994","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2017-03-03T00:03:14Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"efc270f284b3657ae4c642c22d97748be29c49798e33bf8c82ade078a769ea7d","abstract_canon_sha256":"b5d654d4ff433d503dcd95616f28277b2178310ebb2a5b86a6910159a17dd4b7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:49:37.301844Z","signature_b64":"Hl9b4Y8GsccWwxFcsnOrRyzr3ypCdtPpIQkBObkbT75Z2eBoi+hsJclh0SChd/BQ+BQd+7bRWi8h9+NilUG6AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c96f86b236200ba9e2289e6ed28470a8f41aef976df345737fdd9e7bd46c78b2","last_reissued_at":"2026-05-18T00:49:37.301206Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:49:37.301206Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Co-Clustering for Multitask Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Jaime Carbonell, Keerthiram Murugesan, Yiming Yang","submitted_at":"2017-03-03T00:03:14Z","abstract_excerpt":"This paper presents a new multitask learning framework that learns a shared representation among the tasks, incorporating both task and feature clusters. The jointly-induced clusters yield a shared latent subspace where task relationships are learned more effectively and more generally than in state-of-the-art multitask learning methods. The proposed general framework enables the derivation of more specific or restricted state-of-the-art multitask methods. The paper also proposes a highly-scalable multitask learning algorithm, based on the new framework, using conjugate gradient descent and ge"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.00994","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":"1703.00994","created_at":"2026-05-18T00:49:37.301302+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.00994v1","created_at":"2026-05-18T00:49:37.301302+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.00994","created_at":"2026-05-18T00:49:37.301302+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZFXYNMRWEAF2","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZFXYNMRWEAF2TYRI","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZFXYNMRW","created_at":"2026-05-18T12:31:59.375834+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.01907","citing_title":"Adaptive Estimation and Inference in Semi-parametric Heterogeneous Clustered Multitask Learning via Neyman Orthogonality","ref_index":5,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZFXYNMRWEAF2TYRITZXNFBDQVD","json":"https://pith.science/pith/ZFXYNMRWEAF2TYRITZXNFBDQVD.json","graph_json":"https://pith.science/api/pith-number/ZFXYNMRWEAF2TYRITZXNFBDQVD/graph.json","events_json":"https://pith.science/api/pith-number/ZFXYNMRWEAF2TYRITZXNFBDQVD/events.json","paper":"https://pith.science/paper/ZFXYNMRW"},"agent_actions":{"view_html":"https://pith.science/pith/ZFXYNMRWEAF2TYRITZXNFBDQVD","download_json":"https://pith.science/pith/ZFXYNMRWEAF2TYRITZXNFBDQVD.json","view_paper":"https://pith.science/paper/ZFXYNMRW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.00994&json=true","fetch_graph":"https://pith.science/api/pith-number/ZFXYNMRWEAF2TYRITZXNFBDQVD/graph.json","fetch_events":"https://pith.science/api/pith-number/ZFXYNMRWEAF2TYRITZXNFBDQVD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZFXYNMRWEAF2TYRITZXNFBDQVD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZFXYNMRWEAF2TYRITZXNFBDQVD/action/storage_attestation","attest_author":"https://pith.science/pith/ZFXYNMRWEAF2TYRITZXNFBDQVD/action/author_attestation","sign_citation":"https://pith.science/pith/ZFXYNMRWEAF2TYRITZXNFBDQVD/action/citation_signature","submit_replication":"https://pith.science/pith/ZFXYNMRWEAF2TYRITZXNFBDQVD/action/replication_record"}},"created_at":"2026-05-18T00:49:37.301302+00:00","updated_at":"2026-05-18T00:49:37.301302+00:00"}