{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:JVPO35TDT4USHRB66ZKWV37KJF","short_pith_number":"pith:JVPO35TD","schema_version":"1.0","canonical_sha256":"4d5eedf6639f2923c43ef6556aefea495ef3dfb6f7983c242c6761fe8ef6dbf4","source":{"kind":"arxiv","id":"2001.00846","version":3},"attestation_state":"computed","paper":{"title":"Multi-Gradient Descent for Multi-Objective Recommender Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG","stat.ML"],"primary_cat":"cs.IR","authors_text":"Boi Faltings, Claudiu Musat, Diego Antognini, Giancarlo Bergamin, Nikola Milojkovic","submitted_at":"2019-12-09T19:56:08Z","abstract_excerpt":"Recommender systems need to mirror the complexity of the environment they are applied in. The more we know about what might benefit the user, the more objectives the recommender system has. In addition there may be multiple stakeholders - sellers, buyers, shareholders - in addition to legal and ethical constraints. Simultaneously optimizing for a multitude of objectives, correlated and not correlated, having the same scale or not, has proven difficult so far.\n  We introduce a stochastic multi-gradient descent approach to recommender systems (MGDRec) to solve this problem. We show that this exc"},"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":"2001.00846","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2019-12-09T19:56:08Z","cross_cats_sorted":["cs.AI","cs.LG","stat.ML"],"title_canon_sha256":"c5fa281c2491ad8345d0ec23b863204eba5d4062e375972add891bf893781d75","abstract_canon_sha256":"e4a08cf5be636625d7d17ca84f7b0e5be6e66974a359afd368a438522a5ed803"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:55:46.862419Z","signature_b64":"d6ea4CbAEiHDS2cpVJVFzZVYp90tQ9OkLlJTMJF1JXcqlLVS5o4715bernuq7KccaBNY5dGtkz39xjWdn0h8CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4d5eedf6639f2923c43ef6556aefea495ef3dfb6f7983c242c6761fe8ef6dbf4","last_reissued_at":"2026-07-05T00:55:46.861965Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:55:46.861965Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multi-Gradient Descent for Multi-Objective Recommender Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG","stat.ML"],"primary_cat":"cs.IR","authors_text":"Boi Faltings, Claudiu Musat, Diego Antognini, Giancarlo Bergamin, Nikola Milojkovic","submitted_at":"2019-12-09T19:56:08Z","abstract_excerpt":"Recommender systems need to mirror the complexity of the environment they are applied in. The more we know about what might benefit the user, the more objectives the recommender system has. In addition there may be multiple stakeholders - sellers, buyers, shareholders - in addition to legal and ethical constraints. Simultaneously optimizing for a multitude of objectives, correlated and not correlated, having the same scale or not, has proven difficult so far.\n  We introduce a stochastic multi-gradient descent approach to recommender systems (MGDRec) to solve this problem. We show that this exc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2001.00846","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2001.00846/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2001.00846","created_at":"2026-07-05T00:55:46.862024+00:00"},{"alias_kind":"arxiv_version","alias_value":"2001.00846v3","created_at":"2026-07-05T00:55:46.862024+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2001.00846","created_at":"2026-07-05T00:55:46.862024+00:00"},{"alias_kind":"pith_short_12","alias_value":"JVPO35TDT4US","created_at":"2026-07-05T00:55:46.862024+00:00"},{"alias_kind":"pith_short_16","alias_value":"JVPO35TDT4USHRB6","created_at":"2026-07-05T00:55:46.862024+00:00"},{"alias_kind":"pith_short_8","alias_value":"JVPO35TD","created_at":"2026-07-05T00:55:46.862024+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/JVPO35TDT4USHRB66ZKWV37KJF","json":"https://pith.science/pith/JVPO35TDT4USHRB66ZKWV37KJF.json","graph_json":"https://pith.science/api/pith-number/JVPO35TDT4USHRB66ZKWV37KJF/graph.json","events_json":"https://pith.science/api/pith-number/JVPO35TDT4USHRB66ZKWV37KJF/events.json","paper":"https://pith.science/paper/JVPO35TD"},"agent_actions":{"view_html":"https://pith.science/pith/JVPO35TDT4USHRB66ZKWV37KJF","download_json":"https://pith.science/pith/JVPO35TDT4USHRB66ZKWV37KJF.json","view_paper":"https://pith.science/paper/JVPO35TD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2001.00846&json=true","fetch_graph":"https://pith.science/api/pith-number/JVPO35TDT4USHRB66ZKWV37KJF/graph.json","fetch_events":"https://pith.science/api/pith-number/JVPO35TDT4USHRB66ZKWV37KJF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JVPO35TDT4USHRB66ZKWV37KJF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JVPO35TDT4USHRB66ZKWV37KJF/action/storage_attestation","attest_author":"https://pith.science/pith/JVPO35TDT4USHRB66ZKWV37KJF/action/author_attestation","sign_citation":"https://pith.science/pith/JVPO35TDT4USHRB66ZKWV37KJF/action/citation_signature","submit_replication":"https://pith.science/pith/JVPO35TDT4USHRB66ZKWV37KJF/action/replication_record"}},"created_at":"2026-07-05T00:55:46.862024+00:00","updated_at":"2026-07-05T00:55:46.862024+00:00"}