{"as_of":"2026-08-19T07:11:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c614d40b32f33c8db806ec860145f2569d60ba206da8c4d320a197f423cf2436","coverage":[{"denominator":107,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":100,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-02T09:27:47.554185Z","state":"measured"},{"denominator":100,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":100,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-19T06:32:44.657259+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2607.22665/citation-record","integrity":"/paper/2607.22665/integrity","json":"/paper/2607.22665/citation-record.json","paper":"/paper/2607.22665"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:27:47.013550Z","title":"Matrix factorization model in collaborative filtering algorithms: A survey","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.22665","last_updated":"2026-06-30T05:52:32Z","snapshot_observed_at":"2026-08-17T15:18:30.906141Z","submitted_at":"2026-06-30T05:52:32Z","title":"Obliviate: Efficient Unlearning in Recommender Systems","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-02T09:27:47.013550Z"},"links":{"citing_paper":"/paper/2607.22665"},"observation_digest":"sha256:026fa628e60f2aee82f68ca7ea3462a4aa8c1e5ed08bd142b06578a4e7e2128c","observation_id":"291fdd4d-451f-4534-93c8-e10ee11312c2","resolution":{"observed_at":"2026-08-02T09:27:47.013550Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:27:47.135637Z","title":null,"venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2607.22665","last_updated":"2026-06-30T05:52:32Z","snapshot_observed_at":"2026-08-17T15:18:30.906141Z","submitted_at":"2026-06-30T05:52:32Z","title":"Obliviate: Efficient Unlearning in Recommender Systems","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-02T09:27:47.135637Z"},"links":{"citing_paper":"/paper/2607.22665"},"observation_digest":"sha256:04bbd8a68be2826ec7071f619ffc6be46b6b7b63e64ec7076dc3be0285f34327","observation_id":"3375bc7c-dcd0-4cfa-98f8-a628d0286ca7","resolution":{"observed_at":"2026-08-02T09:27:47.135637Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:27:47.237809Z","title":"A., Jia, H., Travers, A., Zhang, B., Lie, D., and Papernot, N","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.22665","last_updated":"2026-06-30T05:52:32Z","snapshot_observed_at":"2026-08-17T15:18:30.906141Z","submitted_at":"2026-06-30T05:52:32Z","title":"Obliviate: Efficient Unlearning in Recommender Systems","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-02T09:27:47.237809Z"},"links":{"citing_paper":"/paper/2607.22665"},"observation_digest":"sha256:7969371fcd99be3d9d0c470493d106ff2f2af05288bbcb177f035ba339050c7e","observation_id":"6f325b2f-1a6e-40a7-870b-ece46de56e2d","resolution":{"observed_at":"2026-08-02T09:27:47.237809Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:27:47.256193Z","title":"Recommendation unlearning","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.22665","last_updated":"2026-06-30T05:52:32Z","snapshot_observed_at":"2026-08-17T15:18:30.906141Z","submitted_at":"2026-06-30T05:52:32Z","title":"Obliviate: Efficient Unlearning in Recommender Systems","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-02T09:27:47.256193Z"},"links":{"citing_paper":"/paper/2607.22665"},"observation_digest":"sha256:42779cf594b98e1e31a1cdecf6ee0f307dd5f61b98036351882ce6697afb4a7b","observation_id":"46f6e128-5eef-4110-b2ab-05f75ebd9dd2","resolution":{"observed_at":"2026-08-02T09:27:47.256193Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:27:47.259614Z","title":"Cure4rec: A benchmark for recommendation unlearning with deeper influence","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.22665","last_updated":"2026-06-30T05:52:32Z","snapshot_observed_at":"2026-08-17T15:18:30.906141Z","submitted_at":"2026-06-30T05:52:32Z","title":"Obliviate: Efficient Unlearning in Recommender Systems","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-02T09:27:47.259614Z"},"links":{"citing_paper":"/paper/2607.22665"},"observation_digest":"sha256:15c5757ded00006332a20c447f2f4f3d150ef91170313460adb4d6f2a4f1ac05","observation_id":"926ee247-87e1-4aea-9e65-504d5da26b2b","resolution":{"observed_at":"2026-08-02T09:27:47.259614Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:27:47.263500Z","title":"Wide & deep learning for recommender systems","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.22665","last_updated":"2026-06-30T05:52:32Z","snapshot_observed_at":"2026-08-17T15:18:30.906141Z","submitted_at":"2026-06-30T05:52:32Z","title":"Obliviate: Efficient Unlearning in Recommender Systems","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-02T09:27:47.263500Z"},"links":{"citing_paper":"/paper/2607.22665"},"observation_digest":"sha256:092581506b829e7823e609fa2b547c9130d865e8559b1abe1d90462032b06eb8","observation_id":"b633c87c-b43b-4970-b0cd-3b3f15c54801","resolution":{"observed_at":"2026-08-02T09:27:47.263500Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:27:47.266730Z","title":"Deep neural networks for youtube recommendations","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.22665","last_updated":"2026-06-30T05:52:32Z","snapshot_observed_at":"2026-08-17T15:18:30.906141Z","submitted_at":"2026-06-30T05:52:32Z","title":"Obliviate: Efficient Unlearning in Recommender Systems","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-02T09:27:47.266730Z"},"links":{"citing_paper":"/paper/2607.22665"},"observation_digest":"sha256:8c9e13522257c9be98a99c619a5e5b6d30fd204e5a069b57fc0ee13e23f92186","observation_id":"e7582a24-fe89-4e7b-a4f9-26236529501c","resolution":{"observed_at":"2026-08-02T09:27:47.266730Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:27:47.269942Z","title":"Efficient and adaptive recommendation unlearning: A guided filtering framework to erase outdated preferences","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.22665","last_updated":"2026-06-30T05:52:32Z","snapshot_observed_at":"2026-08-17T15:18:30.906141Z","submitted_at":"2026-06-30T05:52:32Z","title":"Obliviate: Efficient Unlearning in Recommender Systems","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-02T09:27:47.269942Z"},"links":{"citing_paper":"/paper/2607.22665"},"observation_digest":"sha256:e236e2cb4b0a6b167f9372d0aa1193d8a5e7c2fb754632b16470ea03ddfd4d7c","observation_id":"40bd5436-ea58-429c-95b5-67f2f6a2b95a","resolution":{"observed_at":"2026-08-02T09:27:47.269942Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:27:47.273278Z","title":"Enhancing privacy in recommender systems through differential privacy techniques","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.22665","last_updated":"2026-06-30T05:52:32Z","snapshot_observed_at":"2026-08-17T15:18:30.906141Z","submitted_at":"2026-06-30T05:52:32Z","title":"Obliviate: Efficient Unlearning in Recommender Systems","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-02T09:27:47.273278Z"},"links":{"citing_paper":"/paper/2607.22665"},"observation_digest":"sha256:d6e810767ee6f92bc4c0d50df3d73cbdbdb5a7d8b1ac18d94e7728b8413dccb3","observation_id":"0fe3022b-4117-4a5d-b314-0154f1797138","resolution":{"observed_at":"2026-08-02T09:27:47.273278Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:27:47.276610Z","title":"Measuring interaction-level unlearning difficulty for collaborative filtering","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.22665","last_updated":"2026-06-30T05:52:32Z","snapshot_observed_at":"2026-08-17T15:18:30.906141Z","submitted_at":"2026-06-30T05:52:32Z","title":"Obliviate: Efficient Unlearning in Recommender Systems","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-02T09:27:47.276610Z"},"links":{"citing_paper":"/paper/2607.22665"},"observation_digest":"sha256:55c78f0b15dff77c2f89cdec1b5d0c9f6247c28253e234b5786fa03adf4a7f34","observation_id":"bcad8ace-f63f-4d9b-aab7-736abc1111d4","resolution":{"observed_at":"2026-08-02T09:27:47.276610Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:27:47.279870Z","title":"Generalized low-rank update: Model parameter bounds for low-rank training data modifications","venue":null,"work_id":null,"year":1970},"citing_paper":{"arxiv_id":"2607.22665","last_updated":"2026-06-30T05:52:32Z","snapshot_observed_at":"2026-08-17T15:18:30.906141Z","submitted_at":"2026-06-30T05:52:32Z","title":"Obliviate: Efficient Unlearning in Recommender Systems","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-02T09:27:47.279870Z"},"links":{"citing_paper":"/paper/2607.22665"},"observation_digest":"sha256:fd8a36d73d5e817c5daec360c85528674ca71aba650b6db0f3503e3728abf9e0","observation_id":"dabc0bba-fd88-4f8d-8da4-c394af6c754c","resolution":{"observed_at":"2026-08-02T09:27:47.279870Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:27:47.282789Z","title":null,"venue":null,"work_id":null,"year":1987},"citing_paper":{"arxiv_id":"2607.22665","last_updated":"2026-06-30T05:52:32Z","snapshot_observed_at":"2026-08-17T15:18:30.906141Z","submitted_at":"2026-06-30T05:52:32Z","title":"Obliviate: Efficient Unlearning in Recommender Systems","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-02T09:27:47.282789Z"},"links":{"citing_paper":"/paper/2607.22665"},"observation_digest":"sha256:d2f1ed35e694c0ea34997efe6dc6538671544fb83f4991261d4e03fffa66354e","observation_id":"b0a40655-192f-4867-9936-dce24adc062c","resolution":{"observed_at":"2026-08-02T09:27:47.282789Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:27:47.285574Z","title":"Neural collaborative filtering","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.22665","last_updated":"2026-06-30T05:52:32Z","snapshot_observed_at":"2026-08-17T15:18:30.906141Z","submitted_at":"2026-06-30T05:52:32Z","title":"Obliviate: Efficient Unlearning in Recommender Systems","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-02T09:27:47.285574Z"},"links":{"citing_paper":"/paper/2607.22665"},"observation_digest":"sha256:01132ef71b0ee64345c0121e7f82773db92b86db70498757616f6e9b8d31c951","observation_id":"14d4c988-878e-4da0-934b-d1a3f00d55de","resolution":{"observed_at":"2026-08-02T09:27:47.285574Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:27:47.288554Z","title":"Lightgcn: Simplifying and powering graph convolution network for recommendation","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.22665","last_updated":"2026-06-30T05:52:32Z","snapshot_observed_at":"2026-08-17T15:18:30.906141Z","submitted_at":"2026-06-30T05:52:32Z","title":"Obliviate: Efficient Unlearning in Recommender Systems","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-02T09:27:47.288554Z"},"links":{"citing_paper":"/paper/2607.22665"},"observation_digest":"sha256:5c27c6716360232990dd88b9dfa83cf110c263b3fc15d2547467ed2aa0286d71","observation_id":"f795ec3e-97ca-434e-8507-c4fbdc510eb3","resolution":{"observed_at":"2026-08-02T09:27:47.288554Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:27:47.291600Z","title":"S., Bensaali, F., Amira, A., and Alazab, M","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.22665","last_updated":"2026-06-30T05:52:32Z","snapshot_observed_at":"2026-08-17T15:18:30.906141Z","submitted_at":"2026-06-30T05:52:32Z","title":"Obliviate: Efficient Unlearning in Recommender Systems","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-02T09:27:47.291600Z"},"links":{"citing_paper":"/paper/2607.22665"},"observation_digest":"sha256:05a42cd38e502fe2bc7a13798ddc979503f7a56873008b578530ad08515084a1","observation_id":"8f2ddccc-00bc-45b2-b314-9692268b62da","resolution":{"observed_at":"2026-08-02T09:27:47.291600Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:27:47.294660Z","title":"Lora: Low-rank adaptation of large language models","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.22665","last_updated":"2026-06-30T05:52:32Z","snapshot_observed_at":"2026-08-17T15:18:30.906141Z","submitted_at":"2026-06-30T05:52:32Z","title":"Obliviate: Efficient Unlearning in Recommender Systems","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-02T09:27:47.294660Z"},"links":{"citing_paper":"/paper/2607.22665"},"observation_digest":"sha256:aa53b591babf7cd160e9e9e00830593b8ba4db36b0897bb459e85c21e09b5e53","observation_id":"323d4b26-fbc4-44c0-b568-70b6929ccd23","resolution":{"observed_at":"2026-08-02T09:27:47.294660Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:27:47.297707Z","title":"M., and Jordan, M","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.22665","last_updated":"2026-06-30T05:52:32Z","snapshot_observed_at":"2026-08-17T15:18:30.906141Z","submitted_at":"2026-06-30T05:52:32Z","title":"Obliviate: Efficient Unlearning in Recommender Systems","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-02T09:27:47.297707Z"},"links":{"citing_paper":"/paper/2607.22665"},"observation_digest":"sha256:74a5b1bc6bacea88b96b7135e3cd5cbc48b2f99260a78164f07519e54f0308ad","observation_id":"0fccc00d-db20-438f-a4c1-c47fbca61331","resolution":{"observed_at":"2026-08-02T09:27:47.297707Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:27:47.304096Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.22665","last_updated":"2026-06-30T05:52:32Z","snapshot_observed_at":"2026-08-17T15:18:30.906141Z","submitted_at":"2026-06-30T05:52:32Z","title":"Obliviate: Efficient Unlearning in Recommender Systems","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-02T09:27:47.304096Z"},"links":{"citing_paper":"/paper/2607.22665"},"observation_digest":"sha256:c65a4ca619d9aae0d689dc72fd794d90cce280c03db1bba5aed1a3f9e09fcd99","observation_id":"e548040f-5c56-43a4-bebb-64db880c9818","resolution":{"observed_at":"2026-08-02T09:27:47.304096Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:27:47.307304Z","title":"Ultrare: Enhancing receraser for recommendation unlearning via error decomposition","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.22665","last_updated":"2026-06-30T05:52:32Z","snapshot_observed_at":"2026-08-17T15:18:30.906141Z","submitted_at":"2026-06-30T05:52:32Z","title":"Obliviate: Efficient Unlearning in Recommender Systems","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-02T09:27:47.307304Z"},"links":{"citing_paper":"/paper/2607.22665"},"observation_digest":"sha256:f644912112b53161a6b318d3ce5bcd62010f29a7a7e1adbf4b969251d10bca2f","observation_id":"2df31436-28e7-4c08-acfc-44e91690e7fb","resolution":{"observed_at":"2026-08-02T09:27:47.307304Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2304.10199","last_updated":"2023-04-20T10:35:34Z","snapshot_observed_at":"2026-08-18T02:26:53.180950Z","submitted_at":"2023-04-20T10:35:34Z","title":"Selective and Collaborative Influence Function for Efficient Recommendation Unlearning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2304.10199","snapshot_observed_at":"2026-08-02T09:27:47.310132Z","title":"Selective and collaborative influence function for efficient recommendation unlearning","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.22665","last_updated":"2026-06-30T05:52:32Z","snapshot_observed_at":"2026-08-17T15:18:30.906141Z","submitted_at":"2026-06-30T05:52:32Z","title":"Obliviate: Efficient Unlearning in Recommender Systems","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-02T09:27:47.310132Z"},"links":{"cited_paper":"/paper/2304.10199","citing_paper":"/paper/2607.22665"},"observation_digest":"sha256:461bbb4a5e0534c938d962824dbec80036cb0f5a35381f848435b5b93e5d2744","observation_id":"92ce051f-ed45-440f-8bfe-187e62c29cbe","resolution":{"observed_at":"2026-08-02T09:27:47.310132Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2307.15960","last_updated":"2023-07-29T11:36:38Z","snapshot_observed_at":"2026-08-16T15:12:19.201402Z","submitted_at":"2023-07-29T11:36:38Z","title":"Recommendation Unlearning via Matrix Correction","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2307.15960","snapshot_observed_at":"2026-08-02T09:27:47.313258Z","title":"Recommendation unlearning via matrix correction","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.22665","last_updated":"2026-06-30T05:52:32Z","snapshot_observed_at":"2026-08-17T15:18:30.906141Z","submitted_at":"2026-06-30T05:52:32Z","title":"Obliviate: Efficient Unlearning in Recommender Systems","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-02T09:27:47.313258Z"},"links":{"cited_paper":"/paper/2307.15960","citing_paper":"/paper/2607.22665"},"observation_digest":"sha256:2c5024c152d51ceb1e7918c077c241a91a9a0670d1f5ae681417d898f455777b","observation_id":"04e4158c-1dba-4b16-b7df-d5e51bad2c23","resolution":{"observed_at":"2026-08-02T09:27:47.313258Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:27:47.319896Z","title":"Datasets for large language models: A comprehensive survey","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.22665","last_updated":"2026-06-30T05:52:32Z","snapshot_observed_at":"2026-08-17T15:18:30.906141Z","submitted_at":"2026-06-30T05:52:32Z","title":"Obliviate: Efficient Unlearning in Recommender Systems","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-02T09:27:47.319896Z"},"links":{"citing_paper":"/paper/2607.22665"},"observation_digest":"sha256:bf974bfae4c2e218c6edae61d4c66975242c0e6c10aba3ae81f42d5d78a92d06","observation_id":"a983d9d9-247a-4f10-bb14-2a602767a0f0","resolution":{"observed_at":"2026-08-02T09:27:47.319896Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:27:47.326669Z","title":"The eu proposal for a general data protection regulation and the roots of the ‘right to be forgotten’","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2607.22665","last_updated":"2026-06-30T05:52:32Z","snapshot_observed_at":"2026-08-17T15:18:30.906141Z","submitted_at":"2026-06-30T05:52:32Z","title":"Obliviate: Efficient Unlearning in Recommender Systems","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-02T09:27:47.326669Z"},"links":{"citing_paper":"/paper/2607.22665"},"observation_digest":"sha256:81590a1996d4dc392f669b9246ffb207ed5d7ec24fe464202ee5e0915d1e6b5f","observation_id":"a82a7665-63f3-4e89-8f0f-12254a88df3a","resolution":{"observed_at":"2026-08-02T09:27:47.326669Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:27:47.329641Z","title":"Piecewise strong convexity of neural networks","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.22665","last_updated":"2026-06-30T05:52:32Z","snapshot_observed_at":"2026-08-17T15:18:30.906141Z","submitted_at":"2026-06-30T05:52:32Z","title":"Obliviate: Efficient Unlearning in Recommender Systems","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-02T09:27:47.329641Z"},"links":{"citing_paper":"/paper/2607.22665"},"observation_digest":"sha256:d67b8022d4cd46726a3543a170e32f2220987e5b77991574aecaf5cba45dd7e5","observation_id":"f19d167e-3e44-43aa-8ad0-7ec0c79ad945","resolution":{"observed_at":"2026-08-02T09:27:47.329641Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:27:47.332518Z","title":"and Salakhutdinov, R","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2607.22665","last_updated":"2026-06-30T05:52:32Z","snapshot_observed_at":"2026-08-17T15:18:30.906141Z","submitted_at":"2026-06-30T05:52:32Z","title":"Obliviate: Efficient Unlearning in Recommender Systems","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-02T09:27:47.332518Z"},"links":{"citing_paper":"/paper/2607.22665"},"observation_digest":"sha256:36bed6db663651244eeec040df5f1e1cf3ab7d67c8618033802b4820aa7dcb71","observation_id":"278b6189-77bf-4a1f-8718-578f3b2ae1fc","resolution":{"observed_at":"2026-08-02T09:27:47.332518Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:27:47.335540Z","title":"U., Qiu, S., Saqib, M., Anwar, S., Usman, M., Akhtar, N., Barnes, N., and Mian, A","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.22665","last_updated":"2026-06-30T05:52:32Z","snapshot_observed_at":"2026-08-17T15:18:30.906141Z","submitted_at":"2026-06-30T05:52:32Z","title":"Obliviate: Efficient Unlearning in Recommender Systems","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-02T09:27:47.335540Z"},"links":{"citing_paper":"/paper/2607.22665"},"observation_digest":"sha256:4ea315b83616915ebfa51b228055071029a852d414b643dc3dcbba4784e945cd","observation_id":"71d3224c-c911-44e7-9fcf-e365788a67f1","resolution":{"observed_at":"2026-08-02T09:27:47.335540Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:27:47.338277Z","title":"T., Huynh, T","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.22665","last_updated":"2026-06-30T05:52:32Z","snapshot_observed_at":"2026-08-17T15:18:30.906141Z","submitted_at":"2026-06-30T05:52:32Z","title":"Obliviate: Efficient Unlearning in Recommender Systems","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-02T09:27:47.338277Z"},"links":{"citing_paper":"/paper/2607.22665"},"observation_digest":"sha256:276b0514511604e6016a288e594c554ec9763f7b0e9b87f4da42caf8cfef4373","observation_id":"a3d80fee-0bd2-4142-a3f9-e79d0e844753","resolution":{"observed_at":"2026-08-02T09:27:47.338277Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:27:47.341431Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.22665","last_updated":"2026-06-30T05:52:32Z","snapshot_observed_at":"2026-08-17T15:18:30.906141Z","submitted_at":"2026-06-30T05:52:32Z","title":"Obliviate: Efficient Unlearning in Recommender Systems","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-02T09:27:47.341431Z"},"links":{"citing_paper":"/paper/2607.22665"},"observation_digest":"sha256:294f279ccfcbef72225488704777746734b2ab12a7f42c0b99c6f8b5139ea17c","observation_id":"2391ad68-fc75-47f1-8e38-77c2fc8d9117","resolution":{"observed_at":"2026-08-02T09:27:47.341431Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:27:47.344154Z","title":"and So, A","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.22665","last_updated":"2026-06-30T05:52:32Z","snapshot_observed_at":"2026-08-17T15:18:30.906141Z","submitted_at":"2026-06-30T05:52:32Z","title":"Obliviate: Efficient Unlearning in Recommender Systems","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-02T09:27:47.344154Z"},"links":{"citing_paper":"/paper/2607.22665"},"observation_digest":"sha256:a3a05a5bcb728ee751f62e85409c4b2ba436de94629592a104cc050beb69566c","observation_id":"7f70618a-88b1-4ac8-9a85-818e6f47d25f","resolution":{"observed_at":"2026-08-02T09:27:47.344154Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:27:47.350490Z","title":"Forget me now: Fast and exact unlearning in neighborhood-based recommendation","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.22665","last_updated":"2026-06-30T05:52:32Z","snapshot_observed_at":"2026-08-17T15:18:30.906141Z","submitted_at":"2026-06-30T05:52:32Z","title":"Obliviate: Efficient Unlearning in Recommender Systems","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-02T09:27:47.350490Z"},"links":{"citing_paper":"/paper/2607.22665"},"observation_digest":"sha256:cdac5f5f8ed0dd2dd5a4b263580b60f14c7eb5b19a20f610807e38290447c8a4","observation_id":"5753e5ab-016f-45bb-a151-625f13a01dce","resolution":{"observed_at":"2026-08-02T09:27:47.350490Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:27:47.353332Z","title":"Neural graph collaborative filtering","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.22665","last_updated":"2026-06-30T05:52:32Z","snapshot_observed_at":"2026-08-17T15:18:30.906141Z","submitted_at":"2026-06-30T05:52:32Z","title":"Obliviate: Efficient Unlearning in Recommender Systems","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-02T09:27:47.353332Z"},"links":{"citing_paper":"/paper/2607.22665"},"observation_digest":"sha256:75bcc216f493e5a8a18420fc02243f732dbedd71d91c67ee18044fa8199ce9b9","observation_id":"6c17ddb2-490c-41ef-b48b-2b9092e5cb49","resolution":{"observed_at":"2026-08-02T09:27:47.353332Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:27:47.356330Z","title":"Contemporary recommendation systems on big data and their applications: A survey","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.22665","last_updated":"2026-06-30T05:52:32Z","snapshot_observed_at":"2026-08-17T15:18:30.906141Z","submitted_at":"2026-06-30T05:52:32Z","title":"Obliviate: Efficient Unlearning in Recommender Systems","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-02T09:27:47.356330Z"},"links":{"citing_paper":"/paper/2607.22665"},"observation_digest":"sha256:9e417503bfd58e1b4589d5e7270d5de18b6e2173aff936d50bd4984fa0388137","observation_id":"1262f728-5801-4ebd-860a-0f40dc65fa18","resolution":{"observed_at":"2026-08-02T09:27:47.356330Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2302.06676","last_updated":"2023-02-13T20:27:45Z","snapshot_observed_at":"2026-08-16T15:55:37.684931Z","submitted_at":"2023-02-13T20:27:45Z","title":"Netflix and Forget: Efficient and Exact Machine Unlearning from Bi-linear Recommendations","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.06676","snapshot_observed_at":"2026-08-02T09:27:47.359682Z","title":"Netflix and forget: Efficient and exact machine unlearning from bi-linear recommendations","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.22665","last_updated":"2026-06-30T05:52:32Z","snapshot_observed_at":"2026-08-17T15:18:30.906141Z","submitted_at":"2026-06-30T05:52:32Z","title":"Obliviate: Efficient Unlearning in Recommender Systems","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-02T09:27:47.359682Z"},"links":{"cited_paper":"/paper/2302.06676","citing_paper":"/paper/2607.22665"},"observation_digest":"sha256:3ddcd0249b043141a878bc4c57b6623f0406e00e9586c90fc2fd868a1ea58e63","observation_id":"08eeed63-ce0f-4aeb-b3e1-8a83bed2b76b","resolution":{"observed_at":"2026-08-02T09:27:47.359682Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:27:47.362923Z","title":"L., and Leskovec, J","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.22665","last_updated":"2026-06-30T05:52:32Z","snapshot_observed_at":"2026-08-17T15:18:30.906141Z","submitted_at":"2026-06-30T05:52:32Z","title":"Obliviate: Efficient Unlearning in Recommender Systems","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-02T09:27:47.362923Z"},"links":{"citing_paper":"/paper/2607.22665"},"observation_digest":"sha256:233e6747b72c5b373eec5b1df5352fe4faf0b29015335ead649afb8bc00bf494","observation_id":"67603cb6-63cb-4673-a23e-4581016482ea","resolution":{"observed_at":"2026-08-02T09:27:47.362923Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:27:47.366045Z","title":"Rrl: Recommendation reverse learning","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.22665","last_updated":"2026-06-30T05:52:32Z","snapshot_observed_at":"2026-08-17T15:18:30.906141Z","submitted_at":"2026-06-30T05:52:32Z","title":"Obliviate: Efficient Unlearning in Recommender Systems","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-02T09:27:47.366045Z"},"links":{"citing_paper":"/paper/2607.22665"},"observation_digest":"sha256:4614f961f34ff55a12c9174d7bcb7120d10f030cdf386a83d278525febde2b67","observation_id":"fb04e51f-0f7a-4329-90d0-29437978841f","resolution":{"observed_at":"2026-08-02T09:27:47.366045Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:27:47.369101Z","title":"Closed-form machine unlearning for matrix factorization","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.22665","last_updated":"2026-06-30T05:52:32Z","snapshot_observed_at":"2026-08-17T15:18:30.906141Z","submitted_at":"2026-06-30T05:52:32Z","title":"Obliviate: Efficient Unlearning in Recommender Systems","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-02T09:27:47.369101Z"},"links":{"citing_paper":"/paper/2607.22665"},"observation_digest":"sha256:4f1e4376251782d7e29cda3b7b9c55726faa06f2587290b16c5c509bca3a2e3e","observation_id":"743cb8ac-f29e-40a3-8e43-a477949449b1","resolution":{"observed_at":"2026-08-02T09:27:47.369101Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:27:47.372429Z","title":"Recommendation unlearning via influence function","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.22665","last_updated":"2026-06-30T05:52:32Z","snapshot_observed_at":"2026-08-17T15:18:30.906141Z","submitted_at":"2026-06-30T05:52:32Z","title":"Obliviate: Efficient Unlearning in Recommender Systems","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-02T09:27:47.372429Z"},"links":{"citing_paper":"/paper/2607.22665"},"observation_digest":"sha256:d44800fdac0edbc7f32487e600e847e74c5d7131cb3ede07c990e6987cde10ac","observation_id":"e6f2abca-fa74-46a0-b8dc-bc4d19cc36ea","resolution":{"observed_at":"2026-08-02T09:27:47.372429Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:27:47.375315Z","title":"What makes unlearning hard and what to do about it","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.22665","last_updated":"2026-06-30T05:52:32Z","snapshot_observed_at":"2026-08-17T15:18:30.906141Z","submitted_at":"2026-06-30T05:52:32Z","title":"Obliviate: Efficient Unlearning in Recommender Systems","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-02T09:27:47.375315Z"},"links":{"citing_paper":"/paper/2607.22665"},"observation_digest":"sha256:970163602af4eadabcffea921fc9a0e02cc0256682bf86f83966edd1ab82a152","observation_id":"82c5ebc7-e938-4cca-b4c0-49a8e395a311","resolution":{"observed_at":"2026-08-02T09:27:47.375315Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:27:47.378288Z","title":"Sinha and M","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.22665","last_updated":"2026-06-30T05:52:32Z","snapshot_observed_at":"2026-08-17T15:18:30.906141Z","submitted_at":"2026-06-30T05:52:32Z","title":"Obliviate: Efficient Unlearning in Recommender Systems","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-02T09:27:47.378288Z"},"links":{"citing_paper":"/paper/2607.22665"},"observation_digest":"sha256:4160b5573cab322332980c5282f6d8c8ec598d3efbbafff0936570d9c91fceb5","observation_id":"7589c100-4129-4a1a-af41-2c833c56606a","resolution":{"observed_at":"2026-08-02T09:27:47.378288Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1205.2618","last_updated":"2012-05-09T18:25:09Z","snapshot_observed_at":"2026-08-15T03:23:25.220336Z","submitted_at":"2012-05-09T18:25:09Z","title":"BPR: Bayesian Personalized Ranking from Implicit Feedback","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1205.2618","snapshot_observed_at":"2026-08-02T09:27:47.381261Z","title":"arXiv preprint arXiv:1205.2618 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.22665","last_updated":"2026-06-30T05:52:32Z","snapshot_observed_at":"2026-08-17T15:18:30.906141Z","submitted_at":"2026-06-30T05:52:32Z","title":"Obliviate: Efficient Unlearning in Recommender Systems","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-02T09:27:47.381261Z"},"links":{"cited_paper":"/paper/1205.2618","citing_paper":"/paper/2607.22665"},"observation_digest":"sha256:45e383c3552403132496332175617e02f7ea80aabc0d40c396176e5c06edb524","observation_id":"3aed706e-76c5-4f04-b28c-2767dbb5343d","resolution":{"observed_at":"2026-08-02T09:27:47.381261Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1412.6980","last_updated":"2017-01-30T01:27:54Z","snapshot_observed_at":"2026-08-17T19:26:44.032537Z","submitted_at":"2014-12-22T13:54:29Z","title":"Adam: A Method for Stochastic Optimization","version":9},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1412.6980","snapshot_observed_at":"2026-08-02T09:27:47.386991Z","title":"arXiv preprint arXiv:1412.6980 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.22665","last_updated":"2026-06-30T05:52:32Z","snapshot_observed_at":"2026-08-17T15:18:30.906141Z","submitted_at":"2026-06-30T05:52:32Z","title":"Obliviate: Efficient Unlearning in Recommender Systems","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-02T09:27:47.386991Z"},"links":{"cited_paper":"/paper/1412.6980","citing_paper":"/paper/2607.22665"},"observation_digest":"sha256:56e5cbcd1f67714663f2de48c7de2b6f9a58cfa97c01d5ddb143f10d8f21df32","observation_id":"7cc7ed8e-e7df-405b-a8f9-c2dbdcf1d177","resolution":{"observed_at":"2026-08-02T09:27:47.386991Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:27:47.389831Z","title":"Proceedings of the 42nd international ACM SIGIR conference on Research and development in Information Retrieval , pages=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.22665","last_updated":"2026-06-30T05:52:32Z","snapshot_observed_at":"2026-08-17T15:18:30.906141Z","submitted_at":"2026-06-30T05:52:32Z","title":"Obliviate: Efficient Unlearning in Recommender Systems","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-02T09:27:47.389831Z"},"links":{"citing_paper":"/paper/2607.22665"},"observation_digest":"sha256:366aa187a86e6b9a77fcd616551de35528ebc571a4e0b3bf56a163be57d32f25","observation_id":"72537b0b-74a0-48a3-9ded-5234f2105b2f","resolution":{"observed_at":"2026-08-02T09:27:47.389831Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:27:47.392626Z","title":"Proceedings of the 26th international conference on world wide web , pages=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.22665","last_updated":"2026-06-30T05:52:32Z","snapshot_observed_at":"2026-08-17T15:18:30.906141Z","submitted_at":"2026-06-30T05:52:32Z","title":"Obliviate: Efficient Unlearning in Recommender Systems","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-02T09:27:47.392626Z"},"links":{"citing_paper":"/paper/2607.22665"},"observation_digest":"sha256:588cff49856085293e7232e17aaf38b5751fb4a8e48a2da655d377d207adb3a5","observation_id":"6d96e407-7ed2-4bae-9389-34bcb2382fb6","resolution":{"observed_at":"2026-08-02T09:27:47.392626Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:27:47.396587Z","title":"Advances in neural information processing systems , volume=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.22665","last_updated":"2026-06-30T05:52:32Z","snapshot_observed_at":"2026-08-17T15:18:30.906141Z","submitted_at":"2026-06-30T05:52:32Z","title":"Obliviate: Efficient Unlearning in Recommender Systems","version":1},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-02T09:27:47.396587Z"},"links":{"citing_paper":"/paper/2607.22665"},"observation_digest":"sha256:f956d8f4d1ed2f152a70c32bf771b3daa0ece17a0c0393faf9569ae6b540dbdb","observation_id":"7e702e07-0201-46dc-a8b1-492e03334332","resolution":{"observed_at":"2026-08-02T09:27:47.396587Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:27:47.399210Z","title":"Procedia Computer Science , volume=","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.22665","last_updated":"2026-06-30T05:52:32Z","snapshot_observed_at":"2026-08-17T15:18:30.906141Z","submitted_at":"2026-06-30T05:52:32Z","title":"Obliviate: Efficient Unlearning in Recommender Systems","version":1},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-02T09:27:47.399210Z"},"links":{"citing_paper":"/paper/2607.22665"},"observation_digest":"sha256:7150292b956980cb232cc6db1029b6ae51b547c0c62b5046d2c156ef866ee954","observation_id":"86b8fd9b-b4a8-4619-b377-b2e702351569","resolution":{"observed_at":"2026-08-02T09:27:47.399210Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:27:47.401880Z","title":"Proceedings of the 24th ACM SIGKDD international conference on knowledge discovery & data mining , pages=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.22665","last_updated":"2026-06-30T05:52:32Z","snapshot_observed_at":"2026-08-17T15:18:30.906141Z","submitted_at":"2026-06-30T05:52:32Z","title":"Obliviate: Efficient Unlearning in Recommender Systems","version":1},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-08-02T09:27:47.401880Z"},"links":{"citing_paper":"/paper/2607.22665"},"observation_digest":"sha256:9df6c170eccb4516f8676c1e255ab1427f6413b93a1fccbb1523b25e902e0495","observation_id":"4f58f346-c836-4ccf-b256-0c2ea33650dc","resolution":{"observed_at":"2026-08-02T09:27:47.401880Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:27:47.404656Z","title":"Proceedings of the 43rd International ACM SIGIR conference on research and development in Information Retrieval , pages=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.22665","last_updated":"2026-06-30T05:52:32Z","snapshot_observed_at":"2026-08-17T15:18:30.906141Z","submitted_at":"2026-06-30T05:52:32Z","title":"Obliviate: Efficient Unlearning in Recommender Systems","version":1},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-08-02T09:27:47.404656Z"},"links":{"citing_paper":"/paper/2607.22665"},"observation_digest":"sha256:d11aea72e22bd51b275b06599022791c534af092775c697a1882f0d75f72ef39","observation_id":"61e98c4d-54fe-436d-a933-491c7c1975bf","resolution":{"observed_at":"2026-08-02T09:27:47.404656Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:27:47.407443Z","title":"Li and C","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.22665","last_updated":"2026-06-30T05:52:32Z","snapshot_observed_at":"2026-08-17T15:18:30.906141Z","submitted_at":"2026-06-30T05:52:32Z","title":"Obliviate: Efficient Unlearning in Recommender Systems","version":1},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-08-02T09:27:47.407443Z"},"links":{"citing_paper":"/paper/2607.22665"},"observation_digest":"sha256:9910febaf636a2755195969c1165a1d8bc2a5b18df5bc58ee4c2ab0082906105","observation_id":"8ec7ccf2-66ac-49ca-94ea-69f0fac074b3","resolution":{"observed_at":"2026-08-02T09:27:47.407443Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:27:47.410264Z","title":"Yang and J","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.22665","last_updated":"2026-06-30T05:52:32Z","snapshot_observed_at":"2026-08-17T15:18:30.906141Z","submitted_at":"2026-06-30T05:52:32Z","title":"Obliviate: Efficient Unlearning in Recommender Systems","version":1},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-08-02T09:27:47.410264Z"},"links":{"citing_paper":"/paper/2607.22665"},"observation_digest":"sha256:e82dea662b62f934bd8fbf6e276b19b5454fe8992bcdad8ea722385bd88880a3","observation_id":"3e84c31c-a002-4729-b704-d0783b41dcaf","resolution":{"observed_at":"2026-08-02T09:27:47.410264Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:27:47.413139Z","title":"Li and X","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.22665","last_updated":"2026-06-30T05:52:32Z","snapshot_observed_at":"2026-08-17T15:18:30.906141Z","submitted_at":"2026-06-30T05:52:32Z","title":"Obliviate: Efficient Unlearning in Recommender Systems","version":1},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-08-02T09:27:47.413139Z"},"links":{"citing_paper":"/paper/2607.22665"},"observation_digest":"sha256:aecef7a0877df3fc9d055529069490e2581ae540476b910b81a009b11d755290","observation_id":"51d027d4-6bfc-4179-a9e7-49b519462d00","resolution":{"observed_at":"2026-08-02T09:27:47.413139Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:27:47.415753Z","title":"Sachdeva and H","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.22665","last_updated":"2026-06-30T05:52:32Z","snapshot_observed_at":"2026-08-17T15:18:30.906141Z","submitted_at":"2026-06-30T05:52:32Z","title":"Obliviate: Efficient Unlearning in Recommender Systems","version":1},"reference_index":57,"source":"arxiv_source","source_observed_at":"2026-08-02T09:27:47.415753Z"},"links":{"citing_paper":"/paper/2607.22665"},"observation_digest":"sha256:c9c71e33286a66aebfa976910125ef67c9188e369ec76a9f2f20f1d693c99ec1","observation_id":"ffed399c-8b43-40c6-9878-fa49670a92c6","resolution":{"observed_at":"2026-08-02T09:27:47.415753Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:27:47.418895Z","title":"Dang and Y","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.22665","last_updated":"2026-06-30T05:52:32Z","snapshot_observed_at":"2026-08-17T15:18:30.906141Z","submitted_at":"2026-06-30T05:52:32Z","title":"Obliviate: Efficient Unlearning in Recommender Systems","version":1},"reference_index":58,"source":"arxiv_source","source_observed_at":"2026-08-02T09:27:47.418895Z"},"links":{"citing_paper":"/paper/2607.22665"},"observation_digest":"sha256:ce6fde79f1ebb6a710e4bcb73c3e53cba980a359312e71a8ffe76d213c0ee81a","observation_id":"25f4d824-4391-4fa4-bfd4-b8a41c4a21f8","resolution":{"observed_at":"2026-08-02T09:27:47.418895Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:27:47.421585Z","title":"Said and Y","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.22665","last_updated":"2026-06-30T05:52:32Z","snapshot_observed_at":"2026-08-17T15:18:30.906141Z","submitted_at":"2026-06-30T05:52:32Z","title":"Obliviate: Efficient Unlearning in Recommender Systems","version":1},"reference_index":59,"source":"arxiv_source","source_observed_at":"2026-08-02T09:27:47.421585Z"},"links":{"citing_paper":"/paper/2607.22665"},"observation_digest":"sha256:bbca04c0840b8de0497898fac4a8da31537fbddc7aec44b047501133322803a2","observation_id":"9f2fc64e-38cd-4c81-b306-9f596dd13051","resolution":{"observed_at":"2026-08-02T09:27:47.421585Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:27:47.424209Z","title":"Liu and D","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.22665","last_updated":"2026-06-30T05:52:32Z","snapshot_observed_at":"2026-08-17T15:18:30.906141Z","submitted_at":"2026-06-30T05:52:32Z","title":"Obliviate: Efficient Unlearning in Recommender Systems","version":1},"reference_index":60,"source":"arxiv_source","source_observed_at":"2026-08-02T09:27:47.424209Z"},"links":{"citing_paper":"/paper/2607.22665"},"observation_digest":"sha256:939160b0c06059e2f442e15c9026c8c9318abcca06f0bb9227909b2bf3b407f1","observation_id":"2f656fc9-46a0-4853-b12f-1b304b1605c9","resolution":{"observed_at":"2026-08-02T09:27:47.424209Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:27:47.426880Z","title":"Chen and H","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.22665","last_updated":"2026-06-30T05:52:32Z","snapshot_observed_at":"2026-08-17T15:18:30.906141Z","submitted_at":"2026-06-30T05:52:32Z","title":"Obliviate: Efficient Unlearning in Recommender Systems","version":1},"reference_index":61,"source":"arxiv_source","source_observed_at":"2026-08-02T09:27:47.426880Z"},"links":{"citing_paper":"/paper/2607.22665"},"observation_digest":"sha256:5721d05c9595b3f30af80a3f7684b281505e5bf22ec70fbdad23822a1498152a","observation_id":"8d09992a-dc47-4439-8559-b5b025ac6485","resolution":{"observed_at":"2026-08-02T09:27:47.426880Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:27:47.429546Z","title":"Li and C","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.22665","last_updated":"2026-06-30T05:52:32Z","snapshot_observed_at":"2026-08-17T15:18:30.906141Z","submitted_at":"2026-06-30T05:52:32Z","title":"Obliviate: Efficient Unlearning in Recommender Systems","version":1},"reference_index":62,"source":"arxiv_source","source_observed_at":"2026-08-02T09:27:47.429546Z"},"links":{"citing_paper":"/paper/2607.22665"},"observation_digest":"sha256:b1974507b658e525f3c70dcbe0e5d45007a42a331fb57f7cb6ee29abd4f6b9ea","observation_id":"ba565050-391d-47aa-955e-c72af66c1b0e","resolution":{"observed_at":"2026-08-02T09:27:47.429546Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:27:47.432472Z","title":"Chen and F","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.22665","last_updated":"2026-06-30T05:52:32Z","snapshot_observed_at":"2026-08-17T15:18:30.906141Z","submitted_at":"2026-06-30T05:52:32Z","title":"Obliviate: Efficient Unlearning in Recommender Systems","version":1},"reference_index":63,"source":"arxiv_source","source_observed_at":"2026-08-02T09:27:47.432472Z"},"links":{"citing_paper":"/paper/2607.22665"},"observation_digest":"sha256:9bc42dbeb1d85cd258623757a06aa17cafe7bc8e04c4669ecaad688e65ef8b63","observation_id":"4a095c3a-8465-430c-a04f-96f59d0a878f","resolution":{"observed_at":"2026-08-02T09:27:47.432472Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:27:47.435618Z","title":"Dou and T","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.22665","last_updated":"2026-06-30T05:52:32Z","snapshot_observed_at":"2026-08-17T15:18:30.906141Z","submitted_at":"2026-06-30T05:52:32Z","title":"Obliviate: Efficient Unlearning in Recommender Systems","version":1},"reference_index":64,"source":"arxiv_source","source_observed_at":"2026-08-02T09:27:47.435618Z"},"links":{"citing_paper":"/paper/2607.22665"},"observation_digest":"sha256:ecc6c4d289cbdeadf34be4f0d3f0b12dbd6ae321edebdbc9459deeb59b26c974","observation_id":"770a1705-62be-452b-a062-ea23d169d91c","resolution":{"observed_at":"2026-08-02T09:27:47.435618Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:27:47.438409Z","title":"Zhang and W","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.22665","last_updated":"2026-06-30T05:52:32Z","snapshot_observed_at":"2026-08-17T15:18:30.906141Z","submitted_at":"2026-06-30T05:52:32Z","title":"Obliviate: Efficient Unlearning in Recommender Systems","version":1},"reference_index":65,"source":"arxiv_source","source_observed_at":"2026-08-02T09:27:47.438409Z"},"links":{"citing_paper":"/paper/2607.22665"},"observation_digest":"sha256:06d979b989120bb4f40a599b8d2d22ef2ea40a2e417499579bab2da00a84863b","observation_id":"dc130379-42c3-4ce9-ae4b-ddcf1a61946d","resolution":{"observed_at":"2026-08-02T09:27:47.438409Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:27:47.441299Z","title":"Hao and F","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.22665","last_updated":"2026-06-30T05:52:32Z","snapshot_observed_at":"2026-08-17T15:18:30.906141Z","submitted_at":"2026-06-30T05:52:32Z","title":"Obliviate: Efficient Unlearning in Recommender Systems","version":1},"reference_index":66,"source":"arxiv_source","source_observed_at":"2026-08-02T09:27:47.441299Z"},"links":{"citing_paper":"/paper/2607.22665"},"observation_digest":"sha256:184746cf6baadc0c678a8e3aa9ab17e80201ca05b301926f82856e836428bef1","observation_id":"17fffd80-0aa6-4a41-a6d6-2a8ce59d635f","resolution":{"observed_at":"2026-08-02T09:27:47.441299Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:27:47.443936Z","title":"Chen and L","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.22665","last_updated":"2026-06-30T05:52:32Z","snapshot_observed_at":"2026-08-17T15:18:30.906141Z","submitted_at":"2026-06-30T05:52:32Z","title":"Obliviate: Efficient Unlearning in Recommender Systems","version":1},"reference_index":67,"source":"arxiv_source","source_observed_at":"2026-08-02T09:27:47.443936Z"},"links":{"citing_paper":"/paper/2607.22665"},"observation_digest":"sha256:2922449309f685cb7ccd7fbf44c92f0cb9745dc8489496eeb5c0db22fc158c8b","observation_id":"185d0d8d-549a-4280-b4e5-17fabd21438e","resolution":{"observed_at":"2026-08-02T09:27:47.443936Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:27:47.446562Z","title":"Advances in Neural Information Processing Systems , volume=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.22665","last_updated":"2026-06-30T05:52:32Z","snapshot_observed_at":"2026-08-17T15:18:30.906141Z","submitted_at":"2026-06-30T05:52:32Z","title":"Obliviate: Efficient Unlearning in Recommender Systems","version":1},"reference_index":68,"source":"arxiv_source","source_observed_at":"2026-08-02T09:27:47.446562Z"},"links":{"citing_paper":"/paper/2607.22665"},"observation_digest":"sha256:2f941e7dd9ff6e153a705cc30fef3ffe76a21746982777f3b49e5e819ba151d9","observation_id":"4517b33a-d5d2-4794-b321-61d555a8f4d5","resolution":{"observed_at":"2026-08-02T09:27:47.446562Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:27:47.449319Z","title":"Computers & Security , volume=","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.22665","last_updated":"2026-06-30T05:52:32Z","snapshot_observed_at":"2026-08-17T15:18:30.906141Z","submitted_at":"2026-06-30T05:52:32Z","title":"Obliviate: Efficient Unlearning in Recommender Systems","version":1},"reference_index":69,"source":"arxiv_source","source_observed_at":"2026-08-02T09:27:47.449319Z"},"links":{"citing_paper":"/paper/2607.22665"},"observation_digest":"sha256:dda4df42ccb306f706e0ece36a9790f0adf2e490a8d785c7bdf16c49bc40c296","observation_id":"630c5d6d-24ee-4a1c-96e2-fc8b36f7c481","resolution":{"observed_at":"2026-08-02T09:27:47.449319Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:27:47.451950Z","title":"Advances in Neural Information Processing Systems , volume=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.22665","last_updated":"2026-06-30T05:52:32Z","snapshot_observed_at":"2026-08-17T15:18:30.906141Z","submitted_at":"2026-06-30T05:52:32Z","title":"Obliviate: Efficient Unlearning in Recommender Systems","version":1},"reference_index":70,"source":"arxiv_source","source_observed_at":"2026-08-02T09:27:47.451950Z"},"links":{"citing_paper":"/paper/2607.22665"},"observation_digest":"sha256:7ddf838939ebd797ba603966a212bc16f218492108d5317a4e5ec186717d2cf7","observation_id":"6240c537-dfc7-415e-a969-e50f959d9a8d","resolution":{"observed_at":"2026-08-02T09:27:47.451950Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:27:47.454741Z","title":"2021 IEEE symposium on security and privacy (SP) , pages=","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.22665","last_updated":"2026-06-30T05:52:32Z","snapshot_observed_at":"2026-08-17T15:18:30.906141Z","submitted_at":"2026-06-30T05:52:32Z","title":"Obliviate: Efficient Unlearning in Recommender Systems","version":1},"reference_index":71,"source":"arxiv_source","source_observed_at":"2026-08-02T09:27:47.454741Z"},"links":{"citing_paper":"/paper/2607.22665"},"observation_digest":"sha256:41fb8093ca3cc1fa8193bf62f8852a082482217320d36ca74a82588b46b9609e","observation_id":"e3b7ce58-a56d-49b9-ad47-ce20c23bd9b4","resolution":{"observed_at":"2026-08-02T09:27:47.454741Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:27:47.457600Z","title":"ACM Transactions on Intelligent Systems and Technology , volume=","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.22665","last_updated":"2026-06-30T05:52:32Z","snapshot_observed_at":"2026-08-17T15:18:30.906141Z","submitted_at":"2026-06-30T05:52:32Z","title":"Obliviate: Efficient Unlearning in Recommender Systems","version":1},"reference_index":72,"source":"arxiv_source","source_observed_at":"2026-08-02T09:27:47.457600Z"},"links":{"citing_paper":"/paper/2607.22665"},"observation_digest":"sha256:04d2457ed3f00eb5b0c8aa008c8326c4591839f79f0f25c8192c5acef50803d4","observation_id":"c4a6600a-ce63-40a3-b3ce-07e24415a5db","resolution":{"observed_at":"2026-08-02T09:27:47.457600Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:27:47.460405Z","title":"Proceedings of the 18th ACM Conference on Recommender Systems , pages=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.22665","last_updated":"2026-06-30T05:52:32Z","snapshot_observed_at":"2026-08-17T15:18:30.906141Z","submitted_at":"2026-06-30T05:52:32Z","title":"Obliviate: Efficient Unlearning in Recommender Systems","version":1},"reference_index":73,"source":"arxiv_source","source_observed_at":"2026-08-02T09:27:47.460405Z"},"links":{"citing_paper":"/paper/2607.22665"},"observation_digest":"sha256:c6f56eff789abe28cb73887ef8ef933d10e6106a208da65c17f2f7f98dea5cf3","observation_id":"e4752a48-41b9-4614-8a01-75d62b075928","resolution":{"observed_at":"2026-08-02T09:27:47.460405Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:27:47.463438Z","title":"IEEE access , volume=","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.22665","last_updated":"2026-06-30T05:52:32Z","snapshot_observed_at":"2026-08-17T15:18:30.906141Z","submitted_at":"2026-06-30T05:52:32Z","title":"Obliviate: Efficient Unlearning in Recommender Systems","version":1},"reference_index":74,"source":"arxiv_source","source_observed_at":"2026-08-02T09:27:47.463438Z"},"links":{"citing_paper":"/paper/2607.22665"},"observation_digest":"sha256:73ba180474747254effc86a417b139659fdb86aad17d86dfb132963d0183ae4d","observation_id":"b95086f0-563f-467e-b84d-6b5f01d2159e","resolution":{"observed_at":"2026-08-02T09:27:47.463438Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:27:47.466049Z","title":"Proceedings of the 10th ACM conference on recommender systems , pages=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.22665","last_updated":"2026-06-30T05:52:32Z","snapshot_observed_at":"2026-08-17T15:18:30.906141Z","submitted_at":"2026-06-30T05:52:32Z","title":"Obliviate: Efficient Unlearning in Recommender Systems","version":1},"reference_index":75,"source":"arxiv_source","source_observed_at":"2026-08-02T09:27:47.466049Z"},"links":{"citing_paper":"/paper/2607.22665"},"observation_digest":"sha256:2a1cd92ebd1a85a2529d1d41ac55b183162d34ad869350350c5922b5ac2b24a8","observation_id":"5ffbf738-d2c7-4983-a976-cdcb5fba1ece","resolution":{"observed_at":"2026-08-02T09:27:47.466049Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:27:47.468778Z","title":"Proceedings of the 1st workshop on deep learning for recommender systems , pages=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.22665","last_updated":"2026-06-30T05:52:32Z","snapshot_observed_at":"2026-08-17T15:18:30.906141Z","submitted_at":"2026-06-30T05:52:32Z","title":"Obliviate: Efficient Unlearning in Recommender Systems","version":1},"reference_index":76,"source":"arxiv_source","source_observed_at":"2026-08-02T09:27:47.468778Z"},"links":{"citing_paper":"/paper/2607.22665"},"observation_digest":"sha256:38be62ccc0a3e2c72b37ca4e64676181bfe245c582d8a9ccad9c68ea1643a2a2","observation_id":"5165237e-071e-40b0-a560-140881da63c4","resolution":{"observed_at":"2026-08-02T09:27:47.468778Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:27:47.471383Z","title":"ACM Transactions on Intelligent Systems and Technology , volume=","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.22665","last_updated":"2026-06-30T05:52:32Z","snapshot_observed_at":"2026-08-17T15:18:30.906141Z","submitted_at":"2026-06-30T05:52:32Z","title":"Obliviate: Efficient Unlearning in Recommender Systems","version":1},"reference_index":77,"source":"arxiv_source","source_observed_at":"2026-08-02T09:27:47.471383Z"},"links":{"citing_paper":"/paper/2607.22665"},"observation_digest":"sha256:13e7b63b4947d601d9abcc4c276788a467fff3c29f86d8b1171b10b594573903","observation_id":"d76ed693-2a72-47bf-a0b8-4294e797c978","resolution":{"observed_at":"2026-08-02T09:27:47.471383Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:27:47.474044Z","title":"Artificial Intelligence Review , volume=","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.22665","last_updated":"2026-06-30T05:52:32Z","snapshot_observed_at":"2026-08-17T15:18:30.906141Z","submitted_at":"2026-06-30T05:52:32Z","title":"Obliviate: Efficient Unlearning in Recommender Systems","version":1},"reference_index":78,"source":"arxiv_source","source_observed_at":"2026-08-02T09:27:47.474044Z"},"links":{"citing_paper":"/paper/2607.22665"},"observation_digest":"sha256:0d86e613075a7ef01fc6c5a2c73857fcd33b411493b2057833bab00e5a76e72d","observation_id":"59f9c5d6-c47d-4cdb-b7bf-9fb729a35bcd","resolution":{"observed_at":"2026-08-02T09:27:47.474044Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:27:47.476584Z","title":"Li and E","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.22665","last_updated":"2026-06-30T05:52:32Z","snapshot_observed_at":"2026-08-17T15:18:30.906141Z","submitted_at":"2026-06-30T05:52:32Z","title":"Obliviate: Efficient Unlearning in Recommender Systems","version":1},"reference_index":79,"source":"arxiv_source","source_observed_at":"2026-08-02T09:27:47.476584Z"},"links":{"citing_paper":"/paper/2607.22665"},"observation_digest":"sha256:85959ae3011288c6a68569ae71095c9952d4392fa14668be4e8412898e34a4da","observation_id":"f308b27b-b167-4c20-a74d-b2c0d67cb565","resolution":{"observed_at":"2026-08-02T09:27:47.476584Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:27:47.479427Z","title":"Hu and Y","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.22665","last_updated":"2026-06-30T05:52:32Z","snapshot_observed_at":"2026-08-17T15:18:30.906141Z","submitted_at":"2026-06-30T05:52:32Z","title":"Obliviate: Efficient Unlearning in Recommender Systems","version":1},"reference_index":80,"source":"arxiv_source","source_observed_at":"2026-08-02T09:27:47.479427Z"},"links":{"citing_paper":"/paper/2607.22665"},"observation_digest":"sha256:664c3dbe9f08461cd694b5aee79497a821be3b373a1067df3b0787b2d24857a8","observation_id":"15a387e8-5707-4f44-956e-666ba5479a33","resolution":{"observed_at":"2026-08-02T09:27:47.479427Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:27:47.482325Z","title":"Zhang and B","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.22665","last_updated":"2026-06-30T05:52:32Z","snapshot_observed_at":"2026-08-17T15:18:30.906141Z","submitted_at":"2026-06-30T05:52:32Z","title":"Obliviate: Efficient Unlearning in Recommender Systems","version":1},"reference_index":81,"source":"arxiv_source","source_observed_at":"2026-08-02T09:27:47.482325Z"},"links":{"citing_paper":"/paper/2607.22665"},"observation_digest":"sha256:018cdebef2f59845ef7f3f6ab07080fc875bc12c425d3993456e54d4af2094b5","observation_id":"ee94c0a1-33e0-4c83-a805-834f2609fbc6","resolution":{"observed_at":"2026-08-02T09:27:47.482325Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:27:47.486001Z","title":"Liu and J","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.22665","last_updated":"2026-06-30T05:52:32Z","snapshot_observed_at":"2026-08-17T15:18:30.906141Z","submitted_at":"2026-06-30T05:52:32Z","title":"Obliviate: Efficient Unlearning in Recommender Systems","version":1},"reference_index":82,"source":"arxiv_source","source_observed_at":"2026-08-02T09:27:47.486001Z"},"links":{"citing_paper":"/paper/2607.22665"},"observation_digest":"sha256:9b005cb19d854460efd7ea37c84e6ebfc18e11cd38b969e8c20f0d1e1ccfe5b4","observation_id":"14ddf235-3783-403b-838c-4781037ff784","resolution":{"observed_at":"2026-08-02T09:27:47.486001Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:27:47.489084Z","title":"Chen and Y","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.22665","last_updated":"2026-06-30T05:52:32Z","snapshot_observed_at":"2026-08-17T15:18:30.906141Z","submitted_at":"2026-06-30T05:52:32Z","title":"Obliviate: Efficient Unlearning in Recommender Systems","version":1},"reference_index":83,"source":"arxiv_source","source_observed_at":"2026-08-02T09:27:47.489084Z"},"links":{"citing_paper":"/paper/2607.22665"},"observation_digest":"sha256:43407c62f5ac7f430a247029baf0b178b685a2003ea32b910c19d8c6d6b37f18","observation_id":"b159cb29-9428-405d-a13e-f59558d9364f","resolution":{"observed_at":"2026-08-02T09:27:47.489084Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:27:47.492003Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.22665","last_updated":"2026-06-30T05:52:32Z","snapshot_observed_at":"2026-08-17T15:18:30.906141Z","submitted_at":"2026-06-30T05:52:32Z","title":"Obliviate: Efficient Unlearning in Recommender Systems","version":1},"reference_index":84,"source":"arxiv_source","source_observed_at":"2026-08-02T09:27:47.492003Z"},"links":{"citing_paper":"/paper/2607.22665"},"observation_digest":"sha256:ef8c73d96a8ce1350ca3cdeceb65d660e8b3eff41c3993032704f20c9e7d2571","observation_id":"c8e8caac-4764-43eb-ac3d-cc6d8efacceb","resolution":{"observed_at":"2026-08-02T09:27:47.492003Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:27:47.494748Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.22665","last_updated":"2026-06-30T05:52:32Z","snapshot_observed_at":"2026-08-17T15:18:30.906141Z","submitted_at":"2026-06-30T05:52:32Z","title":"Obliviate: Efficient Unlearning in Recommender Systems","version":1},"reference_index":85,"source":"arxiv_source","source_observed_at":"2026-08-02T09:27:47.494748Z"},"links":{"citing_paper":"/paper/2607.22665"},"observation_digest":"sha256:a6776424b63f1a6b3e979bf62e647e78dc7515d5d5e8cc662e55ab04d9f8ebad","observation_id":"564dc158-bc3d-490c-a738-c281547af8c2","resolution":{"observed_at":"2026-08-02T09:27:47.494748Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:27:47.497606Z","title":"Li and C","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.22665","last_updated":"2026-06-30T05:52:32Z","snapshot_observed_at":"2026-08-17T15:18:30.906141Z","submitted_at":"2026-06-30T05:52:32Z","title":"Obliviate: Efficient Unlearning in Recommender Systems","version":1},"reference_index":86,"source":"arxiv_source","source_observed_at":"2026-08-02T09:27:47.497606Z"},"links":{"citing_paper":"/paper/2607.22665"},"observation_digest":"sha256:e2879f5d6274413127c7dcc44654c6167c47219512bf257cb385ac688ac0a6cf","observation_id":"aad795fa-3660-4e4b-ae94-c35bff1ff370","resolution":{"observed_at":"2026-08-02T09:27:47.497606Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:27:47.500492Z","title":"Wu and Y","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.22665","last_updated":"2026-06-30T05:52:32Z","snapshot_observed_at":"2026-08-17T15:18:30.906141Z","submitted_at":"2026-06-30T05:52:32Z","title":"Obliviate: Efficient Unlearning in Recommender Systems","version":1},"reference_index":87,"source":"arxiv_source","source_observed_at":"2026-08-02T09:27:47.500492Z"},"links":{"citing_paper":"/paper/2607.22665"},"observation_digest":"sha256:8f6266d1c9cf813e8603952a92a5daf77587377c629f23f7929fd457c3e570f6","observation_id":"0220972b-10ba-4257-afad-e24550a599f3","resolution":{"observed_at":"2026-08-02T09:27:47.500492Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:27:47.503284Z","title":"Wu and Y","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.22665","last_updated":"2026-06-30T05:52:32Z","snapshot_observed_at":"2026-08-17T15:18:30.906141Z","submitted_at":"2026-06-30T05:52:32Z","title":"Obliviate: Efficient Unlearning in Recommender Systems","version":1},"reference_index":88,"source":"arxiv_source","source_observed_at":"2026-08-02T09:27:47.503284Z"},"links":{"citing_paper":"/paper/2607.22665"},"observation_digest":"sha256:b9cdd18eef72e800435db97442f4546c7305e68b03eef8d022acf8cc797ad5ee","observation_id":"8cfd8e97-d448-4735-bfb4-7d6ce55135f0","resolution":{"observed_at":"2026-08-02T09:27:47.503284Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:27:47.506121Z","title":"Xu and Z","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.22665","last_updated":"2026-06-30T05:52:32Z","snapshot_observed_at":"2026-08-17T15:18:30.906141Z","submitted_at":"2026-06-30T05:52:32Z","title":"Obliviate: Efficient Unlearning in Recommender Systems","version":1},"reference_index":89,"source":"arxiv_source","source_observed_at":"2026-08-02T09:27:47.506121Z"},"links":{"citing_paper":"/paper/2607.22665"},"observation_digest":"sha256:a57249672527591eb2382365cd20bd0fd9f36d0f9edd1a8b96b02168829425d0","observation_id":"79d4fe99-f574-49d4-a608-4401f5ace534","resolution":{"observed_at":"2026-08-02T09:27:47.506121Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:27:47.509086Z","title":"Schelter and M","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.22665","last_updated":"2026-06-30T05:52:32Z","snapshot_observed_at":"2026-08-17T15:18:30.906141Z","submitted_at":"2026-06-30T05:52:32Z","title":"Obliviate: Efficient Unlearning in Recommender Systems","version":1},"reference_index":90,"source":"arxiv_source","source_observed_at":"2026-08-02T09:27:47.509086Z"},"links":{"citing_paper":"/paper/2607.22665"},"observation_digest":"sha256:c2ce6eb4293f68e74428c98716ccb581c8a009821a51af138c19646e4a96f04c","observation_id":"cc520be6-969f-4e83-a796-e1618e73c766","resolution":{"observed_at":"2026-08-02T09:27:47.509086Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:27:47.511991Z","title":"Xu and J","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.22665","last_updated":"2026-06-30T05:52:32Z","snapshot_observed_at":"2026-08-17T15:18:30.906141Z","submitted_at":"2026-06-30T05:52:32Z","title":"Obliviate: Efficient Unlearning in Recommender Systems","version":1},"reference_index":91,"source":"arxiv_source","source_observed_at":"2026-08-02T09:27:47.511991Z"},"links":{"citing_paper":"/paper/2607.22665"},"observation_digest":"sha256:8929a9c3bfbdd1ebff8cca53518b1dd5aee5689b2fd7833ec132170e84435cb4","observation_id":"f90577c4-dba8-4e3f-8fa4-bae503c01647","resolution":{"observed_at":"2026-08-02T09:27:47.511991Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:27:47.514867Z","title":"Proceedings of the AAAI conference on artificial intelligence , volume=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.22665","last_updated":"2026-06-30T05:52:32Z","snapshot_observed_at":"2026-08-17T15:18:30.906141Z","submitted_at":"2026-06-30T05:52:32Z","title":"Obliviate: Efficient Unlearning in Recommender Systems","version":1},"reference_index":92,"source":"arxiv_source","source_observed_at":"2026-08-02T09:27:47.514867Z"},"links":{"citing_paper":"/paper/2607.22665"},"observation_digest":"sha256:8ea033bd8484d297bfc80db6d9685f4d20ac0ddafaa9ffd83a6b8ff7a522a8e7","observation_id":"8a78d58f-4fb2-45f4-bd9e-9a2778ec818d","resolution":{"observed_at":"2026-08-02T09:27:47.514867Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:27:47.517897Z","title":"ACM Transactions on Recommender Systems , volume=","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.22665","last_updated":"2026-06-30T05:52:32Z","snapshot_observed_at":"2026-08-17T15:18:30.906141Z","submitted_at":"2026-06-30T05:52:32Z","title":"Obliviate: Efficient Unlearning in Recommender Systems","version":1},"reference_index":93,"source":"arxiv_source","source_observed_at":"2026-08-02T09:27:47.517897Z"},"links":{"citing_paper":"/paper/2607.22665"},"observation_digest":"sha256:ebe71b37cda151d56bcdf26e63f352de3c76e25f9d0db5c84bbd0282ee6c5a8b","observation_id":"8ce8c123-9bf3-4f79-8051-59fba6efaf41","resolution":{"observed_at":"2026-08-02T09:27:47.517897Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:27:47.521033Z","title":"Zhang and J","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.22665","last_updated":"2026-06-30T05:52:32Z","snapshot_observed_at":"2026-08-17T15:18:30.906141Z","submitted_at":"2026-06-30T05:52:32Z","title":"Obliviate: Efficient Unlearning in Recommender Systems","version":1},"reference_index":94,"source":"arxiv_source","source_observed_at":"2026-08-02T09:27:47.521033Z"},"links":{"citing_paper":"/paper/2607.22665"},"observation_digest":"sha256:3afe7f83952eedff538c32c4cf3efa4176d688f542e7b67b725ad90e54bfa1b7","observation_id":"954df6cc-1831-47c0-864e-72d1383ec306","resolution":{"observed_at":"2026-08-02T09:27:47.521033Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:27:47.524165Z","title":"Li and C","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.22665","last_updated":"2026-06-30T05:52:32Z","snapshot_observed_at":"2026-08-17T15:18:30.906141Z","submitted_at":"2026-06-30T05:52:32Z","title":"Obliviate: Efficient Unlearning in Recommender Systems","version":1},"reference_index":95,"source":"arxiv_source","source_observed_at":"2026-08-02T09:27:47.524165Z"},"links":{"citing_paper":"/paper/2607.22665"},"observation_digest":"sha256:fb9c4d786bfe2e90afdbadb125dc5991c3a1b73dd37dc92681bf4c74d14323b0","observation_id":"b8a69598-e9c8-4bfa-8fa3-caf1cd34a2a7","resolution":{"observed_at":"2026-08-02T09:27:47.524165Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:27:47.527034Z","title":"International Conference on Machine Learning (ICML) , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.22665","last_updated":"2026-06-30T05:52:32Z","snapshot_observed_at":"2026-08-17T15:18:30.906141Z","submitted_at":"2026-06-30T05:52:32Z","title":"Obliviate: Efficient Unlearning in Recommender Systems","version":1},"reference_index":96,"source":"arxiv_source","source_observed_at":"2026-08-02T09:27:47.527034Z"},"links":{"citing_paper":"/paper/2607.22665"},"observation_digest":"sha256:f9a831b29598a42b0a3de627906dd0309a36c9b531ece364716a56193ddc4a9b","observation_id":"98db8efc-4e43-4eb8-a0d4-b06399a9944f","resolution":{"observed_at":"2026-08-02T09:27:47.527034Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:27:47.529744Z","title":"Computer Law & Security Review , volume=","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2607.22665","last_updated":"2026-06-30T05:52:32Z","snapshot_observed_at":"2026-08-17T15:18:30.906141Z","submitted_at":"2026-06-30T05:52:32Z","title":"Obliviate: Efficient Unlearning in Recommender Systems","version":1},"reference_index":97,"source":"arxiv_source","source_observed_at":"2026-08-02T09:27:47.529744Z"},"links":{"citing_paper":"/paper/2607.22665"},"observation_digest":"sha256:e4367731827ddeda795fc6cd4740233d898a697bb7f8b4d0d15946360a88ed10","observation_id":"55ab76bd-f598-4687-94f6-8ce2a4328c5f","resolution":{"observed_at":"2026-08-02T09:27:47.529744Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:27:47.532732Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.22665","last_updated":"2026-06-30T05:52:32Z","snapshot_observed_at":"2026-08-17T15:18:30.906141Z","submitted_at":"2026-06-30T05:52:32Z","title":"Obliviate: Efficient Unlearning in Recommender Systems","version":1},"reference_index":98,"source":"arxiv_source","source_observed_at":"2026-08-02T09:27:47.532732Z"},"links":{"citing_paper":"/paper/2607.22665"},"observation_digest":"sha256:6502605b18277be339a23d918fd8aeca201fc1c62ca1d6ca01ec8c6c9503eccf","observation_id":"303d961e-23c0-4f02-baaf-efac4ab2eadf","resolution":{"observed_at":"2026-08-02T09:27:47.532732Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:27:47.535354Z","title":"Proceedings of the sixteenth ACM international conference on web search and data mining , pages=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.22665","last_updated":"2026-06-30T05:52:32Z","snapshot_observed_at":"2026-08-17T15:18:30.906141Z","submitted_at":"2026-06-30T05:52:32Z","title":"Obliviate: Efficient Unlearning in Recommender Systems","version":1},"reference_index":99,"source":"arxiv_source","source_observed_at":"2026-08-02T09:27:47.535354Z"},"links":{"citing_paper":"/paper/2607.22665"},"observation_digest":"sha256:f77166b8c3328378039f21e5bfe643914ff8703b75287be5b456682653565b5a","observation_id":"d389ec3c-e744-4eeb-8014-bd8e92852a6f","resolution":{"observed_at":"2026-08-02T09:27:47.535354Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:27:47.538003Z","title":"Neural Computation , volume=","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.22665","last_updated":"2026-06-30T05:52:32Z","snapshot_observed_at":"2026-08-17T15:18:30.906141Z","submitted_at":"2026-06-30T05:52:32Z","title":"Obliviate: Efficient Unlearning in Recommender Systems","version":1},"reference_index":100,"source":"arxiv_source","source_observed_at":"2026-08-02T09:27:47.538003Z"},"links":{"citing_paper":"/paper/2607.22665"},"observation_digest":"sha256:de42ed441efbc8bf51a76221cf5815a415efac671cb3fb7a74199e11abb2db13","observation_id":"0cdfc3b0-0f5b-4363-b13e-17d02d4f6677","resolution":{"observed_at":"2026-08-02T09:27:47.538003Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:27:47.540742Z","title":"IEEE Transactions on Signal Processing , volume=","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.22665","last_updated":"2026-06-30T05:52:32Z","snapshot_observed_at":"2026-08-17T15:18:30.906141Z","submitted_at":"2026-06-30T05:52:32Z","title":"Obliviate: Efficient Unlearning in Recommender Systems","version":1},"reference_index":101,"source":"arxiv_source","source_observed_at":"2026-08-02T09:27:47.540742Z"},"links":{"citing_paper":"/paper/2607.22665"},"observation_digest":"sha256:ed856b7a9cdec34968f4f22c2781cbc226f13fbb27dbf14e690e2c9d17e205fd","observation_id":"72f2d66f-2597-48a9-bd74-bee142537b54","resolution":{"observed_at":"2026-08-02T09:27:47.540742Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:27:47.543459Z","title":"Advances in neural information processing systems , volume=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.22665","last_updated":"2026-06-30T05:52:32Z","snapshot_observed_at":"2026-08-17T15:18:30.906141Z","submitted_at":"2026-06-30T05:52:32Z","title":"Obliviate: Efficient Unlearning in Recommender Systems","version":1},"reference_index":102,"source":"arxiv_source","source_observed_at":"2026-08-02T09:27:47.543459Z"},"links":{"citing_paper":"/paper/2607.22665"},"observation_digest":"sha256:d34a6c9c5817c1abc6423643d0d00e5f0af698e71aa3b32ff8072d50ae7de05b","observation_id":"bf8ea299-514e-4891-b234-b15eb75d6fb6","resolution":{"observed_at":"2026-08-02T09:27:47.543459Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:27:47.546113Z","title":"International conference on machine learning , pages=","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.22665","last_updated":"2026-06-30T05:52:32Z","snapshot_observed_at":"2026-08-17T15:18:30.906141Z","submitted_at":"2026-06-30T05:52:32Z","title":"Obliviate: Efficient Unlearning in Recommender Systems","version":1},"reference_index":103,"source":"arxiv_source","source_observed_at":"2026-08-02T09:27:47.546113Z"},"links":{"citing_paper":"/paper/2607.22665"},"observation_digest":"sha256:d5830c4eda34db08c096803aa7983d020e383d7f781a3d782ded23df285868b3","observation_id":"72f7654c-c2e7-4cef-9a54-02af150ab4e6","resolution":{"observed_at":"2026-08-02T09:27:47.546113Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2208.06875","last_updated":"2022-08-14T16:11:43Z","snapshot_observed_at":"2026-08-18T13:07:34.397115Z","submitted_at":"2022-08-14T16:11:43Z","title":"Forgetting Fast in Recommender Systems","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2208.06875","snapshot_observed_at":"2026-08-02T09:27:47.549018Z","title":"arXiv preprint arXiv:2208.06875 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.22665","last_updated":"2026-06-30T05:52:32Z","snapshot_observed_at":"2026-08-17T15:18:30.906141Z","submitted_at":"2026-06-30T05:52:32Z","title":"Obliviate: Efficient Unlearning in Recommender Systems","version":1},"reference_index":104,"source":"arxiv_source","source_observed_at":"2026-08-02T09:27:47.549018Z"},"links":{"cited_paper":"/paper/2208.06875","citing_paper":"/paper/2607.22665"},"observation_digest":"sha256:c9edba99fdc7e01bbff613c85ee011589a4a55490c39d2389830957c3b8f2681","observation_id":"d0520ac1-1a6f-4eac-9772-a2e9d7f3bcff","resolution":{"observed_at":"2026-08-02T09:27:47.549018Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.14507","last_updated":"2024-08-27T17:19:20Z","snapshot_observed_at":"2026-08-16T13:41:01.607270Z","submitted_at":"2024-06-20T17:12:20Z","title":"On Newton's Method to Unlearn Neural Networks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.14507","snapshot_observed_at":"2026-08-02T09:27:47.551517Z","title":"arXiv preprint arXiv:2406.14507 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.22665","last_updated":"2026-06-30T05:52:32Z","snapshot_observed_at":"2026-08-17T15:18:30.906141Z","submitted_at":"2026-06-30T05:52:32Z","title":"Obliviate: Efficient Unlearning in Recommender Systems","version":1},"reference_index":105,"source":"arxiv_source","source_observed_at":"2026-08-02T09:27:47.551517Z"},"links":{"cited_paper":"/paper/2406.14507","citing_paper":"/paper/2607.22665"},"observation_digest":"sha256:1adb929b6b1dbfbfd13b093d62a5878d81101127f6c073ad6fcbf99627af2f96","observation_id":"4cc14a7f-452f-4027-83ee-cdd9d54580c2","resolution":{"observed_at":"2026-08-02T09:27:47.551517Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T09:27:47.554185Z","title":"Advances in Neural Information Processing Systems , volume=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.22665","last_updated":"2026-06-30T05:52:32Z","snapshot_observed_at":"2026-08-17T15:18:30.906141Z","submitted_at":"2026-06-30T05:52:32Z","title":"Obliviate: Efficient Unlearning in Recommender Systems","version":1},"reference_index":106,"source":"arxiv_source","source_observed_at":"2026-08-02T09:27:47.554185Z"},"links":{"citing_paper":"/paper/2607.22665"},"observation_digest":"sha256:61126309d8d8f2d1c599d349c73fdd1b1370c733c210ca7fdfb542a19a99ddd4","observation_id":"4c167e6c-440b-4d06-99e2-fb41b3a5e87c","resolution":{"observed_at":"2026-08-02T09:27:47.554185Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.22665","last_updated":"2026-06-30T05:52:32Z","latest_version":1,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-17T15:18:30.906141Z","submitted_at":"2026-06-30T05:52:32Z","title":"Obliviate: Efficient Unlearning in Recommender Systems"},"reference_resolution":{"displayed":100,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":100,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":107},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 100 of 107 outbound references and 0 inbound Pith citation observations for arXiv:2607.22665."}