{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:UQLE6E4C7C526MD4RWEO56YPAE","short_pith_number":"pith:UQLE6E4C","canonical_record":{"source":{"id":"1804.10795","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2018-04-28T12:35:27Z","cross_cats_sorted":[],"title_canon_sha256":"c1d220986d2f7905f18fc8126b93d3cb8178230f2cbf0ecfb31d4a5f8818b47c","abstract_canon_sha256":"a05264abdd8733f4c86377abaf0759abb1de89e875c294f88b6605e2d4c13529"},"schema_version":"1.0"},"canonical_sha256":"a4164f1382f8bbaf307c8d88eefb0f010538e7322e9b58ed90aa845347cbd989","source":{"kind":"arxiv","id":"1804.10795","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.10795","created_at":"2026-05-18T00:17:15Z"},{"alias_kind":"arxiv_version","alias_value":"1804.10795v1","created_at":"2026-05-18T00:17:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.10795","created_at":"2026-05-18T00:17:15Z"},{"alias_kind":"pith_short_12","alias_value":"UQLE6E4C7C52","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"UQLE6E4C7C526MD4","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"UQLE6E4C","created_at":"2026-05-18T12:32:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:UQLE6E4C7C526MD4RWEO56YPAE","target":"record","payload":{"canonical_record":{"source":{"id":"1804.10795","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2018-04-28T12:35:27Z","cross_cats_sorted":[],"title_canon_sha256":"c1d220986d2f7905f18fc8126b93d3cb8178230f2cbf0ecfb31d4a5f8818b47c","abstract_canon_sha256":"a05264abdd8733f4c86377abaf0759abb1de89e875c294f88b6605e2d4c13529"},"schema_version":"1.0"},"canonical_sha256":"a4164f1382f8bbaf307c8d88eefb0f010538e7322e9b58ed90aa845347cbd989","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:15.539433Z","signature_b64":"OsWM0RxeaUDEbjFDGk0Eh9LT7H4yZkvf91ttFTBtsO8wE7noQayKYtlyWj/P5qnrSzlSrnd3aSpM2K4Y0kuDBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a4164f1382f8bbaf307c8d88eefb0f010538e7322e9b58ed90aa845347cbd989","last_reissued_at":"2026-05-18T00:17:15.538839Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:15.538839Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1804.10795","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:17:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BG19GhfAdqsqA/rqA0U+umP21v+3tkg6CcItFuobEPa1CiwCrCN2DIdDYFA6kIqqcAEyhzT1YLlGdU1fQs+mDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T10:05:35.475618Z"},"content_sha256":"2bf81b3be801fbb4e43c996f78f3bea2bc8923c6168fbe2612abad5716b64670","schema_version":"1.0","event_id":"sha256:2bf81b3be801fbb4e43c996f78f3bea2bc8923c6168fbe2612abad5716b64670"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:UQLE6E4C7C526MD4RWEO56YPAE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"User-Sensitive Recommendation Ensemble with Clustered Multi-Task Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Kun Zhang, Menghan Wang, Xiaolin Zheng","submitted_at":"2018-04-28T12:35:27Z","abstract_excerpt":"This paper considers recommendation algorithm ensembles in a user-sensitive manner. Recently researchers have proposed various effective recommendation algorithms, which utilized different aspects of the data and different techniques. However, the \"user skewed prediction\" problem may exist for almost all recommendation algorithms -- algorithms with best average predictive accuracy may cover up that the algorithms may perform poorly for some part of users, which will lead to biased services in real scenarios. In this paper, we propose a user-sensitive ensemble method named \"UREC\" to address thi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.10795","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:17:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jmqC1YSgdusO20ynN+lfZd3i36qNxoWrqSktORHb//epXn8jPtnCF8j7jrAXoOUvy7GkyTmpPCskZzM+x3ZhCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T10:05:35.476272Z"},"content_sha256":"0238a64a0852ad45230f256e618601820d009ea2dcaa87767b7cc04e4eb1bcc4","schema_version":"1.0","event_id":"sha256:0238a64a0852ad45230f256e618601820d009ea2dcaa87767b7cc04e4eb1bcc4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UQLE6E4C7C526MD4RWEO56YPAE/bundle.json","state_url":"https://pith.science/pith/UQLE6E4C7C526MD4RWEO56YPAE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UQLE6E4C7C526MD4RWEO56YPAE/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-26T10:05:35Z","links":{"resolver":"https://pith.science/pith/UQLE6E4C7C526MD4RWEO56YPAE","bundle":"https://pith.science/pith/UQLE6E4C7C526MD4RWEO56YPAE/bundle.json","state":"https://pith.science/pith/UQLE6E4C7C526MD4RWEO56YPAE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UQLE6E4C7C526MD4RWEO56YPAE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:UQLE6E4C7C526MD4RWEO56YPAE","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":"a05264abdd8733f4c86377abaf0759abb1de89e875c294f88b6605e2d4c13529","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2018-04-28T12:35:27Z","title_canon_sha256":"c1d220986d2f7905f18fc8126b93d3cb8178230f2cbf0ecfb31d4a5f8818b47c"},"schema_version":"1.0","source":{"id":"1804.10795","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.10795","created_at":"2026-05-18T00:17:15Z"},{"alias_kind":"arxiv_version","alias_value":"1804.10795v1","created_at":"2026-05-18T00:17:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.10795","created_at":"2026-05-18T00:17:15Z"},{"alias_kind":"pith_short_12","alias_value":"UQLE6E4C7C52","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"UQLE6E4C7C526MD4","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"UQLE6E4C","created_at":"2026-05-18T12:32:56Z"}],"graph_snapshots":[{"event_id":"sha256:0238a64a0852ad45230f256e618601820d009ea2dcaa87767b7cc04e4eb1bcc4","target":"graph","created_at":"2026-05-18T00:17:15Z","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":"This paper considers recommendation algorithm ensembles in a user-sensitive manner. Recently researchers have proposed various effective recommendation algorithms, which utilized different aspects of the data and different techniques. However, the \"user skewed prediction\" problem may exist for almost all recommendation algorithms -- algorithms with best average predictive accuracy may cover up that the algorithms may perform poorly for some part of users, which will lead to biased services in real scenarios. In this paper, we propose a user-sensitive ensemble method named \"UREC\" to address thi","authors_text":"Kun Zhang, Menghan Wang, Xiaolin Zheng","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2018-04-28T12:35:27Z","title":"User-Sensitive Recommendation Ensemble with Clustered Multi-Task Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.10795","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:2bf81b3be801fbb4e43c996f78f3bea2bc8923c6168fbe2612abad5716b64670","target":"record","created_at":"2026-05-18T00:17:15Z","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":"a05264abdd8733f4c86377abaf0759abb1de89e875c294f88b6605e2d4c13529","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2018-04-28T12:35:27Z","title_canon_sha256":"c1d220986d2f7905f18fc8126b93d3cb8178230f2cbf0ecfb31d4a5f8818b47c"},"schema_version":"1.0","source":{"id":"1804.10795","kind":"arxiv","version":1}},"canonical_sha256":"a4164f1382f8bbaf307c8d88eefb0f010538e7322e9b58ed90aa845347cbd989","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a4164f1382f8bbaf307c8d88eefb0f010538e7322e9b58ed90aa845347cbd989","first_computed_at":"2026-05-18T00:17:15.538839Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:17:15.538839Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OsWM0RxeaUDEbjFDGk0Eh9LT7H4yZkvf91ttFTBtsO8wE7noQayKYtlyWj/P5qnrSzlSrnd3aSpM2K4Y0kuDBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:17:15.539433Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.10795","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2bf81b3be801fbb4e43c996f78f3bea2bc8923c6168fbe2612abad5716b64670","sha256:0238a64a0852ad45230f256e618601820d009ea2dcaa87767b7cc04e4eb1bcc4"],"state_sha256":"74b61ca2ae7c52222a3d9ee96102bd37f174b7ae92a41fc05a76744a64e4540b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SCFYCejYR88dr3JomVutUs0YsXzpmI7jaDUqHLwU4KHrR5a6OR9uR0qdPq/DgRFod23VTjhlb3HnS8BKkgrVCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T10:05:35.479539Z","bundle_sha256":"816d646d2b2d3327578f328e61fd268c7694abd13afaef521f4562723572c48e"}}