{"as_of":"2026-08-20T01:09:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:bfcf1450b1b1f2fcef44b466a702045f4aa757f97255db5e39f10ecd7c3ae306","coverage":[{"denominator":31,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":31,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T21:05:37.016625Z","state":"measured"},{"denominator":31,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":31,"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/2411.09181/citation-record","integrity":"/paper/2411.09181/integrity","json":"/paper/2411.09181/citation-record.json","paper":"/paper/2411.09181"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T21:05:37.600681Z","title":"Tempora l graph neural net- works for social recommendation","venue":null,"work_id":"0a62a52f-cd0c-445a-ab2e-de94476dbb57","year":2020},"citing_paper":{"arxiv_id":"2411.09181","last_updated":"2024-11-14T04:39:30Z","snapshot_observed_at":"2026-08-14T00:46:50.995195Z","submitted_at":"2024-11-14T04:39:30Z","title":"DeBaTeR: Denoising Bipartite Temporal Graph for Recommendation","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-12T21:05:36.851177Z"},"links":{"citing_paper":"/paper/2411.09181"},"observation_digest":"sha256:3a4fddf3c0490d75f6f4da77d949c60d138a19d87202878e765089715f9543b5","observation_id":"b025177b-da5b-4764-8327-50fb3afe63a0","resolution":{"observed_at":"2026-08-12T21:05:37.606251Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T21:05:37.584883Z","title":"Continuous-time sequential recommendation with temporal graph collabora- tive transformer","venue":null,"work_id":"5e334545-3858-46df-b846-c6aed641bea8","year":2021},"citing_paper":{"arxiv_id":"2411.09181","last_updated":"2024-11-14T04:39:30Z","snapshot_observed_at":"2026-08-14T00:46:50.995195Z","submitted_at":"2024-11-14T04:39:30Z","title":"DeBaTeR: Denoising Bipartite Temporal Graph for Recommendation","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-12T21:05:36.856782Z"},"links":{"citing_paper":"/paper/2411.09181"},"observation_digest":"sha256:500ca0e3181ae53c0fa97b9033415f6acb1756832acc532662b0c28c80e2b61c","observation_id":"ea5071e4-4c13-48b4-a3ef-898452f2d057","resolution":{"observed_at":"2026-08-12T21:05:37.590083Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T21:05:37.567877Z","title":"Poisoning attacks to graph-based recommender systems","venue":null,"work_id":"36caf3b7-e239-4efa-997f-48793bae80c4","year":2018},"citing_paper":{"arxiv_id":"2411.09181","last_updated":"2024-11-14T04:39:30Z","snapshot_observed_at":"2026-08-14T00:46:50.995195Z","submitted_at":"2024-11-14T04:39:30Z","title":"DeBaTeR: Denoising Bipartite Temporal Graph for Recommendation","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-12T21:05:36.861699Z"},"links":{"citing_paper":"/paper/2411.09181"},"observation_digest":"sha256:b1914c2b1d8096dca651f157cba1825efee9db087067312d85aeace6a1b202b0","observation_id":"56f603df-ea6e-444b-8f9c-d2fa3f87410f","resolution":{"observed_at":"2026-08-12T21:05:37.573106Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T21:05:37.550746Z","title":"Personalized ranking for non-uniformly sampled it ems","venue":null,"work_id":"31ce8ddd-ed09-4752-9300-188efc8ca71a","year":2011},"citing_paper":{"arxiv_id":"2411.09181","last_updated":"2024-11-14T04:39:30Z","snapshot_observed_at":"2026-08-14T00:46:50.995195Z","submitted_at":"2024-11-14T04:39:30Z","title":"DeBaTeR: Denoising Bipartite Temporal Graph for Recommendation","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-12T21:05:36.866918Z"},"links":{"citing_paper":"/paper/2411.09181"},"observation_digest":"sha256:108bda3d72ca2881a0cd329cf984c68df839a069c60c1b0a19448388323eeea9","observation_id":"067e3dc7-4242-47cb-9e20-0a4acddc3d1d","resolution":{"observed_at":"2026-08-12T21:05:37.556252Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T21:05:37.532883Z","title":"Self-guided learning to denoise for robust recom mendation","venue":null,"work_id":"e935fcad-2504-452e-a9f7-94d0a4156090","year":2022},"citing_paper":{"arxiv_id":"2411.09181","last_updated":"2024-11-14T04:39:30Z","snapshot_observed_at":"2026-08-14T00:46:50.995195Z","submitted_at":"2024-11-14T04:39:30Z","title":"DeBaTeR: Denoising Bipartite Temporal Graph for Recommendation","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-12T21:05:36.872327Z"},"links":{"citing_paper":"/paper/2411.09181"},"observation_digest":"sha256:73df7d7bd2e1e530c1c02b8bd1725e8cd958724f6cc01057f151205bf75f2aff","observation_id":"95e8d9a0-4bb8-4c5a-97b2-3826e1bef403","resolution":{"observed_at":"2026-08-12T21:05:37.539145Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T21:05:37.516275Z","title":"Maxwell Harper and Joseph A","venue":null,"work_id":"fa99160f-e98f-42df-80bc-e6f163a7f338","year":2015},"citing_paper":{"arxiv_id":"2411.09181","last_updated":"2024-11-14T04:39:30Z","snapshot_observed_at":"2026-08-14T00:46:50.995195Z","submitted_at":"2024-11-14T04:39:30Z","title":"DeBaTeR: Denoising Bipartite Temporal Graph for Recommendation","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-12T21:05:36.877389Z"},"links":{"citing_paper":"/paper/2411.09181"},"observation_digest":"sha256:6c5249ab3f02951499ab5086bfc205fdad97528f73783761dfd88ba83f74da2a","observation_id":"95efa466-4d73-464c-829f-d9561d8baf10","resolution":{"observed_at":"2026-08-12T21:05:37.521336Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T21:05:37.500431Z","title":"Lightgcn: Simplifying and powering graph convolutio n network for rec- ommendation","venue":null,"work_id":"8279e3ae-af15-4bb9-9100-bb15798dc892","year":2020},"citing_paper":{"arxiv_id":"2411.09181","last_updated":"2024-11-14T04:39:30Z","snapshot_observed_at":"2026-08-14T00:46:50.995195Z","submitted_at":"2024-11-14T04:39:30Z","title":"DeBaTeR: Denoising Bipartite Temporal Graph for Recommendation","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-12T21:05:36.888144Z"},"links":{"citing_paper":"/paper/2411.09181"},"observation_digest":"sha256:28c27828cf111ae3c5014ac67c10e32b9670c4c0df3c929e3893af1f27bdcecc","observation_id":"c8d3f475-3e64-4524-b269-f27aff7714a3","resolution":{"observed_at":"2026-08-12T21:05:37.505454Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T21:05:37.480815Z","title":"Neural collaborative filtering","venue":null,"work_id":"54b4aa8d-603b-4e83-b717-f0126a21a37f","year":2017},"citing_paper":{"arxiv_id":"2411.09181","last_updated":"2024-11-14T04:39:30Z","snapshot_observed_at":"2026-08-14T00:46:50.995195Z","submitted_at":"2024-11-14T04:39:30Z","title":"DeBaTeR: Denoising Bipartite Temporal Graph for Recommendation","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-12T21:05:36.893093Z"},"links":{"citing_paper":"/paper/2411.09181"},"observation_digest":"sha256:779d7a719e5362a300cba829d34f94e720c8ec3c4f9e20ed99db35e3c5499f53","observation_id":"96da17da-7de8-4e41-b314-dff9e9fbd9b0","resolution":{"observed_at":"2026-08-12T21:05:37.487358Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T21:05:37.462480Z","title":"Self-attentive se quential recommenda- tion","venue":null,"work_id":"0559c013-cacd-4393-a922-897f7a51f7e8","year":2018},"citing_paper":{"arxiv_id":"2411.09181","last_updated":"2024-11-14T04:39:30Z","snapshot_observed_at":"2026-08-14T00:46:50.995195Z","submitted_at":"2024-11-14T04:39:30Z","title":"DeBaTeR: Denoising Bipartite Temporal Graph for Recommendation","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-12T21:05:36.897924Z"},"links":{"citing_paper":"/paper/2411.09181"},"observation_digest":"sha256:16870ddbf3737c2769607a8e126fb8402c3580317f084d293a4bc5cb4b73799a","observation_id":"b9f05c96-a6fa-47ec-8c4e-9bdd6a2c63e1","resolution":{"observed_at":"2026-08-12T21:05:37.467834Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T21:05:37.445747Z","title":"Shilling attack models i n recommender system","venue":null,"work_id":"26633cba-054d-4241-8c24-f20a60bcf476","year":2016},"citing_paper":{"arxiv_id":"2411.09181","last_updated":"2024-11-14T04:39:30Z","snapshot_observed_at":"2026-08-14T00:46:50.995195Z","submitted_at":"2024-11-14T04:39:30Z","title":"DeBaTeR: Denoising Bipartite Temporal Graph for Recommendation","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-12T21:05:36.903403Z"},"links":{"citing_paper":"/paper/2411.09181"},"observation_digest":"sha256:66d84ecf1fe5a44f1795e9e6122e131512fe73f23e6f95672cf05f6a2ecac4e5","observation_id":"47321649-cd2b-412c-81bb-8e73f0a3276b","resolution":{"observed_at":"2026-08-12T21:05:37.450875Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1907.05321","last_updated":"2019-07-11T15:47:39Z","snapshot_observed_at":"2026-08-10T23:34:04.708798Z","submitted_at":"2019-07-11T15:47:39Z","title":"Time2Vec: Learning a Vector Representation of Time","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1907.05321","snapshot_observed_at":"2026-08-12T21:05:36.908876Z","title":"Time2vec: Learning a vector representation of ti me","venue":null,"work_id":null,"year":1907},"citing_paper":{"arxiv_id":"2411.09181","last_updated":"2024-11-14T04:39:30Z","snapshot_observed_at":"2026-08-14T00:46:50.995195Z","submitted_at":"2024-11-14T04:39:30Z","title":"DeBaTeR: Denoising Bipartite Temporal Graph for Recommendation","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-12T21:05:36.908876Z"},"links":{"cited_paper":"/paper/1907.05321","citing_paper":"/paper/2411.09181"},"observation_digest":"sha256:6eeef235b25b36d001d044ec17c0168843118341720e9f735b0832bcb45138b5","observation_id":"3b50afb3-0c0c-41ae-ac6b-b04aacd589fa","resolution":{"observed_at":"2026-08-12T21:05:36.908876Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T21:05:37.428615Z","title":"Improving graph collaborative filtering with neighborhood-enriched contrastive learning","venue":null,"work_id":"7ca80c9c-9225-4eef-99c5-88946a96d8ad","year":2022},"citing_paper":{"arxiv_id":"2411.09181","last_updated":"2024-11-14T04:39:30Z","snapshot_observed_at":"2026-08-14T00:46:50.995195Z","submitted_at":"2024-11-14T04:39:30Z","title":"DeBaTeR: Denoising Bipartite Temporal Graph for Recommendation","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-12T21:05:36.914668Z"},"links":{"citing_paper":"/paper/2411.09181"},"observation_digest":"sha256:c39e6ec321b8d6d7d398b60b0382bd71ded294d3b3b602a85530d1284f8976b4","observation_id":"8543e442-30a9-4df2-8ef4-b268b5afd742","resolution":{"observed_at":"2026-08-12T21:05:37.434302Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T21:05:37.410065Z","title":"Rec- ommender system application developments: a survey","venue":null,"work_id":"8cd65821-d1c5-4db7-a2d4-47b40a8916d2","year":2015},"citing_paper":{"arxiv_id":"2411.09181","last_updated":"2024-11-14T04:39:30Z","snapshot_observed_at":"2026-08-14T00:46:50.995195Z","submitted_at":"2024-11-14T04:39:30Z","title":"DeBaTeR: Denoising Bipartite Temporal Graph for Recommendation","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-12T21:05:36.919447Z"},"links":{"citing_paper":"/paper/2411.09181"},"observation_digest":"sha256:e31ccb591388856196ad1de8e74d9f85ad18f9f4cced31b977bf18498a527713","observation_id":"903be68a-abd4-4b01-bb8c-4475a9a9213a","resolution":{"observed_at":"2026-08-12T21:05:37.415720Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T21:05:37.392534Z","title":"Justifying recommendations using distantly-labeled reviews and fine-grained aspects","venue":null,"work_id":"f32cafbe-7791-4413-9ff3-cd9f79b0b81e","year":2019},"citing_paper":{"arxiv_id":"2411.09181","last_updated":"2024-11-14T04:39:30Z","snapshot_observed_at":"2026-08-14T00:46:50.995195Z","submitted_at":"2024-11-14T04:39:30Z","title":"DeBaTeR: Denoising Bipartite Temporal Graph for Recommendation","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-12T21:05:36.924664Z"},"links":{"citing_paper":"/paper/2411.09181"},"observation_digest":"sha256:67e0bb1b9dfb80b3b94af4fb80443b67a02f207bd188df548dbf662fb16fa264","observation_id":"50011a25-a666-480d-99e9-2a6b6b35ea34","resolution":{"observed_at":"2026-08-12T21:05:37.397642Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T21:05:37.376190Z","title":"Effective and effic ient training for se- quential recommendation using recency sampling","venue":null,"work_id":"47405284-fc62-4aa3-80f7-01eb733e1a95","year":2022},"citing_paper":{"arxiv_id":"2411.09181","last_updated":"2024-11-14T04:39:30Z","snapshot_observed_at":"2026-08-14T00:46:50.995195Z","submitted_at":"2024-11-14T04:39:30Z","title":"DeBaTeR: Denoising Bipartite Temporal Graph for Recommendation","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-12T21:05:36.929511Z"},"links":{"citing_paper":"/paper/2411.09181"},"observation_digest":"sha256:6878a2b44e962fb7a0c1583a41d1271b65ac730272472f5ba598dd95e4f5e199","observation_id":"a1e2f56f-8ba1-4f37-b7d6-ad020e908f1d","resolution":{"observed_at":"2026-08-12T21:05:37.381354Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T21:05:37.360686Z","title":"Incorpo rating time in se- quential recommendation models","venue":null,"work_id":"c916bea4-0c38-40c2-a2a3-105a9cb27bec","year":2023},"citing_paper":{"arxiv_id":"2411.09181","last_updated":"2024-11-14T04:39:30Z","snapshot_observed_at":"2026-08-14T00:46:50.995195Z","submitted_at":"2024-11-14T04:39:30Z","title":"DeBaTeR: Denoising Bipartite Temporal Graph for Recommendation","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-12T21:05:36.934830Z"},"links":{"citing_paper":"/paper/2411.09181"},"observation_digest":"sha256:e4b919d866c381e5ddf4cbe5bb3ae4e08b08e671ad3acf656585bf9c8e46604d","observation_id":"85ca0aec-5078-443f-9a38-c270c74f18cd","resolution":{"observed_at":"2026-08-12T21:05:37.365702Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T21:05:37.343218Z","title":"Bpr: Bayesian personalized ranking from implicit f eedback","venue":null,"work_id":"e374920f-d0d6-4b92-8f26-590005b98e68","year":2009},"citing_paper":{"arxiv_id":"2411.09181","last_updated":"2024-11-14T04:39:30Z","snapshot_observed_at":"2026-08-14T00:46:50.995195Z","submitted_at":"2024-11-14T04:39:30Z","title":"DeBaTeR: Denoising Bipartite Temporal Graph for Recommendation","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-12T21:05:36.939695Z"},"links":{"citing_paper":"/paper/2411.09181"},"observation_digest":"sha256:5d5e3c8f332f7bfa6dfde13368c8ced958187441859587745cd4242bb7e18873","observation_id":"c2e897c8-2c52-45cf-b341-bf601b47a016","resolution":{"observed_at":"2026-08-12T21:05:37.348742Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T21:05:37.326511Z","title":"Bert4rec: Sequential recommendation with bidirectional e ncoder representa- tions from transformer","venue":null,"work_id":"75331a44-fa7d-431f-a71a-01777c9ef18e","year":2019},"citing_paper":{"arxiv_id":"2411.09181","last_updated":"2024-11-14T04:39:30Z","snapshot_observed_at":"2026-08-14T00:46:50.995195Z","submitted_at":"2024-11-14T04:39:30Z","title":"DeBaTeR: Denoising Bipartite Temporal Graph for Recommendation","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-12T21:05:36.944696Z"},"links":{"citing_paper":"/paper/2411.09181"},"observation_digest":"sha256:47434059e4c1ac4b1579bd70f0c8f8febb6e8b6eed06d1e761161ab66e677f6d","observation_id":"90dfefe3-0375-4d3d-b79c-c4841eaae03a","resolution":{"observed_at":"2026-08-12T21:05:37.331635Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T21:05:37.309699Z","title":"Learning to denoise unreliable interactions for graph coll aborative filtering","venue":null,"work_id":"47f50e85-0940-43dc-8bae-8329cc16b31e","year":2022},"citing_paper":{"arxiv_id":"2411.09181","last_updated":"2024-11-14T04:39:30Z","snapshot_observed_at":"2026-08-14T00:46:50.995195Z","submitted_at":"2024-11-14T04:39:30Z","title":"DeBaTeR: Denoising Bipartite Temporal Graph for Recommendation","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-12T21:05:36.949637Z"},"links":{"citing_paper":"/paper/2411.09181"},"observation_digest":"sha256:f2869f8bc6a785f602625bb83fa710abc52b683ec5e1cdc7b5f5b5f630251e19","observation_id":"1208f86b-9c2b-46be-8788-b141efa322c7","resolution":{"observed_at":"2026-08-12T21:05:37.315169Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T21:05:37.291862Z","title":"Towards representation alignment and uniformity in collaborative filtering","venue":null,"work_id":"7a744b3c-63a0-4956-9326-a2fde7f34e98","year":2022},"citing_paper":{"arxiv_id":"2411.09181","last_updated":"2024-11-14T04:39:30Z","snapshot_observed_at":"2026-08-14T00:46:50.995195Z","submitted_at":"2024-11-14T04:39:30Z","title":"DeBaTeR: Denoising Bipartite Temporal Graph for Recommendation","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-12T21:05:36.960902Z"},"links":{"citing_paper":"/paper/2411.09181"},"observation_digest":"sha256:1ba265730e246348ec67b61ef221b99a557b71e7c11d14632b5d7ce62318a9cb","observation_id":"cc476d01-e46b-45da-a165-a497ce64bde3","resolution":{"observed_at":"2026-08-12T21:05:37.297058Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T21:05:37.272083Z","title":"De- noising implicit feedback for recommendation","venue":null,"work_id":"9fa30b1a-7dca-430a-9827-bb7ff5e287aa","year":2021},"citing_paper":{"arxiv_id":"2411.09181","last_updated":"2024-11-14T04:39:30Z","snapshot_observed_at":"2026-08-14T00:46:50.995195Z","submitted_at":"2024-11-14T04:39:30Z","title":"DeBaTeR: Denoising Bipartite Temporal Graph for Recommendation","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-12T21:05:36.965438Z"},"links":{"citing_paper":"/paper/2411.09181"},"observation_digest":"sha256:35aeb5da42a52d2431466e446c1e8abaf1364d8bf3e1dcc699b897d10422e578","observation_id":"969e0239-415f-40c8-918c-59fba41141b5","resolution":{"observed_at":"2026-08-12T21:05:37.279848Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T21:05:37.255388Z","title":"Learning robust recommenders through cross-model agreement","venue":null,"work_id":"ad751550-f51c-4a8a-b543-36f4449c0112","year":2022},"citing_paper":{"arxiv_id":"2411.09181","last_updated":"2024-11-14T04:39:30Z","snapshot_observed_at":"2026-08-14T00:46:50.995195Z","submitted_at":"2024-11-14T04:39:30Z","title":"DeBaTeR: Denoising Bipartite Temporal Graph for Recommendation","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-12T21:05:36.970331Z"},"links":{"citing_paper":"/paper/2411.09181"},"observation_digest":"sha256:f7ea89e04fe54f886d7e46cba470850ab7186fec9080af2c74c25f64eb22c893","observation_id":"11fcc6e0-f4d4-4611-a344-141d9833a340","resolution":{"observed_at":"2026-08-12T21:05:37.260560Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T21:05:37.236804Z","title":"Implicit feedbacks are not always favorable: Iterative rel abeled one-class col- laborative filtering against noisy interactions","venue":null,"work_id":"77503131-abe6-4066-b020-2b35edcde786","year":2021},"citing_paper":{"arxiv_id":"2411.09181","last_updated":"2024-11-14T04:39:30Z","snapshot_observed_at":"2026-08-14T00:46:50.995195Z","submitted_at":"2024-11-14T04:39:30Z","title":"DeBaTeR: Denoising Bipartite Temporal Graph for Recommendation","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-12T21:05:36.975099Z"},"links":{"citing_paper":"/paper/2411.09181"},"observation_digest":"sha256:2212015a09265bce8d7dfbbef98e3bc53965b6c3ce2cad4f900c1513f7113a9b","observation_id":"05664668-f5d9-4a8a-8e29-4a816a2a5c19","resolution":{"observed_at":"2026-08-12T21:05:37.243458Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T21:05:37.217689Z","title":"Efficient bi-level optimization for recommendation denoisi ng","venue":null,"work_id":"44ae6080-df45-4037-981e-881c789c1172","year":2023},"citing_paper":{"arxiv_id":"2411.09181","last_updated":"2024-11-14T04:39:30Z","snapshot_observed_at":"2026-08-14T00:46:50.995195Z","submitted_at":"2024-11-14T04:39:30Z","title":"DeBaTeR: Denoising Bipartite Temporal Graph for Recommendation","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-12T21:05:36.979928Z"},"links":{"citing_paper":"/paper/2411.09181"},"observation_digest":"sha256:d13a6955cad8cfffa864aa834f367e33ce56d2a4b5dbf5754a581ed8eee0d361","observation_id":"641db7b1-2725-4ce7-9c52-d187ac99066f","resolution":{"observed_at":"2026-08-12T21:05:37.224371Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T21:05:37.196497Z","title":"Self-supervised graph learning for recommend ation","venue":null,"work_id":"324eb67e-85d1-42ce-ab08-f69ee141e109","year":2021},"citing_paper":{"arxiv_id":"2411.09181","last_updated":"2024-11-14T04:39:30Z","snapshot_observed_at":"2026-08-14T00:46:50.995195Z","submitted_at":"2024-11-14T04:39:30Z","title":"DeBaTeR: Denoising Bipartite Temporal Graph for Recommendation","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-12T21:05:36.984772Z"},"links":{"citing_paper":"/paper/2411.09181"},"observation_digest":"sha256:bcf259b8bfaee23d1bb7d4b394c89f3ceb7fa4120ceb273178f35b3e162fcc4e","observation_id":"f4f54e48-804e-4adf-8c13-aebc9449a5f5","resolution":{"observed_at":"2026-08-12T21:05:37.203927Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T21:05:37.173597Z","title":"Contrastive learning for sequential recommendation","venue":null,"work_id":"817a9402-7f00-43b6-9443-a6e762c5d120","year":2022},"citing_paper":{"arxiv_id":"2411.09181","last_updated":"2024-11-14T04:39:30Z","snapshot_observed_at":"2026-08-14T00:46:50.995195Z","submitted_at":"2024-11-14T04:39:30Z","title":"DeBaTeR: Denoising Bipartite Temporal Graph for Recommendation","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-12T21:05:36.990493Z"},"links":{"citing_paper":"/paper/2411.09181"},"observation_digest":"sha256:ae7cb3189d635ce4e9346250957e9fb397031feba91291b036c2bc94ea8fe140","observation_id":"0dc5934a-9c2b-4d1e-8e4d-49f34cceb2b8","resolution":{"observed_at":"2026-08-12T21:05:37.179881Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T21:05:37.155171Z","title":"Toward s robust neural graph collaborative filtering via structure denoising and e mbedding perturba- tion","venue":null,"work_id":"1cbf9e6f-e704-4c53-bfe3-a5da0f70a63d","year":2023},"citing_paper":{"arxiv_id":"2411.09181","last_updated":"2024-11-14T04:39:30Z","snapshot_observed_at":"2026-08-14T00:46:50.995195Z","submitted_at":"2024-11-14T04:39:30Z","title":"DeBaTeR: Denoising Bipartite Temporal Graph for Recommendation","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-12T21:05:36.995592Z"},"links":{"citing_paper":"/paper/2411.09181"},"observation_digest":"sha256:111664f14e6e81bafca663772cb043b5874aa4f9520a5f8dc59e52b746edffdb","observation_id":"28bb936e-9ed6-4a14-b9d3-31ee3c08063c","resolution":{"observed_at":"2026-08-12T21:05:37.160738Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T21:05:37.137001Z","title":"Are graph augmentations necessary? simple graph co ntrastive learn- ing for recommendation","venue":null,"work_id":"5fbc112e-fe9f-4670-abba-0a6569c53800","year":2022},"citing_paper":{"arxiv_id":"2411.09181","last_updated":"2024-11-14T04:39:30Z","snapshot_observed_at":"2026-08-14T00:46:50.995195Z","submitted_at":"2024-11-14T04:39:30Z","title":"DeBaTeR: Denoising Bipartite Temporal Graph for Recommendation","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-12T21:05:37.000455Z"},"links":{"citing_paper":"/paper/2411.09181"},"observation_digest":"sha256:03cf6b17ae13a43817e61effea76a74e70cb02665ef08c9f56aa6898850c292c","observation_id":"1f3ee1c6-4df7-4f5e-8ef3-63e398424194","resolution":{"observed_at":"2026-08-12T21:05:37.142793Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T21:05:37.118804Z","title":"Self- supervised learning for recommender systems: A survey","venue":null,"work_id":"8bafcb47-9e22-4a23-a33d-6769175cfb6b","year":2023},"citing_paper":{"arxiv_id":"2411.09181","last_updated":"2024-11-14T04:39:30Z","snapshot_observed_at":"2026-08-14T00:46:50.995195Z","submitted_at":"2024-11-14T04:39:30Z","title":"DeBaTeR: Denoising Bipartite Temporal Graph for Recommendation","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-12T21:05:37.005354Z"},"links":{"citing_paper":"/paper/2411.09181"},"observation_digest":"sha256:d08b4a7366978c44ab773678409ecb35fef61eecae8af43b7335151c5290b143","observation_id":"dd08a1ff-b8a1-4059-a98d-80a86dbf8ae4","resolution":{"observed_at":"2026-08-12T21:05:37.125057Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T21:05:37.097966Z","title":"Data poisoning attack against recommender sys tem using incom- plete and perturbed data","venue":null,"work_id":"d33d3139-d864-4f91-989a-a130dab7da3b","year":2021},"citing_paper":{"arxiv_id":"2411.09181","last_updated":"2024-11-14T04:39:30Z","snapshot_observed_at":"2026-08-14T00:46:50.995195Z","submitted_at":"2024-11-14T04:39:30Z","title":"DeBaTeR: Denoising Bipartite Temporal Graph for Recommendation","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-12T21:05:37.011540Z"},"links":{"citing_paper":"/paper/2411.09181"},"observation_digest":"sha256:851e210f18f4590d754cb9ed81e57acfcff312f524776de4032e047bc4d6c2aa","observation_id":"7361025d-1d5e-4f5e-8dfe-c1b50cd3631b","resolution":{"observed_at":"2026-08-12T21:05:37.105725Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2309.02057","last_updated":"2025-04-01T07:33:46Z","snapshot_observed_at":"2026-08-19T00:00:12.856008Z","submitted_at":"2023-09-05T08:58:46Z","title":"Robust Recommender System: A Survey and Future Directions","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.02057","snapshot_observed_at":"2026-08-12T21:05:37.016625Z","title":"Robust recommender system: A survey and future directions","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2411.09181","last_updated":"2024-11-14T04:39:30Z","snapshot_observed_at":"2026-08-14T00:46:50.995195Z","submitted_at":"2024-11-14T04:39:30Z","title":"DeBaTeR: Denoising Bipartite Temporal Graph for Recommendation","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-12T21:05:37.016625Z"},"links":{"cited_paper":"/paper/2309.02057","citing_paper":"/paper/2411.09181"},"observation_digest":"sha256:0bf60000eaad16b1ad0bb775898ae589bdac1fffcf118eb60c2d78d9d4c900f6","observation_id":"d1f57adb-0f34-4616-9213-707f0a18188f","resolution":{"observed_at":"2026-08-12T21:05:37.016625Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2411.09181","last_updated":"2024-11-14T04:39:30Z","latest_version":1,"primary_category":"cs.IR","snapshot_observed_at":"2026-08-14T00:46:50.995195Z","submitted_at":"2024-11-14T04:39:30Z","title":"DeBaTeR: Denoising Bipartite Temporal Graph for Recommendation"},"reference_resolution":{"displayed":31,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":2,"verified_exact":0,"verified_fuzzy":29},"total_outbound_references":31},"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 20 August 2026, this Paper Citation Record lists 31 of 31 outbound references and 0 inbound Pith citation observations for arXiv:2411.09181."}