{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:NNYZYWI32V6ZLZXGVIP4Z2BDT6","short_pith_number":"pith:NNYZYWI3","canonical_record":{"source":{"id":"1811.05695","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-14T09:19:39Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"0e1c7f00f403ea23ac7d1a4f653082413463a7e355a04b3a76310003f5a837f4","abstract_canon_sha256":"a1c44cc13ff751a6200ca9fca647001b47bbb24711a3eb6049e416b7355422bd"},"schema_version":"1.0"},"canonical_sha256":"6b719c591bd57d95e6e6aa1fcce8239f84df66509290455a0af94fb0b6a6aa02","source":{"kind":"arxiv","id":"1811.05695","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.05695","created_at":"2026-05-18T00:00:42Z"},{"alias_kind":"arxiv_version","alias_value":"1811.05695v1","created_at":"2026-05-18T00:00:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.05695","created_at":"2026-05-18T00:00:42Z"},{"alias_kind":"pith_short_12","alias_value":"NNYZYWI32V6Z","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"NNYZYWI32V6ZLZXG","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"NNYZYWI3","created_at":"2026-05-18T12:32:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:NNYZYWI32V6ZLZXGVIP4Z2BDT6","target":"record","payload":{"canonical_record":{"source":{"id":"1811.05695","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-14T09:19:39Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"0e1c7f00f403ea23ac7d1a4f653082413463a7e355a04b3a76310003f5a837f4","abstract_canon_sha256":"a1c44cc13ff751a6200ca9fca647001b47bbb24711a3eb6049e416b7355422bd"},"schema_version":"1.0"},"canonical_sha256":"6b719c591bd57d95e6e6aa1fcce8239f84df66509290455a0af94fb0b6a6aa02","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:42.299991Z","signature_b64":"tTFudlGeqlZWZv9soFIZ7WhtTbQsQhmerwgxj8sbgQlbkg1V1MwvdPCk5qJ78bboLb9Lk4DlYXg4D6tirpsgAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6b719c591bd57d95e6e6aa1fcce8239f84df66509290455a0af94fb0b6a6aa02","last_reissued_at":"2026-05-18T00:00:42.299595Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:42.299595Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.05695","source_version":1,"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-18T00:00:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zp/n0uL2a65R7KWlGOwY3UC1jXl86nGDP1uKPE++DJZLhaRhOO7U1MwUGsoB8elJBF5NlRHM04RmSS2nAu+XBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T18:17:16.974347Z"},"content_sha256":"5e8d0a680c1eb4a8ca608965cb5c07050ea82eb2bb74e843ef5a764cf74c84c9","schema_version":"1.0","event_id":"sha256:5e8d0a680c1eb4a8ca608965cb5c07050ea82eb2bb74e843ef5a764cf74c84c9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:NNYZYWI32V6ZLZXGVIP4Z2BDT6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient and Scalable Multi-task Regression on Massive Number of Tasks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Ammar Shaker, Francesco Alesiani, Xiao He","submitted_at":"2018-11-14T09:19:39Z","abstract_excerpt":"Many real-world large-scale regression problems can be formulated as Multi-task Learning (MTL) problems with a massive number of tasks, as in retail and transportation domains. However, existing MTL methods still fail to offer both the generalization performance and the scalability for such problems. Scaling up MTL methods to problems with a tremendous number of tasks is a big challenge. Here, we propose a novel algorithm, named Convex Clustering Multi-Task regression Learning (CCMTL), which integrates with convex clustering on the k-nearest neighbor graph of the prediction models. Further, CC"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.05695","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"},"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-18T00:00:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VUKYlvm/iGWDJ+51IPvWcKHhp+vmpoj10X3LrMmhpuVZqeUSfur4iu3kOWOMZbuCIzx0b8sGUgXreXaOYMEgAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T18:17:16.975009Z"},"content_sha256":"a3151e6745f0e33055b916a4d7868850b3ef44b46de91166a1880705c2465b73","schema_version":"1.0","event_id":"sha256:a3151e6745f0e33055b916a4d7868850b3ef44b46de91166a1880705c2465b73"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NNYZYWI32V6ZLZXGVIP4Z2BDT6/bundle.json","state_url":"https://pith.science/pith/NNYZYWI32V6ZLZXGVIP4Z2BDT6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NNYZYWI32V6ZLZXGVIP4Z2BDT6/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-28T18:17:16Z","links":{"resolver":"https://pith.science/pith/NNYZYWI32V6ZLZXGVIP4Z2BDT6","bundle":"https://pith.science/pith/NNYZYWI32V6ZLZXGVIP4Z2BDT6/bundle.json","state":"https://pith.science/pith/NNYZYWI32V6ZLZXGVIP4Z2BDT6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NNYZYWI32V6ZLZXGVIP4Z2BDT6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:NNYZYWI32V6ZLZXGVIP4Z2BDT6","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":"a1c44cc13ff751a6200ca9fca647001b47bbb24711a3eb6049e416b7355422bd","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-14T09:19:39Z","title_canon_sha256":"0e1c7f00f403ea23ac7d1a4f653082413463a7e355a04b3a76310003f5a837f4"},"schema_version":"1.0","source":{"id":"1811.05695","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.05695","created_at":"2026-05-18T00:00:42Z"},{"alias_kind":"arxiv_version","alias_value":"1811.05695v1","created_at":"2026-05-18T00:00:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.05695","created_at":"2026-05-18T00:00:42Z"},{"alias_kind":"pith_short_12","alias_value":"NNYZYWI32V6Z","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"NNYZYWI32V6ZLZXG","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"NNYZYWI3","created_at":"2026-05-18T12:32:40Z"}],"graph_snapshots":[{"event_id":"sha256:a3151e6745f0e33055b916a4d7868850b3ef44b46de91166a1880705c2465b73","target":"graph","created_at":"2026-05-18T00:00:42Z","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":"Many real-world large-scale regression problems can be formulated as Multi-task Learning (MTL) problems with a massive number of tasks, as in retail and transportation domains. However, existing MTL methods still fail to offer both the generalization performance and the scalability for such problems. Scaling up MTL methods to problems with a tremendous number of tasks is a big challenge. Here, we propose a novel algorithm, named Convex Clustering Multi-Task regression Learning (CCMTL), which integrates with convex clustering on the k-nearest neighbor graph of the prediction models. Further, CC","authors_text":"Ammar Shaker, Francesco Alesiani, Xiao He","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-14T09:19:39Z","title":"Efficient and Scalable Multi-task Regression on Massive Number of Tasks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.05695","kind":"arxiv","version":1},"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:5e8d0a680c1eb4a8ca608965cb5c07050ea82eb2bb74e843ef5a764cf74c84c9","target":"record","created_at":"2026-05-18T00:00:42Z","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":"a1c44cc13ff751a6200ca9fca647001b47bbb24711a3eb6049e416b7355422bd","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-14T09:19:39Z","title_canon_sha256":"0e1c7f00f403ea23ac7d1a4f653082413463a7e355a04b3a76310003f5a837f4"},"schema_version":"1.0","source":{"id":"1811.05695","kind":"arxiv","version":1}},"canonical_sha256":"6b719c591bd57d95e6e6aa1fcce8239f84df66509290455a0af94fb0b6a6aa02","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6b719c591bd57d95e6e6aa1fcce8239f84df66509290455a0af94fb0b6a6aa02","first_computed_at":"2026-05-18T00:00:42.299595Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:00:42.299595Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tTFudlGeqlZWZv9soFIZ7WhtTbQsQhmerwgxj8sbgQlbkg1V1MwvdPCk5qJ78bboLb9Lk4DlYXg4D6tirpsgAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:00:42.299991Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.05695","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5e8d0a680c1eb4a8ca608965cb5c07050ea82eb2bb74e843ef5a764cf74c84c9","sha256:a3151e6745f0e33055b916a4d7868850b3ef44b46de91166a1880705c2465b73"],"state_sha256":"3a24bf5d89b27abc124b7b6f560bb23d0f74371ff7043fca1d5f3859ac189845"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LTB8w1TDPQaduX8/DvJ1nhoTBC1u78iNGUmRyQ83AcHh8ANtwVffs6+nmyi1SePkViILSSSfWx11GyCa+5E4BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T18:17:16.979029Z","bundle_sha256":"8875b66e5e4c2938777cbc889b96788b49c8b411f61dfc611bd0c7396eb4e079"}}