{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:GB5JGDQIFEEVZVCLS67WMODX63","short_pith_number":"pith:GB5JGDQI","schema_version":"1.0","canonical_sha256":"307a930e0829095cd44b97bf663877f6cf56d67c4a29fa619f4cedc9b0c0349a","source":{"kind":"arxiv","id":"1809.08336","version":1},"attestation_state":"computed","paper":{"title":"Adversarial Recommendation: Attack of the Learned Fake Users","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.IR","authors_text":"Arindam Banerjee, Konstantina Christakopoulou","submitted_at":"2018-09-21T23:00:39Z","abstract_excerpt":"Can machine learning models for recommendation be easily fooled? While the question has been answered for hand-engineered fake user profiles, it has not been explored for machine learned adversarial attacks. This paper attempts to close this gap.\n  We propose a framework for generating fake user profiles which, when incorporated in the training of a recommendation system, can achieve an adversarial intent, while remaining indistinguishable from real user profiles. We formulate this procedure as a repeated general-sum game between two players: an oblivious recommendation system $R$ and an adver"},"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":"1809.08336","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2018-09-21T23:00:39Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"24986a0f43665eb316c4543a6a48251c6e4f0d0a3b7367fe612513447aa84f0a","abstract_canon_sha256":"c85a537db99b78662f4f14e85ea3fd67e835c283ce9f5bb4ae30dfa49e5deb0b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:04.315325Z","signature_b64":"dWUYnFnZVMjOFGH6uqKEGkwDGFfBWr+OkJD6N5HdTNwVLcQhCQQhOtSVeTxiyiNI2tThnHb/iyWf/u7PsJ2YBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"307a930e0829095cd44b97bf663877f6cf56d67c4a29fa619f4cedc9b0c0349a","last_reissued_at":"2026-05-18T00:05:04.314779Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:04.314779Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Adversarial Recommendation: Attack of the Learned Fake Users","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.IR","authors_text":"Arindam Banerjee, Konstantina Christakopoulou","submitted_at":"2018-09-21T23:00:39Z","abstract_excerpt":"Can machine learning models for recommendation be easily fooled? While the question has been answered for hand-engineered fake user profiles, it has not been explored for machine learned adversarial attacks. This paper attempts to close this gap.\n  We propose a framework for generating fake user profiles which, when incorporated in the training of a recommendation system, can achieve an adversarial intent, while remaining indistinguishable from real user profiles. We formulate this procedure as a repeated general-sum game between two players: an oblivious recommendation system $R$ and an adver"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.08336","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":"1809.08336","created_at":"2026-05-18T00:05:04.314852+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.08336v1","created_at":"2026-05-18T00:05:04.314852+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.08336","created_at":"2026-05-18T00:05:04.314852+00:00"},{"alias_kind":"pith_short_12","alias_value":"GB5JGDQIFEEV","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_16","alias_value":"GB5JGDQIFEEVZVCL","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_8","alias_value":"GB5JGDQI","created_at":"2026-05-18T12:32:25.280505+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/GB5JGDQIFEEVZVCLS67WMODX63","json":"https://pith.science/pith/GB5JGDQIFEEVZVCLS67WMODX63.json","graph_json":"https://pith.science/api/pith-number/GB5JGDQIFEEVZVCLS67WMODX63/graph.json","events_json":"https://pith.science/api/pith-number/GB5JGDQIFEEVZVCLS67WMODX63/events.json","paper":"https://pith.science/paper/GB5JGDQI"},"agent_actions":{"view_html":"https://pith.science/pith/GB5JGDQIFEEVZVCLS67WMODX63","download_json":"https://pith.science/pith/GB5JGDQIFEEVZVCLS67WMODX63.json","view_paper":"https://pith.science/paper/GB5JGDQI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.08336&json=true","fetch_graph":"https://pith.science/api/pith-number/GB5JGDQIFEEVZVCLS67WMODX63/graph.json","fetch_events":"https://pith.science/api/pith-number/GB5JGDQIFEEVZVCLS67WMODX63/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GB5JGDQIFEEVZVCLS67WMODX63/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GB5JGDQIFEEVZVCLS67WMODX63/action/storage_attestation","attest_author":"https://pith.science/pith/GB5JGDQIFEEVZVCLS67WMODX63/action/author_attestation","sign_citation":"https://pith.science/pith/GB5JGDQIFEEVZVCLS67WMODX63/action/citation_signature","submit_replication":"https://pith.science/pith/GB5JGDQIFEEVZVCLS67WMODX63/action/replication_record"}},"created_at":"2026-05-18T00:05:04.314852+00:00","updated_at":"2026-05-18T00:05:04.314852+00:00"}