{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:GB5JGDQIFEEVZVCLS67WMODX63","short_pith_number":"pith:GB5JGDQI","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"},"canonical_sha256":"307a930e0829095cd44b97bf663877f6cf56d67c4a29fa619f4cedc9b0c0349a","source":{"kind":"arxiv","id":"1809.08336","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.08336","created_at":"2026-05-18T00:05:04Z"},{"alias_kind":"arxiv_version","alias_value":"1809.08336v1","created_at":"2026-05-18T00:05:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.08336","created_at":"2026-05-18T00:05:04Z"},{"alias_kind":"pith_short_12","alias_value":"GB5JGDQIFEEV","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"GB5JGDQIFEEVZVCL","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"GB5JGDQI","created_at":"2026-05-18T12:32:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:GB5JGDQIFEEVZVCLS67WMODX63","target":"record","payload":{"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"},"canonical_sha256":"307a930e0829095cd44b97bf663877f6cf56d67c4a29fa619f4cedc9b0c0349a","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"},"source_kind":"arxiv","source_id":"1809.08336","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:05:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"91lLKfBM51tURlEWKL8096ujl/8/sSgz8l51FxzW0qc1xR6hZIw/Ga9nozJj4Kirv97b7LUySyVI7DegKzAlAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T13:59:24.434295Z"},"content_sha256":"e4b1ae4ba625549bd750477113efce2ecaaea3887e03747d765f72b70d794ff4","schema_version":"1.0","event_id":"sha256:e4b1ae4ba625549bd750477113efce2ecaaea3887e03747d765f72b70d794ff4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:GB5JGDQIFEEVZVCLS67WMODX63","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:05:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cHRjZokNComwKMCN8ywUcHMXyM96r64KKkfu5wHvbowWmfORiQwK0J8Au3PHAwu7pDkM17m5Fhpbdsfv1HOtDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T13:59:24.434648Z"},"content_sha256":"32d5973f2e412c0cd96a6496856ca02a78c36b049504fc291b2501ef49389f74","schema_version":"1.0","event_id":"sha256:32d5973f2e412c0cd96a6496856ca02a78c36b049504fc291b2501ef49389f74"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GB5JGDQIFEEVZVCLS67WMODX63/bundle.json","state_url":"https://pith.science/pith/GB5JGDQIFEEVZVCLS67WMODX63/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GB5JGDQIFEEVZVCLS67WMODX63/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-04T13:59:24Z","links":{"resolver":"https://pith.science/pith/GB5JGDQIFEEVZVCLS67WMODX63","bundle":"https://pith.science/pith/GB5JGDQIFEEVZVCLS67WMODX63/bundle.json","state":"https://pith.science/pith/GB5JGDQIFEEVZVCLS67WMODX63/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GB5JGDQIFEEVZVCLS67WMODX63/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:GB5JGDQIFEEVZVCLS67WMODX63","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"c85a537db99b78662f4f14e85ea3fd67e835c283ce9f5bb4ae30dfa49e5deb0b","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2018-09-21T23:00:39Z","title_canon_sha256":"24986a0f43665eb316c4543a6a48251c6e4f0d0a3b7367fe612513447aa84f0a"},"schema_version":"1.0","source":{"id":"1809.08336","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.08336","created_at":"2026-05-18T00:05:04Z"},{"alias_kind":"arxiv_version","alias_value":"1809.08336v1","created_at":"2026-05-18T00:05:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.08336","created_at":"2026-05-18T00:05:04Z"},{"alias_kind":"pith_short_12","alias_value":"GB5JGDQIFEEV","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"GB5JGDQIFEEVZVCL","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"GB5JGDQI","created_at":"2026-05-18T12:32:25Z"}],"graph_snapshots":[{"event_id":"sha256:32d5973f2e412c0cd96a6496856ca02a78c36b049504fc291b2501ef49389f74","target":"graph","created_at":"2026-05-18T00:05:04Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Arindam Banerjee, Konstantina Christakopoulou","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2018-09-21T23:00:39Z","title":"Adversarial Recommendation: Attack of the Learned Fake Users"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.08336","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:e4b1ae4ba625549bd750477113efce2ecaaea3887e03747d765f72b70d794ff4","target":"record","created_at":"2026-05-18T00:05:04Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"c85a537db99b78662f4f14e85ea3fd67e835c283ce9f5bb4ae30dfa49e5deb0b","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2018-09-21T23:00:39Z","title_canon_sha256":"24986a0f43665eb316c4543a6a48251c6e4f0d0a3b7367fe612513447aa84f0a"},"schema_version":"1.0","source":{"id":"1809.08336","kind":"arxiv","version":1}},"canonical_sha256":"307a930e0829095cd44b97bf663877f6cf56d67c4a29fa619f4cedc9b0c0349a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"307a930e0829095cd44b97bf663877f6cf56d67c4a29fa619f4cedc9b0c0349a","first_computed_at":"2026-05-18T00:05:04.314779Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:05:04.314779Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dWUYnFnZVMjOFGH6uqKEGkwDGFfBWr+OkJD6N5HdTNwVLcQhCQQhOtSVeTxiyiNI2tThnHb/iyWf/u7PsJ2YBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:05:04.315325Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.08336","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e4b1ae4ba625549bd750477113efce2ecaaea3887e03747d765f72b70d794ff4","sha256:32d5973f2e412c0cd96a6496856ca02a78c36b049504fc291b2501ef49389f74"],"state_sha256":"83d8dda2d622dbad23dc6716a89766a6e89285f71999437812eb4662c1b8e0f0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VRkkpGuP+vn18OlxJwnSKwBHVRNJSMz+NtWESkjnNXBMAxoWC5V5/4++Lww2X30JgGn7Y8QmiCO6u5w6ofR7Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-04T13:59:24.436498Z","bundle_sha256":"3be94e7e87cd6efeaf6d47cd24263a8fedb47e502702fd069ad9c9f4129a5060"}}