{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:ZXHSX3TQPFWHKJTINKWACCR6WH","short_pith_number":"pith:ZXHSX3TQ","schema_version":"1.0","canonical_sha256":"cdcf2bee70796c7526686aac010a3eb1cb25be75478421cfa6be345b869bdb1b","source":{"kind":"arxiv","id":"2403.02692","version":1},"attestation_state":"computed","paper":{"title":"Uplift Modeling for Target User Attacks on Recommender Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Changsheng Wang, Daizong Ding, Fuli Feng, Tat-Seng Chua, Wenjie Wang, Wentao Shi","submitted_at":"2024-03-05T06:23:00Z","abstract_excerpt":"Recommender systems are vulnerable to injective attacks, which inject limited fake users into the platforms to manipulate the exposure of target items to all users. In this work, we identify that conventional injective attackers overlook the fact that each item has its unique potential audience, and meanwhile, the attack difficulty across different users varies. Blindly attacking all users will result in a waste of fake user budgets and inferior attack performance. To address these issues, we focus on an under-explored attack task called target user attacks, aiming at promoting target items to"},"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.02692","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2024-03-05T06:23:00Z","cross_cats_sorted":[],"title_canon_sha256":"932d34d96493929e01733bd6ae365b52f37c32ca57a795c309c74adb53b3be0f","abstract_canon_sha256":"940ac425449f8af36d1373d501393312e6abd50d87a29183fbea0b63ad064757"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:52:21.011108Z","signature_b64":"wemnodWE9NoGiSrgZTERD4s5mVh0zyh8BCbndXzk7vBjoCsNpXqeex1M5GTxtADXDEpsyfeGDf0S7juLT2FQCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cdcf2bee70796c7526686aac010a3eb1cb25be75478421cfa6be345b869bdb1b","last_reissued_at":"2026-07-05T07:52:21.010662Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:52:21.010662Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Uplift Modeling for Target User Attacks on Recommender Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Changsheng Wang, Daizong Ding, Fuli Feng, Tat-Seng Chua, Wenjie Wang, Wentao Shi","submitted_at":"2024-03-05T06:23:00Z","abstract_excerpt":"Recommender systems are vulnerable to injective attacks, which inject limited fake users into the platforms to manipulate the exposure of target items to all users. In this work, we identify that conventional injective attackers overlook the fact that each item has its unique potential audience, and meanwhile, the attack difficulty across different users varies. Blindly attacking all users will result in a waste of fake user budgets and inferior attack performance. To address these issues, we focus on an under-explored attack task called target user attacks, aiming at promoting target items to"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.02692","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.02692/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.02692","created_at":"2026-07-05T07:52:21.010717+00:00"},{"alias_kind":"arxiv_version","alias_value":"2403.02692v1","created_at":"2026-07-05T07:52:21.010717+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.02692","created_at":"2026-07-05T07:52:21.010717+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZXHSX3TQPFWH","created_at":"2026-07-05T07:52:21.010717+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZXHSX3TQPFWHKJTI","created_at":"2026-07-05T07:52:21.010717+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZXHSX3TQ","created_at":"2026-07-05T07:52:21.010717+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.07436","citing_title":"When Graph Contrastive Learning Backfires: Spectral Vulnerability and Defense in Recommendation","ref_index":34,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZXHSX3TQPFWHKJTINKWACCR6WH","json":"https://pith.science/pith/ZXHSX3TQPFWHKJTINKWACCR6WH.json","graph_json":"https://pith.science/api/pith-number/ZXHSX3TQPFWHKJTINKWACCR6WH/graph.json","events_json":"https://pith.science/api/pith-number/ZXHSX3TQPFWHKJTINKWACCR6WH/events.json","paper":"https://pith.science/paper/ZXHSX3TQ"},"agent_actions":{"view_html":"https://pith.science/pith/ZXHSX3TQPFWHKJTINKWACCR6WH","download_json":"https://pith.science/pith/ZXHSX3TQPFWHKJTINKWACCR6WH.json","view_paper":"https://pith.science/paper/ZXHSX3TQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2403.02692&json=true","fetch_graph":"https://pith.science/api/pith-number/ZXHSX3TQPFWHKJTINKWACCR6WH/graph.json","fetch_events":"https://pith.science/api/pith-number/ZXHSX3TQPFWHKJTINKWACCR6WH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZXHSX3TQPFWHKJTINKWACCR6WH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZXHSX3TQPFWHKJTINKWACCR6WH/action/storage_attestation","attest_author":"https://pith.science/pith/ZXHSX3TQPFWHKJTINKWACCR6WH/action/author_attestation","sign_citation":"https://pith.science/pith/ZXHSX3TQPFWHKJTINKWACCR6WH/action/citation_signature","submit_replication":"https://pith.science/pith/ZXHSX3TQPFWHKJTINKWACCR6WH/action/replication_record"}},"created_at":"2026-07-05T07:52:21.010717+00:00","updated_at":"2026-07-05T07:52:21.010717+00:00"}