{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:C5J76HSCX5HHVHBZDM4M5OQ3QM","short_pith_number":"pith:C5J76HSC","schema_version":"1.0","canonical_sha256":"1753ff1e42bf4e7a9c391b38ceba1b83356868f707bcb769996f21adc6816509","source":{"kind":"arxiv","id":"1807.11698","version":1},"attestation_state":"computed","paper":{"title":"Rank and Rate: Multi-task Learning for Recommender Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.IR","authors_text":"Guy Hadash, Oren Sar Shalom, Rita Osadchy","submitted_at":"2018-07-31T08:16:08Z","abstract_excerpt":"The two main tasks in the Recommender Systems domain are the ranking and rating prediction tasks. The rating prediction task aims at predicting to what extent a user would like any given item, which would enable to recommend the items with the highest predicted scores. The ranking task on the other hand directly aims at recommending the most valuable items for the user. Several previous approaches proposed learning user and item representations to optimize both tasks simultaneously in a multi-task framework. In this work we propose a novel multi-task framework that exploits the fact that a use"},"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":"1807.11698","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2018-07-31T08:16:08Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"c4286edaf1760b801bdd8aed0a0c28295adc935a7522e9ec9b001894dc80e717","abstract_canon_sha256":"a554aca2a95443a4670547500c160acfacf63601c34d66d049b9ecce2881395b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:08:53.595125Z","signature_b64":"QQZZN/zkITQPkN6L5dP/5YN0pbLBE0EQoDrbjLL9OxKHVMjVbv4ql3WeRgXhMT90BteZYrQv4RDCSxvqpaVwBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1753ff1e42bf4e7a9c391b38ceba1b83356868f707bcb769996f21adc6816509","last_reissued_at":"2026-05-18T00:08:53.594506Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:08:53.594506Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Rank and Rate: Multi-task Learning for Recommender Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.IR","authors_text":"Guy Hadash, Oren Sar Shalom, Rita Osadchy","submitted_at":"2018-07-31T08:16:08Z","abstract_excerpt":"The two main tasks in the Recommender Systems domain are the ranking and rating prediction tasks. The rating prediction task aims at predicting to what extent a user would like any given item, which would enable to recommend the items with the highest predicted scores. The ranking task on the other hand directly aims at recommending the most valuable items for the user. Several previous approaches proposed learning user and item representations to optimize both tasks simultaneously in a multi-task framework. In this work we propose a novel multi-task framework that exploits the fact that a use"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.11698","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":"1807.11698","created_at":"2026-05-18T00:08:53.594600+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.11698v1","created_at":"2026-05-18T00:08:53.594600+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.11698","created_at":"2026-05-18T00:08:53.594600+00:00"},{"alias_kind":"pith_short_12","alias_value":"C5J76HSCX5HH","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_16","alias_value":"C5J76HSCX5HHVHBZ","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_8","alias_value":"C5J76HSC","created_at":"2026-05-18T12:32:16.446611+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/C5J76HSCX5HHVHBZDM4M5OQ3QM","json":"https://pith.science/pith/C5J76HSCX5HHVHBZDM4M5OQ3QM.json","graph_json":"https://pith.science/api/pith-number/C5J76HSCX5HHVHBZDM4M5OQ3QM/graph.json","events_json":"https://pith.science/api/pith-number/C5J76HSCX5HHVHBZDM4M5OQ3QM/events.json","paper":"https://pith.science/paper/C5J76HSC"},"agent_actions":{"view_html":"https://pith.science/pith/C5J76HSCX5HHVHBZDM4M5OQ3QM","download_json":"https://pith.science/pith/C5J76HSCX5HHVHBZDM4M5OQ3QM.json","view_paper":"https://pith.science/paper/C5J76HSC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.11698&json=true","fetch_graph":"https://pith.science/api/pith-number/C5J76HSCX5HHVHBZDM4M5OQ3QM/graph.json","fetch_events":"https://pith.science/api/pith-number/C5J76HSCX5HHVHBZDM4M5OQ3QM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C5J76HSCX5HHVHBZDM4M5OQ3QM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C5J76HSCX5HHVHBZDM4M5OQ3QM/action/storage_attestation","attest_author":"https://pith.science/pith/C5J76HSCX5HHVHBZDM4M5OQ3QM/action/author_attestation","sign_citation":"https://pith.science/pith/C5J76HSCX5HHVHBZDM4M5OQ3QM/action/citation_signature","submit_replication":"https://pith.science/pith/C5J76HSCX5HHVHBZDM4M5OQ3QM/action/replication_record"}},"created_at":"2026-05-18T00:08:53.594600+00:00","updated_at":"2026-05-18T00:08:53.594600+00:00"}