{"as_of":"2026-08-06T12:26:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:714795869e28af19387d246ce139d307b11a992ba5057117dc41ce6a125ef885","coverage":[{"denominator":52,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":52,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-11T01:02:46.958164Z","state":"measured"},{"denominator":52,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":52,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-06T06:34:29.942622+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/2605.07125/citation-record","integrity":"/paper/2605.07125/integrity","json":"/paper/2605.07125/citation-record.json","paper":"/paper/2605.07125"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"A survey of sequential recommendation systems: Techniques, evaluation, and future directions.Information Systems, 125:102427","venue":null,"work_id":"27a02783-1971-490d-becb-235c4b3d3ab9","year":2024},"citing_paper":{"arxiv_id":"2605.07125","last_updated":"2026-05-08T02:00:11Z","snapshot_observed_at":"2026-07-30T06:31:58.184575Z","submitted_at":"2026-05-08T02:00:11Z","title":"An Embarrassingly Simple Graph Heuristic Reveals Shortcut-Solvable Benchmarks for Sequential Recommendation","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-11T01:02:46.958164Z"},"links":{"citing_paper":"/paper/2605.07125"},"observation_digest":"sha256:7a173a74086ba2f9710fd54f8b52e3717b894ad8516ecdc1618c6bdd569ed769","observation_id":"06ae0e52-41fc-48fc-a695-2176db7abbfd","resolution":{"observed_at":"2026-05-16T00:30:27.888881Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"A survey on sequential recommendation.Frontiers of Computer Science, 20(3):2003606","venue":null,"work_id":"b97ed42e-edad-4723-8a7b-b4271da13c7f","year":2026},"citing_paper":{"arxiv_id":"2605.07125","last_updated":"2026-05-08T02:00:11Z","snapshot_observed_at":"2026-07-30T06:31:58.184575Z","submitted_at":"2026-05-08T02:00:11Z","title":"An Embarrassingly Simple Graph Heuristic Reveals Shortcut-Solvable Benchmarks for Sequential Recommendation","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-11T01:02:46.958164Z"},"links":{"citing_paper":"/paper/2605.07125"},"observation_digest":"sha256:dbd927d6e7e034cb0becb35d8a5ccf842244778e25c7cce0653bb474aa4a067f","observation_id":"4672f093-533b-48e9-9862-95d27cceb59f","resolution":{"observed_at":"2026-05-16T00:30:27.902549Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Deep learning for sequential recommendation: Algorithms, influential factors, and evaluations.ACM Transactions on Information Systems (TOIS), 39(1):1–42","venue":null,"work_id":"f98aa1ab-2cc5-4fdb-b615-0679af75b336","year":2020},"citing_paper":{"arxiv_id":"2605.07125","last_updated":"2026-05-08T02:00:11Z","snapshot_observed_at":"2026-07-30T06:31:58.184575Z","submitted_at":"2026-05-08T02:00:11Z","title":"An Embarrassingly Simple Graph Heuristic Reveals Shortcut-Solvable Benchmarks for Sequential Recommendation","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-11T01:02:46.958164Z"},"links":{"citing_paper":"/paper/2605.07125"},"observation_digest":"sha256:ed10230ca595341d0b5bad4bf5765ca5c1776885829546c6e2f80d303f6909a8","observation_id":"ff5e5717-9333-411a-a31d-6b5aca5f6e0e","resolution":{"observed_at":"2026-05-16T00:30:27.906163Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Collaborative filtering recommender systems.Foundations and Trends® in Human–Computer Interaction, 4(2):81–173","venue":null,"work_id":"61ee19ab-4c96-47fb-9714-7683c25530ca","year":2011},"citing_paper":{"arxiv_id":"2605.07125","last_updated":"2026-05-08T02:00:11Z","snapshot_observed_at":"2026-07-30T06:31:58.184575Z","submitted_at":"2026-05-08T02:00:11Z","title":"An Embarrassingly Simple Graph Heuristic Reveals Shortcut-Solvable Benchmarks for Sequential Recommendation","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-11T01:02:46.958164Z"},"links":{"citing_paper":"/paper/2605.07125"},"observation_digest":"sha256:567f6a388e9d7cb22d4f202bfdf03d267ec5c3ceb2080f240dde0aa22c33ca72","observation_id":"415c6b0d-b55e-4228-9a2b-4ee2ade6d815","resolution":{"observed_at":"2026-05-16T00:30:27.884088Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Collaborative filtering for implicit feedback datasets","venue":null,"work_id":"f011edd4-23b9-43a1-8f79-005aae9bc75a","year":2008},"citing_paper":{"arxiv_id":"2605.07125","last_updated":"2026-05-08T02:00:11Z","snapshot_observed_at":"2026-07-30T06:31:58.184575Z","submitted_at":"2026-05-08T02:00:11Z","title":"An Embarrassingly Simple Graph Heuristic Reveals Shortcut-Solvable Benchmarks for Sequential Recommendation","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-11T01:02:46.958164Z"},"links":{"citing_paper":"/paper/2605.07125"},"observation_digest":"sha256:84b4d8bdf28e5fac45ebe964a2d6a69f267611ce1d53fcd1877a8e1414969635","observation_id":"b1a6f082-40f3-4538-a7c9-b6a0648b2cd7","resolution":{"observed_at":"2026-05-16T00:30:27.920403Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Translation-based recommendation","venue":null,"work_id":"97e860d2-be0e-4c27-bbc2-1c2a97216a83","year":2017},"citing_paper":{"arxiv_id":"2605.07125","last_updated":"2026-05-08T02:00:11Z","snapshot_observed_at":"2026-07-30T06:31:58.184575Z","submitted_at":"2026-05-08T02:00:11Z","title":"An Embarrassingly Simple Graph Heuristic Reveals Shortcut-Solvable Benchmarks for Sequential Recommendation","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-11T01:02:46.958164Z"},"links":{"citing_paper":"/paper/2605.07125"},"observation_digest":"sha256:d9687e5a5600bbbc3ee0fcec9c17181edb84c7558edda796a6ec6a47af8b9f8e","observation_id":"3f33f490-6f62-423c-94ed-ceaf669766ba","resolution":{"observed_at":"2026-05-16T00:30:27.907630Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1511.06939","last_updated":"2016-03-29T14:52:58Z","snapshot_observed_at":"2026-07-31T19:00:00.136727Z","submitted_at":"2015-11-21T23:42:59Z","title":"Session-based Recommendations with Recurrent Neural Networks","version":4},"cited_work":{"arxiv_id":"1511.06939","doi":"10.48550/arxiv.1511.06939","metadata_source":"pith","pith_arxiv_id":"1511.06939","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Session-based Recommendations with Recurrent Neural Networks","venue":"cs.LG","work_id":"9d4b6587-2e21-4e80-9580-2f993ff7903f","year":2015},"citing_paper":{"arxiv_id":"2605.07125","last_updated":"2026-05-08T02:00:11Z","snapshot_observed_at":"2026-07-30T06:31:58.184575Z","submitted_at":"2026-05-08T02:00:11Z","title":"An Embarrassingly Simple Graph Heuristic Reveals Shortcut-Solvable Benchmarks for Sequential Recommendation","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-11T01:02:46.958164Z"},"links":{"cited_paper":"/paper/1511.06939","citing_paper":"/paper/2605.07125"},"observation_digest":"sha256:207ff3b16b4b9fe778f1e249d7625f80f0c51eb5af1f369d228b656f998404b4","observation_id":"17634589-26d2-4b94-a8b6-21a245250268","resolution":{"observed_at":"2026-05-11T21:09:40.489683Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Improved recurrent neural networks for session- based recommendations","venue":null,"work_id":"e50901c9-62ea-47ee-b2fb-d2ab39e29d57","year":2016},"citing_paper":{"arxiv_id":"2605.07125","last_updated":"2026-05-08T02:00:11Z","snapshot_observed_at":"2026-07-30T06:31:58.184575Z","submitted_at":"2026-05-08T02:00:11Z","title":"An Embarrassingly Simple Graph Heuristic Reveals Shortcut-Solvable Benchmarks for Sequential Recommendation","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-11T01:02:46.958164Z"},"links":{"citing_paper":"/paper/2605.07125"},"observation_digest":"sha256:caf66b8849720b82548c7848dd1ce8055a20214fa678b8d21f67bcef37b9c71e","observation_id":"3a855f6c-b0ff-4ad9-89c6-04e9d65856a1","resolution":{"observed_at":"2026-05-16T00:30:27.916651Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Lightgcn: Simplifying and powering graph convolution network for recommendation","venue":null,"work_id":"cbc02d7f-b3f8-4ebc-b1b7-0a25385ea848","year":2020},"citing_paper":{"arxiv_id":"2605.07125","last_updated":"2026-05-08T02:00:11Z","snapshot_observed_at":"2026-07-30T06:31:58.184575Z","submitted_at":"2026-05-08T02:00:11Z","title":"An Embarrassingly Simple Graph Heuristic Reveals Shortcut-Solvable Benchmarks for Sequential Recommendation","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-11T01:02:46.958164Z"},"links":{"citing_paper":"/paper/2605.07125"},"observation_digest":"sha256:90659f8bf04192deb0f940e7f3b2704f3482d0fb0ffadf64e946bdb50950802c","observation_id":"6e4ad207-9352-4c15-9c2f-d80d9ca0445a","resolution":{"observed_at":"2026-05-16T00:30:27.879179Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Session-based recommendation with graph neural networks","venue":null,"work_id":"72bae5a6-bd39-4d75-b4bb-d54769853d7c","year":2019},"citing_paper":{"arxiv_id":"2605.07125","last_updated":"2026-05-08T02:00:11Z","snapshot_observed_at":"2026-07-30T06:31:58.184575Z","submitted_at":"2026-05-08T02:00:11Z","title":"An Embarrassingly Simple Graph Heuristic Reveals Shortcut-Solvable Benchmarks for Sequential Recommendation","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-11T01:02:46.958164Z"},"links":{"citing_paper":"/paper/2605.07125"},"observation_digest":"sha256:0f57e55c88c503f0e192d65843b088801a65d326469b793520b08c5522153cba","observation_id":"f458d36b-a2b9-45d7-a201-e396b8f6884f","resolution":{"observed_at":"2026-05-16T00:30:27.901500Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Deep interest network for click-through rate prediction","venue":null,"work_id":"5bc12ab4-eb09-4d26-a97e-e18a848fb1f0","year":2018},"citing_paper":{"arxiv_id":"2605.07125","last_updated":"2026-05-08T02:00:11Z","snapshot_observed_at":"2026-07-30T06:31:58.184575Z","submitted_at":"2026-05-08T02:00:11Z","title":"An Embarrassingly Simple Graph Heuristic Reveals Shortcut-Solvable Benchmarks for Sequential Recommendation","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-11T01:02:46.958164Z"},"links":{"citing_paper":"/paper/2605.07125"},"observation_digest":"sha256:d9dcd53f1a42f447971d369f9061f3d4c9797bbff8ec45d9dc2b993c05e6296a","observation_id":"ab1e68c8-17e6-47e2-b738-43f3f7ab4a98","resolution":{"observed_at":"2026-05-16T00:30:27.912195Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Deep interest evolution network for click-through rate prediction","venue":null,"work_id":"eebc59e9-4185-47db-9ef3-58037214995f","year":2019},"citing_paper":{"arxiv_id":"2605.07125","last_updated":"2026-05-08T02:00:11Z","snapshot_observed_at":"2026-07-30T06:31:58.184575Z","submitted_at":"2026-05-08T02:00:11Z","title":"An Embarrassingly Simple Graph Heuristic Reveals Shortcut-Solvable Benchmarks for Sequential Recommendation","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-11T01:02:46.958164Z"},"links":{"citing_paper":"/paper/2605.07125"},"observation_digest":"sha256:a3afb25c430d681542cdfcaa72a761992e69afcf127cdd8493b6350eb6abaafb","observation_id":"bd021c30-5ee7-4e33-bcaf-2ae17596bec6","resolution":{"observed_at":"2026-05-16T00:30:27.827125Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-07-05T01:50:35.827116Z","title":"Recommender systems with generative retrieval.Advances in Neural Information Processing Systems, 36:10299–10315","venue":null,"work_id":"4a79f0c6-16e4-407d-8bac-50e39389fb33","year":2023},"citing_paper":{"arxiv_id":"2605.07125","last_updated":"2026-05-08T02:00:11Z","snapshot_observed_at":"2026-07-30T06:31:58.184575Z","submitted_at":"2026-05-08T02:00:11Z","title":"An Embarrassingly Simple Graph Heuristic Reveals Shortcut-Solvable Benchmarks for Sequential Recommendation","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-11T01:02:46.958164Z"},"links":{"citing_paper":"/paper/2605.07125"},"observation_digest":"sha256:43344723df3f91b5e459ed3a866b43ef8e1c4e4804ce19811e84402ccd1f4d1f","observation_id":"90c1bccb-f6ac-4c01-83d5-2fb9b0a09292","resolution":{"observed_at":"2026-05-16T00:30:27.823255Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-07-07T09:13:35.693785Z","title":"Learnable item tokenization for generative recommendation","venue":null,"work_id":"b0314429-092e-480e-853a-e1ba607fa3ff","year":2024},"citing_paper":{"arxiv_id":"2605.07125","last_updated":"2026-05-08T02:00:11Z","snapshot_observed_at":"2026-07-30T06:31:58.184575Z","submitted_at":"2026-05-08T02:00:11Z","title":"An Embarrassingly Simple Graph Heuristic Reveals Shortcut-Solvable Benchmarks for Sequential Recommendation","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-05-11T01:02:46.958164Z"},"links":{"citing_paper":"/paper/2605.07125"},"observation_digest":"sha256:0829ed0be1f0cabd0edbf5789913c7e6c7541900dd9c9cb45d31358af32e94cc","observation_id":"fc69000b-99b3-4ca1-b2e4-f775186b1bae","resolution":{"observed_at":"2026-05-16T00:30:27.874003Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.13581","last_updated":"2025-08-15T23:44:20Z","snapshot_observed_at":"2026-07-06T20:39:06.470648Z","submitted_at":"2025-02-19T09:45:29Z","title":"ActionPiece: Contextually Tokenizing Action Sequences for Generative Recommendation","version":3},"cited_work":{"arxiv_id":"2502.13581","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.13581","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Actionpiece: Contextually tokeniz- ing action sequences for generative recommendation","venue":null,"work_id":"2f83d746-aace-4e7a-b113-72265531d16d","year":2025},"citing_paper":{"arxiv_id":"2605.07125","last_updated":"2026-05-08T02:00:11Z","snapshot_observed_at":"2026-07-30T06:31:58.184575Z","submitted_at":"2026-05-08T02:00:11Z","title":"An Embarrassingly Simple Graph Heuristic Reveals Shortcut-Solvable Benchmarks for Sequential Recommendation","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-11T01:02:46.958164Z"},"links":{"cited_paper":"/paper/2502.13581","citing_paper":"/paper/2605.07125"},"observation_digest":"sha256:8ffc640ad85006f5fc232014a70ed61637bbfd7e7407c8bfe1f08e65899fbecd","observation_id":"1e0ead72-0f28-4504-9247-6c8627ec1d33","resolution":{"observed_at":"2026-05-11T04:50:56.797346Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Recommendation as language processing (rlp): A unified pretrain, personalized prompt & predict paradigm (p5)","venue":null,"work_id":"e77462d0-6c9f-47f0-8ad4-68975f6f97b2","year":2022},"citing_paper":{"arxiv_id":"2605.07125","last_updated":"2026-05-08T02:00:11Z","snapshot_observed_at":"2026-07-30T06:31:58.184575Z","submitted_at":"2026-05-08T02:00:11Z","title":"An Embarrassingly Simple Graph Heuristic Reveals Shortcut-Solvable Benchmarks for Sequential Recommendation","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-11T01:02:46.958164Z"},"links":{"citing_paper":"/paper/2605.07125"},"observation_digest":"sha256:9c96267f89505a41b99d531e2b789adbeddf70d71e9a7c4b77b7b92211ad72f7","observation_id":"07044640-7d9a-4c1f-a2eb-4eddf7f186d0","resolution":{"observed_at":"2026-05-16T00:30:27.856131Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"How to index item ids for recommendation foundation models","venue":null,"work_id":"465459ca-30bf-4141-b221-4e1b981173c5","year":2023},"citing_paper":{"arxiv_id":"2605.07125","last_updated":"2026-05-08T02:00:11Z","snapshot_observed_at":"2026-07-30T06:31:58.184575Z","submitted_at":"2026-05-08T02:00:11Z","title":"An Embarrassingly Simple Graph Heuristic Reveals Shortcut-Solvable Benchmarks for Sequential Recommendation","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-05-11T01:02:46.958164Z"},"links":{"citing_paper":"/paper/2605.07125"},"observation_digest":"sha256:22afedf4c75df345566f1746fcf4e9ac64896fde57919e505aec567aebe9d2c9","observation_id":"ebd1b33c-6385-4597-be0f-83e66220158a","resolution":{"observed_at":"2026-05-16T00:30:27.814793Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2511.22707","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Cofirec: Coarse-to-fine tokenization for generative recommendation","venue":null,"work_id":"0997c647-4f1e-4127-8a27-9cbd29805ac6","year":2025},"citing_paper":{"arxiv_id":"2605.07125","last_updated":"2026-05-08T02:00:11Z","snapshot_observed_at":"2026-07-30T06:31:58.184575Z","submitted_at":"2026-05-08T02:00:11Z","title":"An Embarrassingly Simple Graph Heuristic Reveals Shortcut-Solvable Benchmarks for Sequential Recommendation","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-05-11T01:02:46.958164Z"},"links":{"citing_paper":"/paper/2605.07125"},"observation_digest":"sha256:0d3fc736f347bd314d4b053b16dc98e089c5d2cdd20e629b9428c30dd5beb64d","observation_id":"322b2dc8-48c1-4968-ac2f-9794ee1836c1","resolution":{"observed_at":"2026-05-11T04:50:56.804866Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Genrec: Large language model for generative recommendation","venue":null,"work_id":"1dbad850-898a-468e-b4e6-e2968a421334","year":2024},"citing_paper":{"arxiv_id":"2605.07125","last_updated":"2026-05-08T02:00:11Z","snapshot_observed_at":"2026-07-30T06:31:58.184575Z","submitted_at":"2026-05-08T02:00:11Z","title":"An Embarrassingly Simple Graph Heuristic Reveals Shortcut-Solvable Benchmarks for Sequential Recommendation","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-05-11T01:02:46.958164Z"},"links":{"citing_paper":"/paper/2605.07125"},"observation_digest":"sha256:993c8716a04e45c72b36064b3eab2e4fb4e4800eb7022d8d0d71fe8edbf4332b","observation_id":"4b20f072-1542-4cf6-bc54-dcdb07fceb48","resolution":{"observed_at":"2026-05-16T00:30:27.718777Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Image-based recommendations on styles and substitutes","venue":null,"work_id":"7a920403-df4b-4313-a324-ba13f78ffcfc","year":2015},"citing_paper":{"arxiv_id":"2605.07125","last_updated":"2026-05-08T02:00:11Z","snapshot_observed_at":"2026-07-30T06:31:58.184575Z","submitted_at":"2026-05-08T02:00:11Z","title":"An Embarrassingly Simple Graph Heuristic Reveals Shortcut-Solvable Benchmarks for Sequential Recommendation","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-05-11T01:02:46.958164Z"},"links":{"citing_paper":"/paper/2605.07125"},"observation_digest":"sha256:7c190f4d662cacefbb21f5b9adda58b7eca1e3fe6f919d87e2c09494d4d0f5e9","observation_id":"e9ac1d78-8ab2-4d1d-8290-33c84646a2b4","resolution":{"observed_at":"2026-05-16T00:30:27.829598Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-07-07T12:13:45.000227Z","title":"Scaling instruction-finetuned language models.Journal of Machine Learning Research, 25(70):1–53","venue":null,"work_id":"a5376c0a-112b-4291-bd30-97404268fb89","year":2024},"citing_paper":{"arxiv_id":"2605.07125","last_updated":"2026-05-08T02:00:11Z","snapshot_observed_at":"2026-07-30T06:31:58.184575Z","submitted_at":"2026-05-08T02:00:11Z","title":"An Embarrassingly Simple Graph Heuristic Reveals Shortcut-Solvable Benchmarks for Sequential Recommendation","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-05-11T01:02:46.958164Z"},"links":{"citing_paper":"/paper/2605.07125"},"observation_digest":"sha256:1e596653891fdd514dcc773d29d7ffe65ceef29e6f27f2635a1bc52ef89aa562","observation_id":"742fbbe7-6326-4ac6-921e-05a2d98f6335","resolution":{"observed_at":"2026-05-16T00:30:27.839164Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2302.13971","last_updated":"2023-02-27T17:11:15Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-02-27T17:11:15Z","title":"LLaMA: Open and Efficient Foundation Language Models","version":1},"cited_work":{"arxiv_id":"2302.13971","doi":"10.48550/arxiv.2302.13971","metadata_source":"pith","pith_arxiv_id":"2302.13971","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"LLaMA: Open and Efficient Foundation Language Models","venue":"cs.CL","work_id":"c018fc23-6f3f-4035-9d02-28a2173b2b9d","year":2023},"citing_paper":{"arxiv_id":"2605.07125","last_updated":"2026-05-08T02:00:11Z","snapshot_observed_at":"2026-07-30T06:31:58.184575Z","submitted_at":"2026-05-08T02:00:11Z","title":"An Embarrassingly Simple Graph Heuristic Reveals Shortcut-Solvable Benchmarks for Sequential Recommendation","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-05-11T01:02:46.958164Z"},"links":{"cited_paper":"/paper/2302.13971","citing_paper":"/paper/2605.07125"},"observation_digest":"sha256:1c2f783db4ae2b6314882fc30dd61cfa60c0143dab48a8c8581762b71fe68dc7","observation_id":"90eb545a-d0ba-4138-a8f0-249d28d68f66","resolution":{"observed_at":"2026-05-11T04:50:56.779079Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-01T11:08:05.851253+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-01T11:08:05.851253+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Matrix factorization techniques for recom- mender systems.Computer, 42(8):30–37","venue":null,"work_id":"2e37d447-ba4c-433b-9dab-1e523d89b0aa","year":2009},"citing_paper":{"arxiv_id":"2605.07125","last_updated":"2026-05-08T02:00:11Z","snapshot_observed_at":"2026-07-30T06:31:58.184575Z","submitted_at":"2026-05-08T02:00:11Z","title":"An Embarrassingly Simple Graph Heuristic Reveals Shortcut-Solvable Benchmarks for Sequential Recommendation","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-05-11T01:02:46.958164Z"},"links":{"citing_paper":"/paper/2605.07125"},"observation_digest":"sha256:ef8af8e42186dd500f69a401df96ef23939c0151a7760e8c3cf7b38240b3b841","observation_id":"0c19626b-76ad-4179-bc88-cf29ebba0092","resolution":{"observed_at":"2026-05-16T00:30:27.842852Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Factorizing personalized markov chains for next-basket recommendation","venue":null,"work_id":"aeb65708-c0f8-487c-b9a6-a9ca1662b0b0","year":2010},"citing_paper":{"arxiv_id":"2605.07125","last_updated":"2026-05-08T02:00:11Z","snapshot_observed_at":"2026-07-30T06:31:58.184575Z","submitted_at":"2026-05-08T02:00:11Z","title":"An Embarrassingly Simple Graph Heuristic Reveals Shortcut-Solvable Benchmarks for Sequential Recommendation","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-05-11T01:02:46.958164Z"},"links":{"citing_paper":"/paper/2605.07125"},"observation_digest":"sha256:852802887b6da845f58b108a0de959456f8d1821f9eb244f582a97d8d2656d6e","observation_id":"e43815ba-1b67-4a94-9629-24c78ef65dea","resolution":{"observed_at":"2026-05-16T00:30:27.791188Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Personalized top-n sequential recommendation via convolutional sequence embedding","venue":null,"work_id":"409ea811-e08f-43a4-8680-0b5227f2b738","year":2018},"citing_paper":{"arxiv_id":"2605.07125","last_updated":"2026-05-08T02:00:11Z","snapshot_observed_at":"2026-07-30T06:31:58.184575Z","submitted_at":"2026-05-08T02:00:11Z","title":"An Embarrassingly Simple Graph Heuristic Reveals Shortcut-Solvable Benchmarks for Sequential Recommendation","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-05-11T01:02:46.958164Z"},"links":{"citing_paper":"/paper/2605.07125"},"observation_digest":"sha256:3ce5ed5a67135865cc03704c471dc975ebc9111e037a60fcf502c565b243843e","observation_id":"34cad4a1-2563-4cff-9277-64741bc6e861","resolution":{"observed_at":"2026-05-16T00:30:27.819598Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Self-attentive sequential recommendation","venue":null,"work_id":"b683b2cd-3b7e-4b47-96a9-2a0e097f6259","year":2018},"citing_paper":{"arxiv_id":"2605.07125","last_updated":"2026-05-08T02:00:11Z","snapshot_observed_at":"2026-07-30T06:31:58.184575Z","submitted_at":"2026-05-08T02:00:11Z","title":"An Embarrassingly Simple Graph Heuristic Reveals Shortcut-Solvable Benchmarks for Sequential Recommendation","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-05-11T01:02:46.958164Z"},"links":{"citing_paper":"/paper/2605.07125"},"observation_digest":"sha256:22e6e7f7de3a90be933b3b63fa4c6b7f380a214d7e302b7d26ff06bd716c4d30","observation_id":"5957819b-fefb-45cc-b8be-c2da682e670c","resolution":{"observed_at":"2026-05-16T00:30:27.768018Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-07-07T09:13:35.687177Z","title":"Bert4rec: Sequential recommendation with bidirectional encoder representations from transformer","venue":null,"work_id":"dd07d5ff-33a8-463d-98e0-5af1e98c28d8","year":2019},"citing_paper":{"arxiv_id":"2605.07125","last_updated":"2026-05-08T02:00:11Z","snapshot_observed_at":"2026-07-30T06:31:58.184575Z","submitted_at":"2026-05-08T02:00:11Z","title":"An Embarrassingly Simple Graph Heuristic Reveals Shortcut-Solvable Benchmarks for Sequential Recommendation","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-05-11T01:02:46.958164Z"},"links":{"citing_paper":"/paper/2605.07125"},"observation_digest":"sha256:672838ff4dee8007685e740f35c4072fe9252f5d4797cfe553412f004c144c89","observation_id":"a5afdd26-b73d-4957-91e2-911b06f354ed","resolution":{"observed_at":"2026-05-16T00:30:27.835358Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Global context enhanced graph neural networks for session-based recommendation","venue":null,"work_id":"f124bb24-049f-41dd-96ec-85b84d780759","year":2020},"citing_paper":{"arxiv_id":"2605.07125","last_updated":"2026-05-08T02:00:11Z","snapshot_observed_at":"2026-07-30T06:31:58.184575Z","submitted_at":"2026-05-08T02:00:11Z","title":"An Embarrassingly Simple Graph Heuristic Reveals Shortcut-Solvable Benchmarks for Sequential Recommendation","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-05-11T01:02:46.958164Z"},"links":{"citing_paper":"/paper/2605.07125"},"observation_digest":"sha256:83065ece5f4a9310064c9eb7ffa7e331d9bd26574c3438c0c2bf842718fb4bc7","observation_id":"9c11fe41-26de-4f51-b659-8265c547f340","resolution":{"observed_at":"2026-05-16T00:30:27.838769Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"S3-rec: Self-supervised learning for sequential recommendation with mutual information maximization","venue":null,"work_id":"4ec750be-4e61-45e5-8b4b-0945c40c14c5","year":1902},"citing_paper":{"arxiv_id":"2605.07125","last_updated":"2026-05-08T02:00:11Z","snapshot_observed_at":"2026-07-30T06:31:58.184575Z","submitted_at":"2026-05-08T02:00:11Z","title":"An Embarrassingly Simple Graph Heuristic Reveals Shortcut-Solvable Benchmarks for Sequential Recommendation","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-05-11T01:02:46.958164Z"},"links":{"citing_paper":"/paper/2605.07125"},"observation_digest":"sha256:ce5fcc212737020d8e4a14791ad9dec8b7b60dc37123411f153c3afc73203bbf","observation_id":"87ab6492-d432-4593-90bb-a3554b731878","resolution":{"observed_at":"2026-05-16T00:30:27.847335Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Towards universal sequence representation learning for recommender systems","venue":null,"work_id":"a91724a8-2ba0-41c4-a0aa-0928075a2771","year":2022},"citing_paper":{"arxiv_id":"2605.07125","last_updated":"2026-05-08T02:00:11Z","snapshot_observed_at":"2026-07-30T06:31:58.184575Z","submitted_at":"2026-05-08T02:00:11Z","title":"An Embarrassingly Simple Graph Heuristic Reveals Shortcut-Solvable Benchmarks for Sequential Recommendation","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-05-11T01:02:46.958164Z"},"links":{"citing_paper":"/paper/2605.07125"},"observation_digest":"sha256:05190d80a8cc2b47c5c7cabd0ef22696ff5a5dbcdb2d3d3eb3bd7d50b146bdaf","observation_id":"af1e1bd3-7d2b-44ab-acb2-d5128743063d","resolution":{"observed_at":"2026-05-16T00:30:27.834938Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Text is all you need: Learning language representations for sequential recommendation","venue":null,"work_id":"077d7656-3cae-43b7-9079-a32a51c1e166","year":2023},"citing_paper":{"arxiv_id":"2605.07125","last_updated":"2026-05-08T02:00:11Z","snapshot_observed_at":"2026-07-30T06:31:58.184575Z","submitted_at":"2026-05-08T02:00:11Z","title":"An Embarrassingly Simple Graph Heuristic Reveals Shortcut-Solvable Benchmarks for Sequential Recommendation","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-05-11T01:02:46.958164Z"},"links":{"citing_paper":"/paper/2605.07125"},"observation_digest":"sha256:a4779e0a6a1c1061f47d698b1eb509d25cdfe95691d9b54fa378a1d1f8ed22bb","observation_id":"1c64c7d8-af0c-498b-a101-b5daa7d44bee","resolution":{"observed_at":"2026-05-16T00:30:27.855421Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Amazon-m2: A multilingual multi-locale shopping session dataset for recommendation and text generation.Advances in Neural Information Processing Systems, 36:8006–8026","venue":null,"work_id":"d33ddc10-4ddb-4304-ba33-2bdb16e2aefe","year":2023},"citing_paper":{"arxiv_id":"2605.07125","last_updated":"2026-05-08T02:00:11Z","snapshot_observed_at":"2026-07-30T06:31:58.184575Z","submitted_at":"2026-05-08T02:00:11Z","title":"An Embarrassingly Simple Graph Heuristic Reveals Shortcut-Solvable Benchmarks for Sequential Recommendation","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-05-11T01:02:46.958164Z"},"links":{"citing_paper":"/paper/2605.07125"},"observation_digest":"sha256:30e84a3b0f5b706cdb2f7886df0a7c068a29ceb5eb7c843a56b12b40619d7e66","observation_id":"a110d309-7f1d-47fc-959c-3835c8563c90","resolution":{"observed_at":"2026-05-16T00:30:27.860780Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"A review of modern recommender systems using generative models (gen-recsys)","venue":null,"work_id":"ff66d28d-4024-448a-8fb7-d6020469838e","year":2024},"citing_paper":{"arxiv_id":"2605.07125","last_updated":"2026-05-08T02:00:11Z","snapshot_observed_at":"2026-07-30T06:31:58.184575Z","submitted_at":"2026-05-08T02:00:11Z","title":"An Embarrassingly Simple Graph Heuristic Reveals Shortcut-Solvable Benchmarks for Sequential Recommendation","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-05-11T01:02:46.958164Z"},"links":{"citing_paper":"/paper/2605.07125"},"observation_digest":"sha256:659854c3977c5950b77ee7f426beea10c1efe982d89140aa0c16f57cb1a892b7","observation_id":"1daae21a-7e66-4db1-aad1-9af852efb0f1","resolution":{"observed_at":"2026-05-16T00:30:27.804166Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Analysis of recom- mender system using generative artificial intelligence: A systematic literature review.Ieee Access, 12:87742–87766","venue":null,"work_id":"9e94001f-f590-4fcf-b2d5-7bf8018e438b","year":2024},"citing_paper":{"arxiv_id":"2605.07125","last_updated":"2026-05-08T02:00:11Z","snapshot_observed_at":"2026-07-30T06:31:58.184575Z","submitted_at":"2026-05-08T02:00:11Z","title":"An Embarrassingly Simple Graph Heuristic Reveals Shortcut-Solvable Benchmarks for Sequential Recommendation","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-05-11T01:02:46.958164Z"},"links":{"citing_paper":"/paper/2605.07125"},"observation_digest":"sha256:dd2dad3411a2f4cf21a77b3b2fb897ea1826fe03265d904dfe030b4ae892d53f","observation_id":"0ba28534-6a1f-45c9-8264-543735558fae","resolution":{"observed_at":"2026-05-16T00:30:27.868363Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.17152","last_updated":"2024-05-06T02:05:45Z","snapshot_observed_at":"2026-08-06T03:48:40.952592Z","submitted_at":"2024-02-27T02:37:37Z","title":"Actions Speak Louder than Words: Trillion-Parameter Sequential Transducers for Generative Recommendations","version":3},"cited_work":{"arxiv_id":"2402.17152","doi":"10.48550/arxiv.2402.17152","metadata_source":"pith","pith_arxiv_id":"2402.17152","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Actions Speak Louder than Words: Trillion-Parameter Sequential Transducers for Generative Recommendations","venue":"cs.LG","work_id":"cedb01b6-64b1-4cd7-a797-f157c3dc9930","year":2024},"citing_paper":{"arxiv_id":"2605.07125","last_updated":"2026-05-08T02:00:11Z","snapshot_observed_at":"2026-07-30T06:31:58.184575Z","submitted_at":"2026-05-08T02:00:11Z","title":"An Embarrassingly Simple Graph Heuristic Reveals Shortcut-Solvable Benchmarks for Sequential Recommendation","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-05-11T01:02:46.958164Z"},"links":{"cited_paper":"/paper/2402.17152","citing_paper":"/paper/2605.07125"},"observation_digest":"sha256:7bd80a8b183dc345af12e6153a73cd7daf16c1b7a5d348112c62dd2c68a01e85","observation_id":"8b12f4c5-a30f-4c57-a317-dabe406f544d","resolution":{"observed_at":"2026-05-13T19:39:33.082504Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-06-02T00:57:47.012388+00:00","source":"crossref_status_cache"},{"observed_at":"2026-06-02T00:57:47.012388+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Large language models for generative recommendation: A survey and visionary discussions","venue":null,"work_id":"bb8fee91-a66f-47c1-b6f6-a4853f9ff0ce","year":2024},"citing_paper":{"arxiv_id":"2605.07125","last_updated":"2026-05-08T02:00:11Z","snapshot_observed_at":"2026-07-30T06:31:58.184575Z","submitted_at":"2026-05-08T02:00:11Z","title":"An Embarrassingly Simple Graph Heuristic Reveals Shortcut-Solvable Benchmarks for Sequential Recommendation","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-05-11T01:02:46.958164Z"},"links":{"citing_paper":"/paper/2605.07125"},"observation_digest":"sha256:b3d53c36595d30e99d3311568597739bf118a5846e33ab79505d52a2b6c2704c","observation_id":"1d1078dc-7bc2-4839-bdaa-9a0d12ce3cf5","resolution":{"observed_at":"2026-05-16T00:30:27.877660Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"On sampled metrics for item recommendation","venue":null,"work_id":"3ba8e1ad-ebc8-45b6-8fdf-97d0d9cc4289","year":2020},"citing_paper":{"arxiv_id":"2605.07125","last_updated":"2026-05-08T02:00:11Z","snapshot_observed_at":"2026-07-30T06:31:58.184575Z","submitted_at":"2026-05-08T02:00:11Z","title":"An Embarrassingly Simple Graph Heuristic Reveals Shortcut-Solvable Benchmarks for Sequential Recommendation","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-05-11T01:02:46.958164Z"},"links":{"citing_paper":"/paper/2605.07125"},"observation_digest":"sha256:e67dc18c307a2365fac501a8942d96659ad4fa579d843bb04b13bfa856ffd313","observation_id":"96be9a30-59eb-4414-bca3-470e431bbebb","resolution":{"observed_at":"2026-05-16T00:30:27.777647Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Exploring data splitting strategies for the evaluation of recommendation models","venue":null,"work_id":"58389ade-7505-4b6a-ac7e-58387f154f63","year":2020},"citing_paper":{"arxiv_id":"2605.07125","last_updated":"2026-05-08T02:00:11Z","snapshot_observed_at":"2026-07-30T06:31:58.184575Z","submitted_at":"2026-05-08T02:00:11Z","title":"An Embarrassingly Simple Graph Heuristic Reveals Shortcut-Solvable Benchmarks for Sequential Recommendation","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-05-11T01:02:46.958164Z"},"links":{"citing_paper":"/paper/2605.07125"},"observation_digest":"sha256:714549ecc40fad1b9a114c47ec4dc6965021c8d7ae0fe1c3c3c3d4fa3a8dd25f","observation_id":"82bf6c2b-8743-46ee-a9bb-1680723ca13b","resolution":{"observed_at":"2026-05-16T00:30:27.847005Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"A revisiting study of appropriate offline evaluation for top-n recommendation algorithms.ACM Transactions on Information Systems, 41(2):1–41","venue":null,"work_id":"b28bab9b-0c3f-44d7-b631-b585f916e345","year":2022},"citing_paper":{"arxiv_id":"2605.07125","last_updated":"2026-05-08T02:00:11Z","snapshot_observed_at":"2026-07-30T06:31:58.184575Z","submitted_at":"2026-05-08T02:00:11Z","title":"An Embarrassingly Simple Graph Heuristic Reveals Shortcut-Solvable Benchmarks for Sequential Recommendation","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-05-11T01:02:46.958164Z"},"links":{"citing_paper":"/paper/2605.07125"},"observation_digest":"sha256:5f4fd10e29dffec00671da5361e42ace6e6c62f35fe5b43acb770e0d247d895c","observation_id":"52a07734-471e-4f0c-b9f3-74cb2f278b22","resolution":{"observed_at":"2026-05-16T00:30:27.809547Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Are we really making much progress? a worrying analysis of recent neural recommendation approaches","venue":null,"work_id":"4dc4b6aa-3fcb-4eda-b066-624524bdfd31","year":2019},"citing_paper":{"arxiv_id":"2605.07125","last_updated":"2026-05-08T02:00:11Z","snapshot_observed_at":"2026-07-30T06:31:58.184575Z","submitted_at":"2026-05-08T02:00:11Z","title":"An Embarrassingly Simple Graph Heuristic Reveals Shortcut-Solvable Benchmarks for Sequential Recommendation","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-05-11T01:02:46.958164Z"},"links":{"citing_paper":"/paper/2605.07125"},"observation_digest":"sha256:e0a5b99905c69e9a35e3c18aeca07cf2a1f08fa93a34a5538e84fce249cfc1c2","observation_id":"5892c6d9-565a-411f-8b13-3cab94d150ed","resolution":{"observed_at":"2026-05-16T00:30:27.815297Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"A troubling analysis of reproducibility and progress in recommender systems research.ACM Transactions on Information Systems (TOIS), 39(2):1–49","venue":null,"work_id":"6a0c29ec-c31f-47e3-8017-3e4b5c066526","year":2021},"citing_paper":{"arxiv_id":"2605.07125","last_updated":"2026-05-08T02:00:11Z","snapshot_observed_at":"2026-07-30T06:31:58.184575Z","submitted_at":"2026-05-08T02:00:11Z","title":"An Embarrassingly Simple Graph Heuristic Reveals Shortcut-Solvable Benchmarks for Sequential Recommendation","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-05-11T01:02:46.958164Z"},"links":{"citing_paper":"/paper/2605.07125"},"observation_digest":"sha256:bbbfd1a7678ce521d87a91a8436e798bf789ea147a43e32b7b176724b9f5687d","observation_id":"271f6dc8-2a70-42d7-85a4-830066925f11","resolution":{"observed_at":"2026-05-16T00:30:27.831142Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Neural collaborative filtering vs","venue":null,"work_id":"8a366348-52a5-4c5a-9167-2b189d78b254","year":2020},"citing_paper":{"arxiv_id":"2605.07125","last_updated":"2026-05-08T02:00:11Z","snapshot_observed_at":"2026-07-30T06:31:58.184575Z","submitted_at":"2026-05-08T02:00:11Z","title":"An Embarrassingly Simple Graph Heuristic Reveals Shortcut-Solvable Benchmarks for Sequential Recommendation","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-05-11T01:02:46.958164Z"},"links":{"citing_paper":"/paper/2605.07125"},"observation_digest":"sha256:c542bd2e119ffc40b17d32d42e37780200f3f09ff38eff396abb3f8ba6734622","observation_id":"5843ebe1-3584-48bf-9c17-71e074458e0b","resolution":{"observed_at":"2026-05-16T00:30:27.785063Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Generative recommendation with semantic ids: A practitioner’s handbook","venue":null,"work_id":"c6130dd2-4c8b-4be9-bdcf-9862900e5c9e","year":2025},"citing_paper":{"arxiv_id":"2605.07125","last_updated":"2026-05-08T02:00:11Z","snapshot_observed_at":"2026-07-30T06:31:58.184575Z","submitted_at":"2026-05-08T02:00:11Z","title":"An Embarrassingly Simple Graph Heuristic Reveals Shortcut-Solvable Benchmarks for Sequential Recommendation","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-05-11T01:02:46.958164Z"},"links":{"citing_paper":"/paper/2605.07125"},"observation_digest":"sha256:2dd1313b249781459ff783f373dd027af13c4250a4d6202d060e752ef8244d27","observation_id":"450a88f2-7b96-4652-b0af-84d4f1b5e0df","resolution":{"observed_at":"2026-05-16T00:30:27.851459Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Second workshop on information hetero- geneity and fusion in recommender systems (hetrec2011)","venue":null,"work_id":"927e1cf1-e274-41bf-907e-494bcca83940","year":2011},"citing_paper":{"arxiv_id":"2605.07125","last_updated":"2026-05-08T02:00:11Z","snapshot_observed_at":"2026-07-30T06:31:58.184575Z","submitted_at":"2026-05-08T02:00:11Z","title":"An Embarrassingly Simple Graph Heuristic Reveals Shortcut-Solvable Benchmarks for Sequential Recommendation","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-05-11T01:02:46.958164Z"},"links":{"citing_paper":"/paper/2605.07125"},"observation_digest":"sha256:1a54ac495aad8604db9e463af06de552e901d83debd0cefdd921164c8eb5f238","observation_id":"33628366-487e-4268-aa77-a653708510c2","resolution":{"observed_at":"2026-05-16T00:30:27.762796Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"The movielens datasets: History and context.Acm transactions on interactive intelligent systems (tiis), 5(4):1–19","venue":null,"work_id":"be3ac854-3b37-4f0f-9667-246893bac3ce","year":2015},"citing_paper":{"arxiv_id":"2605.07125","last_updated":"2026-05-08T02:00:11Z","snapshot_observed_at":"2026-07-30T06:31:58.184575Z","submitted_at":"2026-05-08T02:00:11Z","title":"An Embarrassingly Simple Graph Heuristic Reveals Shortcut-Solvable Benchmarks for Sequential Recommendation","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-05-11T01:02:46.958164Z"},"links":{"citing_paper":"/paper/2605.07125"},"observation_digest":"sha256:6831ff6c41dfa8b7f700d4d632c7c097b0389743359dba766e7c99ed7c36cd0f","observation_id":"51081a3d-506b-48f6-a09d-bbffec8ba616","resolution":{"observed_at":"2026-05-16T00:30:27.842508Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Yelp open dataset","venue":null,"work_id":"c4931d36-a900-4a09-b908-1324e5cc56c3","year":2023},"citing_paper":{"arxiv_id":"2605.07125","last_updated":"2026-05-08T02:00:11Z","snapshot_observed_at":"2026-07-30T06:31:58.184575Z","submitted_at":"2026-05-08T02:00:11Z","title":"An Embarrassingly Simple Graph Heuristic Reveals Shortcut-Solvable Benchmarks for Sequential Recommendation","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-05-11T01:02:46.958164Z"},"links":{"citing_paper":"/paper/2605.07125"},"observation_digest":"sha256:4457c5741d39ac693badc28befd7626b04dafc4ffe8581d8a10abc1ee95af69d","observation_id":"2e646141-7ce4-4f06-a354-762843d86c94","resolution":{"observed_at":"2026-05-16T00:30:27.864391Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Mind: A large-scale dataset for news recommendation","venue":null,"work_id":"49ad5a9b-a5b4-42dd-81ab-48c7c42bc5fe","year":2020},"citing_paper":{"arxiv_id":"2605.07125","last_updated":"2026-05-08T02:00:11Z","snapshot_observed_at":"2026-07-30T06:31:58.184575Z","submitted_at":"2026-05-08T02:00:11Z","title":"An Embarrassingly Simple Graph Heuristic Reveals Shortcut-Solvable Benchmarks for Sequential Recommendation","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-05-11T01:02:46.958164Z"},"links":{"citing_paper":"/paper/2605.07125"},"observation_digest":"sha256:88e26c4ef53d3eec134fbf22fbfe6d023208fd089956c084fa81f8277be85e13","observation_id":"aaadb342-a319-4727-a65c-6b8aa4e30554","resolution":{"observed_at":"2026-05-16T00:30:27.804684Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Item recommendation on monotonic behavior chains","venue":null,"work_id":"1cce32fd-1ea9-41df-8e1e-c25b9dea0889","year":2018},"citing_paper":{"arxiv_id":"2605.07125","last_updated":"2026-05-08T02:00:11Z","snapshot_observed_at":"2026-07-30T06:31:58.184575Z","submitted_at":"2026-05-08T02:00:11Z","title":"An Embarrassingly Simple Graph Heuristic Reveals Shortcut-Solvable Benchmarks for Sequential Recommendation","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-05-11T01:02:46.958164Z"},"links":{"citing_paper":"/paper/2605.07125"},"observation_digest":"sha256:f5051e353060a5ff2ebcda5cd70289faf24ea84af8effa0273f6ec9916034efe","observation_id":"33e5623d-11eb-4144-b519-b9de2f641c32","resolution":{"observed_at":"2026-05-16T00:30:27.747693Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"H&m personalized fashion recommendations","venue":null,"work_id":"1bf7697a-b1bd-4f97-b370-e14ba7a36a79","year":2022},"citing_paper":{"arxiv_id":"2605.07125","last_updated":"2026-05-08T02:00:11Z","snapshot_observed_at":"2026-07-30T06:31:58.184575Z","submitted_at":"2026-05-08T02:00:11Z","title":"An Embarrassingly Simple Graph Heuristic Reveals Shortcut-Solvable Benchmarks for Sequential Recommendation","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-05-11T01:02:46.958164Z"},"links":{"citing_paper":"/paper/2605.07125"},"observation_digest":"sha256:1204262ffe6592ceb990e47299b3ad274ea7485fbd6bbc2ff6a99f25751d3b75","observation_id":"b7a4084f-509f-406d-924b-ddf4d6ed5b43","resolution":{"observed_at":"2026-05-16T00:30:27.819277Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Tokenrec: Learning to tokenize id for llm- based generative recommendations.IEEE Transactions on Knowledge and Data Engineering","venue":null,"work_id":"15f22fdf-a135-4f50-9b35-7d22c8181b43","year":2025},"citing_paper":{"arxiv_id":"2605.07125","last_updated":"2026-05-08T02:00:11Z","snapshot_observed_at":"2026-07-30T06:31:58.184575Z","submitted_at":"2026-05-08T02:00:11Z","title":"An Embarrassingly Simple Graph Heuristic Reveals Shortcut-Solvable Benchmarks for Sequential Recommendation","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-05-11T01:02:46.958164Z"},"links":{"citing_paper":"/paper/2605.07125"},"observation_digest":"sha256:3c864a892569be55e24bc3603d5c4283c6cdc17dad44a38ba663061acf8f0952","observation_id":"32b65ecb-3221-4f6b-9b8f-c05a300184c0","resolution":{"observed_at":"2026-05-16T00:30:27.782670Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Memory augmented graph neural networks for sequential recommendation","venue":null,"work_id":"dc1dcd0a-3135-4e5b-81d0-5bf17d552cf7","year":2020},"citing_paper":{"arxiv_id":"2605.07125","last_updated":"2026-05-08T02:00:11Z","snapshot_observed_at":"2026-07-30T06:31:58.184575Z","submitted_at":"2026-05-08T02:00:11Z","title":"An Embarrassingly Simple Graph Heuristic Reveals Shortcut-Solvable Benchmarks for Sequential Recommendation","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-05-11T01:02:46.958164Z"},"links":{"citing_paper":"/paper/2605.07125"},"observation_digest":"sha256:d01a7ea671bd6bd47ea15efec1326016198456563ae27299b76812cc196af6e8","observation_id":"89273149-ee43-4a58-933b-cfbf11260960","resolution":{"observed_at":"2026-05-16T00:30:27.754830Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2312.7914","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Autoregressive image generation using residual quantization","venue":null,"work_id":"6a51a88f-f1ea-4625-8017-02db0284a78f","year":2022},"citing_paper":{"arxiv_id":"2605.07125","last_updated":"2026-05-08T02:00:11Z","snapshot_observed_at":"2026-07-30T06:31:58.184575Z","submitted_at":"2026-05-08T02:00:11Z","title":"An Embarrassingly Simple Graph Heuristic Reveals Shortcut-Solvable Benchmarks for Sequential Recommendation","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-05-11T01:02:46.958164Z"},"links":{"citing_paper":"/paper/2605.07125"},"observation_digest":"sha256:54507da7114741ff3bedc1145020b8bde0167927984cd71cab3c212e16dda9ff","observation_id":"8b69c8cc-5b81-4133-90af-92bd3c36ac7b","resolution":{"observed_at":"2026-05-11T04:50:56.785513Z","resolver_source":"arxiv_id","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2605.07125","last_updated":"2026-05-08T02:00:11Z","latest_version":1,"primary_category":"cs.IR","snapshot_observed_at":"2026-07-30T06:31:58.184575Z","submitted_at":"2026-05-08T02:00:11Z","title":"An Embarrassingly Simple Graph Heuristic Reveals Shortcut-Solvable Benchmarks for Sequential Recommendation"},"reference_resolution":{"displayed":52,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":5,"verified_fuzzy":46},"total_outbound_references":52},"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-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"thesis":"As of 6 August 2026, this Paper Citation Record lists 52 of 52 outbound references and 0 inbound Pith citation observations for arXiv:2605.07125."}