{"as_of":"2026-08-06T04:27:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5b42aa4767d40caaf062286e33e76b4d49904f287e623cf8c1ed45dd7ad223e0","coverage":[{"denominator":42,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":42,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-21T23:23:26.304190Z","state":"measured"},{"denominator":42,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":42,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-05T06:32:48.257954+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/2509.09682/citation-record","integrity":"/paper/2509.09682/integrity","json":"/paper/2509.09682/citation-record.json","paper":"/paper/2509.09682"},"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":null,"venue":null,"work_id":"3d3547e6-78ee-4fb6-8344-b1f196d58a21","year":2018},"citing_paper":{"arxiv_id":"2509.09682","last_updated":"2026-05-20T09:23:36Z","snapshot_observed_at":"2026-08-02T10:23:41.548004Z","submitted_at":"2025-08-13T15:03:38Z","title":"Faster and Memory-Efficient Training of Sequential Recommendation Models for Large Catalogs","version":6},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-21T23:23:26.304190Z"},"links":{"citing_paper":"/paper/2509.09682"},"observation_digest":"sha256:9bdf40dd671184b8e10cae02f33669caf880656cfcc42cc5ae51b6a2919c9436","observation_id":"535e15c2-e57c-4e0d-8d61-7f03cf0a7911","resolution":{"observed_at":"2026-05-21T23:24:26.428881Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"8689.334701","doi":"10.1145/3298689.3347010","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":null,"work_id":"d54eaabc-2960-4ab5-ac68-f243d1970427","year":2019},"citing_paper":{"arxiv_id":"2509.09682","last_updated":"2026-05-20T09:23:36Z","snapshot_observed_at":"2026-08-02T10:23:41.548004Z","submitted_at":"2025-08-13T15:03:38Z","title":"Faster and Memory-Efficient Training of Sequential Recommendation Models for Large Catalogs","version":6},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-21T23:23:26.304190Z"},"links":{"citing_paper":"/paper/2509.09682"},"observation_digest":"sha256:743570dbea391d62a49810d1702e446525b94bc5aab4078a2b4dffb42388e398","observation_id":"071b3634-661b-4843-9ebb-a95989ea622c","resolution":{"observed_at":"2026-05-21T23:24:26.104345Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2309.16609","last_updated":"2023-09-28T17:07:49Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-09-28T17:07:49Z","title":"Qwen Technical Report","version":1},"cited_work":{"arxiv_id":"2309.16609","doi":"10.48550/arxiv.2309.16609","metadata_source":"pith","pith_arxiv_id":"2309.16609","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Qwen Technical Report","venue":"cs.CL","work_id":"bb1fd52f-6b2f-437c-9516-37bdf6eb9be8","year":2023},"citing_paper":{"arxiv_id":"2509.09682","last_updated":"2026-05-20T09:23:36Z","snapshot_observed_at":"2026-08-02T10:23:41.548004Z","submitted_at":"2025-08-13T15:03:38Z","title":"Faster and Memory-Efficient Training of Sequential Recommendation Models for Large Catalogs","version":6},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-21T23:23:26.304190Z"},"links":{"cited_paper":"/paper/2309.16609","citing_paper":"/paper/2509.09682"},"observation_digest":"sha256:0ee708f521df742d768c3a0747c4116b6499960d94cea86a40ede30e772e0158","observation_id":"99e1ea47-4327-4a03-a798-96af3358a04f","resolution":{"observed_at":"2026-05-21T23:24:26.169739Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-07-15T23:50:15.620681+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-15T23:50:15.620681+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-05T06:32:44.755628+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":null,"venue":null,"work_id":"8d67e6e4-266e-4161-b659-667f0037a452","year":2024},"citing_paper":{"arxiv_id":"2509.09682","last_updated":"2026-05-20T09:23:36Z","snapshot_observed_at":"2026-08-02T10:23:41.548004Z","submitted_at":"2025-08-13T15:03:38Z","title":"Faster and Memory-Efficient Training of Sequential Recommendation Models for Large Catalogs","version":6},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-21T23:23:26.304190Z"},"links":{"citing_paper":"/paper/2509.09682"},"observation_digest":"sha256:3771e09608429f3523fe27eb5f2070b19334b74e0d87cdc11b0609c38a11023f","observation_id":"1e19a39c-6f29-4433-a76e-a67b9f6f071b","resolution":{"observed_at":"2026-05-21T23:24:26.387976Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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":null,"venue":null,"work_id":"878b6f29-ce99-4dee-8686-ed2e443a615b","year":2024},"citing_paper":{"arxiv_id":"2509.09682","last_updated":"2026-05-20T09:23:36Z","snapshot_observed_at":"2026-08-02T10:23:41.548004Z","submitted_at":"2025-08-13T15:03:38Z","title":"Faster and Memory-Efficient Training of Sequential Recommendation Models for Large Catalogs","version":6},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-21T23:23:26.304190Z"},"links":{"citing_paper":"/paper/2509.09682"},"observation_digest":"sha256:ab0928aa010da9696a4dd1b150182254372a7a4264f06a69b42233af162366d5","observation_id":"d050d661-4c98-433c-ac73-4fa26c1f1823","resolution":{"observed_at":"2026-05-21T23:24:26.392865Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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":null,"venue":null,"work_id":"ec3941a9-719c-49d8-b8b9-3cd394902733","year":2013},"citing_paper":{"arxiv_id":"2509.09682","last_updated":"2026-05-20T09:23:36Z","snapshot_observed_at":"2026-08-02T10:23:41.548004Z","submitted_at":"2025-08-13T15:03:38Z","title":"Faster and Memory-Efficient Training of Sequential Recommendation Models for Large Catalogs","version":6},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-21T23:23:26.304190Z"},"links":{"citing_paper":"/paper/2509.09682"},"observation_digest":"sha256:2bd8156c6230855f2b444db3f2dc37a9018cde0a0648c2ff8129eabb9621e693","observation_id":"3fa04ba0-1aba-4e75-b186-276855cc79f1","resolution":{"observed_at":"2026-05-21T23:24:26.406106Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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":null,"venue":null,"work_id":"f891682e-2b0a-45e1-b7a0-bb02635c1d75","year":2022},"citing_paper":{"arxiv_id":"2509.09682","last_updated":"2026-05-20T09:23:36Z","snapshot_observed_at":"2026-08-02T10:23:41.548004Z","submitted_at":"2025-08-13T15:03:38Z","title":"Faster and Memory-Efficient Training of Sequential Recommendation Models for Large Catalogs","version":6},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-21T23:23:26.304190Z"},"links":{"citing_paper":"/paper/2509.09682"},"observation_digest":"sha256:b563a8f0183c403b09fe83745d9797e21f66ab79bddb9c6ea4c39fedc4a13e23","observation_id":"b8be9450-1e45-41e3-b49c-733259f8c488","resolution":{"observed_at":"2026-05-21T23:24:26.370211Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2411.07770","last_updated":"2025-04-19T13:35:24Z","snapshot_observed_at":"2026-07-06T19:49:02.803513Z","submitted_at":"2024-11-12T13:06:16Z","title":"A Theoretical Analysis of Recommendation Loss Functions under Negative Sampling","version":3},"cited_work":{"arxiv_id":"2411.07770","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2411.07770","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"6aea9904-c015-4105-bfcd-2d1e517384d3","year":2024},"citing_paper":{"arxiv_id":"2509.09682","last_updated":"2026-05-20T09:23:36Z","snapshot_observed_at":"2026-08-02T10:23:41.548004Z","submitted_at":"2025-08-13T15:03:38Z","title":"Faster and Memory-Efficient Training of Sequential Recommendation Models for Large Catalogs","version":6},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-21T23:23:26.304190Z"},"links":{"cited_paper":"/paper/2411.07770","citing_paper":"/paper/2509.09682"},"observation_digest":"sha256:86003a5d03912497fe3a7764d10932d0ad138cabc1f5ae59dbb28f9b23c791da","observation_id":"0d32b1d1-dac7-4518-99b0-d880d3a14d4a","resolution":{"observed_at":"2026-05-21T23:24:26.156880Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2412.00714","last_updated":"2024-12-01T07:27:20Z","snapshot_observed_at":"2026-07-06T19:59:37.692710Z","submitted_at":"2024-12-01T07:27:20Z","title":"Scaling New Frontiers: Insights into Large Recommendation Models","version":1},"cited_work":{"arxiv_id":"2412.00714","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2412.00714","snapshot_observed_at":"2026-07-04T08:29:41.993245Z","title":null,"venue":null,"work_id":"ad8c4fc3-4722-478c-b316-9f076d22c0ab","year":2024},"citing_paper":{"arxiv_id":"2509.09682","last_updated":"2026-05-20T09:23:36Z","snapshot_observed_at":"2026-08-02T10:23:41.548004Z","submitted_at":"2025-08-13T15:03:38Z","title":"Faster and Memory-Efficient Training of Sequential Recommendation Models for Large Catalogs","version":6},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-21T23:23:26.304190Z"},"links":{"cited_paper":"/paper/2412.00714","citing_paper":"/paper/2509.09682"},"observation_digest":"sha256:9ec7dd9dd75898f10c3a985a93f9ae147520fa0a86043d8ab9ee81fa8cfa8e95","observation_id":"f97647af-0a33-4888-afa2-86c99bad6b8c","resolution":{"observed_at":"2026-05-21T23:24:26.141193Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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":null,"venue":null,"work_id":"5e14f9a6-d1a1-4bcd-8854-7a583b91a4ba","year":2025},"citing_paper":{"arxiv_id":"2509.09682","last_updated":"2026-05-20T09:23:36Z","snapshot_observed_at":"2026-08-02T10:23:41.548004Z","submitted_at":"2025-08-13T15:03:38Z","title":"Faster and Memory-Efficient Training of Sequential Recommendation Models for Large Catalogs","version":6},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-21T23:23:26.304190Z"},"links":{"citing_paper":"/paper/2509.09682"},"observation_digest":"sha256:c25716f5a1c0102c0fdb9dd2b54f1cdc697478f8347680acdaea0e81163fc55a","observation_id":"42ea1b22-d251-4ead-b23b-1230e18ce3b8","resolution":{"observed_at":"2026-05-21T23:24:26.382368Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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":null,"venue":null,"work_id":"5e100a95-5a07-46c3-9653-2202af704c56","year":2015},"citing_paper":{"arxiv_id":"2509.09682","last_updated":"2026-05-20T09:23:36Z","snapshot_observed_at":"2026-08-02T10:23:41.548004Z","submitted_at":"2025-08-13T15:03:38Z","title":"Faster and Memory-Efficient Training of Sequential Recommendation Models for Large Catalogs","version":6},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-21T23:23:26.304190Z"},"links":{"citing_paper":"/paper/2509.09682"},"observation_digest":"sha256:d605bc55ffd347b7c07465d9f1e7ac9bf07f9e145c5bcc13733b20c3f19c5e4e","observation_id":"247ffc64-fd1a-437b-9804-dd5109b93bf4","resolution":{"observed_at":"2026-05-21T23:24:26.399232Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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":null,"venue":null,"work_id":"774c0647-1c6f-4d23-8d4a-35aa5dbabbdf","year":2024},"citing_paper":{"arxiv_id":"2509.09682","last_updated":"2026-05-20T09:23:36Z","snapshot_observed_at":"2026-08-02T10:23:41.548004Z","submitted_at":"2025-08-13T15:03:38Z","title":"Faster and Memory-Efficient Training of Sequential Recommendation Models for Large Catalogs","version":6},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-21T23:23:26.304190Z"},"links":{"citing_paper":"/paper/2509.09682"},"observation_digest":"sha256:5d9f60e50ebb0e5a1f6b1151b5dbff5a4b7621dd02e0246aa3d069a71e1c1b6c","observation_id":"2be62abd-06fe-4ab6-a1cc-3ba844cfdd09","resolution":{"observed_at":"2026-05-21T23:24:26.368005Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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":null,"venue":null,"work_id":"8337980a-52aa-4094-81c0-c369cd5a7851","year":null},"citing_paper":{"arxiv_id":"2509.09682","last_updated":"2026-05-20T09:23:36Z","snapshot_observed_at":"2026-08-02T10:23:41.548004Z","submitted_at":"2025-08-13T15:03:38Z","title":"Faster and Memory-Efficient Training of Sequential Recommendation Models for Large Catalogs","version":6},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-21T23:23:26.304190Z"},"links":{"citing_paper":"/paper/2509.09682"},"observation_digest":"sha256:93142e1a8fe1d9c681098baaecefa8575d94a82fff8a722518d018d46c99df21","observation_id":"5793bdaf-1a5e-4f63-89f4-41f3727feb16","resolution":{"observed_at":"2026-05-21T23:24:26.401877Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.10989","last_updated":"2025-01-24T00:14:55Z","snapshot_observed_at":"2026-07-06T19:33:26.078722Z","submitted_at":"2024-10-14T18:17:01Z","title":"Liger Kernel: Efficient Triton Kernels for LLM Training","version":3},"cited_work":{"arxiv_id":"2410.10989","doi":"10.48550/arxiv.2410.10989","metadata_source":"arxiv_reference","pith_arxiv_id":"2410.10989","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Liger Kernel: Efficient Triton Kernels for","venue":"arXiv (Cornell University)","work_id":"ce624c61-a8db-44ff-9646-e09326d1328e","year":2024},"citing_paper":{"arxiv_id":"2509.09682","last_updated":"2026-05-20T09:23:36Z","snapshot_observed_at":"2026-08-02T10:23:41.548004Z","submitted_at":"2025-08-13T15:03:38Z","title":"Faster and Memory-Efficient Training of Sequential Recommendation Models for Large Catalogs","version":6},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-21T23:23:26.304190Z"},"links":{"cited_paper":"/paper/2410.10989","citing_paper":"/paper/2509.09682"},"observation_digest":"sha256:b142c57913d02802ac6f78c7ee424bbca627ddda7481d0eaff8c2467284cc8cb","observation_id":"1f8d291a-99be-4ee4-a35c-e3369cdfd722","resolution":{"observed_at":"2026-05-21T23:24:26.165842Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-05-24T05:54:39.54334+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-24T05:54:39.54334+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2404.01847","last_updated":"2024-10-27T14:40:08Z","snapshot_observed_at":"2026-07-06T17:54:31.739953Z","submitted_at":"2024-04-02T11:12:42Z","title":"Accelerating Transformer Pre-training with 2:4 Sparsity","version":3},"cited_work":{"arxiv_id":"2404.01847","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2404.01847","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Accelerating transformer pre- training with 2: 4 sparsity.arXiv preprint arXiv:2404.01847","venue":null,"work_id":"7a8cb6d1-a4c9-4bcd-a920-1488109dc29c","year":2024},"citing_paper":{"arxiv_id":"2509.09682","last_updated":"2026-05-20T09:23:36Z","snapshot_observed_at":"2026-08-02T10:23:41.548004Z","submitted_at":"2025-08-13T15:03:38Z","title":"Faster and Memory-Efficient Training of Sequential Recommendation Models for Large Catalogs","version":6},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-05-21T23:23:26.304190Z"},"links":{"cited_paper":"/paper/2404.01847","citing_paper":"/paper/2509.09682"},"observation_digest":"sha256:1083c91bad71117e7c1bcebff100cdc203241b2d55832814ed7d4cc4de1cd3c6","observation_id":"a12b4328-f815-4a3f-8ca5-13a6bc1c1354","resolution":{"observed_at":"2026-05-21T23:24:26.181121Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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":null,"venue":null,"work_id":"caa831aa-0874-406b-8370-1b0c2300244f","year":2018},"citing_paper":{"arxiv_id":"2509.09682","last_updated":"2026-05-20T09:23:36Z","snapshot_observed_at":"2026-08-02T10:23:41.548004Z","submitted_at":"2025-08-13T15:03:38Z","title":"Faster and Memory-Efficient Training of Sequential Recommendation Models for Large Catalogs","version":6},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-21T23:23:26.304190Z"},"links":{"citing_paper":"/paper/2509.09682"},"observation_digest":"sha256:ae261aa11d4f5cdbd31ae4335f484122da75af539f50f6f57dc19b145f70c664","observation_id":"f92842ff-9397-424c-b00d-be33b740d4f0","resolution":{"observed_at":"2026-05-21T23:24:26.419413Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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":null,"venue":null,"work_id":"4c9cd289-6a11-44ae-9ad8-be1c285fa4f5","year":2023},"citing_paper":{"arxiv_id":"2509.09682","last_updated":"2026-05-20T09:23:36Z","snapshot_observed_at":"2026-08-02T10:23:41.548004Z","submitted_at":"2025-08-13T15:03:38Z","title":"Faster and Memory-Efficient Training of Sequential Recommendation Models for Large Catalogs","version":6},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-21T23:23:26.304190Z"},"links":{"citing_paper":"/paper/2509.09682"},"observation_digest":"sha256:c52653da0de3b3fbfb37fb05659aea11b2769a56d2c46cbcaeb1dc5dbf9582e7","observation_id":"663bd48a-d3b6-49e4-830e-fd68cb0535f2","resolution":{"observed_at":"2026-05-21T23:24:26.389004Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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":null,"venue":null,"work_id":"01a70cbb-bc13-484c-9579-568d86abfab4","year":2024},"citing_paper":{"arxiv_id":"2509.09682","last_updated":"2026-05-20T09:23:36Z","snapshot_observed_at":"2026-08-02T10:23:41.548004Z","submitted_at":"2025-08-13T15:03:38Z","title":"Faster and Memory-Efficient Training of Sequential Recommendation Models for Large Catalogs","version":6},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-05-21T23:23:26.304190Z"},"links":{"citing_paper":"/paper/2509.09682"},"observation_digest":"sha256:5eee16712914ee7ff7ebe6d3e4bc4403eefa4357831a97a4ec55a5c204d57d6c","observation_id":"2ea50a43-469a-4c78-b0a2-ba121b52e16d","resolution":{"observed_at":"2026-05-21T23:24:26.422119Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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":null,"venue":null,"work_id":"e4a7e15b-33c0-4359-97a4-98c02018870e","year":2014},"citing_paper":{"arxiv_id":"2509.09682","last_updated":"2026-05-20T09:23:36Z","snapshot_observed_at":"2026-08-02T10:23:41.548004Z","submitted_at":"2025-08-13T15:03:38Z","title":"Faster and Memory-Efficient Training of Sequential Recommendation Models for Large Catalogs","version":6},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-05-21T23:23:26.304190Z"},"links":{"citing_paper":"/paper/2509.09682"},"observation_digest":"sha256:cf5cdbc87943e2ce2c9894cdd65d9ef1e5735799a8642fb40b4994ff98062fd9","observation_id":"19dfe354-c741-4785-9327-905ca54ea2d1","resolution":{"observed_at":"2026-05-21T23:24:26.414542Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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":null,"venue":null,"work_id":"3b7a120e-6966-4bc1-84b9-cfca6a217628","year":2022},"citing_paper":{"arxiv_id":"2509.09682","last_updated":"2026-05-20T09:23:36Z","snapshot_observed_at":"2026-08-02T10:23:41.548004Z","submitted_at":"2025-08-13T15:03:38Z","title":"Faster and Memory-Efficient Training of Sequential Recommendation Models for Large Catalogs","version":6},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-05-21T23:23:26.304190Z"},"links":{"citing_paper":"/paper/2509.09682"},"observation_digest":"sha256:b32b7b552d85be86b5cc899ecc4d81b27901762538348857debf67d97e0d14e3","observation_id":"9ff7222c-c326-4895-bcd4-e6ade21111ca","resolution":{"observed_at":"2026-05-21T23:24:26.365738Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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":null,"venue":null,"work_id":"aab6f8a2-79c0-481e-84a1-4dc632518946","year":2015},"citing_paper":{"arxiv_id":"2509.09682","last_updated":"2026-05-20T09:23:36Z","snapshot_observed_at":"2026-08-02T10:23:41.548004Z","submitted_at":"2025-08-13T15:03:38Z","title":"Faster and Memory-Efficient Training of Sequential Recommendation Models for Large Catalogs","version":6},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-05-21T23:23:26.304190Z"},"links":{"citing_paper":"/paper/2509.09682"},"observation_digest":"sha256:0c8e3e0eabe2dfb2ab5b9269c6f38359cbff39332727594e23c1702cb3aa7591","observation_id":"da1d8d62-0d35-4e0b-b6e4-15f2ad58f412","resolution":{"observed_at":"2026-05-21T23:24:26.424800Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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":null,"venue":null,"work_id":"d44d6013-bf92-4b15-b117-df8df634d95e","year":2024},"citing_paper":{"arxiv_id":"2509.09682","last_updated":"2026-05-20T09:23:36Z","snapshot_observed_at":"2026-08-02T10:23:41.548004Z","submitted_at":"2025-08-13T15:03:38Z","title":"Faster and Memory-Efficient Training of Sequential Recommendation Models for Large Catalogs","version":6},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-05-21T23:23:26.304190Z"},"links":{"citing_paper":"/paper/2509.09682"},"observation_digest":"sha256:f84270a8627f1e0384f094f67a83cb3d85f88524176ce02a929dcdc7508bd02f","observation_id":"c9f6f846-9a3f-4ee4-a620-8bc47465cb14","resolution":{"observed_at":"2026-05-21T23:24:26.408252Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1710.03740","last_updated":"2018-02-15T20:04:02Z","snapshot_observed_at":"2026-07-06T06:03:37.247241Z","submitted_at":"2017-10-10T17:42:04Z","title":"Mixed Precision Training","version":3},"cited_work":{"arxiv_id":"1710.03740","doi":"10.48550/arxiv.1710.03740","metadata_source":"pith","pith_arxiv_id":"1710.03740","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Mixed Precision Training","venue":"cs.AI","work_id":"c525941b-ce20-4bcb-8509-a9968f1e89c3","year":2017},"citing_paper":{"arxiv_id":"2509.09682","last_updated":"2026-05-20T09:23:36Z","snapshot_observed_at":"2026-08-02T10:23:41.548004Z","submitted_at":"2025-08-13T15:03:38Z","title":"Faster and Memory-Efficient Training of Sequential Recommendation Models for Large Catalogs","version":6},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-05-21T23:23:26.304190Z"},"links":{"cited_paper":"/paper/1710.03740","citing_paper":"/paper/2509.09682"},"observation_digest":"sha256:256b2bc68fca0510025bc913bc9eddfc190fc86f6362b59599bd8b6ac6e7e83e","observation_id":"610ade97-66bf-4886-9f68-fdf64f62c82d","resolution":{"observed_at":"2026-05-21T23:24:26.189442Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-07-09T10:48:36.073032+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-09T10:48:36.073032+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1805.02867","last_updated":"2018-07-28T06:51:27Z","snapshot_observed_at":"2026-07-06T06:37:55.065033Z","submitted_at":"2018-05-08T07:34:17Z","title":"Online normalizer calculation for softmax","version":2},"cited_work":{"arxiv_id":"1805.02867","doi":null,"metadata_source":"pith","pith_arxiv_id":"1805.02867","snapshot_observed_at":"2026-07-04T17:50:00.641865Z","title":"Online normalizer calculation for softmax","venue":"cs.PF","work_id":"69eba45e-8338-46b7-b28a-e99bb687af56","year":2018},"citing_paper":{"arxiv_id":"2509.09682","last_updated":"2026-05-20T09:23:36Z","snapshot_observed_at":"2026-08-02T10:23:41.548004Z","submitted_at":"2025-08-13T15:03:38Z","title":"Faster and Memory-Efficient Training of Sequential Recommendation Models for Large Catalogs","version":6},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-05-21T23:23:26.304190Z"},"links":{"cited_paper":"/paper/1805.02867","citing_paper":"/paper/2509.09682"},"observation_digest":"sha256:2194e427dabf97fab43b49fd7250f438aae70b5991fb0f600799e5dd33e56817","observation_id":"5c992fee-4167-4150-99c7-5b1a4c1c9940","resolution":{"observed_at":"2026-05-21T23:24:26.146100Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.17276","last_updated":"2024-10-29T04:32:17Z","snapshot_observed_at":"2026-08-04T11:04:42.125756Z","submitted_at":"2024-10-08T00:23:17Z","title":"Evaluating Performance and Bias of Negative Sampling in Large-Scale Sequential Recommendation Models","version":2},"cited_work":{"arxiv_id":"2410.17276","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2410.17276","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Prakash, D","venue":null,"work_id":"e0e209a5-7bef-4d39-a5ce-f0bbd6d63a65","year":2024},"citing_paper":{"arxiv_id":"2509.09682","last_updated":"2026-05-20T09:23:36Z","snapshot_observed_at":"2026-08-02T10:23:41.548004Z","submitted_at":"2025-08-13T15:03:38Z","title":"Faster and Memory-Efficient Training of Sequential Recommendation Models for Large Catalogs","version":6},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-05-21T23:23:26.304190Z"},"links":{"cited_paper":"/paper/2410.17276","citing_paper":"/paper/2509.09682"},"observation_digest":"sha256:ac799c5c532d711479f42b0cc703790c43dacba2e4e11ee9036e942b42cb18b1","observation_id":"6eac0779-dd88-402c-8b81-be75fc63abda","resolution":{"observed_at":"2026-05-21T23:24:26.152452Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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":null,"venue":null,"work_id":"f4944b15-9c12-43a7-9f1c-0022d6aa7766","year":2017},"citing_paper":{"arxiv_id":"2509.09682","last_updated":"2026-05-20T09:23:36Z","snapshot_observed_at":"2026-08-02T10:23:41.548004Z","submitted_at":"2025-08-13T15:03:38Z","title":"Faster and Memory-Efficient Training of Sequential Recommendation Models for Large Catalogs","version":6},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-05-21T23:23:26.304190Z"},"links":{"citing_paper":"/paper/2509.09682"},"observation_digest":"sha256:4723755e359e55073b845235ae829bab12cd2afb5dd85a695da55c98fbe64024","observation_id":"56490b3a-28f7-445e-b4c8-1a7516e52079","resolution":{"observed_at":"2026-05-21T23:24:26.403965Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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":null,"venue":null,"work_id":"4630d4eb-f9f7-416d-ba04-b60a86ed123b","year":2024},"citing_paper":{"arxiv_id":"2509.09682","last_updated":"2026-05-20T09:23:36Z","snapshot_observed_at":"2026-08-02T10:23:41.548004Z","submitted_at":"2025-08-13T15:03:38Z","title":"Faster and Memory-Efficient Training of Sequential Recommendation Models for Large Catalogs","version":6},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-05-21T23:23:26.304190Z"},"links":{"citing_paper":"/paper/2509.09682"},"observation_digest":"sha256:703d9009748d44922b562fdb39b1493ba9b14b736e81ef2d63d9fbf26a804fb7","observation_id":"ae25b3a8-d16a-4a20-9579-a9d846719bfe","resolution":{"observed_at":"2026-05-21T23:24:26.389698Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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":null,"venue":null,"work_id":"17e32159-c609-4139-91b4-543aa2672bcf","year":2024},"citing_paper":{"arxiv_id":"2509.09682","last_updated":"2026-05-20T09:23:36Z","snapshot_observed_at":"2026-08-02T10:23:41.548004Z","submitted_at":"2025-08-13T15:03:38Z","title":"Faster and Memory-Efficient Training of Sequential Recommendation Models for Large Catalogs","version":6},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-05-21T23:23:26.304190Z"},"links":{"citing_paper":"/paper/2509.09682"},"observation_digest":"sha256:b61f72c47ab2b3ef839b5f17b3dcf6a99f27f5b69f5575f1152d41c805da15e4","observation_id":"7344a753-4fef-4175-92d8-60243439231f","resolution":{"observed_at":"2026-05-21T23:24:26.410293Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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":null,"venue":null,"work_id":"3319f528-ad8e-48b4-ad0a-a92cb0630280","year":2010},"citing_paper":{"arxiv_id":"2509.09682","last_updated":"2026-05-20T09:23:36Z","snapshot_observed_at":"2026-08-02T10:23:41.548004Z","submitted_at":"2025-08-13T15:03:38Z","title":"Faster and Memory-Efficient Training of Sequential Recommendation Models for Large Catalogs","version":6},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-05-21T23:23:26.304190Z"},"links":{"citing_paper":"/paper/2509.09682"},"observation_digest":"sha256:4e7f4e857238b4c8fb71e37a6b5fe7159149d38d427b2f7f0719abf43101951f","observation_id":"36591f04-8176-4d45-b489-70e43773effb","resolution":{"observed_at":"2026-05-21T23:24:26.380205Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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":null,"venue":null,"work_id":"9e8c176c-dacd-4375-9eb3-f25b2b110104","year":2019},"citing_paper":{"arxiv_id":"2509.09682","last_updated":"2026-05-20T09:23:36Z","snapshot_observed_at":"2026-08-02T10:23:41.548004Z","submitted_at":"2025-08-13T15:03:38Z","title":"Faster and Memory-Efficient Training of Sequential Recommendation Models for Large Catalogs","version":6},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-05-21T23:23:26.304190Z"},"links":{"citing_paper":"/paper/2509.09682"},"observation_digest":"sha256:a769377a7c8a3da7c6565bf90b2a9d4bc5b6d4d177681593d953f0f426767650","observation_id":"c3b8f321-5633-4dd7-a3fe-31f4fcc7f424","resolution":{"observed_at":"2026-05-21T23:24:26.387010Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.08295","last_updated":"2024-04-16T12:52:47Z","snapshot_observed_at":"2026-08-03T03:29:01.959523Z","submitted_at":"2024-03-13T06:59:16Z","title":"Gemma: Open Models Based on Gemini Research and Technology","version":4},"cited_work":{"arxiv_id":"2403.08295","doi":"10.48550/arxiv.2403.08295","metadata_source":"pith","pith_arxiv_id":"2403.08295","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Gemma: Open Models Based on Gemini Research and Technology","venue":"cs.CL","work_id":"a9ea2870-df28-40b8-a9e0-a7e9a116f793","year":2024},"citing_paper":{"arxiv_id":"2509.09682","last_updated":"2026-05-20T09:23:36Z","snapshot_observed_at":"2026-08-02T10:23:41.548004Z","submitted_at":"2025-08-13T15:03:38Z","title":"Faster and Memory-Efficient Training of Sequential Recommendation Models for Large Catalogs","version":6},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-05-21T23:23:26.304190Z"},"links":{"cited_paper":"/paper/2403.08295","citing_paper":"/paper/2509.09682"},"observation_digest":"sha256:b22fe44d112e2622ac9581b2cac423b4c35b0fb4b1657d5587b2dd6a7d139433","observation_id":"1dcc9090-c579-4acd-bae7-778059620bda","resolution":{"observed_at":"2026-05-21T23:24:26.175893Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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":null,"venue":null,"work_id":"68b4fe23-6729-4123-88a4-5d59bd114f10","year":2019},"citing_paper":{"arxiv_id":"2509.09682","last_updated":"2026-05-20T09:23:36Z","snapshot_observed_at":"2026-08-02T10:23:41.548004Z","submitted_at":"2025-08-13T15:03:38Z","title":"Faster and Memory-Efficient Training of Sequential Recommendation Models for Large Catalogs","version":6},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-05-21T23:23:26.304190Z"},"links":{"citing_paper":"/paper/2509.09682"},"observation_digest":"sha256:82e9654fbcf693c35b9a2cc4da216a98e0f5d185c70aaa24a3e5548ec6909029","observation_id":"b5ca7bc6-27fb-48b1-8c9a-1f45fb869a2b","resolution":{"observed_at":"2026-05-21T23:24:26.417017Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2307.09288","last_updated":"2023-07-19T17:08:59Z","snapshot_observed_at":"2026-08-02T11:57:18.735747Z","submitted_at":"2023-07-18T14:31:57Z","title":"Llama 2: Open Foundation and Fine-Tuned Chat Models","version":2},"cited_work":{"arxiv_id":"2307.09288","doi":"10.24963/ijcai.2025/706","metadata_source":"pith","pith_arxiv_id":"2307.09288","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Llama 2: Open Foundation and Fine-Tuned Chat Models","venue":"cs.CL","work_id":"68a5177f-d644-44c1-bd4f-4e5278c22f5d","year":2023},"citing_paper":{"arxiv_id":"2509.09682","last_updated":"2026-05-20T09:23:36Z","snapshot_observed_at":"2026-08-02T10:23:41.548004Z","submitted_at":"2025-08-13T15:03:38Z","title":"Faster and Memory-Efficient Training of Sequential Recommendation Models for Large Catalogs","version":6},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-05-21T23:23:26.304190Z"},"links":{"cited_paper":"/paper/2307.09288","citing_paper":"/paper/2509.09682"},"observation_digest":"sha256:b69c66e62b3c7647987f5d514f04f63efe4d512401e8dc2692c5d66d3bf954be","observation_id":"7da0a41c-c439-4427-b242-d9849d5ff78b","resolution":{"observed_at":"2026-05-21T23:24:26.160818Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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":null,"venue":null,"work_id":"f3f438d2-9c51-4302-884d-edcb3da2822d","year":2015},"citing_paper":{"arxiv_id":"2509.09682","last_updated":"2026-05-20T09:23:36Z","snapshot_observed_at":"2026-08-02T10:23:41.548004Z","submitted_at":"2025-08-13T15:03:38Z","title":"Faster and Memory-Efficient Training of Sequential Recommendation Models for Large Catalogs","version":6},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-05-21T23:23:26.304190Z"},"links":{"citing_paper":"/paper/2509.09682"},"observation_digest":"sha256:665dc1e113932db4421b611cf437d0da7701f3bd218f08fa793b59f66288b904","observation_id":"29df56ee-4ed8-4988-af86-cddf390405c6","resolution":{"observed_at":"2026-05-21T23:24:26.394986Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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":null,"venue":null,"work_id":"2a8464bf-cd8d-4b1a-9d6c-73f6505dc7d5","year":2024},"citing_paper":{"arxiv_id":"2509.09682","last_updated":"2026-05-20T09:23:36Z","snapshot_observed_at":"2026-08-02T10:23:41.548004Z","submitted_at":"2025-08-13T15:03:38Z","title":"Faster and Memory-Efficient Training of Sequential Recommendation Models for Large Catalogs","version":6},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-05-21T23:23:26.304190Z"},"links":{"citing_paper":"/paper/2509.09682"},"observation_digest":"sha256:5b5786aeb193cfb993bdda8135c811c347c6b7cb64bde5b20a4920b155481444","observation_id":"d93b5549-83fb-4cd9-a91e-2792c9bcf161","resolution":{"observed_at":"2026-05-21T23:24:26.412395Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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":null,"venue":null,"work_id":"21ade9ba-64c9-45ae-986f-dd8c2efde4d6","year":2024},"citing_paper":{"arxiv_id":"2509.09682","last_updated":"2026-05-20T09:23:36Z","snapshot_observed_at":"2026-08-02T10:23:41.548004Z","submitted_at":"2025-08-13T15:03:38Z","title":"Faster and Memory-Efficient Training of Sequential Recommendation Models for Large Catalogs","version":6},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-05-21T23:23:26.304190Z"},"links":{"citing_paper":"/paper/2509.09682"},"observation_digest":"sha256:cac136d33ed7cc596ad6958905ffbb1bab687751d42c33952f039d30ccda49bf","observation_id":"533130c8-6980-47d1-a5b6-75551ae053ab","resolution":{"observed_at":"2026-05-21T23:24:26.426913Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2411.09009","last_updated":"2025-03-10T23:08:54Z","snapshot_observed_at":"2026-08-06T03:12:07.851370Z","submitted_at":"2024-11-13T20:30:15Z","title":"Cut Your Losses in Large-Vocabulary Language Models","version":2},"cited_work":{"arxiv_id":"2411.09009","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2411.09009","snapshot_observed_at":"2026-07-01T23:56:23.985782Z","title":"Cut your losses in large-vocabulary language models","venue":null,"work_id":"4dd223f7-8e2e-454c-90b3-81528ab8080f","year":2025},"citing_paper":{"arxiv_id":"2509.09682","last_updated":"2026-05-20T09:23:36Z","snapshot_observed_at":"2026-08-02T10:23:41.548004Z","submitted_at":"2025-08-13T15:03:38Z","title":"Faster and Memory-Efficient Training of Sequential Recommendation Models for Large Catalogs","version":6},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-05-21T23:23:26.304190Z"},"links":{"cited_paper":"/paper/2411.09009","citing_paper":"/paper/2509.09682"},"observation_digest":"sha256:87a2e08fbf283898bf48f33034ed529a26b4e4e50d8f70682df6ab781ae90331","observation_id":"8619c83e-531d-45a5-be67-095bea1cfbc1","resolution":{"observed_at":"2026-05-21T23:24:26.193277Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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":null,"venue":null,"work_id":"4e65e564-cd17-410b-b3e8-57c5539730c3","year":2023},"citing_paper":{"arxiv_id":"2509.09682","last_updated":"2026-05-20T09:23:36Z","snapshot_observed_at":"2026-08-02T10:23:41.548004Z","submitted_at":"2025-08-13T15:03:38Z","title":"Faster and Memory-Efficient Training of Sequential Recommendation Models for Large Catalogs","version":6},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-05-21T23:23:26.304190Z"},"links":{"citing_paper":"/paper/2509.09682"},"observation_digest":"sha256:7db1d653111d271276fb5aee48ccf3f85a62825cc1cfe7fdf7e93877ab948901","observation_id":"1eb5f3e4-d243-491f-a9e5-9c4828b49a00","resolution":{"observed_at":"2026-05-21T23:24:26.397248Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.09888","last_updated":"2025-08-28T01:40:30Z","snapshot_observed_at":"2026-07-06T20:36:26.822412Z","submitted_at":"2025-02-14T03:25:09Z","title":"Climber: Toward Efficient Scaling Laws for Large Recommendation Models","version":2},"cited_work":{"arxiv_id":"2502.09888","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.09888","snapshot_observed_at":"2026-06-29T15:03:31.984708Z","title":"Climber: Toward efficient scaling laws for large recommendation models.arXiv preprint arXiv:2502.09888, 2025","venue":null,"work_id":"1a49f2ee-2a4a-4b02-aecd-303758ab22cd","year":2025},"citing_paper":{"arxiv_id":"2509.09682","last_updated":"2026-05-20T09:23:36Z","snapshot_observed_at":"2026-08-02T10:23:41.548004Z","submitted_at":"2025-08-13T15:03:38Z","title":"Faster and Memory-Efficient Training of Sequential Recommendation Models for Large Catalogs","version":6},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-05-21T23:23:26.304190Z"},"links":{"cited_paper":"/paper/2502.09888","citing_paper":"/paper/2509.09682"},"observation_digest":"sha256:b32c83690fe42546037e9045f340fb649441db48292ea6c28ddd1e684ee1c389","observation_id":"f30fd532-bb4f-425b-8451-eac953ae4548","resolution":{"observed_at":"2026-05-21T23:24:26.185200Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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":null,"venue":null,"work_id":"ef0a505d-dc01-4d58-9de8-b9fda7544845","year":2024},"citing_paper":{"arxiv_id":"2509.09682","last_updated":"2026-05-20T09:23:36Z","snapshot_observed_at":"2026-08-02T10:23:41.548004Z","submitted_at":"2025-08-13T15:03:38Z","title":"Faster and Memory-Efficient Training of Sequential Recommendation Models for Large Catalogs","version":6},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-05-21T23:23:26.304190Z"},"links":{"citing_paper":"/paper/2509.09682"},"observation_digest":"sha256:f35ac6726da1168123c7fb62e013ac583506c1d40a4a1982e5fa77fae0042342","observation_id":"5380c05a-73bb-4d82-8ab7-e4f891a90d8a","resolution":{"observed_at":"2026-05-21T23:24:26.375642Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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":null,"venue":null,"work_id":"c8eb58fe-1b9b-404d-8edc-c6bc35e173ba","year":2022},"citing_paper":{"arxiv_id":"2509.09682","last_updated":"2026-05-20T09:23:36Z","snapshot_observed_at":"2026-08-02T10:23:41.548004Z","submitted_at":"2025-08-13T15:03:38Z","title":"Faster and Memory-Efficient Training of Sequential Recommendation Models for Large Catalogs","version":6},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-05-21T23:23:26.304190Z"},"links":{"citing_paper":"/paper/2509.09682"},"observation_digest":"sha256:7db2f3094c35485c39638bf0b3c4dd84dab1671ac8976cbaf2c7f0594b2d0a38","observation_id":"dce7ebab-aadc-4ae1-9f3b-785ad9dba484","resolution":{"observed_at":"2026-05-21T23:24:26.390883Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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":null,"venue":null,"work_id":"2cc09e19-5df2-4c52-b3e3-167cc7fcc223","year":2024},"citing_paper":{"arxiv_id":"2509.09682","last_updated":"2026-05-20T09:23:36Z","snapshot_observed_at":"2026-08-02T10:23:41.548004Z","submitted_at":"2025-08-13T15:03:38Z","title":"Faster and Memory-Efficient Training of Sequential Recommendation Models for Large Catalogs","version":6},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-05-21T23:23:26.304190Z"},"links":{"citing_paper":"/paper/2509.09682"},"observation_digest":"sha256:5456f38f2307961208641c5a5b0938b57e5aea2bcc204262bb073d38dc94db6a","observation_id":"13d8a272-4d68-4101-9ef9-207b9ed90c9f","resolution":{"observed_at":"2026-05-21T23:24:26.391351Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2509.09682","last_updated":"2026-05-20T09:23:36Z","latest_version":6,"primary_category":"cs.IR","snapshot_observed_at":"2026-08-02T10:23:41.548004Z","submitted_at":"2025-08-13T15:03:38Z","title":"Faster and Memory-Efficient Training of Sequential Recommendation Models for Large Catalogs"},"reference_resolution":{"displayed":42,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":29,"verified_exact":13,"verified_fuzzy":0},"total_outbound_references":42},"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-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"thesis":"As of 6 August 2026, this Paper Citation Record lists 42 of 42 outbound references and 0 inbound Pith citation observations for arXiv:2509.09682."}