{"as_of":"2026-08-23T20:08:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:97803ab06cdb384c7acf0acbf70ad92956afbdc7fa8bbca5142ce3ddfc101ab7","coverage":[{"denominator":29,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":29,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T23:39:25.771682Z","state":"measured"},{"denominator":61,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":61,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-23T06:30:58.430688+00:00","state":"measured"},{"denominator":32,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":32,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T16:19:47.026404Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":1,"source":"arxiv_reference","source_observed_at":"2026-08-05T02:28:24.338817Z","state":"measured"}],"external_citation_measurements":[{"count":0,"observed_at":"2026-08-05T02:28:24.338817Z","source":"arxiv_reference"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2505.04180","last_updated":"2025-05-08T07:51:26Z","snapshot_observed_at":"2026-08-20T03:52:43.157286Z","submitted_at":"2025-05-07T07:25:46Z","title":"Towards Large-scale Generative Ranking","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.04180","snapshot_observed_at":"2026-08-06T19:06:03.798087Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2507.06507","last_updated":"2025-07-14T07:46:11Z","snapshot_observed_at":"2026-08-19T21:36:03.963334Z","submitted_at":"2025-07-09T03:13:08Z","title":"GR-LLMs: Recent Advances in Generative Recommendation Based on Large Language Models","version":2},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-06T19:06:03.798087Z"},"links":{"cited_paper":"/paper/2505.04180","citing_paper":"/paper/2507.06507"},"observation_digest":"sha256:d0b380527f624ec910eb6c5533d9035c6b085d73e8394b0f31708a33076fe008","observation_id":"3360218f-bb60-44bf-abdd-241078655be1","resolution":{"observed_at":"2026-08-06T19:06:03.798087Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.04180","last_updated":"2025-05-08T07:51:26Z","snapshot_observed_at":"2026-08-20T03:52:43.157286Z","submitted_at":"2025-05-07T07:25:46Z","title":"Towards Large-scale Generative Ranking","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.04180","snapshot_observed_at":"2026-08-06T14:43:53.793746Z","title":"Ruiwen Xu, and Lei Zhang","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2508.05640","last_updated":"2025-08-14T23:38:08Z","snapshot_observed_at":"2026-08-18T08:52:48.280607Z","submitted_at":"2025-07-24T05:56:55Z","title":"Request-Only Optimization for Recommendation Systems","version":3},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-06T14:43:53.793746Z"},"links":{"cited_paper":"/paper/2505.04180","citing_paper":"/paper/2508.05640"},"observation_digest":"sha256:6ac708e4fef4aed7b97980c7ccaa6aec88cc68a16e7d7709a506bfe06e1fc5a5","observation_id":"07f1671a-3711-4566-adbc-9aa7e288e019","resolution":{"observed_at":"2026-08-06T14:43:53.793746Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.04180","last_updated":"2025-05-08T07:51:26Z","snapshot_observed_at":"2026-08-20T03:52:43.157286Z","submitted_at":"2025-05-07T07:25:46Z","title":"Towards Large-scale Generative Ranking","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.04180","snapshot_observed_at":"2026-08-05T16:19:07.455503Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2508.18739","last_updated":"2025-08-26T07:11:44Z","snapshot_observed_at":"2026-08-13T16:48:01.739577Z","submitted_at":"2025-08-26T07:11:44Z","title":"Beyond Quality: Unlocking Diversity in Ad Headline Generation with Large Language Models","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-05T16:19:07.455503Z"},"links":{"cited_paper":"/paper/2505.04180","citing_paper":"/paper/2508.18739"},"observation_digest":"sha256:24c05610937565188c3233f16bda35c2bf7880b9707d9bd780b4ce23662ccd3f","observation_id":"a7b02637-e695-49a1-8316-85e291967c19","resolution":{"observed_at":"2026-08-05T16:19:07.455503Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.04180","last_updated":"2025-05-08T07:51:26Z","snapshot_observed_at":"2026-08-20T03:52:43.157286Z","submitted_at":"2025-05-07T07:25:46Z","title":"Towards Large-scale Generative Ranking","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.04180","snapshot_observed_at":"2026-08-05T04:42:44.463434Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.06002","last_updated":"2025-09-07T10:29:41Z","snapshot_observed_at":"2026-08-16T14:27:30.664493Z","submitted_at":"2025-09-07T10:29:41Z","title":"A Survey of Real-World Recommender Systems: Challenges, Constraints, and Industrial Perspectives","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-05T04:42:44.463434Z"},"links":{"cited_paper":"/paper/2505.04180","citing_paper":"/paper/2509.06002"},"observation_digest":"sha256:f933bb808b04e62c1ce9c0b077c34578988d5d0f64b754ac3291dee7b5a41d57","observation_id":"e856c2c2-3cff-49ee-afaa-f0d9515bf8c3","resolution":{"observed_at":"2026-08-05T04:42:44.463434Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.04180","last_updated":"2025-05-08T07:51:26Z","snapshot_observed_at":"2026-08-20T03:52:43.157286Z","submitted_at":"2025-05-07T07:25:46Z","title":"Towards Large-scale Generative Ranking","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.04180","snapshot_observed_at":"2026-08-15T16:19:47.026404Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.06887","last_updated":"2025-09-10T17:17:28Z","snapshot_observed_at":"2026-08-21T02:53:09.462433Z","submitted_at":"2025-09-08T17:08:26Z","title":"UniSearch: Rethinking Search System with a Unified Generative Architecture","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-15T16:19:47.026404Z"},"links":{"cited_paper":"/paper/2505.04180","citing_paper":"/paper/2509.06887"},"observation_digest":"sha256:1d2d2703c72c604c18a5b5f00aa087ecda98f9fe128923c7155559170fdce5b1","observation_id":"806b7157-abe4-4d2b-bf14-1467a722fc13","resolution":{"observed_at":"2026-08-15T16:19:47.026404Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.04180","last_updated":"2025-05-08T07:51:26Z","snapshot_observed_at":"2026-08-20T03:52:43.157286Z","submitted_at":"2025-05-07T07:25:46Z","title":"Towards Large-scale Generative Ranking","version":2},"cited_work":{"arxiv_id":"2505.04180","doi":"10.48550/arxiv.2505.04180","metadata_source":"arxiv_reference","pith_arxiv_id":"2505.04180","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Towards large-scale generative ranking","venue":"ArXiv.org","work_id":"40d575d6-fc6a-41ee-aafb-3708eb22fe34","year":2025},"citing_paper":{"arxiv_id":"2510.27157","last_updated":"2026-05-09T03:19:23Z","snapshot_observed_at":"2026-08-11T00:20:03.132239Z","submitted_at":"2025-10-31T04:02:58Z","title":"A Survey on Generative Recommendation: Data, Model, and Tasks","version":2},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-05-18T03:47:08.208082Z"},"links":{"cited_paper":"/paper/2505.04180","citing_paper":"/paper/2510.27157"},"observation_digest":"sha256:2b1a10496b1d98171e62d2b36602ce6b115ee1b538ae736c2b4d5bd2a7da6b5e","observation_id":"892bfbfd-6cdc-4ac5-9ede-292132600206","resolution":{"observed_at":"2026-05-18T03:50:52.163903Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-05-25T20:53:23.624647+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T20:53:23.624647+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.04180","last_updated":"2025-05-08T07:51:26Z","snapshot_observed_at":"2026-08-20T03:52:43.157286Z","submitted_at":"2025-05-07T07:25:46Z","title":"Towards Large-scale Generative Ranking","version":2},"cited_work":{"arxiv_id":"2505.04180","doi":"10.48550/arxiv.2505.04180","metadata_source":"arxiv_reference","pith_arxiv_id":"2505.04180","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Towards large-scale generative ranking","venue":"ArXiv.org","work_id":"40d575d6-fc6a-41ee-aafb-3708eb22fe34","year":2025},"citing_paper":{"arxiv_id":"2602.10445","last_updated":"2026-05-21T03:19:32Z","snapshot_observed_at":"2026-08-17T03:22:28.892234Z","submitted_at":"2026-02-11T02:38:26Z","title":"End-to-End Semantic ID Generation for Generative Advertisement Recommendation","version":3},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-22T11:51:53.936922Z"},"links":{"cited_paper":"/paper/2505.04180","citing_paper":"/paper/2602.10445"},"observation_digest":"sha256:2a9adb71b6483ffcf158602da33156e24354c5406020b9eeae64100abcb8c0b1","observation_id":"919ffd54-4da3-4693-a16d-0c8f05a7cea9","resolution":{"observed_at":"2026-05-22T11:54:51.403162Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-05-25T20:53:23.624647+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T20:53:23.624647+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.04180","last_updated":"2025-05-08T07:51:26Z","snapshot_observed_at":"2026-08-20T03:52:43.157286Z","submitted_at":"2025-05-07T07:25:46Z","title":"Towards Large-scale Generative Ranking","version":2},"cited_work":{"arxiv_id":"2505.04180","doi":"10.48550/arxiv.2505.04180","metadata_source":"arxiv_reference","pith_arxiv_id":"2505.04180","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Towards large-scale generative ranking","venue":"ArXiv.org","work_id":"40d575d6-fc6a-41ee-aafb-3708eb22fe34","year":2025},"citing_paper":{"arxiv_id":"2604.02684","last_updated":"2026-04-03T03:26:36Z","snapshot_observed_at":"2026-08-12T22:19:41.359365Z","submitted_at":"2026-04-03T03:26:36Z","title":"MBGR: Multi-Business Prediction for Generative Recommendation at Meituan","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-13T19:16:17.841338Z"},"links":{"cited_paper":"/paper/2505.04180","citing_paper":"/paper/2604.02684"},"observation_digest":"sha256:95cb7b3fcb16371dbb58ddc9cd7bd16e0ab3d6a41180be6374ab842ee38c058e","observation_id":"2df4c1aa-544a-45e9-9d88-47986ffc52f1","resolution":{"observed_at":"2026-05-13T19:18:09.327198Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-05-25T20:53:23.624647+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T20:53:23.624647+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.04180","last_updated":"2025-05-08T07:51:26Z","snapshot_observed_at":"2026-08-20T03:52:43.157286Z","submitted_at":"2025-05-07T07:25:46Z","title":"Towards Large-scale Generative Ranking","version":2},"cited_work":{"arxiv_id":"2505.04180","doi":"10.48550/arxiv.2505.04180","metadata_source":"arxiv_reference","pith_arxiv_id":"2505.04180","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Towards large-scale generative ranking","venue":"ArXiv.org","work_id":"40d575d6-fc6a-41ee-aafb-3708eb22fe34","year":2025},"citing_paper":{"arxiv_id":"2604.04976","last_updated":"2026-04-04T17:05:15Z","snapshot_observed_at":"2026-08-14T01:20:46.134170Z","submitted_at":"2026-04-04T17:05:15Z","title":"Tencent Advertising Algorithm Challenge 2025: All-Modality Generative Recommendation","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-05-13T16:59:06.735742Z"},"links":{"cited_paper":"/paper/2505.04180","citing_paper":"/paper/2604.04976"},"observation_digest":"sha256:5f01fbb6c7e7d25fa34edcc39920356451ebfed5f547666006b39b573a40fba1","observation_id":"1d57a1c5-8c2c-4b9b-b475-2689fd23b76e","resolution":{"observed_at":"2026-05-13T17:08:01.175399Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-05-25T20:53:23.624647+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T20:53:23.624647+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.04180","last_updated":"2025-05-08T07:51:26Z","snapshot_observed_at":"2026-08-20T03:52:43.157286Z","submitted_at":"2025-05-07T07:25:46Z","title":"Towards Large-scale Generative Ranking","version":2},"cited_work":{"arxiv_id":"2505.04180","doi":"10.48550/arxiv.2505.04180","metadata_source":"arxiv_reference","pith_arxiv_id":"2505.04180","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Towards large-scale generative ranking","venue":"ArXiv.org","work_id":"40d575d6-fc6a-41ee-aafb-3708eb22fe34","year":2025},"citing_paper":{"arxiv_id":"2604.20861","last_updated":"2026-06-01T16:16:21Z","snapshot_observed_at":"2026-08-15T09:47:49.577807Z","submitted_at":"2026-03-03T13:36:22Z","title":"Deep Interest Mining for Intent-Enriched Semantic IDs in Multimodal Generative Recommendation","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-15T17:01:07.245161Z"},"links":{"cited_paper":"/paper/2505.04180","citing_paper":"/paper/2604.20861"},"observation_digest":"sha256:acf327496af176ca3c011dff29711adfbfa861a266e45b0540e302998ad1d3cc","observation_id":"cb4a2dec-371e-479b-9ba8-3c4c7a379636","resolution":{"observed_at":"2026-05-15T17:01:18.491532Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-05-25T20:53:23.624647+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T20:53:23.624647+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.04180","last_updated":"2025-05-08T07:51:26Z","snapshot_observed_at":"2026-08-20T03:52:43.157286Z","submitted_at":"2025-05-07T07:25:46Z","title":"Towards Large-scale Generative Ranking","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.04180","snapshot_observed_at":"2026-08-02T19:15:40.698549Z","title":"Towards large-scale generative ranking,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2604.20861","last_updated":"2026-06-01T16:16:21Z","snapshot_observed_at":"2026-08-15T09:47:49.577807Z","submitted_at":"2026-03-03T13:36:22Z","title":"Deep Interest Mining for Intent-Enriched Semantic IDs in Multimodal Generative Recommendation","version":3},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-02T19:15:40.698549Z"},"links":{"cited_paper":"/paper/2505.04180","citing_paper":"/paper/2604.20861"},"observation_digest":"sha256:deae5ba7e4afa662fd832cc10488c4fb8ab3e840343b54c88e2970ea8f664a5c","observation_id":"463ea0e6-c82a-4013-95bf-bc0cd11fb5ef","resolution":{"observed_at":"2026-08-02T19:15:40.698549Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.04180","last_updated":"2025-05-08T07:51:26Z","snapshot_observed_at":"2026-08-20T03:52:43.157286Z","submitted_at":"2025-05-07T07:25:46Z","title":"Towards Large-scale Generative Ranking","version":2},"cited_work":{"arxiv_id":"2505.04180","doi":"10.48550/arxiv.2505.04180","metadata_source":"arxiv_reference","pith_arxiv_id":"2505.04180","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Towards large-scale generative ranking","venue":"ArXiv.org","work_id":"40d575d6-fc6a-41ee-aafb-3708eb22fe34","year":2025},"citing_paper":{"arxiv_id":"2604.22881","last_updated":"2026-04-24T03:44:35Z","snapshot_observed_at":"2026-08-12T15:42:05.323848Z","submitted_at":"2026-04-24T03:44:35Z","title":"MTServe: Efficient Serving for Generative Recommendation Models with Hierarchical Caches","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-08T12:28:21.346963Z"},"links":{"cited_paper":"/paper/2505.04180","citing_paper":"/paper/2604.22881"},"observation_digest":"sha256:895282dae05f50123aafcde70fbe919e5617da3ff08e9181d4d41ed1bbebe605","observation_id":"d1f3e989-6ed3-4595-969b-fb05590f71fb","resolution":{"observed_at":"2026-05-11T19:16:07.763341Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-05-25T20:53:23.624647+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T20:53:23.624647+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.04180","last_updated":"2025-05-08T07:51:26Z","snapshot_observed_at":"2026-08-20T03:52:43.157286Z","submitted_at":"2025-05-07T07:25:46Z","title":"Towards Large-scale Generative Ranking","version":2},"cited_work":{"arxiv_id":"2505.04180","doi":"10.48550/arxiv.2505.04180","metadata_source":"arxiv_reference","pith_arxiv_id":"2505.04180","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Towards large-scale generative ranking","venue":"ArXiv.org","work_id":"40d575d6-fc6a-41ee-aafb-3708eb22fe34","year":2025},"citing_paper":{"arxiv_id":"2604.25290","last_updated":"2026-05-28T08:41:00Z","snapshot_observed_at":"2026-08-23T18:55:42.044733Z","submitted_at":"2026-04-28T06:54:02Z","title":"Limitations of LTI Koopman Modeling for Nonlinear Control Systems","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-07-01T09:11:52.797383Z"},"links":{"cited_paper":"/paper/2505.04180","citing_paper":"/paper/2604.25290"},"observation_digest":"sha256:c28cbaa64bbc1f3bddc118e5179958a69430e79168863886aff5cf06377bd608","observation_id":"bc0ff1c2-c8aa-435b-af56-0eaaf2827d50","resolution":{"observed_at":"2026-07-01T09:15:43.608143Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-05-25T20:53:23.624647+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T20:53:23.624647+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.04180","last_updated":"2025-05-08T07:51:26Z","snapshot_observed_at":"2026-08-20T03:52:43.157286Z","submitted_at":"2025-05-07T07:25:46Z","title":"Towards Large-scale Generative Ranking","version":2},"cited_work":{"arxiv_id":"2505.04180","doi":"10.48550/arxiv.2505.04180","metadata_source":"arxiv_reference","pith_arxiv_id":"2505.04180","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Towards large-scale generative ranking","venue":"ArXiv.org","work_id":"40d575d6-fc6a-41ee-aafb-3708eb22fe34","year":2025},"citing_paper":{"arxiv_id":"2604.25291","last_updated":"2026-04-28T06:57:00Z","snapshot_observed_at":"2026-08-15T00:40:57.805454Z","submitted_at":"2026-04-28T06:57:00Z","title":"From Local Indices to Global Identifiers: Generative Reranking for Recommender Systems via Global Action Space","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-07T15:41:47.819144Z"},"links":{"cited_paper":"/paper/2505.04180","citing_paper":"/paper/2604.25291"},"observation_digest":"sha256:ef508c2b5bbb44a94001f97667291270e611b008ec7e9b581be097dc32687842","observation_id":"f718d530-21f1-41b1-825d-b5578006776b","resolution":{"observed_at":"2026-05-12T00:11:17.056106Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-05-25T20:53:23.624647+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T20:53:23.624647+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.04180","last_updated":"2025-05-08T07:51:26Z","snapshot_observed_at":"2026-08-20T03:52:43.157286Z","submitted_at":"2025-05-07T07:25:46Z","title":"Towards Large-scale Generative Ranking","version":2},"cited_work":{"arxiv_id":"2505.04180","doi":"10.48550/arxiv.2505.04180","metadata_source":"arxiv_reference","pith_arxiv_id":"2505.04180","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Towards large-scale generative ranking","venue":"ArXiv.org","work_id":"40d575d6-fc6a-41ee-aafb-3708eb22fe34","year":2025},"citing_paper":{"arxiv_id":"2605.04450","last_updated":"2026-05-06T03:25:22Z","snapshot_observed_at":"2026-08-15T20:52:51.847523Z","submitted_at":"2026-05-06T03:25:22Z","title":"One Pool, Two Caches: Adaptive HBM Partitioning for Accelerating Generative Recommender Serving","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-05-08T17:44:18.414311Z"},"links":{"cited_paper":"/paper/2505.04180","citing_paper":"/paper/2605.04450"},"observation_digest":"sha256:e2e773936713a09ba586079a593229b4cb00158b1e64e00b274a7f3005c6e8cb","observation_id":"402235e1-ba90-4224-9bac-fef0e6835e7c","resolution":{"observed_at":"2026-05-08T19:49:07.382341Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-05-25T20:53:23.624647+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T20:53:23.624647+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.04180","last_updated":"2025-05-08T07:51:26Z","snapshot_observed_at":"2026-08-20T03:52:43.157286Z","submitted_at":"2025-05-07T07:25:46Z","title":"Towards Large-scale Generative Ranking","version":2},"cited_work":{"arxiv_id":"2505.04180","doi":"10.48550/arxiv.2505.04180","metadata_source":"arxiv_reference","pith_arxiv_id":"2505.04180","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Towards large-scale generative ranking","venue":"ArXiv.org","work_id":"40d575d6-fc6a-41ee-aafb-3708eb22fe34","year":2025},"citing_paper":{"arxiv_id":"2605.05249","last_updated":"2026-06-02T17:05:24Z","snapshot_observed_at":"2026-08-17T16:48:18.082022Z","submitted_at":"2026-05-05T11:42:14Z","title":"TriAlignGR: Triangular Multitask Alignment with Multimodal Deep Interest Mining for Generative Recommendation","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-05-08T18:46:08.393219Z"},"links":{"cited_paper":"/paper/2505.04180","citing_paper":"/paper/2605.05249"},"observation_digest":"sha256:16a404a5856177197c847c47edbbed88e91d9d07947618563f27ef6f1d4fd18d","observation_id":"739198b6-7c8c-4d88-9d5f-743f31a4568e","resolution":{"observed_at":"2026-05-09T06:10:43.281551Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-05-25T20:53:23.624647+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T20:53:23.624647+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.04180","last_updated":"2025-05-08T07:51:26Z","snapshot_observed_at":"2026-08-20T03:52:43.157286Z","submitted_at":"2025-05-07T07:25:46Z","title":"Towards Large-scale Generative Ranking","version":2},"cited_work":{"arxiv_id":"2505.04180","doi":"10.48550/arxiv.2505.04180","metadata_source":"arxiv_reference","pith_arxiv_id":"2505.04180","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Towards large-scale generative ranking","venue":"ArXiv.org","work_id":"40d575d6-fc6a-41ee-aafb-3708eb22fe34","year":2025},"citing_paper":{"arxiv_id":"2605.05249","last_updated":"2026-06-02T17:05:24Z","snapshot_observed_at":"2026-08-17T16:48:18.082022Z","submitted_at":"2026-05-05T11:42:14Z","title":"TriAlignGR: Triangular Multitask Alignment with Multimodal Deep Interest Mining for Generative Recommendation","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-05-20T23:50:47.510019Z"},"links":{"cited_paper":"/paper/2505.04180","citing_paper":"/paper/2605.05249"},"observation_digest":"sha256:88b5cde1f93969ad1938f03702f81c30aa0cd0140f26f47fb6cfd32ecfb3404c","observation_id":"b083fdfa-1a95-41af-81ca-33027d5e44aa","resolution":{"observed_at":"2026-05-20T23:53:51.757491Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-05-25T20:53:23.624647+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T20:53:23.624647+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.04180","last_updated":"2025-05-08T07:51:26Z","snapshot_observed_at":"2026-08-20T03:52:43.157286Z","submitted_at":"2025-05-07T07:25:46Z","title":"Towards Large-scale Generative Ranking","version":2},"cited_work":{"arxiv_id":"2505.04180","doi":"10.48550/arxiv.2505.04180","metadata_source":"arxiv_reference","pith_arxiv_id":"2505.04180","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Towards large-scale generative ranking","venue":"ArXiv.org","work_id":"40d575d6-fc6a-41ee-aafb-3708eb22fe34","year":2025},"citing_paper":{"arxiv_id":"2605.05249","last_updated":"2026-06-02T17:05:24Z","snapshot_observed_at":"2026-08-17T16:48:18.082022Z","submitted_at":"2026-05-05T11:42:14Z","title":"TriAlignGR: Triangular Multitask Alignment with Multimodal Deep Interest Mining for Generative Recommendation","version":3},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-07-01T00:12:24.019383Z"},"links":{"cited_paper":"/paper/2505.04180","citing_paper":"/paper/2605.05249"},"observation_digest":"sha256:fe06189127727a5d9bc7019bae9e4df9568460f1a3f2cd157eaf0002f6eb4a91","observation_id":"a6bfc8f1-9ca4-42d5-bb72-d52ad5c90883","resolution":{"observed_at":"2026-07-01T00:15:09.140799Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-05-25T20:53:23.624647+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T20:53:23.624647+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.04180","last_updated":"2025-05-08T07:51:26Z","snapshot_observed_at":"2026-08-20T03:52:43.157286Z","submitted_at":"2025-05-07T07:25:46Z","title":"Towards Large-scale Generative Ranking","version":2},"cited_work":{"arxiv_id":"2505.04180","doi":"10.48550/arxiv.2505.04180","metadata_source":"arxiv_reference","pith_arxiv_id":"2505.04180","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Towards large-scale generative ranking","venue":"ArXiv.org","work_id":"40d575d6-fc6a-41ee-aafb-3708eb22fe34","year":2025},"citing_paper":{"arxiv_id":"2605.05803","last_updated":"2026-07-29T07:00:12Z","snapshot_observed_at":"2026-08-12T12:27:37.483283Z","submitted_at":"2026-05-07T07:41:19Z","title":"UniVA: Unified Value Alignment for Generative Recommendation in Online Advertising at Tencent","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-08T06:06:49.422159Z"},"links":{"cited_paper":"/paper/2505.04180","citing_paper":"/paper/2605.05803"},"observation_digest":"sha256:cee2fc002cfd1423c56b7ecbd2e4bca041768ce9b25a24061477c923f5a3382b","observation_id":"39ca6766-ce76-46cc-b328-e0c777dc2152","resolution":{"observed_at":"2026-05-11T21:16:26.021045Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-05-25T20:53:23.624647+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T20:53:23.624647+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.04180","last_updated":"2025-05-08T07:51:26Z","snapshot_observed_at":"2026-08-20T03:52:43.157286Z","submitted_at":"2025-05-07T07:25:46Z","title":"Towards Large-scale Generative Ranking","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.04180","snapshot_observed_at":"2026-08-02T14:47:54.548933Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2605.05803","last_updated":"2026-07-29T07:00:12Z","snapshot_observed_at":"2026-08-12T12:27:37.483283Z","submitted_at":"2026-05-07T07:41:19Z","title":"UniVA: Unified Value Alignment for Generative Recommendation in Online Advertising at Tencent","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-02T14:47:54.548933Z"},"links":{"cited_paper":"/paper/2505.04180","citing_paper":"/paper/2605.05803"},"observation_digest":"sha256:f8d5e3179875e2aef363e897410b0af057a6d08e97b27fc738614cc05a3956a7","observation_id":"e0dc2492-8981-422c-a70c-e085902c949f","resolution":{"observed_at":"2026-08-02T14:47:54.548933Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.04180","last_updated":"2025-05-08T07:51:26Z","snapshot_observed_at":"2026-08-20T03:52:43.157286Z","submitted_at":"2025-05-07T07:25:46Z","title":"Towards Large-scale Generative Ranking","version":2},"cited_work":{"arxiv_id":"2505.04180","doi":"10.48550/arxiv.2505.04180","metadata_source":"arxiv_reference","pith_arxiv_id":"2505.04180","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Towards large-scale generative ranking","venue":"ArXiv.org","work_id":"40d575d6-fc6a-41ee-aafb-3708eb22fe34","year":2025},"citing_paper":{"arxiv_id":"2605.14512","last_updated":"2026-08-03T09:42:25Z","snapshot_observed_at":"2026-08-16T18:12:56.800993Z","submitted_at":"2026-05-14T07:55:43Z","title":"Asymmetric Generative Recommendation via Kronecker Residual Bridge and Multi-Faceted Hierarchical Quantization","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-15T01:48:42.759751Z"},"links":{"cited_paper":"/paper/2505.04180","citing_paper":"/paper/2605.14512"},"observation_digest":"sha256:32c1aae0d4fa07a8290d1c5cfc2df4eef8bca4889f29ab7f940e1315f4bb8746","observation_id":"0a7d61cb-b222-4f14-853c-fad79732f393","resolution":{"observed_at":"2026-05-15T01:49:38.097978Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-05-25T20:53:23.624647+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T20:53:23.624647+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.04180","last_updated":"2025-05-08T07:51:26Z","snapshot_observed_at":"2026-08-20T03:52:43.157286Z","submitted_at":"2025-05-07T07:25:46Z","title":"Towards Large-scale Generative Ranking","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.04180","snapshot_observed_at":"2026-08-04T05:13:09.699709Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2605.14512","last_updated":"2026-08-03T09:42:25Z","snapshot_observed_at":"2026-08-16T18:12:56.800993Z","submitted_at":"2026-05-14T07:55:43Z","title":"Asymmetric Generative Recommendation via Kronecker Residual Bridge and Multi-Faceted Hierarchical Quantization","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-04T05:13:09.699709Z"},"links":{"cited_paper":"/paper/2505.04180","citing_paper":"/paper/2605.14512"},"observation_digest":"sha256:f2ec3809fe6af44644d6698ce53dfeee18611b21cd394b1202037d1caa7ac4d0","observation_id":"b53422d2-9a97-4873-888e-23ae2b9975ea","resolution":{"observed_at":"2026-08-04T05:13:09.699709Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.04180","last_updated":"2025-05-08T07:51:26Z","snapshot_observed_at":"2026-08-20T03:52:43.157286Z","submitted_at":"2025-05-07T07:25:46Z","title":"Towards Large-scale Generative Ranking","version":2},"cited_work":{"arxiv_id":"2505.04180","doi":"10.48550/arxiv.2505.04180","metadata_source":"arxiv_reference","pith_arxiv_id":"2505.04180","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Towards large-scale generative ranking","venue":"ArXiv.org","work_id":"40d575d6-fc6a-41ee-aafb-3708eb22fe34","year":2025},"citing_paper":{"arxiv_id":"2606.00422","last_updated":"2026-05-29T23:17:34Z","snapshot_observed_at":"2026-08-17T07:19:38.733584Z","submitted_at":"2026-05-29T23:17:34Z","title":"UniPinRec: Unifying Generative Retrieval and Ranking at Pinterest Scale","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-06-28T20:30:25.473281Z"},"links":{"cited_paper":"/paper/2505.04180","citing_paper":"/paper/2606.00422"},"observation_digest":"sha256:d13ec9d111722ec8dcc98be3507289cf954d02d996c2c1e092011631a49e6c27","observation_id":"3123c7f6-5da8-439f-913e-0203c17e5819","resolution":{"observed_at":"2026-06-28T20:32:36.720977Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-05-25T20:53:23.624647+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T20:53:23.624647+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.04180","last_updated":"2025-05-08T07:51:26Z","snapshot_observed_at":"2026-08-20T03:52:43.157286Z","submitted_at":"2025-05-07T07:25:46Z","title":"Towards Large-scale Generative Ranking","version":2},"cited_work":{"arxiv_id":"2505.04180","doi":"10.48550/arxiv.2505.04180","metadata_source":"arxiv_reference","pith_arxiv_id":"2505.04180","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Towards large-scale generative ranking","venue":"ArXiv.org","work_id":"40d575d6-fc6a-41ee-aafb-3708eb22fe34","year":2025},"citing_paper":{"arxiv_id":"2606.06970","last_updated":"2026-06-05T06:58:07Z","snapshot_observed_at":"2026-08-07T06:28:45.273437Z","submitted_at":"2026-06-05T06:58:07Z","title":"SSRLive: Live Streaming Recommendation with Dynamic Semantic ID","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-06-27T20:58:45.808333Z"},"links":{"cited_paper":"/paper/2505.04180","citing_paper":"/paper/2606.06970"},"observation_digest":"sha256:884c9bf6d957785d70f740c716aa64b1e10e1984adc2f5dc8966ba3ad5181696","observation_id":"b0f47834-4499-47ea-b507-f3abe4e83938","resolution":{"observed_at":"2026-07-02T20:07:21.815902Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-05-25T20:53:23.624647+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T20:53:23.624647+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.04180","last_updated":"2025-05-08T07:51:26Z","snapshot_observed_at":"2026-08-20T03:52:43.157286Z","submitted_at":"2025-05-07T07:25:46Z","title":"Towards Large-scale Generative Ranking","version":2},"cited_work":{"arxiv_id":"2505.04180","doi":"10.48550/arxiv.2505.04180","metadata_source":"arxiv_reference","pith_arxiv_id":"2505.04180","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Towards large-scale generative ranking","venue":"ArXiv.org","work_id":"40d575d6-fc6a-41ee-aafb-3708eb22fe34","year":2025},"citing_paper":{"arxiv_id":"2606.19635","last_updated":"2026-07-27T23:16:22Z","snapshot_observed_at":"2026-08-15T19:19:43.238709Z","submitted_at":"2026-06-17T22:27:36Z","title":"Token Factory: Efficiently Integrating Diverse Signals into Large Recommendation Models","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-06-26T18:49:39.851566Z"},"links":{"cited_paper":"/paper/2505.04180","citing_paper":"/paper/2606.19635"},"observation_digest":"sha256:c0203059cef770f69019d929aafbc8c2b7d7d875e1e8545202058943e24b5910","observation_id":"44f426ed-c7ca-437c-88eb-95a1b849efcd","resolution":{"observed_at":"2026-07-04T02:49:25.514233Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-05-25T20:53:23.624647+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T20:53:23.624647+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.04180","last_updated":"2025-05-08T07:51:26Z","snapshot_observed_at":"2026-08-20T03:52:43.157286Z","submitted_at":"2025-05-07T07:25:46Z","title":"Towards Large-scale Generative Ranking","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.04180","snapshot_observed_at":"2026-08-02T10:53:50.228667Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.19635","last_updated":"2026-07-27T23:16:22Z","snapshot_observed_at":"2026-08-15T19:19:43.238709Z","submitted_at":"2026-06-17T22:27:36Z","title":"Token Factory: Efficiently Integrating Diverse Signals into Large Recommendation Models","version":3},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-02T10:53:50.228667Z"},"links":{"cited_paper":"/paper/2505.04180","citing_paper":"/paper/2606.19635"},"observation_digest":"sha256:89654161a608abeb506f4cb200beb2455ab6b170906b3298e68792a8918cdad0","observation_id":"53585050-0693-4756-8fde-d492ef40c496","resolution":{"observed_at":"2026-08-02T10:53:50.228667Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.04180","last_updated":"2025-05-08T07:51:26Z","snapshot_observed_at":"2026-08-20T03:52:43.157286Z","submitted_at":"2025-05-07T07:25:46Z","title":"Towards Large-scale Generative Ranking","version":2},"cited_work":{"arxiv_id":"2505.04180","doi":"10.48550/arxiv.2505.04180","metadata_source":"arxiv_reference","pith_arxiv_id":"2505.04180","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Towards large-scale generative ranking","venue":"ArXiv.org","work_id":"40d575d6-fc6a-41ee-aafb-3708eb22fe34","year":2025},"citing_paper":{"arxiv_id":"2606.25147","last_updated":"2026-06-23T20:20:37Z","snapshot_observed_at":"2026-08-14T10:59:00.347105Z","submitted_at":"2026-06-23T20:20:37Z","title":"TokenMinds: Pretrained User Tokens and Embeddings for User Understanding in Large Recommender Systems","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-06-25T22:00:13.334443Z"},"links":{"cited_paper":"/paper/2505.04180","citing_paper":"/paper/2606.25147"},"observation_digest":"sha256:161e14fb189e5bd5d62989b0b8a08b909c635737990c96a1c8acdfb22ba9e6c6","observation_id":"f51eb0e2-922f-4d7d-a737-3e2e72c858e3","resolution":{"observed_at":"2026-07-04T19:00:06.197062Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-05-25T20:53:23.624647+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T20:53:23.624647+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.04180","last_updated":"2025-05-08T07:51:26Z","snapshot_observed_at":"2026-08-20T03:52:43.157286Z","submitted_at":"2025-05-07T07:25:46Z","title":"Towards Large-scale Generative Ranking","version":2},"cited_work":{"arxiv_id":"2505.04180","doi":"10.48550/arxiv.2505.04180","metadata_source":"arxiv_reference","pith_arxiv_id":"2505.04180","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Towards large-scale generative ranking","venue":"ArXiv.org","work_id":"40d575d6-fc6a-41ee-aafb-3708eb22fe34","year":2025},"citing_paper":{"arxiv_id":"2606.31031","last_updated":"2026-06-30T02:00:05Z","snapshot_observed_at":"2026-08-16T19:56:19.499050Z","submitted_at":"2026-06-30T02:00:05Z","title":"GenPage: Towards End-to-End Generative Homepage Construction at Netflix","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-07-01T04:53:02.752056Z"},"links":{"cited_paper":"/paper/2505.04180","citing_paper":"/paper/2606.31031"},"observation_digest":"sha256:b0fb13a77d5bfd14a96538157b072d0c007448733d572b9a5097ecdad6019ffa","observation_id":"83eada5f-bfbd-47b6-a2d8-c1c41a2c736b","resolution":{"observed_at":"2026-07-01T10:55:42.341947Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-05-25T20:53:23.624647+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T20:53:23.624647+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.04180","last_updated":"2025-05-08T07:51:26Z","snapshot_observed_at":"2026-08-20T03:52:43.157286Z","submitted_at":"2025-05-07T07:25:46Z","title":"Towards Large-scale Generative Ranking","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.04180","snapshot_observed_at":"2026-08-01T14:25:21.182340Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.18796","last_updated":"2026-07-22T08:19:23Z","snapshot_observed_at":"2026-08-14T19:16:19.068800Z","submitted_at":"2026-07-21T07:17:43Z","title":"TSGR: Taobao Search Generative Retrieval","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-01T14:25:21.182340Z"},"links":{"cited_paper":"/paper/2505.04180","citing_paper":"/paper/2607.18796"},"observation_digest":"sha256:3f80a52f09a25e0a76b54656f4fc2ff73d3a1a26e95d08838d609fcee3ae2d29","observation_id":"84b4d87f-bc10-4128-824d-6b388730c9c6","resolution":{"observed_at":"2026-08-01T14:25:21.182340Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.04180","last_updated":"2025-05-08T07:51:26Z","snapshot_observed_at":"2026-08-20T03:52:43.157286Z","submitted_at":"2025-05-07T07:25:46Z","title":"Towards Large-scale Generative Ranking","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.04180","snapshot_observed_at":"2026-08-03T01:29:03.742585Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.28895","last_updated":"2026-08-18T16:58:28Z","snapshot_observed_at":"2026-08-21T22:11:30.019778Z","submitted_at":"2026-07-30T23:27:14Z","title":"LLM-Based Generative Retrieval for Snapchat Content Recommendation","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-03T01:29:03.742585Z"},"links":{"cited_paper":"/paper/2505.04180","citing_paper":"/paper/2607.28895"},"observation_digest":"sha256:507dc9558b1b704f20413f48f4bed9e9bf9c80a7968da492a689880a120a15f0","observation_id":"fc0076f2-d72c-47c2-8ddb-6b054fc43744","resolution":{"observed_at":"2026-08-03T01:29:03.742585Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.04180","last_updated":"2025-05-08T07:51:26Z","snapshot_observed_at":"2026-08-20T03:52:43.157286Z","submitted_at":"2025-05-07T07:25:46Z","title":"Towards Large-scale Generative Ranking","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.04180","snapshot_observed_at":"2026-08-07T00:14:40.125040Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.02738","last_updated":"2026-08-06T05:18:40Z","snapshot_observed_at":"2026-08-09T23:10:04.908200Z","submitted_at":"2026-08-03T18:00:05Z","title":"Knowledge-Geometry Decoupling: Refreshable Pretrained Transfer for Streaming Recommendation","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T00:14:40.125040Z"},"links":{"cited_paper":"/paper/2505.04180","citing_paper":"/paper/2608.02738"},"observation_digest":"sha256:c29c11b13e5bfd099c53666cf7d2291de6d893d9e7e0b2936810d640505ba86e","observation_id":"9666522f-6c3a-48e7-8d3b-6dd8fa2aff72","resolution":{"observed_at":"2026-08-07T00:14:40.125040Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.04180","last_updated":"2025-05-08T07:51:26Z","snapshot_observed_at":"2026-08-20T03:52:43.157286Z","submitted_at":"2025-05-07T07:25:46Z","title":"Towards Large-scale Generative Ranking","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.04180","snapshot_observed_at":"2026-08-14T04:45:59.738968Z","title":"Huang, Y","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.08422","last_updated":"2026-08-11T04:26:53Z","snapshot_observed_at":"2026-08-20T01:50:15.732124Z","submitted_at":"2026-08-09T02:36:49Z","title":"Population-Level Generative Modeling for Ranking Data","version":2},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-14T04:45:59.738968Z"},"links":{"cited_paper":"/paper/2505.04180","citing_paper":"/paper/2608.08422"},"observation_digest":"sha256:ffefe6f2b297b486905592b34c8c63ab188b1a86e982c185a9b99c480adbe6d5","observation_id":"06cf7532-6654-4c75-9888-b48c0f6ad3ca","resolution":{"observed_at":"2026-08-14T04:45:59.738968Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2505.04180/citation-record","integrity":"/paper/2505.04180/integrity","json":"/paper/2505.04180/citation-record.json","paper":"/paper/2505.04180"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2503.18941","last_updated":"2025-06-08T12:15:41Z","snapshot_observed_at":"2026-08-19T12:55:58.339786Z","submitted_at":"2025-03-24T17:59:03Z","title":"Exploring Training and Inference Scaling Laws in Generative Retrieval","version":2},"cited_work":{"arxiv_id":"2503.18941","doi":null,"metadata_source":"pith","pith_arxiv_id":"2503.18941","snapshot_observed_at":"2026-08-15T23:39:25.860790Z","title":"Exploring Training and Inference Scaling Laws in Generative Retrieval","venue":"cs.IR","work_id":"7887044f-dced-4c29-afdd-bd3ecdd9deb1","year":2025},"citing_paper":{"arxiv_id":"2505.04180","last_updated":"2025-05-08T07:51:26Z","snapshot_observed_at":"2026-08-20T03:52:43.157286Z","submitted_at":"2025-05-07T07:25:46Z","title":"Towards Large-scale Generative Ranking","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-15T23:39:25.674221Z"},"links":{"cited_paper":"/paper/2503.18941","citing_paper":"/paper/2505.04180"},"observation_digest":"sha256:227e70c1f2f8a63a3e7a4c5684c1ef1ce2f1416aa9613ab591c16cfab19926ee","observation_id":"f2723690-6d79-4a03-910a-2c07934cc800","resolution":{"observed_at":"2026-08-15T23:39:25.866593Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-15T23:39:26.098189Z","title":null,"venue":null,"work_id":"ac1b370f-9919-4944-84c6-aa012ff3a6b9","year":2023},"citing_paper":{"arxiv_id":"2505.04180","last_updated":"2025-05-08T07:51:26Z","snapshot_observed_at":"2026-08-20T03:52:43.157286Z","submitted_at":"2025-05-07T07:25:46Z","title":"Towards Large-scale Generative Ranking","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-15T23:39:25.678641Z"},"links":{"citing_paper":"/paper/2505.04180"},"observation_digest":"sha256:5e86f3c72a770c501c7b17e7d9e1adb25c382ca0fa4e5fa9a5fe7124db2fde4a","observation_id":"5e66a01d-56f5-4458-9533-4840036bdde3","resolution":{"observed_at":"2026-08-15T23:39:26.102320Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-15T23:39:26.087065Z","title":null,"venue":null,"work_id":"e0953f7e-1cdf-4e31-942f-106a6896d810","year":2023},"citing_paper":{"arxiv_id":"2505.04180","last_updated":"2025-05-08T07:51:26Z","snapshot_observed_at":"2026-08-20T03:52:43.157286Z","submitted_at":"2025-05-07T07:25:46Z","title":"Towards Large-scale Generative Ranking","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-15T23:39:25.682111Z"},"links":{"citing_paper":"/paper/2505.04180"},"observation_digest":"sha256:1e5a893bf1989162b04e26307cd12cc0d0c676ca0133e266a4c425bdd88576c1","observation_id":"ef8ed778-301f-4c95-82d4-84cd516a3a12","resolution":{"observed_at":"2026-08-15T23:39:26.091379Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-15T23:39:26.074686Z","title":"Wide & deep learning for recommender systems // Proceedings of the 1st workshop on deep learning for recommender systems","venue":null,"work_id":"a5b3e6db-fa48-4fdc-953e-11ffeaa75534","year":2016},"citing_paper":{"arxiv_id":"2505.04180","last_updated":"2025-05-08T07:51:26Z","snapshot_observed_at":"2026-08-20T03:52:43.157286Z","submitted_at":"2025-05-07T07:25:46Z","title":"Towards Large-scale Generative Ranking","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-15T23:39:25.685659Z"},"links":{"citing_paper":"/paper/2505.04180"},"observation_digest":"sha256:2910be4d8dfa8be3a13aff147e16df766186d7f074a2d66b73a0878d5a679776","observation_id":"1a65ce6a-d0b9-4331-afe7-10a3709466c1","resolution":{"observed_at":"2026-08-15T23:39:26.078854Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-08-19T12:40:18.769960Z","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-15T23:39:25.689561Z","title":"Scaling New Frontiers: Insights into Large Recommendation Models // arXiv preprint arXiv:2412.00714","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.04180","last_updated":"2025-05-08T07:51:26Z","snapshot_observed_at":"2026-08-20T03:52:43.157286Z","submitted_at":"2025-05-07T07:25:46Z","title":"Towards Large-scale Generative Ranking","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-15T23:39:25.689561Z"},"links":{"cited_paper":"/paper/2412.00714","citing_paper":"/paper/2505.04180"},"observation_digest":"sha256:80f878eac88e1586d8cff14d3612ecd5a9e05d739a7dbe34bf6971eed819b67e","observation_id":"31995402-73a6-4bd9-88e0-ea064761e1ba","resolution":{"observed_at":"2026-08-15T23:39:25.689561Z","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-15T23:39:26.061771Z","title":"Neural statistics for click-through rate prediction // Proceedings of the 45th International ACM SIGIR Conference on Research and Development in Information Retrieval","venue":null,"work_id":"b5d22dd5-5046-4fdf-8b39-688063c6f667","year":2022},"citing_paper":{"arxiv_id":"2505.04180","last_updated":"2025-05-08T07:51:26Z","snapshot_observed_at":"2026-08-20T03:52:43.157286Z","submitted_at":"2025-05-07T07:25:46Z","title":"Towards Large-scale Generative Ranking","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-15T23:39:25.694217Z"},"links":{"citing_paper":"/paper/2505.04180"},"observation_digest":"sha256:7699da4197e7465705225787c28ef04698c4b82a28d3bfad09a761ffd8d130de","observation_id":"50d12282-65e7-4705-876d-3f877da7b655","resolution":{"observed_at":"2026-08-15T23:39:26.066420Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-15T23:39:26.051483Z","title":"Sliding spectrum decomposition for diversified recommendation // Proceedings of the 27th ACM SIGKDD conference on knowledge discovery & data mining","venue":null,"work_id":"4bcc90c4-2f5f-4229-a3bd-9b122c1ff285","year":2021},"citing_paper":{"arxiv_id":"2505.04180","last_updated":"2025-05-08T07:51:26Z","snapshot_observed_at":"2026-08-20T03:52:43.157286Z","submitted_at":"2025-05-07T07:25:46Z","title":"Towards Large-scale Generative Ranking","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-15T23:39:25.698064Z"},"links":{"citing_paper":"/paper/2505.04180"},"observation_digest":"sha256:c3c68ff35d7ab547e5ec15517920500e4696bfd25a2c1f6ea7474c6f46f67329","observation_id":"22da240d-c3e0-4a5c-ac93-f784f82d4ad6","resolution":{"observed_at":"2026-08-15T23:39:26.055293Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-15T23:39:26.041001Z","title":"Self-attentive sequential recommendation // 2018 IEEE international conference on data mining (ICDM)","venue":null,"work_id":"64da0324-c343-44f2-afea-dc2332584864","year":2018},"citing_paper":{"arxiv_id":"2505.04180","last_updated":"2025-05-08T07:51:26Z","snapshot_observed_at":"2026-08-20T03:52:43.157286Z","submitted_at":"2025-05-07T07:25:46Z","title":"Towards Large-scale Generative Ranking","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-15T23:39:25.701374Z"},"links":{"citing_paper":"/paper/2505.04180"},"observation_digest":"sha256:1e1d7ff5a35af74afd7bb2a12e1aaa5ce4d977b66188eaf86bbfd68337a0c213","observation_id":"4400a217-898d-4d7a-aa9e-4678e74259bb","resolution":{"observed_at":"2026-08-15T23:39:26.044539Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2001.08361","last_updated":"2020-01-23T03:59:20Z","snapshot_observed_at":"2026-08-13T17:41:53.092611Z","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-15T23:39:25.704564Z","title":"Scaling laws for neural language models // arXiv preprint arXiv:2001.08361","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2505.04180","last_updated":"2025-05-08T07:51:26Z","snapshot_observed_at":"2026-08-20T03:52:43.157286Z","submitted_at":"2025-05-07T07:25:46Z","title":"Towards Large-scale Generative Ranking","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-15T23:39:25.704564Z"},"links":{"cited_paper":"/paper/2001.08361","citing_paper":"/paper/2505.04180"},"observation_digest":"sha256:b6db1112df3ae18186856527bc313e8ba6387ebd40a6263513a394a3b8f57ece","observation_id":"256e878a-d9d4-40ec-b00a-8922d37cf9d7","resolution":{"observed_at":"2026-08-15T23:39:25.704564Z","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-15T23:39:26.029566Z","title":null,"venue":null,"work_id":"9ade4e4b-af92-4703-8f9f-45d2c8866758","year":2020},"citing_paper":{"arxiv_id":"2505.04180","last_updated":"2025-05-08T07:51:26Z","snapshot_observed_at":"2026-08-20T03:52:43.157286Z","submitted_at":"2025-05-07T07:25:46Z","title":"Towards Large-scale Generative Ranking","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-15T23:39:25.708353Z"},"links":{"citing_paper":"/paper/2505.04180"},"observation_digest":"sha256:9e597baac535df2563674c2c62cdfa0b05cb2fbfd0fce8cc3d9a1c5c030301b9","observation_id":"6233c76b-53db-40f2-b7cb-0144a6a4df99","resolution":{"observed_at":"2026-08-15T23:39:26.033460Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2108.12409","last_updated":"2022-04-22T18:20:48Z","snapshot_observed_at":"2026-08-07T11:26:24.970964Z","submitted_at":"2021-08-27T17:35:06Z","title":"Train Short, Test Long: Attention with Linear Biases Enables Input Length Extrapolation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2108.12409","snapshot_observed_at":"2026-08-15T23:39:25.711646Z","title":"Train short, test long: Attention with linear biases enables input length extrapolation // arXiv preprint arXiv:2108.12409","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.04180","last_updated":"2025-05-08T07:51:26Z","snapshot_observed_at":"2026-08-20T03:52:43.157286Z","submitted_at":"2025-05-07T07:25:46Z","title":"Towards Large-scale Generative Ranking","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-15T23:39:25.711646Z"},"links":{"cited_paper":"/paper/2108.12409","citing_paper":"/paper/2505.04180"},"observation_digest":"sha256:e6a98568bb08dd5dd2b6eafda56d0d6f4bde91b6873c65f822dd28f2b7bf37ca","observation_id":"25dbf3ff-dfa8-43a1-9417-b8f0d2071ead","resolution":{"observed_at":"2026-08-15T23:39:25.711646Z","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-15T23:39:26.017788Z","title":"Exploring the limits of transfer learning with a unified text-to-text transformer // Journal of machine learning research","venue":null,"work_id":"cf61e782-18fb-47d7-af35-ef31899f3763","year":2020},"citing_paper":{"arxiv_id":"2505.04180","last_updated":"2025-05-08T07:51:26Z","snapshot_observed_at":"2026-08-20T03:52:43.157286Z","submitted_at":"2025-05-07T07:25:46Z","title":"Towards Large-scale Generative Ranking","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-15T23:39:25.715312Z"},"links":{"citing_paper":"/paper/2505.04180"},"observation_digest":"sha256:e2f51c7064f64f70191b45ced6114a54fa7fedba5852c0dae26d9e158d0ace56","observation_id":"3b6ac3a6-f886-4d81-b1ae-eb8bc0458a8d","resolution":{"observed_at":"2026-08-15T23:39:26.021625Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-15T23:39:26.006569Z","title":"Recommender systems with generative retrieval // Advances in Neural Information Processing Systems","venue":null,"work_id":"7486b6e6-0a9a-4dfb-a66c-7a9fcd8be620","year":2023},"citing_paper":{"arxiv_id":"2505.04180","last_updated":"2025-05-08T07:51:26Z","snapshot_observed_at":"2026-08-20T03:52:43.157286Z","submitted_at":"2025-05-07T07:25:46Z","title":"Towards Large-scale Generative Ranking","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-15T23:39:25.718789Z"},"links":{"citing_paper":"/paper/2505.04180"},"observation_digest":"sha256:994f470b6f169f3eee47d95b0e3bcd6ecb0f021bbffd080bcb2adda873c09744","observation_id":"c4674bde-6aef-4255-9eef-b3b53bc7ccc5","resolution":{"observed_at":"2026-08-15T23:39:26.010306Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-15T23:39:25.995454Z","title":"Non-autoregressive generative models for reranking recommendation // Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining","venue":null,"work_id":"117113ab-4370-4080-8f5a-7ceb9b1335e1","year":2024},"citing_paper":{"arxiv_id":"2505.04180","last_updated":"2025-05-08T07:51:26Z","snapshot_observed_at":"2026-08-20T03:52:43.157286Z","submitted_at":"2025-05-07T07:25:46Z","title":"Towards Large-scale Generative Ranking","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-15T23:39:25.721834Z"},"links":{"citing_paper":"/paper/2505.04180"},"observation_digest":"sha256:4caf1e7f5148ba7e5245d59da992220b072041777b4b4d3ee2a2866d27779f7f","observation_id":"6509ee29-5965-453a-a51b-39f83b783ce7","resolution":{"observed_at":"2026-08-15T23:39:25.999772Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-15T23:39:25.985029Z","title":null,"venue":null,"work_id":"af2fb71c-ad34-4286-872c-95f608410dea","year":2024},"citing_paper":{"arxiv_id":"2505.04180","last_updated":"2025-05-08T07:51:26Z","snapshot_observed_at":"2026-08-20T03:52:43.157286Z","submitted_at":"2025-05-07T07:25:46Z","title":"Towards Large-scale Generative Ranking","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-15T23:39:25.724936Z"},"links":{"citing_paper":"/paper/2505.04180"},"observation_digest":"sha256:84a1f86609b812ba5c8a8b093955e595894767e0768b0a506c1bd745a64cdfa1","observation_id":"f81644c7-cc27-4e4e-bff1-25c7e763a9d2","resolution":{"observed_at":"2026-08-15T23:39:25.988705Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-15T23:39:25.974702Z","title":null,"venue":null,"work_id":"ab99461c-58ac-484b-82ce-496ad18ce98e","year":null},"citing_paper":{"arxiv_id":"2505.04180","last_updated":"2025-05-08T07:51:26Z","snapshot_observed_at":"2026-08-20T03:52:43.157286Z","submitted_at":"2025-05-07T07:25:46Z","title":"Towards Large-scale Generative Ranking","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-15T23:39:25.728022Z"},"links":{"citing_paper":"/paper/2505.04180"},"observation_digest":"sha256:80c7afd0c9645e453ea7c3a6b1856b293a9fe6050b1b539536b941f5010b1f8b","observation_id":"69e48bed-4794-4e3f-bb36-ed9faa002cb3","resolution":{"observed_at":"2026-08-15T23:39:25.978454Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-15T23:39:25.962720Z","title":"Progressive layered extraction (ple): A novel multi-task learning (mtl) model for personalized recommendations // Proceedings of the 14th ACM conference on recommender systems","venue":null,"work_id":"56c2f04d-3204-4609-bfb8-b9341aadc4fb","year":2020},"citing_paper":{"arxiv_id":"2505.04180","last_updated":"2025-05-08T07:51:26Z","snapshot_observed_at":"2026-08-20T03:52:43.157286Z","submitted_at":"2025-05-07T07:25:46Z","title":"Towards Large-scale Generative Ranking","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-15T23:39:25.731681Z"},"links":{"citing_paper":"/paper/2505.04180"},"observation_digest":"sha256:745e8f6690583cdd14442416c96a56906ac29a504cdab4c4f154766236247bac","observation_id":"c3268945-cd01-41dc-ab79-3b6aa1002a03","resolution":{"observed_at":"2026-08-15T23:39:25.967828Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-15T23:39:25.951074Z","title":"Learnable item tokenization for generative recommendation // Proceedings of the 33rd ACM International Conference on Information and Knowledge Management","venue":null,"work_id":"d36bb5cf-deda-4015-bf2b-5b900a8bfecb","year":2024},"citing_paper":{"arxiv_id":"2505.04180","last_updated":"2025-05-08T07:51:26Z","snapshot_observed_at":"2026-08-20T03:52:43.157286Z","submitted_at":"2025-05-07T07:25:46Z","title":"Towards Large-scale Generative Ranking","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-15T23:39:25.734700Z"},"links":{"citing_paper":"/paper/2505.04180"},"observation_digest":"sha256:eff4df007861875f7abfeeda0b274b51ba49b43f70f8908f6a6b1c8869b70b09","observation_id":"67913f06-d2b2-4384-b2e7-ccc6811d30f0","resolution":{"observed_at":"2026-08-15T23:39:25.955257Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-15T23:39:25.940176Z","title":"EAGER: Two-Stream Generative Recommender with Behavior- Semantic Collaboration // Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining","venue":null,"work_id":"3bb1aceb-2b8b-403c-9f6a-3344787cb045","year":2024},"citing_paper":{"arxiv_id":"2505.04180","last_updated":"2025-05-08T07:51:26Z","snapshot_observed_at":"2026-08-20T03:52:43.157286Z","submitted_at":"2025-05-07T07:25:46Z","title":"Towards Large-scale Generative Ranking","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-15T23:39:25.737946Z"},"links":{"citing_paper":"/paper/2505.04180"},"observation_digest":"sha256:1ca9bd50e80c6c5ad389ff4f4385909ef78fc5b2f43330b392bef9fc192b7302","observation_id":"9bb67a0e-8dac-417d-bd4b-720a1e3dd313","resolution":{"observed_at":"2026-08-15T23:39:25.944237Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-15T23:39:25.929982Z","title":"Content-Based Collaborative Generation for Recom- mender Systems // Proceedings of the 33rd ACM International Conference on Information and Knowledge Management","venue":null,"work_id":"05947d01-b05d-41d8-9f8a-5a3b0798c437","year":2024},"citing_paper":{"arxiv_id":"2505.04180","last_updated":"2025-05-08T07:51:26Z","snapshot_observed_at":"2026-08-20T03:52:43.157286Z","submitted_at":"2025-05-07T07:25:46Z","title":"Towards Large-scale Generative Ranking","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-15T23:39:25.740965Z"},"links":{"citing_paper":"/paper/2505.04180"},"observation_digest":"sha256:2a8eb6507f5296fb7d6f06e35ae05b0c353ec90a516915c63bb9eb2a00661430","observation_id":"324e8c88-2d46-4dd4-bd43-753e69d6b536","resolution":{"observed_at":"2026-08-15T23:39:25.933507Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-15T23:39:25.919478Z","title":"Enhancing Performance and Scalability of Large-Scale Recommendation Systems with Jagged Flash Attention // Proceedings of the 18th ACM Conference on Recommender Systems","venue":null,"work_id":"1e124998-a76c-4329-aba0-7cd063d39c4c","year":2024},"citing_paper":{"arxiv_id":"2505.04180","last_updated":"2025-05-08T07:51:26Z","snapshot_observed_at":"2026-08-20T03:52:43.157286Z","submitted_at":"2025-05-07T07:25:46Z","title":"Towards Large-scale Generative Ranking","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-15T23:39:25.744154Z"},"links":{"citing_paper":"/paper/2505.04180"},"observation_digest":"sha256:8ccea6d66aee6ff980ca5e66d21103e93338daf32d94505b42f97429fd807fc0","observation_id":"f6abd0ce-59c1-4778-933f-ba1cc0c86c95","resolution":{"observed_at":"2026-08-15T23:39:25.923682Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2503.02453","last_updated":"2025-03-04T10:00:05Z","snapshot_observed_at":"2026-08-19T12:52:32.352399Z","submitted_at":"2025-03-04T10:00:05Z","title":"Sparse Meets Dense: Unified Generative Recommendations with Cascaded Sparse-Dense Representations","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.02453","snapshot_observed_at":"2026-08-15T23:39:25.747342Z","title":"Sparse Meets Dense: Unified Generative Recommendations with Cascaded Sparse-Dense Representations // arXiv preprint arXiv:2503.02453","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.04180","last_updated":"2025-05-08T07:51:26Z","snapshot_observed_at":"2026-08-20T03:52:43.157286Z","submitted_at":"2025-05-07T07:25:46Z","title":"Towards Large-scale Generative Ranking","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-15T23:39:25.747342Z"},"links":{"cited_paper":"/paper/2503.02453","citing_paper":"/paper/2505.04180"},"observation_digest":"sha256:42eaead62f619a2bbfc78640192537c02139cebc0f8d8a846c7855cfe1663c53","observation_id":"54a9cabe-38de-40cc-aff8-7af29cc21f33","resolution":{"observed_at":"2026-08-15T23:39:25.747342Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.17152","last_updated":"2024-05-06T02:05:45Z","snapshot_observed_at":"2026-08-21T23:52:21.846075Z","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-15T23:39:25.750896Z","title":"Actions speak louder than words: Trillion-parameter sequential transducers for generative recommendations // arXiv preprint arXiv:2402.17152","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.04180","last_updated":"2025-05-08T07:51:26Z","snapshot_observed_at":"2026-08-20T03:52:43.157286Z","submitted_at":"2025-05-07T07:25:46Z","title":"Towards Large-scale Generative Ranking","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-15T23:39:25.750896Z"},"links":{"cited_paper":"/paper/2402.17152","citing_paper":"/paper/2505.04180"},"observation_digest":"sha256:ff3cc589a5a76e6b7336eb4c2ee16f965273fe02bdf57feac27151719fe34c4b","observation_id":"5243f674-2453-4c7a-8d5c-8c8dc4fc0513","resolution":{"observed_at":"2026-08-15T23:39:25.750896Z","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-15T23:39:25.907663Z","title":"Scaling vision transformers // Proceedings of the IEEE/CVF conference on computer vision and pattern recognition","venue":null,"work_id":"ee92eb4a-2d08-4008-88ef-6e13b24a4e37","year":2022},"citing_paper":{"arxiv_id":"2505.04180","last_updated":"2025-05-08T07:51:26Z","snapshot_observed_at":"2026-08-20T03:52:43.157286Z","submitted_at":"2025-05-07T07:25:46Z","title":"Towards Large-scale Generative Ranking","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-15T23:39:25.754205Z"},"links":{"citing_paper":"/paper/2505.04180"},"observation_digest":"sha256:7a75f160c609426a676fde8e57c97cfa0efc58b75dbafd5a26892c5d1cef2f45","observation_id":"3f3f0e4e-f46d-436e-b2a6-6f6feb2ab93e","resolution":{"observed_at":"2026-08-15T23:39:25.912858Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-15T23:39:25.896727Z","title":"Sigmoid loss for language image pre-training // Proceedings of the IEEE/CVF international conference on computer vision","venue":null,"work_id":"b00565e8-6b60-4f7d-aec4-ad93eb021941","year":null},"citing_paper":{"arxiv_id":"2505.04180","last_updated":"2025-05-08T07:51:26Z","snapshot_observed_at":"2026-08-20T03:52:43.157286Z","submitted_at":"2025-05-07T07:25:46Z","title":"Towards Large-scale Generative Ranking","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-15T23:39:25.757247Z"},"links":{"citing_paper":"/paper/2505.04180"},"observation_digest":"sha256:c292c202b9613fd93e403405309edd1a0b3be0687d2f0d7476ce670f398b72e8","observation_id":"a2836247-bdf6-47f1-b84c-f6878ee5d056","resolution":{"observed_at":"2026-08-15T23:39:25.900985Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.02545","last_updated":"2024-06-04T04:29:24Z","snapshot_observed_at":"2026-08-19T13:13:01.996148Z","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-15T23:39:25.760563Z","title":"Wukong: Towards a scaling law for large-scale recommendation // arXiv preprint arXiv:2403.02545","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.04180","last_updated":"2025-05-08T07:51:26Z","snapshot_observed_at":"2026-08-20T03:52:43.157286Z","submitted_at":"2025-05-07T07:25:46Z","title":"Towards Large-scale Generative Ranking","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-15T23:39:25.760563Z"},"links":{"cited_paper":"/paper/2403.02545","citing_paper":"/paper/2505.04180"},"observation_digest":"sha256:d2d0c5fd8c398a7b87e3db747b4a84178251ee74823c6641dc07ea9721176cac","observation_id":"a83797b9-3fb7-4f4a-9181-6dd6686605d9","resolution":{"observed_at":"2026-08-15T23:39:25.760563Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.16789","last_updated":"2025-01-21T15:40:43Z","snapshot_observed_at":"2026-08-16T13:49:13.072319Z","submitted_at":"2024-05-27T03:24:01Z","title":"NoteLLM-2: Multimodal Large Representation Models for Recommendation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.16789","snapshot_observed_at":"2026-08-15T23:39:25.764421Z","title":"Notellm-2: Multimodal large representation models for recommendation // arXiv preprint arXiv:2405.16789","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.04180","last_updated":"2025-05-08T07:51:26Z","snapshot_observed_at":"2026-08-20T03:52:43.157286Z","submitted_at":"2025-05-07T07:25:46Z","title":"Towards Large-scale Generative Ranking","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-15T23:39:25.764421Z"},"links":{"cited_paper":"/paper/2405.16789","citing_paper":"/paper/2505.04180"},"observation_digest":"sha256:a79922013110e0aec72c20dad8d38859ed01da203692415688273471c5fc3018","observation_id":"fdcb1ef3-fe53-4431-a13e-3015eca85ff3","resolution":{"observed_at":"2026-08-15T23:39:25.764421Z","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-15T23:39:25.885981Z","title":"Towards understanding the overfitting phenomenon of deep click-through rate models // Proceedings of the 31st ACM international conference on information & knowledge management","venue":null,"work_id":"2e9e0025-fae9-423b-adc4-e65ac3313e79","year":2022},"citing_paper":{"arxiv_id":"2505.04180","last_updated":"2025-05-08T07:51:26Z","snapshot_observed_at":"2026-08-20T03:52:43.157286Z","submitted_at":"2025-05-07T07:25:46Z","title":"Towards Large-scale Generative Ranking","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-15T23:39:25.768364Z"},"links":{"citing_paper":"/paper/2505.04180"},"observation_digest":"sha256:cc548a1bc6750f64975a5e214f97b2ce5bfed2a1f6d9d0e54a4ebf9202f37495","observation_id":"3bb7f710-b326-41f1-9fe2-00cbfefb133a","resolution":{"observed_at":"2026-08-15T23:39:25.889876Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-15T23:39:25.874826Z","title":"Deep interest network for click-through rate prediction // Proceedings of the 24th ACM SIGKDD international conference on knowledge discovery & data mining","venue":null,"work_id":"8d391bb9-c317-471c-940e-d936115b0e21","year":null},"citing_paper":{"arxiv_id":"2505.04180","last_updated":"2025-05-08T07:51:26Z","snapshot_observed_at":"2026-08-20T03:52:43.157286Z","submitted_at":"2025-05-07T07:25:46Z","title":"Towards Large-scale Generative Ranking","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-15T23:39:25.771682Z"},"links":{"citing_paper":"/paper/2505.04180"},"observation_digest":"sha256:cdaa4b6651cabcf5570f27bda20f73e30d49cb39ef98f3d71df4da6c2abd8173","observation_id":"94e3053d-dbd8-484f-92fe-ed49eb7dc59f","resolution":{"observed_at":"2026-08-15T23:39:25.879468Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2505.04180","last_updated":"2025-05-08T07:51:26Z","latest_version":2,"primary_category":"cs.IR","snapshot_observed_at":"2026-08-20T03:52:43.157286Z","submitted_at":"2025-05-07T07:25:46Z","title":"Towards Large-scale Generative Ranking"},"reference_resolution":{"displayed":29,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":12,"verified_exact":1,"verified_fuzzy":16},"total_outbound_references":29},"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-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"thesis":"As of 23 August 2026, this Paper Citation Record lists 29 of 29 outbound references and 32 inbound Pith citation observations for arXiv:2505.04180."}