{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:QPQE77IRC3KKTYFMZUB4RYMYTE","short_pith_number":"pith:QPQE77IR","canonical_record":{"source":{"id":"1706.01824","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-06-06T15:53:26Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"30e5b79ef8ab15a78767bb5ffbf52c79fca2eacaa438a1da49d4edbc798c7d8d","abstract_canon_sha256":"9a09e329593eefa4397cf34cce1011a43b7e24b4ddbe94fc10dd542c2998955c"},"schema_version":"1.0"},"canonical_sha256":"83e04ffd1116d4a9e0accd03c8e198993d5bceb260697bb18c67edaaf16cac17","source":{"kind":"arxiv","id":"1706.01824","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.01824","created_at":"2026-05-18T00:41:32Z"},{"alias_kind":"arxiv_version","alias_value":"1706.01824v1","created_at":"2026-05-18T00:41:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.01824","created_at":"2026-05-18T00:41:32Z"},{"alias_kind":"pith_short_12","alias_value":"QPQE77IRC3KK","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"QPQE77IRC3KKTYFM","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"QPQE77IR","created_at":"2026-05-18T12:31:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:QPQE77IRC3KKTYFMZUB4RYMYTE","target":"record","payload":{"canonical_record":{"source":{"id":"1706.01824","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-06-06T15:53:26Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"30e5b79ef8ab15a78767bb5ffbf52c79fca2eacaa438a1da49d4edbc798c7d8d","abstract_canon_sha256":"9a09e329593eefa4397cf34cce1011a43b7e24b4ddbe94fc10dd542c2998955c"},"schema_version":"1.0"},"canonical_sha256":"83e04ffd1116d4a9e0accd03c8e198993d5bceb260697bb18c67edaaf16cac17","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:41:32.142912Z","signature_b64":"p4oNrNBMyS7piP8rufPa87FX/OPUcheU4A5qhfwEkNF2AnUoCl4UnuzbxV87Z1Cxro4anOjH3uIuPTv4SrfwBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"83e04ffd1116d4a9e0accd03c8e198993d5bceb260697bb18c67edaaf16cac17","last_reissued_at":"2026-05-18T00:41:32.142149Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:41:32.142149Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1706.01824","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:41:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6KTkzO2HBJ3b2b+v4NqTe7CENh45u4Ws5VeGz1G1P/2baOfomWPOW4VM94VLEaf+C+D/wMvnbFsUz5cTvjtmCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T21:39:25.752919Z"},"content_sha256":"21042e502546e422b7f9bd0af8badd03326718497b93420082a1022c5058bf65","schema_version":"1.0","event_id":"sha256:21042e502546e422b7f9bd0af8badd03326718497b93420082a1022c5058bf65"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:QPQE77IRC3KKTYFMZUB4RYMYTE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Robust Online Multi-Task Learning with Correlative and Personalized Structures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Peilin Zhao, Peng Yang, Xin Gao","submitted_at":"2017-06-06T15:53:26Z","abstract_excerpt":"Multi-Task Learning (MTL) can enhance a classifier's generalization performance by learning multiple related tasks simultaneously. Conventional MTL works under the offline or batch setting, and suffers from expensive training cost and poor scalability. To address such inefficiency issues, online learning techniques have been applied to solve MTL problems. However, most existing algorithms of online MTL constrain task relatedness into a presumed structure via a single weight matrix, which is a strict restriction that does not always hold in practice. In this paper, we propose a robust online MT"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.01824","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:41:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qSzNcg6GHlhFtGbGyhaPGGLGyWE6uMMjFHVxj4wzXzh5cjeCG+6bDNCE16qXf7p5Ya4kNL6AfwOL2l3je2TTBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T21:39:25.753563Z"},"content_sha256":"d1e1b504117d1421db12bf1d2044fb42c9c19c329910fdbb69ca9351bbc4ce46","schema_version":"1.0","event_id":"sha256:d1e1b504117d1421db12bf1d2044fb42c9c19c329910fdbb69ca9351bbc4ce46"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QPQE77IRC3KKTYFMZUB4RYMYTE/bundle.json","state_url":"https://pith.science/pith/QPQE77IRC3KKTYFMZUB4RYMYTE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QPQE77IRC3KKTYFMZUB4RYMYTE/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-25T21:39:25Z","links":{"resolver":"https://pith.science/pith/QPQE77IRC3KKTYFMZUB4RYMYTE","bundle":"https://pith.science/pith/QPQE77IRC3KKTYFMZUB4RYMYTE/bundle.json","state":"https://pith.science/pith/QPQE77IRC3KKTYFMZUB4RYMYTE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QPQE77IRC3KKTYFMZUB4RYMYTE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:QPQE77IRC3KKTYFMZUB4RYMYTE","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":"9a09e329593eefa4397cf34cce1011a43b7e24b4ddbe94fc10dd542c2998955c","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-06-06T15:53:26Z","title_canon_sha256":"30e5b79ef8ab15a78767bb5ffbf52c79fca2eacaa438a1da49d4edbc798c7d8d"},"schema_version":"1.0","source":{"id":"1706.01824","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.01824","created_at":"2026-05-18T00:41:32Z"},{"alias_kind":"arxiv_version","alias_value":"1706.01824v1","created_at":"2026-05-18T00:41:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.01824","created_at":"2026-05-18T00:41:32Z"},{"alias_kind":"pith_short_12","alias_value":"QPQE77IRC3KK","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"QPQE77IRC3KKTYFM","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"QPQE77IR","created_at":"2026-05-18T12:31:39Z"}],"graph_snapshots":[{"event_id":"sha256:d1e1b504117d1421db12bf1d2044fb42c9c19c329910fdbb69ca9351bbc4ce46","target":"graph","created_at":"2026-05-18T00:41:32Z","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":"Multi-Task Learning (MTL) can enhance a classifier's generalization performance by learning multiple related tasks simultaneously. Conventional MTL works under the offline or batch setting, and suffers from expensive training cost and poor scalability. To address such inefficiency issues, online learning techniques have been applied to solve MTL problems. However, most existing algorithms of online MTL constrain task relatedness into a presumed structure via a single weight matrix, which is a strict restriction that does not always hold in practice. In this paper, we propose a robust online MT","authors_text":"Peilin Zhao, Peng Yang, Xin Gao","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-06-06T15:53:26Z","title":"Robust Online Multi-Task Learning with Correlative and Personalized Structures"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.01824","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:21042e502546e422b7f9bd0af8badd03326718497b93420082a1022c5058bf65","target":"record","created_at":"2026-05-18T00:41:32Z","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":"9a09e329593eefa4397cf34cce1011a43b7e24b4ddbe94fc10dd542c2998955c","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-06-06T15:53:26Z","title_canon_sha256":"30e5b79ef8ab15a78767bb5ffbf52c79fca2eacaa438a1da49d4edbc798c7d8d"},"schema_version":"1.0","source":{"id":"1706.01824","kind":"arxiv","version":1}},"canonical_sha256":"83e04ffd1116d4a9e0accd03c8e198993d5bceb260697bb18c67edaaf16cac17","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"83e04ffd1116d4a9e0accd03c8e198993d5bceb260697bb18c67edaaf16cac17","first_computed_at":"2026-05-18T00:41:32.142149Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:41:32.142149Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"p4oNrNBMyS7piP8rufPa87FX/OPUcheU4A5qhfwEkNF2AnUoCl4UnuzbxV87Z1Cxro4anOjH3uIuPTv4SrfwBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:41:32.142912Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.01824","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:21042e502546e422b7f9bd0af8badd03326718497b93420082a1022c5058bf65","sha256:d1e1b504117d1421db12bf1d2044fb42c9c19c329910fdbb69ca9351bbc4ce46"],"state_sha256":"c9269895898fc33b1becbff6909f65d4f4bc3574aa1f87524b4a983c485c46c2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rFV/vsh4+modV361CYP5s66P6uzexUS11Cc8HHAKTe77r8ooD/bDfYlSU5Ih+Ympx3E7wPebmRWpsL3AqTHhDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T21:39:25.756750Z","bundle_sha256":"2299ab4ed3bb85c51539f634aa8b8a480d361bedb75fad5a8399f19ed3fed4ce"}}