{"as_of":"2026-08-12T13:00:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:83c3c7b913f1ad8c65e46c941807a4091bddabf06d4a9196777133de6980b9ff","coverage":[{"denominator":33,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":33,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T22:36:54.756250Z","state":"measured"},{"denominator":33,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":33,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-12T06:34:41.77262+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/2501.01242/citation-record","integrity":"/paper/2501.01242/integrity","json":"/paper/2501.01242/citation-record.json","paper":"/paper/2501.01242"},"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-10T22:36:55.460512Z","title":"Neural attentive session -based recommendation,","venue":null,"work_id":"c92f1d7d-ea0e-4e6d-a88a-ce11a27d9a76","year":2017},"citing_paper":{"arxiv_id":"2501.01242","last_updated":"2025-01-02T13:03:06Z","snapshot_observed_at":"2026-08-10T22:29:49.883122Z","submitted_at":"2025-01-02T13:03:06Z","title":"An Efficient Attention Mechanism for Sequential Recommendation Tasks: HydraRec","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-10T22:36:54.625835Z"},"links":{"citing_paper":"/paper/2501.01242"},"observation_digest":"sha256:8ee215e5a9394c31933859d2a4d9286281b4b33ea20355d9435b081e18c62009","observation_id":"7a4bcfea-7739-4a8c-b850-ae83b547971d","resolution":{"observed_at":"2026-08-10T22:36:55.464659Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T22:36:55.448361Z","title":"Self-attentive sequential recommendation,","venue":null,"work_id":"f2dcdd2a-38af-4365-a5f7-3c658643d47f","year":2018},"citing_paper":{"arxiv_id":"2501.01242","last_updated":"2025-01-02T13:03:06Z","snapshot_observed_at":"2026-08-10T22:29:49.883122Z","submitted_at":"2025-01-02T13:03:06Z","title":"An Efficient Attention Mechanism for Sequential Recommendation Tasks: HydraRec","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-10T22:36:54.630369Z"},"links":{"citing_paper":"/paper/2501.01242"},"observation_digest":"sha256:afb5443d5cb749b60f9c4cac92ede77397a24af6b96fc1f96f26b6bcedd54342","observation_id":"31286b2e-6e7b-445e-aea0-b041c4382d32","resolution":{"observed_at":"2026-08-10T22:36:55.452396Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T22:36:55.430202Z","title":"Pre-training of Context-aware Item Representation for Next Basket Recommendation","venue":null,"work_id":"507eda9a-e0d5-4cc0-94e3-688d2850dd6d","year":null},"citing_paper":{"arxiv_id":"2501.01242","last_updated":"2025-01-02T13:03:06Z","snapshot_observed_at":"2026-08-10T22:29:49.883122Z","submitted_at":"2025-01-02T13:03:06Z","title":"An Efficient Attention Mechanism for Sequential Recommendation Tasks: HydraRec","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-10T22:36:54.635370Z"},"links":{"citing_paper":"/paper/2501.01242"},"observation_digest":"sha256:051a92f65b585d4b6e868b07c4779e7abd4e5e7c9cb55bd1d810958edba79556","observation_id":"216b310e-d278-4798-ae35-67df6d3e79c2","resolution":{"observed_at":"2026-08-10T22:36:55.436304Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T22:36:55.412058Z","title":"Attention is all you need,","venue":null,"work_id":"9bc65773-3568-42a5-ad55-32dcfa36fc9d","year":2017},"citing_paper":{"arxiv_id":"2501.01242","last_updated":"2025-01-02T13:03:06Z","snapshot_observed_at":"2026-08-10T22:29:49.883122Z","submitted_at":"2025-01-02T13:03:06Z","title":"An Efficient Attention Mechanism for Sequential Recommendation Tasks: HydraRec","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-10T22:36:54.640344Z"},"links":{"citing_paper":"/paper/2501.01242"},"observation_digest":"sha256:89e1765b1f9556312fc62e18657b612ce2f9e5347f674a975e4d7283daf15f8c","observation_id":"1bc730a9-e77b-472b-8f1f-6b8d87a4230c","resolution":{"observed_at":"2026-08-10T22:36:55.417630Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T22:36:55.395795Z","title":"BERT: Pre -training of deep bidirectional transformers for language understanding,","venue":null,"work_id":"c3e7e810-f901-4a32-9ac4-8d20c84230df","year":2019},"citing_paper":{"arxiv_id":"2501.01242","last_updated":"2025-01-02T13:03:06Z","snapshot_observed_at":"2026-08-10T22:29:49.883122Z","submitted_at":"2025-01-02T13:03:06Z","title":"An Efficient Attention Mechanism for Sequential Recommendation Tasks: HydraRec","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-10T22:36:54.644738Z"},"links":{"citing_paper":"/paper/2501.01242"},"observation_digest":"sha256:256f94939d03bbfce12a94508feeaeef24929712b1fbf10f6580977f86ec1bbc","observation_id":"e80b6051-8115-45dc-8e05-62fa20a012d7","resolution":{"observed_at":"2026-08-10T22:36:55.400931Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2302.01107","last_updated":"2023-05-04T01:23:12Z","snapshot_observed_at":"2026-07-06T14:47:41.143659Z","submitted_at":"2023-02-02T13:58:18Z","title":"A Survey on Efficient Training of Transformers","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.01107","snapshot_observed_at":"2026-08-10T22:36:54.649056Z","title":"A survey on efficient training of transformers,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2501.01242","last_updated":"2025-01-02T13:03:06Z","snapshot_observed_at":"2026-08-10T22:29:49.883122Z","submitted_at":"2025-01-02T13:03:06Z","title":"An Efficient Attention Mechanism for Sequential Recommendation Tasks: HydraRec","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-10T22:36:54.649056Z"},"links":{"cited_paper":"/paper/2302.01107","citing_paper":"/paper/2501.01242"},"observation_digest":"sha256:dd1246ec80b40a10883a96450c25d6ce69845fb79e7405b89af93ce294ada270","observation_id":"86df6972-c3a4-459f-8112-c7e90438baae","resolution":{"observed_at":"2026-08-10T22:36:54.649056Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2006.04768","last_updated":"2020-06-14T08:15:54Z","snapshot_observed_at":"2026-07-06T09:27:03.809621Z","submitted_at":"2020-06-08T17:37:52Z","title":"Linformer: Self-Attention with Linear Complexity","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2006.04768","snapshot_observed_at":"2026-08-10T22:36:54.653480Z","title":"Linformer: Self -Attention with Linear Complexity,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2501.01242","last_updated":"2025-01-02T13:03:06Z","snapshot_observed_at":"2026-08-10T22:29:49.883122Z","submitted_at":"2025-01-02T13:03:06Z","title":"An Efficient Attention Mechanism for Sequential Recommendation Tasks: HydraRec","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-10T22:36:54.653480Z"},"links":{"cited_paper":"/paper/2006.04768","citing_paper":"/paper/2501.01242"},"observation_digest":"sha256:9dc2ebb556a97aec2a78d724e08612423cb2a62bb24c37adebbf95f74edbb2ae","observation_id":"af0675ea-b6f6-4dda-85b6-39f6fe2b8458","resolution":{"observed_at":"2026-08-10T22:36:54.653480Z","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-10T22:36:55.380900Z","title":"Big bird: Transformers for longer sequences,","venue":null,"work_id":"5aca823c-95ff-468c-9efa-994e342600b2","year":2020},"citing_paper":{"arxiv_id":"2501.01242","last_updated":"2025-01-02T13:03:06Z","snapshot_observed_at":"2026-08-10T22:29:49.883122Z","submitted_at":"2025-01-02T13:03:06Z","title":"An Efficient Attention Mechanism for Sequential Recommendation Tasks: HydraRec","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-10T22:36:54.658052Z"},"links":{"citing_paper":"/paper/2501.01242"},"observation_digest":"sha256:4abb6405d44bcdf63800e8193eae2c828a3692825051e80cc0b49490f0e54b51","observation_id":"d42ac74d-dead-453a-a854-0b5bb4451cd8","resolution":{"observed_at":"2026-08-10T22:36:55.385066Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T22:36:55.368252Z","title":"BasisFormer: Attention -based Time Series Forecasting with Learnable and Interpretable Basis,","venue":null,"work_id":"fff437b2-6082-4564-bee6-384aa494ea24","year":2023},"citing_paper":{"arxiv_id":"2501.01242","last_updated":"2025-01-02T13:03:06Z","snapshot_observed_at":"2026-08-10T22:29:49.883122Z","submitted_at":"2025-01-02T13:03:06Z","title":"An Efficient Attention Mechanism for Sequential Recommendation Tasks: HydraRec","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-10T22:36:54.661930Z"},"links":{"citing_paper":"/paper/2501.01242"},"observation_digest":"sha256:bead0ad9e541fcd413e480ea440ab994faf0888952abe9d6e80d23bf234d2441","observation_id":"8b9f95df-a550-4162-92b1-280c08dd2cfd","resolution":{"observed_at":"2026-08-10T22:36:55.372596Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:36:54.665736Z","title":"LinRec: Linear Attention Mechanism for Long -term Sequential Recommender Systems,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2501.01242","last_updated":"2025-01-02T13:03:06Z","snapshot_observed_at":"2026-08-10T22:29:49.883122Z","submitted_at":"2025-01-02T13:03:06Z","title":"An Efficient Attention Mechanism for Sequential Recommendation Tasks: HydraRec","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-10T22:36:54.665736Z"},"links":{"citing_paper":"/paper/2501.01242"},"observation_digest":"sha256:c9c7be916d9922c391c1041c1fbc02e50c030cf5021351568a62500246e276bd","observation_id":"bac27d22-9645-4969-9f5a-436add073f70","resolution":{"observed_at":"2026-08-10T22:36:54.665736Z","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":"10.1007/978-3-031-25082-8_3","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:03:20.376878Z","title":"Hydra Attention: Efficient Attention with Many Heads,","venue":"Lecture notes in computer science","work_id":"f853f2da-5a30-4f95-9102-57c3139335ea","year":2023},"citing_paper":{"arxiv_id":"2501.01242","last_updated":"2025-01-02T13:03:06Z","snapshot_observed_at":"2026-08-10T22:29:49.883122Z","submitted_at":"2025-01-02T13:03:06Z","title":"An Efficient Attention Mechanism for Sequential Recommendation Tasks: HydraRec","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-10T22:36:54.669932Z"},"links":{"citing_paper":"/paper/2501.01242"},"observation_digest":"sha256:3f3242f681ff887b3041e0e766dd8443333c5dcd1b1ba44d10f54202f34f5a10","observation_id":"6e61e960-b5cc-4bfe-b909-97f232172f8e","resolution":{"observed_at":"2026-08-10T22:36:54.789332Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2306.01160","last_updated":"2023-06-01T21:33:59Z","snapshot_observed_at":"2026-08-10T03:50:20.888402Z","submitted_at":"2023-06-01T21:33:59Z","title":"Faster Causal Attention Over Large Sequences Through Sparse Flash Attention","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.01160","snapshot_observed_at":"2026-08-10T22:36:54.674547Z","title":"Faster causal attention over large sequences through sparse flash attention,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2501.01242","last_updated":"2025-01-02T13:03:06Z","snapshot_observed_at":"2026-08-10T22:29:49.883122Z","submitted_at":"2025-01-02T13:03:06Z","title":"An Efficient Attention Mechanism for Sequential Recommendation Tasks: HydraRec","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-10T22:36:54.674547Z"},"links":{"cited_paper":"/paper/2306.01160","citing_paper":"/paper/2501.01242"},"observation_digest":"sha256:21555acc364e0a8bc0aeaf281a06f32cf2d061922d9594b865bf080a4e9ceb37","observation_id":"41de598d-02d3-4b5a-982f-496c33b2f663","resolution":{"observed_at":"2026-08-10T22:36:54.674547Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:36:54.679101Z","title":"Bert4rec: Sequential recommendation with bidirectional encoder representations from transformer,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2501.01242","last_updated":"2025-01-02T13:03:06Z","snapshot_observed_at":"2026-08-10T22:29:49.883122Z","submitted_at":"2025-01-02T13:03:06Z","title":"An Efficient Attention Mechanism for Sequential Recommendation Tasks: HydraRec","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-10T22:36:54.679101Z"},"links":{"citing_paper":"/paper/2501.01242"},"observation_digest":"sha256:6995a04b3aa561bef680914a0e9c8588f2ba144dc7e7bb7e88b68d7bfa273288","observation_id":"ad145913-65a2-4bc8-8c95-741eec801cb1","resolution":{"observed_at":"2026-08-10T22:36:54.679101Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2105.14103","last_updated":"2021-09-21T18:04:55Z","snapshot_observed_at":"2026-08-12T10:40:58.838350Z","submitted_at":"2021-05-28T20:45:30Z","title":"An Attention Free Transformer","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2105.14103","snapshot_observed_at":"2026-08-10T22:36:54.682739Z","title":"An attention free transformer,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2501.01242","last_updated":"2025-01-02T13:03:06Z","snapshot_observed_at":"2026-08-10T22:29:49.883122Z","submitted_at":"2025-01-02T13:03:06Z","title":"An Efficient Attention Mechanism for Sequential Recommendation Tasks: HydraRec","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-10T22:36:54.682739Z"},"links":{"cited_paper":"/paper/2105.14103","citing_paper":"/paper/2501.01242"},"observation_digest":"sha256:aebc0dc1ca66e38d20443149198c91477471881ac028444c9c0d91b405fb990e","observation_id":"b400422a-3f83-4d22-9dd9-1829dc16ddae","resolution":{"observed_at":"2026-08-10T22:36:54.682739Z","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-10T22:36:55.355163Z","title":"Training data-efficient image transformers & distillation through attention,","venue":null,"work_id":"5c91b841-30ce-4964-b929-99cd5ce6637b","year":2021},"citing_paper":{"arxiv_id":"2501.01242","last_updated":"2025-01-02T13:03:06Z","snapshot_observed_at":"2026-08-10T22:29:49.883122Z","submitted_at":"2025-01-02T13:03:06Z","title":"An Efficient Attention Mechanism for Sequential Recommendation Tasks: HydraRec","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-10T22:36:54.686721Z"},"links":{"citing_paper":"/paper/2501.01242"},"observation_digest":"sha256:23c3cabcd367e028b2c4f4f93a9fae37733e094f0d6307bce70f7410a27cc548","observation_id":"433ca88a-620d-4179-b06c-f61ee28125db","resolution":{"observed_at":"2026-08-10T22:36:55.359894Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T22:36:55.341964Z","title":"An MDP -based recommender system.,","venue":null,"work_id":"5a6e826f-fec3-480a-83eb-5d9520247803","year":2005},"citing_paper":{"arxiv_id":"2501.01242","last_updated":"2025-01-02T13:03:06Z","snapshot_observed_at":"2026-08-10T22:29:49.883122Z","submitted_at":"2025-01-02T13:03:06Z","title":"An Efficient Attention Mechanism for Sequential Recommendation Tasks: HydraRec","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-10T22:36:54.690423Z"},"links":{"citing_paper":"/paper/2501.01242"},"observation_digest":"sha256:80e491b5b1706772c6e79385de0f1e210d5f08e632d54ee1cebee22d9f51c9a1","observation_id":"634c027c-76e6-433f-a1b9-8815dbb4bf42","resolution":{"observed_at":"2026-08-10T22:36:55.346489Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T22:36:55.329396Z","title":"A Markov chain model for integrating context in recommender systems,","venue":null,"work_id":"addf1919-7b62-4449-a401-2f0916320f2e","year":2016},"citing_paper":{"arxiv_id":"2501.01242","last_updated":"2025-01-02T13:03:06Z","snapshot_observed_at":"2026-08-10T22:29:49.883122Z","submitted_at":"2025-01-02T13:03:06Z","title":"An Efficient Attention Mechanism for Sequential Recommendation Tasks: HydraRec","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-10T22:36:54.694638Z"},"links":{"citing_paper":"/paper/2501.01242"},"observation_digest":"sha256:f6bc4d021c226aa8bf059681c43f564b17fe7805ce66c913c2f222c792dc0b0d","observation_id":"6f9775fa-9249-49bc-aa0e-8de770151673","resolution":{"observed_at":"2026-08-10T22:36:55.333542Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T22:36:55.316935Z","title":"A hybrid recommender system for sequential recommendation: combining similarity models with markov chains,","venue":null,"work_id":"173874eb-6b23-4a8e-9860-9c92aef50f6b","year":2020},"citing_paper":{"arxiv_id":"2501.01242","last_updated":"2025-01-02T13:03:06Z","snapshot_observed_at":"2026-08-10T22:29:49.883122Z","submitted_at":"2025-01-02T13:03:06Z","title":"An Efficient Attention Mechanism for Sequential Recommendation Tasks: HydraRec","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-10T22:36:54.698207Z"},"links":{"citing_paper":"/paper/2501.01242"},"observation_digest":"sha256:3871b0bfc175a61a89ac65d52eacf38ce20c6a1b8693ef255a52df31b63e8d0a","observation_id":"fefcf9ae-8e87-4b2b-a697-83c40efa0c2d","resolution":{"observed_at":"2026-08-10T22:36:55.321220Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T22:36:55.302512Z","title":"Long short -term memory,","venue":null,"work_id":"65a34776-9bac-4a67-b652-9080aa5c3866","year":2012},"citing_paper":{"arxiv_id":"2501.01242","last_updated":"2025-01-02T13:03:06Z","snapshot_observed_at":"2026-08-10T22:29:49.883122Z","submitted_at":"2025-01-02T13:03:06Z","title":"An Efficient Attention Mechanism for Sequential Recommendation Tasks: HydraRec","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-10T22:36:54.702170Z"},"links":{"citing_paper":"/paper/2501.01242"},"observation_digest":"sha256:2ce1db478a877bda1da4c76987ef2b52d4d61cba9aa080d75cf5738e3d803ffb","observation_id":"650b1d3e-db75-4029-a2b2-0da2914c4053","resolution":{"observed_at":"2026-08-10T22:36:55.308082Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T22:36:55.289466Z","title":"Recurrent recommender networks,","venue":null,"work_id":"c18a9965-1a15-4467-acb8-1a244b942013","year":2017},"citing_paper":{"arxiv_id":"2501.01242","last_updated":"2025-01-02T13:03:06Z","snapshot_observed_at":"2026-08-10T22:29:49.883122Z","submitted_at":"2025-01-02T13:03:06Z","title":"An Efficient Attention Mechanism for Sequential Recommendation Tasks: HydraRec","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-10T22:36:54.706029Z"},"links":{"citing_paper":"/paper/2501.01242"},"observation_digest":"sha256:328ed74c8e0e4604fa746a64e10543fd619bab74d509c2d23d02d3c9d62ad3bd","observation_id":"520c5370-1f26-422b-953e-0db7335da78b","resolution":{"observed_at":"2026-08-10T22:36:55.294472Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T22:36:55.276673Z","title":"A social hybrid recommendation system using LSTM and CNN,","venue":null,"work_id":"6c34b3a0-b6a2-4dbe-bb98-5b350c555ce9","year":2022},"citing_paper":{"arxiv_id":"2501.01242","last_updated":"2025-01-02T13:03:06Z","snapshot_observed_at":"2026-08-10T22:29:49.883122Z","submitted_at":"2025-01-02T13:03:06Z","title":"An Efficient Attention Mechanism for Sequential Recommendation Tasks: HydraRec","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-10T22:36:54.709545Z"},"links":{"citing_paper":"/paper/2501.01242"},"observation_digest":"sha256:2ab6563ce9927f10a89731cf9f57dbff3c3795b1caf8800fd734ee4ecb1c144d","observation_id":"8dc1fc0b-f1e9-41c6-b337-be964914ab55","resolution":{"observed_at":"2026-08-10T22:36:55.281242Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T22:36:55.262435Z","title":"Sequential user -based recurrent neural network recommendations,","venue":null,"work_id":"6528ba81-ffe2-4887-905f-5b778ac9aeb7","year":2017},"citing_paper":{"arxiv_id":"2501.01242","last_updated":"2025-01-02T13:03:06Z","snapshot_observed_at":"2026-08-10T22:29:49.883122Z","submitted_at":"2025-01-02T13:03:06Z","title":"An Efficient Attention Mechanism for Sequential Recommendation Tasks: HydraRec","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-10T22:36:54.713250Z"},"links":{"citing_paper":"/paper/2501.01242"},"observation_digest":"sha256:a8ae9be7c68c5a95fddba4cba3006e21eed7b181ec65cc37e3383024320f645e","observation_id":"e19bd975-f6ab-43af-93f1-ebca70912a63","resolution":{"observed_at":"2026-08-10T22:36:55.267102Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T22:36:55.246695Z","title":"Recurrent neural networks with top-k gains for session- based recommendations,","venue":null,"work_id":"ce8cf931-8eb7-4a82-be55-fd48199f59c1","year":2018},"citing_paper":{"arxiv_id":"2501.01242","last_updated":"2025-01-02T13:03:06Z","snapshot_observed_at":"2026-08-10T22:29:49.883122Z","submitted_at":"2025-01-02T13:03:06Z","title":"An Efficient Attention Mechanism for Sequential Recommendation Tasks: HydraRec","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-10T22:36:54.716601Z"},"links":{"citing_paper":"/paper/2501.01242"},"observation_digest":"sha256:31d7d2101b3396dae259ff2f0bd5cb376e34f580140db7d660f098a57e785b9e","observation_id":"2172b0d4-491f-4dfa-a0bd-898ff9a88533","resolution":{"observed_at":"2026-08-10T22:36:55.251655Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T22:36:55.231060Z","title":"Personalized top-n sequential recommendation via convolutional sequence embedding,","venue":null,"work_id":"f04a8091-263f-4ffa-a758-183a1498b224","year":2018},"citing_paper":{"arxiv_id":"2501.01242","last_updated":"2025-01-02T13:03:06Z","snapshot_observed_at":"2026-08-10T22:29:49.883122Z","submitted_at":"2025-01-02T13:03:06Z","title":"An Efficient Attention Mechanism for Sequential Recommendation Tasks: HydraRec","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-10T22:36:54.720322Z"},"links":{"citing_paper":"/paper/2501.01242"},"observation_digest":"sha256:d70e2110e65b445e085a190354f2c35985c48c628f02c8fdf06b63607b9c59bb","observation_id":"fcb32138-4a79-4a9d-b475-b1dfbac7bfc1","resolution":{"observed_at":"2026-08-10T22:36:55.235603Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T22:36:55.217254Z","title":"Deep learning based recommender system: A survey and new perspectives,","venue":null,"work_id":"7fb3df3c-5d92-48e2-8c3c-1e431ad375fb","year":2019},"citing_paper":{"arxiv_id":"2501.01242","last_updated":"2025-01-02T13:03:06Z","snapshot_observed_at":"2026-08-10T22:29:49.883122Z","submitted_at":"2025-01-02T13:03:06Z","title":"An Efficient Attention Mechanism for Sequential Recommendation Tasks: HydraRec","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-10T22:36:54.724554Z"},"links":{"citing_paper":"/paper/2501.01242"},"observation_digest":"sha256:6f12514c1bbec69501736140b6ac7b077953a232c42492c9d5aa168e5ce9f81a","observation_id":"b8c464c3-302e-491a-8339-ee0d1b0e5155","resolution":{"observed_at":"2026-08-10T22:36:55.222064Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1409.0473","last_updated":"2016-05-19T21:53:22Z","snapshot_observed_at":"2026-08-12T12:07:33.202888Z","submitted_at":"2014-09-01T16:33:02Z","title":"Neural Machine Translation by Jointly Learning to Align and Translate","version":7},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1409.0473","snapshot_observed_at":"2026-08-10T22:36:54.728217Z","title":"Neural machine translation by jointly learning to align and translate,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2501.01242","last_updated":"2025-01-02T13:03:06Z","snapshot_observed_at":"2026-08-10T22:29:49.883122Z","submitted_at":"2025-01-02T13:03:06Z","title":"An Efficient Attention Mechanism for Sequential Recommendation Tasks: HydraRec","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-10T22:36:54.728217Z"},"links":{"cited_paper":"/paper/1409.0473","citing_paper":"/paper/2501.01242"},"observation_digest":"sha256:7afbd63a5d30887c48ab6ff94cb306aa564683e0acabe99306d89828f949eaf4","observation_id":"d42ef035-896a-4545-95b8-16396d021532","resolution":{"observed_at":"2026-08-10T22:36:54.728217Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2302.09210","last_updated":"2023-02-18T02:11:36Z","snapshot_observed_at":"2026-08-09T14:17:01.779895Z","submitted_at":"2023-02-18T02:11:36Z","title":"How Good Are GPT Models at Machine Translation? A Comprehensive Evaluation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.09210","snapshot_observed_at":"2026-08-10T22:36:54.732180Z","title":"How good are gpt models at machine translation? a comprehensive evaluation,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2501.01242","last_updated":"2025-01-02T13:03:06Z","snapshot_observed_at":"2026-08-10T22:29:49.883122Z","submitted_at":"2025-01-02T13:03:06Z","title":"An Efficient Attention Mechanism for Sequential Recommendation Tasks: HydraRec","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-10T22:36:54.732180Z"},"links":{"cited_paper":"/paper/2302.09210","citing_paper":"/paper/2501.01242"},"observation_digest":"sha256:4812dc18452657899d71c3560c04129f8e42d9af72f098a43016dec2eede5d44","observation_id":"d6db0ee6-b453-42de-8794-0f34146200a6","resolution":{"observed_at":"2026-08-10T22:36:54.732180Z","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-10T22:36:55.203244Z","title":"SSE-PT: Sequential recommendation via personalized transformer,","venue":null,"work_id":"620d85b0-1488-490d-9d1c-2fe47fbed45a","year":2020},"citing_paper":{"arxiv_id":"2501.01242","last_updated":"2025-01-02T13:03:06Z","snapshot_observed_at":"2026-08-10T22:29:49.883122Z","submitted_at":"2025-01-02T13:03:06Z","title":"An Efficient Attention Mechanism for Sequential Recommendation Tasks: HydraRec","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-10T22:36:54.737162Z"},"links":{"citing_paper":"/paper/2501.01242"},"observation_digest":"sha256:88eef04486d6ac0180ddf146db863012e91b2b8579c95ec9daa3191458032d7b","observation_id":"b5fddabd-d5ae-4b64-b371-84e1f12f3f10","resolution":{"observed_at":"2026-08-10T22:36:55.208370Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2203.01536","last_updated":"2023-10-17T06:05:41Z","snapshot_observed_at":"2026-08-12T06:23:35.761889Z","submitted_at":"2022-03-03T06:17:03Z","title":"Recent Advances in Vision Transformer: A Survey and Outlook of Recent Work","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2203.01536","snapshot_observed_at":"2026-08-10T22:36:54.741593Z","title":"Recent advances in vision transformer: A survey and outlook of recent work,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2501.01242","last_updated":"2025-01-02T13:03:06Z","snapshot_observed_at":"2026-08-10T22:29:49.883122Z","submitted_at":"2025-01-02T13:03:06Z","title":"An Efficient Attention Mechanism for Sequential Recommendation Tasks: HydraRec","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-10T22:36:54.741593Z"},"links":{"cited_paper":"/paper/2203.01536","citing_paper":"/paper/2501.01242"},"observation_digest":"sha256:6a9fcc5605e6fb5487f96aaaabce91915f4c7bab6b320713dac7cedecf1ed02e","observation_id":"740dd8e0-b872-4462-8da7-c5b16ac4e8e5","resolution":{"observed_at":"2026-08-10T22:36:54.741593Z","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-10T22:36:55.190142Z","title":"Toward the next generation of recommender systems: A survey of the state-of-the-art and possible extensions,","venue":null,"work_id":"c5392bc3-8015-4737-9e9a-01064f66eb1d","year":2005},"citing_paper":{"arxiv_id":"2501.01242","last_updated":"2025-01-02T13:03:06Z","snapshot_observed_at":"2026-08-10T22:29:49.883122Z","submitted_at":"2025-01-02T13:03:06Z","title":"An Efficient Attention Mechanism for Sequential Recommendation Tasks: HydraRec","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-10T22:36:54.745494Z"},"links":{"citing_paper":"/paper/2501.01242"},"observation_digest":"sha256:518aadb854e3cde1d3faf6899215a719e3b2346dae038d9c622f5fdd8ff1f671","observation_id":"44b5af1b-503c-4962-8602-b162fc74c394","resolution":{"observed_at":"2026-08-10T22:36:55.194698Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T22:36:55.176568Z","title":"Core: simple and effective session -based recommendation within consistent representation space,","venue":null,"work_id":"9f131087-2c7b-4b94-8499-aa8c3501f07c","year":2022},"citing_paper":{"arxiv_id":"2501.01242","last_updated":"2025-01-02T13:03:06Z","snapshot_observed_at":"2026-08-10T22:29:49.883122Z","submitted_at":"2025-01-02T13:03:06Z","title":"An Efficient Attention Mechanism for Sequential Recommendation Tasks: HydraRec","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-10T22:36:54.749324Z"},"links":{"citing_paper":"/paper/2501.01242"},"observation_digest":"sha256:fa471a665639762767bc0d4f35365cbb74592878e6414d9bb6b55bd385b73725","observation_id":"1b0459dc-2062-407c-920a-f8d5f60364fb","resolution":{"observed_at":"2026-08-10T22:36:55.181215Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T22:36:55.163070Z","title":"Efficient attention: Attention with linear complexities,","venue":null,"work_id":"3c51441a-37fb-4f72-aec1-1874ba4085e3","year":2021},"citing_paper":{"arxiv_id":"2501.01242","last_updated":"2025-01-02T13:03:06Z","snapshot_observed_at":"2026-08-10T22:29:49.883122Z","submitted_at":"2025-01-02T13:03:06Z","title":"An Efficient Attention Mechanism for Sequential Recommendation Tasks: HydraRec","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-10T22:36:54.752863Z"},"links":{"citing_paper":"/paper/2501.01242"},"observation_digest":"sha256:8d778c7c71d6d507d06286c558fe2be0129b9957d384fcc76140f1e7da29b6af","observation_id":"6c8ec853-5272-45fb-9599-875e32163b17","resolution":{"observed_at":"2026-08-10T22:36:55.167932Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T22:36:55.150543Z","title":"Transformers are rnns: Fast autoregressive transformers with linear attention,","venue":null,"work_id":"e3f02584-d283-47f5-aa91-b1b750853266","year":2020},"citing_paper":{"arxiv_id":"2501.01242","last_updated":"2025-01-02T13:03:06Z","snapshot_observed_at":"2026-08-10T22:29:49.883122Z","submitted_at":"2025-01-02T13:03:06Z","title":"An Efficient Attention Mechanism for Sequential Recommendation Tasks: HydraRec","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-10T22:36:54.756250Z"},"links":{"citing_paper":"/paper/2501.01242"},"observation_digest":"sha256:4671726d2a843a38c02e312463f3607f1c913c04d930635a083cbd2b636d0c21","observation_id":"d22c619c-756c-4381-9fa7-7fe05f38db66","resolution":{"observed_at":"2026-08-10T22:36:55.154564Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2501.01242","last_updated":"2025-01-02T13:03:06Z","latest_version":1,"primary_category":"cs.IR","snapshot_observed_at":"2026-08-10T22:29:49.883122Z","submitted_at":"2025-01-02T13:03:06Z","title":"An Efficient Attention Mechanism for Sequential Recommendation Tasks: HydraRec"},"reference_resolution":{"displayed":33,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":9,"verified_exact":1,"verified_fuzzy":23},"total_outbound_references":33},"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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 12 August 2026, this Paper Citation Record lists 33 of 33 outbound references and 0 inbound Pith citation observations for arXiv:2501.01242."}