{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:BYQOKKTW5ZQAWKVXDNI3UX6GZB","short_pith_number":"pith:BYQOKKTW","canonical_record":{"source":{"id":"1808.08068","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-08-24T09:55:41Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"d25a8f605ba9ffed889263de3e7b1015325fd16830b43a8b5a73723e4e141952","abstract_canon_sha256":"42011482eb6ef3465e0ca1cae292182cd909831f498197da9ff0e5c8c8dd05d4"},"schema_version":"1.0"},"canonical_sha256":"0e20e52a76ee600b2ab71b51ba5fc6c87b487c7e4c990701aa8b1526cab9265f","source":{"kind":"arxiv","id":"1808.08068","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.08068","created_at":"2026-05-18T00:07:22Z"},{"alias_kind":"arxiv_version","alias_value":"1808.08068v1","created_at":"2026-05-18T00:07:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.08068","created_at":"2026-05-18T00:07:22Z"},{"alias_kind":"pith_short_12","alias_value":"BYQOKKTW5ZQA","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"BYQOKKTW5ZQAWKVX","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"BYQOKKTW","created_at":"2026-05-18T12:32:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:BYQOKKTW5ZQAWKVXDNI3UX6GZB","target":"record","payload":{"canonical_record":{"source":{"id":"1808.08068","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-08-24T09:55:41Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"d25a8f605ba9ffed889263de3e7b1015325fd16830b43a8b5a73723e4e141952","abstract_canon_sha256":"42011482eb6ef3465e0ca1cae292182cd909831f498197da9ff0e5c8c8dd05d4"},"schema_version":"1.0"},"canonical_sha256":"0e20e52a76ee600b2ab71b51ba5fc6c87b487c7e4c990701aa8b1526cab9265f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:07:22.525599Z","signature_b64":"/vZ7D0FUQ9VM1gIoDAYCd1QnCiBR9xi7srq8vaDQ2GTppZV5iulrj2p2AV+1B+lAQxp1h62XF+GYE/tjesksBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0e20e52a76ee600b2ab71b51ba5fc6c87b487c7e4c990701aa8b1526cab9265f","last_reissued_at":"2026-05-18T00:07:22.524920Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:07:22.524920Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1808.08068","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:07:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ltT9EwouvgWVquirEsmujcZPgXABPIckh0kY77XPNdkq4c0/9r8TioxlN7e/N0KMKHueAKaqBgBcGgcYyowABw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T06:36:23.540758Z"},"content_sha256":"0047a47de18b649098476bfdfeecbea06fae82fe3e6dc0497acc0959b7614708","schema_version":"1.0","event_id":"sha256:0047a47de18b649098476bfdfeecbea06fae82fe3e6dc0497acc0959b7614708"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:BYQOKKTW5ZQAWKVXDNI3UX6GZB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Self-Paced Multi-Task Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Dezhong Yao, Xiaofan Que, Yazhou Ren, Zenglin Xu","submitted_at":"2018-08-24T09:55:41Z","abstract_excerpt":"Multi-task clustering (MTC) has attracted a lot of research attentions in machine learning due to its ability in utilizing the relationship among different tasks. Despite the success of traditional MTC models, they are either easy to stuck into local optima, or sensitive to outliers and noisy data. To alleviate these problems, we propose a novel self-paced multi-task clustering (SPMTC) paradigm. In detail, SPMTC progressively selects data examples to train a series of MTC models with increasing complexity, thus highly decreases the risk of trapping into poor local optima. Furthermore, to reduc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.08068","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:07:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L3qFj0glr5dR7s4uAVay9ldwrczH0HYyoJ4RcuaNcCQ0MPzZFvq7bujZ2DsNVUhDStAcwvkOJ9hyTCP+3IqeCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T06:36:23.541106Z"},"content_sha256":"6f402291ce125860ac54b90a03a1597da80ad3e60c28d1a21998a619f36455f8","schema_version":"1.0","event_id":"sha256:6f402291ce125860ac54b90a03a1597da80ad3e60c28d1a21998a619f36455f8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BYQOKKTW5ZQAWKVXDNI3UX6GZB/bundle.json","state_url":"https://pith.science/pith/BYQOKKTW5ZQAWKVXDNI3UX6GZB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BYQOKKTW5ZQAWKVXDNI3UX6GZB/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-06-01T06:36:23Z","links":{"resolver":"https://pith.science/pith/BYQOKKTW5ZQAWKVXDNI3UX6GZB","bundle":"https://pith.science/pith/BYQOKKTW5ZQAWKVXDNI3UX6GZB/bundle.json","state":"https://pith.science/pith/BYQOKKTW5ZQAWKVXDNI3UX6GZB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BYQOKKTW5ZQAWKVXDNI3UX6GZB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:BYQOKKTW5ZQAWKVXDNI3UX6GZB","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":"42011482eb6ef3465e0ca1cae292182cd909831f498197da9ff0e5c8c8dd05d4","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-08-24T09:55:41Z","title_canon_sha256":"d25a8f605ba9ffed889263de3e7b1015325fd16830b43a8b5a73723e4e141952"},"schema_version":"1.0","source":{"id":"1808.08068","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.08068","created_at":"2026-05-18T00:07:22Z"},{"alias_kind":"arxiv_version","alias_value":"1808.08068v1","created_at":"2026-05-18T00:07:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.08068","created_at":"2026-05-18T00:07:22Z"},{"alias_kind":"pith_short_12","alias_value":"BYQOKKTW5ZQA","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"BYQOKKTW5ZQAWKVX","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"BYQOKKTW","created_at":"2026-05-18T12:32:16Z"}],"graph_snapshots":[{"event_id":"sha256:6f402291ce125860ac54b90a03a1597da80ad3e60c28d1a21998a619f36455f8","target":"graph","created_at":"2026-05-18T00:07:22Z","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 clustering (MTC) has attracted a lot of research attentions in machine learning due to its ability in utilizing the relationship among different tasks. Despite the success of traditional MTC models, they are either easy to stuck into local optima, or sensitive to outliers and noisy data. To alleviate these problems, we propose a novel self-paced multi-task clustering (SPMTC) paradigm. In detail, SPMTC progressively selects data examples to train a series of MTC models with increasing complexity, thus highly decreases the risk of trapping into poor local optima. Furthermore, to reduc","authors_text":"Dezhong Yao, Xiaofan Que, Yazhou Ren, Zenglin Xu","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-08-24T09:55:41Z","title":"Self-Paced Multi-Task Clustering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.08068","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:0047a47de18b649098476bfdfeecbea06fae82fe3e6dc0497acc0959b7614708","target":"record","created_at":"2026-05-18T00:07:22Z","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":"42011482eb6ef3465e0ca1cae292182cd909831f498197da9ff0e5c8c8dd05d4","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-08-24T09:55:41Z","title_canon_sha256":"d25a8f605ba9ffed889263de3e7b1015325fd16830b43a8b5a73723e4e141952"},"schema_version":"1.0","source":{"id":"1808.08068","kind":"arxiv","version":1}},"canonical_sha256":"0e20e52a76ee600b2ab71b51ba5fc6c87b487c7e4c990701aa8b1526cab9265f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0e20e52a76ee600b2ab71b51ba5fc6c87b487c7e4c990701aa8b1526cab9265f","first_computed_at":"2026-05-18T00:07:22.524920Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:07:22.524920Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/vZ7D0FUQ9VM1gIoDAYCd1QnCiBR9xi7srq8vaDQ2GTppZV5iulrj2p2AV+1B+lAQxp1h62XF+GYE/tjesksBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:07:22.525599Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.08068","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0047a47de18b649098476bfdfeecbea06fae82fe3e6dc0497acc0959b7614708","sha256:6f402291ce125860ac54b90a03a1597da80ad3e60c28d1a21998a619f36455f8"],"state_sha256":"7826be445e745c2b4074f68591336c6fcf68170427ad622373ac9f8af7fc1028"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"guc0WNXYvqWyOeIl8bXbVKWXdYKSRZM9OpJKbpOxdUuZv8rM8+lTHSlLi5HVaA33a5Q1m6ropnO05YAhuZfEAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T06:36:23.543145Z","bundle_sha256":"354c581437de85dd23a60f0fe1d651c99b88d39b1875a03200d8838ce78f61bd"}}