{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:M3UU57TTMNVXWPN6RINDRU54VG","short_pith_number":"pith:M3UU57TT","schema_version":"1.0","canonical_sha256":"66e94efe73636b7b3dbe8a1a38d3bca990a52cf9f8edc2746a6cb91566cd8ccc","source":{"kind":"arxiv","id":"2403.20107","version":1},"attestation_state":"computed","paper":{"title":"Robust Federated Contrastive Recommender System against Model Poisoning Attack","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Chaoqun Yang, Guanhua Ye, Hongzhi Yin, Liang Qu, Quoc Viet Hung Nguyen, Wei Yuan","submitted_at":"2024-03-29T10:40:45Z","abstract_excerpt":"Federated Recommender Systems (FedRecs) have garnered increasing attention recently, thanks to their privacy-preserving benefits. However, the decentralized and open characteristics of current FedRecs present two dilemmas. First, the performance of FedRecs is compromised due to highly sparse on-device data for each client. Second, the system's robustness is undermined by the vulnerability to model poisoning attacks launched by malicious users. In this paper, we introduce a novel contrastive learning framework designed to fully leverage the client's sparse data through embedding augmentation, r"},"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":"2403.20107","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.IR","submitted_at":"2024-03-29T10:40:45Z","cross_cats_sorted":[],"title_canon_sha256":"cccf98e5f7f8a57f01175a6b8c240bad3d4a188d5385638ecac4061a7665285c","abstract_canon_sha256":"fda93e603aef063bbaa68df7de574d065f6b38bc91780ae5f02b9fb66cf685ba"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:02:13.735213Z","signature_b64":"GTt+2E+DGKBrDSp4TW+Al2q/18a9l+ngoyzWtICOrLOpX79zFh5OE/2KIzSsqhzfGivwYdTT6QS9EXdqxLCZDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"66e94efe73636b7b3dbe8a1a38d3bca990a52cf9f8edc2746a6cb91566cd8ccc","last_reissued_at":"2026-07-05T08:02:13.734714Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:02:13.734714Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Robust Federated Contrastive Recommender System against Model Poisoning Attack","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Chaoqun Yang, Guanhua Ye, Hongzhi Yin, Liang Qu, Quoc Viet Hung Nguyen, Wei Yuan","submitted_at":"2024-03-29T10:40:45Z","abstract_excerpt":"Federated Recommender Systems (FedRecs) have garnered increasing attention recently, thanks to their privacy-preserving benefits. However, the decentralized and open characteristics of current FedRecs present two dilemmas. First, the performance of FedRecs is compromised due to highly sparse on-device data for each client. Second, the system's robustness is undermined by the vulnerability to model poisoning attacks launched by malicious users. In this paper, we introduce a novel contrastive learning framework designed to fully leverage the client's sparse data through embedding augmentation, r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.20107","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2403.20107/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":"2403.20107","created_at":"2026-07-05T08:02:13.734778+00:00"},{"alias_kind":"arxiv_version","alias_value":"2403.20107v1","created_at":"2026-07-05T08:02:13.734778+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.20107","created_at":"2026-07-05T08:02:13.734778+00:00"},{"alias_kind":"pith_short_12","alias_value":"M3UU57TTMNVX","created_at":"2026-07-05T08:02:13.734778+00:00"},{"alias_kind":"pith_short_16","alias_value":"M3UU57TTMNVXWPN6","created_at":"2026-07-05T08:02:13.734778+00:00"},{"alias_kind":"pith_short_8","alias_value":"M3UU57TT","created_at":"2026-07-05T08:02:13.734778+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2508.10401","citing_title":"Proxy Model-Guided Reinforcement Learning for Client Selection in Federated Recommendation","ref_index":39,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/M3UU57TTMNVXWPN6RINDRU54VG","json":"https://pith.science/pith/M3UU57TTMNVXWPN6RINDRU54VG.json","graph_json":"https://pith.science/api/pith-number/M3UU57TTMNVXWPN6RINDRU54VG/graph.json","events_json":"https://pith.science/api/pith-number/M3UU57TTMNVXWPN6RINDRU54VG/events.json","paper":"https://pith.science/paper/M3UU57TT"},"agent_actions":{"view_html":"https://pith.science/pith/M3UU57TTMNVXWPN6RINDRU54VG","download_json":"https://pith.science/pith/M3UU57TTMNVXWPN6RINDRU54VG.json","view_paper":"https://pith.science/paper/M3UU57TT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2403.20107&json=true","fetch_graph":"https://pith.science/api/pith-number/M3UU57TTMNVXWPN6RINDRU54VG/graph.json","fetch_events":"https://pith.science/api/pith-number/M3UU57TTMNVXWPN6RINDRU54VG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M3UU57TTMNVXWPN6RINDRU54VG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M3UU57TTMNVXWPN6RINDRU54VG/action/storage_attestation","attest_author":"https://pith.science/pith/M3UU57TTMNVXWPN6RINDRU54VG/action/author_attestation","sign_citation":"https://pith.science/pith/M3UU57TTMNVXWPN6RINDRU54VG/action/citation_signature","submit_replication":"https://pith.science/pith/M3UU57TTMNVXWPN6RINDRU54VG/action/replication_record"}},"created_at":"2026-07-05T08:02:13.734778+00:00","updated_at":"2026-07-05T08:02:13.734778+00:00"}