{"as_of":"2026-08-09T15:26:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:fa544d8da4ee5a4b2e83da1628ebaa7645473e78dd08c3b3e8839da154bc6362","coverage":[{"denominator":43,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":43,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T20:15:14.138329Z","state":"measured"},{"denominator":47,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":47,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T14:59:19.962749Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-06-29T15:03:31.984708Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2502.09888","last_updated":"2025-08-28T01:40:30Z","snapshot_observed_at":"2026-08-07T20:07:17.154568Z","submitted_at":"2025-02-14T03:25:09Z","title":"Climber: Toward Efficient Scaling Laws for Large Recommendation Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.09888","snapshot_observed_at":"2026-08-07T14:59:19.962749Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.16865","last_updated":"2025-06-04T11:31:59Z","snapshot_observed_at":"2026-08-07T17:34:45.087540Z","submitted_at":"2025-05-22T16:22:54Z","title":"LARES: Latent Reasoning for Sequential Recommendation","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-07T14:59:19.962749Z"},"links":{"cited_paper":"/paper/2502.09888","citing_paper":"/paper/2505.16865"},"observation_digest":"sha256:5d3bf491197cc2bca4a3449a223564a5e5bd003eec7ed3a3e8f7564597a39f7c","observation_id":"c25c7674-6aad-4ab3-9375-96739ba7ada1","resolution":{"observed_at":"2026-08-07T14:59:19.962749Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.09888","last_updated":"2025-08-28T01:40:30Z","snapshot_observed_at":"2026-08-07T20:07:17.154568Z","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:bf6f2abe1d37c329dfe005c29bcb8e23d13d12686e8b99c564dfd051334fe2d7","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08-07T20:07:17.154568Z","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":"2605.29232","last_updated":"2026-05-28T01:48:19Z","snapshot_observed_at":"2026-08-02T01:34:37.024828Z","submitted_at":"2026-05-28T01:48:19Z","title":"On the Practice of Scaling Search Conversion Rate Prediction","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-06-29T06:04:05.505743Z"},"links":{"cited_paper":"/paper/2502.09888","citing_paper":"/paper/2605.29232"},"observation_digest":"sha256:9de2cef75adfe435ee3f0455c48437b5c26c239934633e7647c617e0e66d6b91","observation_id":"feaceaf2-0d67-422e-a4c7-72f128538939","resolution":{"observed_at":"2026-06-29T15:03:31.986296Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08-07T20:07:17.154568Z","submitted_at":"2025-02-14T03:25:09Z","title":"Climber: Toward Efficient Scaling Laws for Large Recommendation Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.09888","snapshot_observed_at":"2026-07-30T15:00:20.492230Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.23718","last_updated":"2026-07-26T15:30:48Z","snapshot_observed_at":"2026-08-08T10:38:22.959049Z","submitted_at":"2026-07-26T15:30:48Z","title":"Melo: A Production LLM-Powered Music Recommendation Agent","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-07-30T15:00:20.492230Z"},"links":{"cited_paper":"/paper/2502.09888","citing_paper":"/paper/2607.23718"},"observation_digest":"sha256:17ec38eac43179fcd31f77d97968c1d8e7b1b97b141592c10340653d520d8ba9","observation_id":"db2d9d1a-b577-42f2-b059-2aa1bbc9b8a6","resolution":{"observed_at":"2026-07-30T15:00:20.492230Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2502.09888/citation-record","integrity":"/paper/2502.09888/integrity","json":"/paper/2502.09888/citation-record.json","paper":"/paper/2502.09888"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2208.08489","last_updated":"2022-08-17T19:13:17Z","snapshot_observed_at":"2026-08-03T18:34:33.961760Z","submitted_at":"2022-08-17T19:13:17Z","title":"Understanding Scaling Laws for Recommendation Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2208.08489","snapshot_observed_at":"2026-08-07T20:15:13.898263Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2502.09888","last_updated":"2025-08-28T01:40:30Z","snapshot_observed_at":"2026-08-07T20:07:17.154568Z","submitted_at":"2025-02-14T03:25:09Z","title":"Climber: Toward Efficient Scaling Laws for Large Recommendation Models","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T20:15:13.898263Z"},"links":{"cited_paper":"/paper/2208.08489","citing_paper":"/paper/2502.09888"},"observation_digest":"sha256:8bcf45de6f253caa6c5a16a0b0fdb809971770de9ed3a74017777323edab1142","observation_id":"0eaff254-29a4-4e20-af6d-1c10c879ed4c","resolution":{"observed_at":"2026-08-07T20:15:13.898263Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2308.12966","last_updated":"2023-10-13T02:41:28Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-08-24T17:59:17Z","title":"Qwen-VL: A Versatile Vision-Language Model for Understanding, Localization, Text Reading, and Beyond","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2308.12966","snapshot_observed_at":"2026-08-07T20:15:13.902808Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.09888","last_updated":"2025-08-28T01:40:30Z","snapshot_observed_at":"2026-08-07T20:07:17.154568Z","submitted_at":"2025-02-14T03:25:09Z","title":"Climber: Toward Efficient Scaling Laws for Large Recommendation Models","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T20:15:13.902808Z"},"links":{"cited_paper":"/paper/2308.12966","citing_paper":"/paper/2502.09888"},"observation_digest":"sha256:245a44c18b12e79491fd46ca186561d6d408e5b7baf39c955a93d7565ad1b01a","observation_id":"74ba1a89-7018-48da-a229-dfc537fa6028","resolution":{"observed_at":"2026-08-07T20:15:13.902808Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.02954","last_updated":"2024-01-05T18:59:13Z","snapshot_observed_at":"2026-08-02T13:11:16.882565Z","submitted_at":"2024-01-05T18:59:13Z","title":"DeepSeek LLM: Scaling Open-Source Language Models with Longtermism","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.02954","snapshot_observed_at":"2026-08-07T20:15:13.906708Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.09888","last_updated":"2025-08-28T01:40:30Z","snapshot_observed_at":"2026-08-07T20:07:17.154568Z","submitted_at":"2025-02-14T03:25:09Z","title":"Climber: Toward Efficient Scaling Laws for Large Recommendation Models","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T20:15:13.906708Z"},"links":{"cited_paper":"/paper/2401.02954","citing_paper":"/paper/2502.09888"},"observation_digest":"sha256:c299d6593fa17ae8b221201a7c3160213a3ee6d250b1cf8e132348c16f300b62","observation_id":"8eaf37d5-2f28-4454-a5c4-47f2284fb5ff","resolution":{"observed_at":"2026-08-07T20:15:13.906708Z","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-07T20:15:14.562501Z","title":null,"venue":null,"work_id":"87097389-4572-4132-a578-3cbbdbd60118","year":2019},"citing_paper":{"arxiv_id":"2502.09888","last_updated":"2025-08-28T01:40:30Z","snapshot_observed_at":"2026-08-07T20:07:17.154568Z","submitted_at":"2025-02-14T03:25:09Z","title":"Climber: Toward Efficient Scaling Laws for Large Recommendation Models","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T20:15:13.910932Z"},"links":{"citing_paper":"/paper/2502.09888"},"observation_digest":"sha256:d4b2a24eecc7cb91cd6528ea60f90db88f3a141a5a1921f9aa80da523226e511","observation_id":"8d0c4e17-cd39-407d-8d6a-1c6d67a46af2","resolution":{"observed_at":"2026-08-07T20:15:14.566111Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T20:15:14.551155Z","title":null,"venue":null,"work_id":"9e027b5d-97e4-4209-bb2e-b11cec9ccb1f","year":2023},"citing_paper":{"arxiv_id":"2502.09888","last_updated":"2025-08-28T01:40:30Z","snapshot_observed_at":"2026-08-07T20:07:17.154568Z","submitted_at":"2025-02-14T03:25:09Z","title":"Climber: Toward Efficient Scaling Laws for Large Recommendation Models","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T20:15:13.914617Z"},"links":{"citing_paper":"/paper/2502.09888"},"observation_digest":"sha256:0f224ae71887727b6a7b11a176d2d7eb7cd0c7ae335dceef8b312cb7de38fe5c","observation_id":"1d49a2db-53cc-40ef-b842-2bdfc58aacf5","resolution":{"observed_at":"2026-08-07T20:15:14.555057Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T20:15:13.918525Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.09888","last_updated":"2025-08-28T01:40:30Z","snapshot_observed_at":"2026-08-07T20:07:17.154568Z","submitted_at":"2025-02-14T03:25:09Z","title":"Climber: Toward Efficient Scaling Laws for Large Recommendation Models","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T20:15:13.918525Z"},"links":{"citing_paper":"/paper/2502.09888"},"observation_digest":"sha256:a5e3ca58e4561b752e8d76a72b8a043187bf053446810fff7bf05dde361e8a17","observation_id":"e9fab154-f10a-4775-bf85-822cfe44f02c","resolution":{"observed_at":"2026-08-07T20:15:13.918525Z","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-07T20:15:13.922348Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.09888","last_updated":"2025-08-28T01:40:30Z","snapshot_observed_at":"2026-08-07T20:07:17.154568Z","submitted_at":"2025-02-14T03:25:09Z","title":"Climber: Toward Efficient Scaling Laws for Large Recommendation Models","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T20:15:13.922348Z"},"links":{"citing_paper":"/paper/2502.09888"},"observation_digest":"sha256:1d3828ee47372dd8bb13a747607cf26f6a85d69db9ecca99104256305d9f0881","observation_id":"4f4f863a-c39e-4f8b-af9e-6129a9cfbf5f","resolution":{"observed_at":"2026-08-07T20:15:13.922348Z","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-07T20:15:13.929342Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2502.09888","last_updated":"2025-08-28T01:40:30Z","snapshot_observed_at":"2026-08-07T20:07:17.154568Z","submitted_at":"2025-02-14T03:25:09Z","title":"Climber: Toward Efficient Scaling Laws for Large Recommendation Models","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T20:15:13.929342Z"},"links":{"citing_paper":"/paper/2502.09888"},"observation_digest":"sha256:d87bf245776c0e868b153c89f984f8bbdb98a8ad75d561dbefe1d2d033970106","observation_id":"a9148771-d840-4a62-855a-e0d29322eb03","resolution":{"observed_at":"2026-08-07T20:15:13.929342Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.09398","last_updated":"2024-06-12T06:08:58Z","snapshot_observed_at":"2026-08-05T03:17:46.344890Z","submitted_at":"2024-02-14T18:54:56Z","title":"Get More with LESS: Synthesizing Recurrence with KV Cache Compression for Efficient LLM Inference","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.09398","snapshot_observed_at":"2026-08-07T20:15:13.933003Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.09888","last_updated":"2025-08-28T01:40:30Z","snapshot_observed_at":"2026-08-07T20:07:17.154568Z","submitted_at":"2025-02-14T03:25:09Z","title":"Climber: Toward Efficient Scaling Laws for Large Recommendation Models","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T20:15:13.933003Z"},"links":{"cited_paper":"/paper/2402.09398","citing_paper":"/paper/2502.09888"},"observation_digest":"sha256:615923afb6640b03d6f703b617c83bebb7918a4afb3b740caeb50752179bc33c","observation_id":"efcfaefd-a247-4353-a861-efdbe90e7350","resolution":{"observed_at":"2026-08-07T20:15:13.933003Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.00714","last_updated":"2024-12-01T07:27:20Z","snapshot_observed_at":"2026-08-09T00:05:53.518450Z","submitted_at":"2024-12-01T07:27:20Z","title":"Scaling New Frontiers: Insights into Large Recommendation Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.00714","snapshot_observed_at":"2026-08-07T20:15:13.937257Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.09888","last_updated":"2025-08-28T01:40:30Z","snapshot_observed_at":"2026-08-07T20:07:17.154568Z","submitted_at":"2025-02-14T03:25:09Z","title":"Climber: Toward Efficient Scaling Laws for Large Recommendation Models","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T20:15:13.937257Z"},"links":{"cited_paper":"/paper/2412.00714","citing_paper":"/paper/2502.09888"},"observation_digest":"sha256:6604ea2b51825ddcf4467c3e11f5f66fb5aa35efff9f3423f166a7ceace6b773","observation_id":"0389cd82-2ca5-4a17-a8ca-d7d48f8f5c99","resolution":{"observed_at":"2026-08-07T20:15:13.937257Z","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-07T20:15:14.512514Z","title":null,"venue":null,"work_id":"e514f66c-2240-49b8-86d2-8c85d802cb3f","year":2018},"citing_paper":{"arxiv_id":"2502.09888","last_updated":"2025-08-28T01:40:30Z","snapshot_observed_at":"2026-08-07T20:07:17.154568Z","submitted_at":"2025-02-14T03:25:09Z","title":"Climber: Toward Efficient Scaling Laws for Large Recommendation Models","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T20:15:14.034470Z"},"links":{"citing_paper":"/paper/2502.09888"},"observation_digest":"sha256:71d966e795a8c42490328014969c92943edb24ced48e7e9fb6625051c1e9658f","observation_id":"2e902135-c807-4ba1-aa9b-fb496357d88c","resolution":{"observed_at":"2026-08-07T20:15:14.516002Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1503.02531","last_updated":"2015-03-09T15:44:49Z","snapshot_observed_at":"2026-07-06T04:11:24.157003Z","submitted_at":"2015-03-09T15:44:49Z","title":"Distilling the Knowledge in a Neural Network","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1503.02531","snapshot_observed_at":"2026-08-07T20:15:14.038463Z","title":null,"venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2502.09888","last_updated":"2025-08-28T01:40:30Z","snapshot_observed_at":"2026-08-07T20:07:17.154568Z","submitted_at":"2025-02-14T03:25:09Z","title":"Climber: Toward Efficient Scaling Laws for Large Recommendation Models","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T20:15:14.038463Z"},"links":{"cited_paper":"/paper/1503.02531","citing_paper":"/paper/2502.09888"},"observation_digest":"sha256:141cf8f8192dfc209b3c2947444ddb3e6dd65b4c1e7628f034463c3ae0af6698","observation_id":"f96aa809-346d-4e6d-a9a5-a8176ca175ac","resolution":{"observed_at":"2026-08-07T20:15:14.038463Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2203.15556","last_updated":"2022-03-29T13:38:03Z","snapshot_observed_at":"2026-07-06T12:54:11.616335Z","submitted_at":"2022-03-29T13:38:03Z","title":"Training Compute-Optimal Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2203.15556","snapshot_observed_at":"2026-08-07T20:15:14.042065Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2502.09888","last_updated":"2025-08-28T01:40:30Z","snapshot_observed_at":"2026-08-07T20:07:17.154568Z","submitted_at":"2025-02-14T03:25:09Z","title":"Climber: Toward Efficient Scaling Laws for Large Recommendation Models","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T20:15:14.042065Z"},"links":{"cited_paper":"/paper/2203.15556","citing_paper":"/paper/2502.09888"},"observation_digest":"sha256:b2d5afbcf73b7368a19ffb0417ed73cfcc61ad422b957ea4161d561cb6f305b0","observation_id":"4fd1021c-8869-48bd-82bb-07e1ec2d6ddd","resolution":{"observed_at":"2026-08-07T20:15:14.042065Z","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-07T20:15:14.045696Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.09888","last_updated":"2025-08-28T01:40:30Z","snapshot_observed_at":"2026-08-07T20:07:17.154568Z","submitted_at":"2025-02-14T03:25:09Z","title":"Climber: Toward Efficient Scaling Laws for Large Recommendation Models","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T20:15:14.045696Z"},"links":{"citing_paper":"/paper/2502.09888"},"observation_digest":"sha256:7a7e9382411cf5f58d272c1d00e633b8b7ead95a9fc70f7e9bb6fdadd74a0f2c","observation_id":"43b1014b-d6d4-47b0-8384-c5feb567e2a2","resolution":{"observed_at":"2026-08-07T20:15:14.045696Z","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-07T20:15:14.049476Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2502.09888","last_updated":"2025-08-28T01:40:30Z","snapshot_observed_at":"2026-08-07T20:07:17.154568Z","submitted_at":"2025-02-14T03:25:09Z","title":"Climber: Toward Efficient Scaling Laws for Large Recommendation Models","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T20:15:14.049476Z"},"links":{"citing_paper":"/paper/2502.09888"},"observation_digest":"sha256:2003c07b0e0c3cb4db5b977249fc92d7a28ee2f7bc9b46ec9b1a000965fc2ac6","observation_id":"a377482f-6db0-4c6d-9ee8-254550f6412a","resolution":{"observed_at":"2026-08-07T20:15:14.049476Z","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-07T20:15:14.052567Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2502.09888","last_updated":"2025-08-28T01:40:30Z","snapshot_observed_at":"2026-08-07T20:07:17.154568Z","submitted_at":"2025-02-14T03:25:09Z","title":"Climber: Toward Efficient Scaling Laws for Large Recommendation Models","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T20:15:14.052567Z"},"links":{"citing_paper":"/paper/2502.09888"},"observation_digest":"sha256:59bc87ae56fc2bfd08f1ad90b277489f280b8c011b8b18b6aa8c455906bf516b","observation_id":"0ef23a6f-73e6-4091-9408-13241da09aa4","resolution":{"observed_at":"2026-08-07T20:15:14.052567Z","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-07T20:15:14.056493Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2502.09888","last_updated":"2025-08-28T01:40:30Z","snapshot_observed_at":"2026-08-07T20:07:17.154568Z","submitted_at":"2025-02-14T03:25:09Z","title":"Climber: Toward Efficient Scaling Laws for Large Recommendation Models","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T20:15:14.056493Z"},"links":{"citing_paper":"/paper/2502.09888"},"observation_digest":"sha256:ad6fabdcfa2884a39f642085d4305c670ce780dee256f4f4169d4a62124f6625","observation_id":"655b1abc-6ce9-4e51-aa93-426bde535917","resolution":{"observed_at":"2026-08-07T20:15:14.056493Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2001.08361","last_updated":"2020-01-23T03:59:20Z","snapshot_observed_at":"2026-07-06T08:52:12.656082Z","submitted_at":"2020-01-23T03:59:20Z","title":"Scaling Laws for Neural Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2001.08361","snapshot_observed_at":"2026-08-07T20:15:14.059598Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2502.09888","last_updated":"2025-08-28T01:40:30Z","snapshot_observed_at":"2026-08-07T20:07:17.154568Z","submitted_at":"2025-02-14T03:25:09Z","title":"Climber: Toward Efficient Scaling Laws for Large Recommendation Models","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T20:15:14.059598Z"},"links":{"cited_paper":"/paper/2001.08361","citing_paper":"/paper/2502.09888"},"observation_digest":"sha256:3b21139a2bc5f9691d505a64dd2f21b0ebc52bc88516b42132aeb8d1f0be7de1","observation_id":"149e6b83-689b-4572-ae40-baf3e07b46f2","resolution":{"observed_at":"2026-08-07T20:15:14.059598Z","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-07T20:15:14.063198Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2502.09888","last_updated":"2025-08-28T01:40:30Z","snapshot_observed_at":"2026-08-07T20:07:17.154568Z","submitted_at":"2025-02-14T03:25:09Z","title":"Climber: Toward Efficient Scaling Laws for Large Recommendation Models","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T20:15:14.063198Z"},"links":{"citing_paper":"/paper/2502.09888"},"observation_digest":"sha256:dee116ac3624f54dc6ba3037de9d8c255807f6e74af0e6cd354f163e7cb27888","observation_id":"1d65c868-d980-45bb-9d37-bc52e1572439","resolution":{"observed_at":"2026-08-07T20:15:14.063198Z","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-07T20:15:14.067142Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.09888","last_updated":"2025-08-28T01:40:30Z","snapshot_observed_at":"2026-08-07T20:07:17.154568Z","submitted_at":"2025-02-14T03:25:09Z","title":"Climber: Toward Efficient Scaling Laws for Large Recommendation Models","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T20:15:14.067142Z"},"links":{"citing_paper":"/paper/2502.09888"},"observation_digest":"sha256:cbc5ebc3ddaf233ff4d4aadf6fbb522e3f9ccaef6a5f4e7a162f754023842f3b","observation_id":"40c70e97-1767-417b-b2a5-2d84cfcc42d9","resolution":{"observed_at":"2026-08-07T20:15:14.067142Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.04434","last_updated":"2024-06-19T06:04:17Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-05-07T15:56:43Z","title":"DeepSeek-V2: A Strong, Economical, and Efficient Mixture-of-Experts Language Model","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.04434","snapshot_observed_at":"2026-08-07T20:15:14.070781Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.09888","last_updated":"2025-08-28T01:40:30Z","snapshot_observed_at":"2026-08-07T20:07:17.154568Z","submitted_at":"2025-02-14T03:25:09Z","title":"Climber: Toward Efficient Scaling Laws for Large Recommendation Models","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T20:15:14.070781Z"},"links":{"cited_paper":"/paper/2405.04434","citing_paper":"/paper/2502.09888"},"observation_digest":"sha256:24c093a47b549f26f3fd2707b397d8b05b42db6853b43e6dedd47b1e7404444e","observation_id":"fea2f38a-a783-4d78-96f7-373c093114c6","resolution":{"observed_at":"2026-08-07T20:15:14.070781Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.19437","last_updated":"2025-02-18T17:26:38Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-12-27T04:03:16Z","title":"DeepSeek-V3 Technical Report","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.19437","snapshot_observed_at":"2026-08-07T20:15:14.074368Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.09888","last_updated":"2025-08-28T01:40:30Z","snapshot_observed_at":"2026-08-07T20:07:17.154568Z","submitted_at":"2025-02-14T03:25:09Z","title":"Climber: Toward Efficient Scaling Laws for Large Recommendation Models","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T20:15:14.074368Z"},"links":{"cited_paper":"/paper/2412.19437","citing_paper":"/paper/2502.09888"},"observation_digest":"sha256:52e1f2ab7b26eb12602938e72216de898c5d269b8c64562d2a52af702d5fa0bc","observation_id":"723eec64-1ec0-45fc-95a2-ee040de68720","resolution":{"observed_at":"2026-08-07T20:15:14.074368Z","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-07T20:15:14.465170Z","title":null,"venue":null,"work_id":"fa27c1e6-49f6-4d8e-bd6d-6e1955a88d28","year":2024},"citing_paper":{"arxiv_id":"2502.09888","last_updated":"2025-08-28T01:40:30Z","snapshot_observed_at":"2026-08-07T20:07:17.154568Z","submitted_at":"2025-02-14T03:25:09Z","title":"Climber: Toward Efficient Scaling Laws for Large Recommendation Models","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T20:15:14.078093Z"},"links":{"citing_paper":"/paper/2502.09888"},"observation_digest":"sha256:cabc8ca00b99fb5f90222d79638af31c7c46244a7319f92d11b5ce84b532e257","observation_id":"2a7e2bfc-7baa-400e-aab1-b1af939aba91","resolution":{"observed_at":"2026-08-07T20:15:14.469094Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T20:15:14.455193Z","title":null,"venue":null,"work_id":"f5c1b8f1-5fc3-4b49-a8ce-d87fc0746d67","year":2022},"citing_paper":{"arxiv_id":"2502.09888","last_updated":"2025-08-28T01:40:30Z","snapshot_observed_at":"2026-08-07T20:07:17.154568Z","submitted_at":"2025-02-14T03:25:09Z","title":"Climber: Toward Efficient Scaling Laws for Large Recommendation Models","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T20:15:14.081235Z"},"links":{"citing_paper":"/paper/2502.09888"},"observation_digest":"sha256:a7542df9e458d68f87632f82485d6c515297b198b7430c35a29a7fd9c248994f","observation_id":"f7f47983-f15f-4b21-add8-5a298c1c893f","resolution":{"observed_at":"2026-08-07T20:15:14.458418Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2411.09425","last_updated":"2025-08-25T15:48:28Z","snapshot_observed_at":"2026-08-09T06:45:43.732227Z","submitted_at":"2024-11-14T13:22:41Z","title":"MARM: Unlocking the Future of Recommendation Systems through Memory Augmentation and Scalable Complexity","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.09425","snapshot_observed_at":"2026-08-07T20:15:14.083904Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.09888","last_updated":"2025-08-28T01:40:30Z","snapshot_observed_at":"2026-08-07T20:07:17.154568Z","submitted_at":"2025-02-14T03:25:09Z","title":"Climber: Toward Efficient Scaling Laws for Large Recommendation Models","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T20:15:14.083904Z"},"links":{"cited_paper":"/paper/2411.09425","citing_paper":"/paper/2502.09888"},"observation_digest":"sha256:67f5f1058925ebb8844af265d7ee1f5b060b37cecdc861b26e88809b8c86a12d","observation_id":"8d1f36a4-03dc-4651-952c-3f1473387bbd","resolution":{"observed_at":"2026-08-07T20:15:14.083904Z","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-07T20:15:14.086746Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.09888","last_updated":"2025-08-28T01:40:30Z","snapshot_observed_at":"2026-08-07T20:07:17.154568Z","submitted_at":"2025-02-14T03:25:09Z","title":"Climber: Toward Efficient Scaling Laws for Large Recommendation Models","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-07T20:15:14.086746Z"},"links":{"citing_paper":"/paper/2502.09888"},"observation_digest":"sha256:89ada16c16cc11d50204405b43176ccabc1400eaf553a598a6565566f2b9a117","observation_id":"cd8ca1e5-6652-49ff-938f-55f88a769859","resolution":{"observed_at":"2026-08-07T20:15:14.086746Z","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-07T20:15:14.092593Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2502.09888","last_updated":"2025-08-28T01:40:30Z","snapshot_observed_at":"2026-08-07T20:07:17.154568Z","submitted_at":"2025-02-14T03:25:09Z","title":"Climber: Toward Efficient Scaling Laws for Large Recommendation Models","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-07T20:15:14.092593Z"},"links":{"citing_paper":"/paper/2502.09888"},"observation_digest":"sha256:d24af246b1597d009fc8c818f67f0f62baf128bc659a73edd40f52d56977e589","observation_id":"23c9315f-3bc6-4f04-aa4c-d64bae1b0611","resolution":{"observed_at":"2026-08-07T20:15:14.092593Z","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-07T20:15:14.095285Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2502.09888","last_updated":"2025-08-28T01:40:30Z","snapshot_observed_at":"2026-08-07T20:07:17.154568Z","submitted_at":"2025-02-14T03:25:09Z","title":"Climber: Toward Efficient Scaling Laws for Large Recommendation Models","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-07T20:15:14.095285Z"},"links":{"citing_paper":"/paper/2502.09888"},"observation_digest":"sha256:1b8dfaff369670953bfb5334730640e7e70e6c7daec6ab5fc9a0a48bc8dfe408","observation_id":"7232204d-f040-4e98-bc2a-6d7759c73e5e","resolution":{"observed_at":"2026-08-07T20:15:14.095285Z","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-07T20:15:14.098697Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.09888","last_updated":"2025-08-28T01:40:30Z","snapshot_observed_at":"2026-08-07T20:07:17.154568Z","submitted_at":"2025-02-14T03:25:09Z","title":"Climber: Toward Efficient Scaling Laws for Large Recommendation Models","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-07T20:15:14.098697Z"},"links":{"citing_paper":"/paper/2502.09888"},"observation_digest":"sha256:96a4641415b942eeb46e765cacb996f7d191fe9c973545c18444304884c7387e","observation_id":"be894f2c-a275-4ecb-ac29-21b03b6c9a31","resolution":{"observed_at":"2026-08-07T20:15:14.098697Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2302.13971","last_updated":"2023-02-27T17:11:15Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-02-27T17:11:15Z","title":"LLaMA: Open and Efficient Foundation Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.13971","snapshot_observed_at":"2026-08-07T20:15:14.101749Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.09888","last_updated":"2025-08-28T01:40:30Z","snapshot_observed_at":"2026-08-07T20:07:17.154568Z","submitted_at":"2025-02-14T03:25:09Z","title":"Climber: Toward Efficient Scaling Laws for Large Recommendation Models","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-07T20:15:14.101749Z"},"links":{"cited_paper":"/paper/2302.13971","citing_paper":"/paper/2502.09888"},"observation_digest":"sha256:d2f511a9440f8505490f7e4f73546ce5890b41bf52ae8533f95ee0f7c4b6e16d","observation_id":"c15c1da0-075d-46b4-a3c1-a0d0779a959d","resolution":{"observed_at":"2026-08-07T20:15:14.101749Z","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-07T20:15:14.415252Z","title":null,"venue":null,"work_id":"d259e701-30e9-4db2-8123-9fb7eeeb902d","year":2015},"citing_paper":{"arxiv_id":"2502.09888","last_updated":"2025-08-28T01:40:30Z","snapshot_observed_at":"2026-08-07T20:07:17.154568Z","submitted_at":"2025-02-14T03:25:09Z","title":"Climber: Toward Efficient Scaling Laws for Large Recommendation Models","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-07T20:15:14.105199Z"},"links":{"citing_paper":"/paper/2502.09888"},"observation_digest":"sha256:a78bf3b440d03c802b17411ff83c5beb3d99219770a4e9ead4ed4e90bb90f21b","observation_id":"6791df61-10c1-4152-932a-cba3f73814f8","resolution":{"observed_at":"2026-08-07T20:15:14.418909Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T20:15:14.108787Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2502.09888","last_updated":"2025-08-28T01:40:30Z","snapshot_observed_at":"2026-08-07T20:07:17.154568Z","submitted_at":"2025-02-14T03:25:09Z","title":"Climber: Toward Efficient Scaling Laws for Large Recommendation Models","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-07T20:15:14.108787Z"},"links":{"citing_paper":"/paper/2502.09888"},"observation_digest":"sha256:27464ca680cc14fc85b484d280dd28729f6da6957a332c28a685feb78f06f937","observation_id":"14405a36-5fcb-41bd-b918-d1602f6de5b9","resolution":{"observed_at":"2026-08-07T20:15:14.108787Z","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-07T20:15:14.399638Z","title":null,"venue":null,"work_id":"b5afa044-7186-4f80-8585-d0e5a8eeebe4","year":2025},"citing_paper":{"arxiv_id":"2502.09888","last_updated":"2025-08-28T01:40:30Z","snapshot_observed_at":"2026-08-07T20:07:17.154568Z","submitted_at":"2025-02-14T03:25:09Z","title":"Climber: Toward Efficient Scaling Laws for Large Recommendation Models","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-07T20:15:14.112042Z"},"links":{"citing_paper":"/paper/2502.09888"},"observation_digest":"sha256:c1a2fd418088cf72978abec696cb1d5d43c2b14cddf5fac00f25e6108d78db2f","observation_id":"1300222e-0ba5-4e0b-87e1-f1ee988189de","resolution":{"observed_at":"2026-08-07T20:15:14.402532Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T20:15:14.390658Z","title":null,"venue":null,"work_id":"dd44605a-29dd-4f08-ad22-1f7d1dc4a701","year":2024},"citing_paper":{"arxiv_id":"2502.09888","last_updated":"2025-08-28T01:40:30Z","snapshot_observed_at":"2026-08-07T20:07:17.154568Z","submitted_at":"2025-02-14T03:25:09Z","title":"Climber: Toward Efficient Scaling Laws for Large Recommendation Models","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-07T20:15:14.115378Z"},"links":{"citing_paper":"/paper/2502.09888"},"observation_digest":"sha256:a487750c742e6d3599ec89b317f46bde014d2a16be2ace8b32193f7b49c7fc52","observation_id":"e26c2e80-b497-4229-a7af-fee55880270d","resolution":{"observed_at":"2026-08-07T20:15:14.393418Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T20:15:14.118543Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.09888","last_updated":"2025-08-28T01:40:30Z","snapshot_observed_at":"2026-08-07T20:07:17.154568Z","submitted_at":"2025-02-14T03:25:09Z","title":"Climber: Toward Efficient Scaling Laws for Large Recommendation Models","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-07T20:15:14.118543Z"},"links":{"citing_paper":"/paper/2502.09888"},"observation_digest":"sha256:31fb61068228b8f6101a3cd35d6cf6f31db61c18fbd3ada3d3370175b45a4cb3","observation_id":"e3ef4fc5-378c-4ac2-ac7c-58836996ed99","resolution":{"observed_at":"2026-08-07T20:15:14.118543Z","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-07T20:15:14.121685Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2502.09888","last_updated":"2025-08-28T01:40:30Z","snapshot_observed_at":"2026-08-07T20:07:17.154568Z","submitted_at":"2025-02-14T03:25:09Z","title":"Climber: Toward Efficient Scaling Laws for Large Recommendation Models","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-07T20:15:14.121685Z"},"links":{"citing_paper":"/paper/2502.09888"},"observation_digest":"sha256:439d233a7d5f7951a11b8012f088d34950f130795809a65f4e508ad972aef4a9","observation_id":"9a82b482-8da8-42d6-a868-0e0752d48fcb","resolution":{"observed_at":"2026-08-07T20:15:14.121685Z","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-07T20:15:14.373906Z","title":null,"venue":null,"work_id":"c598cee2-08d1-467b-89c4-6a12e9854ac2","year":2024},"citing_paper":{"arxiv_id":"2502.09888","last_updated":"2025-08-28T01:40:30Z","snapshot_observed_at":"2026-08-07T20:07:17.154568Z","submitted_at":"2025-02-14T03:25:09Z","title":"Climber: Toward Efficient Scaling Laws for Large Recommendation Models","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-07T20:15:14.124904Z"},"links":{"citing_paper":"/paper/2502.09888"},"observation_digest":"sha256:1fd9328e0a68100cc1cd7778f0b553084b2e6405f5e7455751a49c0d34589da1","observation_id":"5ba55aff-db2a-43e9-8b33-6ee8d136f78b","resolution":{"observed_at":"2026-08-07T20:15:14.378164Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.17152","last_updated":"2024-05-06T02:05:45Z","snapshot_observed_at":"2026-08-06T03:48:40.952592Z","submitted_at":"2024-02-27T02:37:37Z","title":"Actions Speak Louder than Words: Trillion-Parameter Sequential Transducers for Generative Recommendations","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.17152","snapshot_observed_at":"2026-08-07T20:15:14.128121Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.09888","last_updated":"2025-08-28T01:40:30Z","snapshot_observed_at":"2026-08-07T20:07:17.154568Z","submitted_at":"2025-02-14T03:25:09Z","title":"Climber: Toward Efficient Scaling Laws for Large Recommendation Models","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-07T20:15:14.128121Z"},"links":{"cited_paper":"/paper/2402.17152","citing_paper":"/paper/2502.09888"},"observation_digest":"sha256:dd5e0c85d8eae6defa0ad4fa0d2575a838bdc8ff77bf089024202ed511703841","observation_id":"d0abc6a4-ad1a-44d6-bd5d-4cb364cfd9fe","resolution":{"observed_at":"2026-08-07T20:15:14.128121Z","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-07T20:15:14.131524Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2502.09888","last_updated":"2025-08-28T01:40:30Z","snapshot_observed_at":"2026-08-07T20:07:17.154568Z","submitted_at":"2025-02-14T03:25:09Z","title":"Climber: Toward Efficient Scaling Laws for Large Recommendation Models","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-07T20:15:14.131524Z"},"links":{"citing_paper":"/paper/2502.09888"},"observation_digest":"sha256:586a1f6c7d51be8b8c502090774bb49b61e85104e18cc74de6181a1bee67d69c","observation_id":"730e8efa-7643-4b8d-ac75-743ab8bf0b9f","resolution":{"observed_at":"2026-08-07T20:15:14.131524Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.02545","last_updated":"2024-06-04T04:29:24Z","snapshot_observed_at":"2026-07-06T17:39:32.800594Z","submitted_at":"2024-03-04T23:40:20Z","title":"Wukong: Towards a Scaling Law for Large-Scale Recommendation","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.02545","snapshot_observed_at":"2026-08-07T20:15:14.134768Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.09888","last_updated":"2025-08-28T01:40:30Z","snapshot_observed_at":"2026-08-07T20:07:17.154568Z","submitted_at":"2025-02-14T03:25:09Z","title":"Climber: Toward Efficient Scaling Laws for Large Recommendation Models","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-07T20:15:14.134768Z"},"links":{"cited_paper":"/paper/2403.02545","citing_paper":"/paper/2502.09888"},"observation_digest":"sha256:a1c4269db99d5719af6e326430eb50f53261e64d4f3054615000ff79eda9b421","observation_id":"f1521fca-0268-497f-9904-7eaa8225ee3d","resolution":{"observed_at":"2026-08-07T20:15:14.134768Z","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-07T20:15:14.138329Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.09888","last_updated":"2025-08-28T01:40:30Z","snapshot_observed_at":"2026-08-07T20:07:17.154568Z","submitted_at":"2025-02-14T03:25:09Z","title":"Climber: Toward Efficient Scaling Laws for Large Recommendation Models","version":2},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-07T20:15:14.138329Z"},"links":{"citing_paper":"/paper/2502.09888"},"observation_digest":"sha256:287a90b44d810c5dcfcb6f9f4cb14ed1fef2595487b84211633ab9e521c09ce0","observation_id":"dc23b6e2-04f5-49d1-9ae1-129f1fc99263","resolution":{"observed_at":"2026-08-07T20:15:14.138329Z","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-07T20:15:14.089794Z","title":"In Proceedings of the 38th international ACM SIGIR conference on research and development in information retrieval","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.09888","last_updated":"2025-08-28T01:40:30Z","snapshot_observed_at":"2026-08-07T20:07:17.154568Z","submitted_at":"2025-02-14T03:25:09Z","title":"Climber: Toward Efficient Scaling Laws for Large Recommendation Models","version":2},"reference_index":2015,"source":"pdf_text","source_observed_at":"2026-08-07T20:15:14.089794Z"},"links":{"citing_paper":"/paper/2502.09888"},"observation_digest":"sha256:e4ad0a730578010809e233302bafa77c0c3ab11200c6ee7592f21f1b84e47248","observation_id":"7f100a3e-28ac-498b-a473-5a3c957a4e8a","resolution":{"observed_at":"2026-08-07T20:15:14.089794Z","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-07T20:15:14.528272Z","title":"In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition","venue":null,"work_id":"06904446-e0ac-4716-9684-12714949768a","year":null},"citing_paper":{"arxiv_id":"2502.09888","last_updated":"2025-08-28T01:40:30Z","snapshot_observed_at":"2026-08-07T20:07:17.154568Z","submitted_at":"2025-02-14T03:25:09Z","title":"Climber: Toward Efficient Scaling Laws for Large Recommendation Models","version":2},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-07T20:15:13.926018Z"},"links":{"citing_paper":"/paper/2502.09888"},"observation_digest":"sha256:5ae39e4f5deb6f03035c2242daf3dbd37115b8fa1288af738f7b2e2be6cc7596","observation_id":"b7d73dd1-933f-46ba-929f-9fc907ce524a","resolution":{"observed_at":"2026-08-07T20:15:14.532842Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2502.09888","last_updated":"2025-08-28T01:40:30Z","latest_version":2,"primary_category":"cs.IR","snapshot_observed_at":"2026-08-07T20:07:17.154568Z","submitted_at":"2025-02-14T03:25:09Z","title":"Climber: Toward Efficient Scaling Laws for Large Recommendation Models"},"reference_resolution":{"displayed":43,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":42,"verified_exact":0,"verified_fuzzy":1},"total_outbound_references":43},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 43 of 43 outbound references and 4 inbound Pith citation observations for arXiv:2502.09888."}