{"as_of":"2026-08-08T15:43:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:49a1a9a6fd1e59547521ce6b39c9e6363fb2de850dae5431affff920208eef49","coverage":[{"denominator":38,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":38,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T15:03:16.849422Z","state":"measured"},{"denominator":39,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":39,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T19:06:02.428274Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-06T19:06:09.369804Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2505.16752","last_updated":"2025-08-18T11:53:56Z","snapshot_observed_at":"2026-08-07T14:53:58.792049Z","submitted_at":"2025-05-22T14:58:53Z","title":"Action is All You Need: Dual-Flow Generative Ranking Network for Recommendation","version":3},"cited_work":{"arxiv_id":"2505.16752","doi":null,"metadata_source":"pith","pith_arxiv_id":"2505.16752","snapshot_observed_at":"2026-08-06T19:06:09.369804Z","title":"Action is All You Need: Dual-Flow Generative Ranking Network for Recommendation","venue":"cs.IR","work_id":"2e724906-abdf-4a79-8caa-5414ee024d52","year":2025},"citing_paper":{"arxiv_id":"2507.06507","last_updated":"2025-07-14T07:46:11Z","snapshot_observed_at":"2026-08-08T04:13:41.618907Z","submitted_at":"2025-07-09T03:13:08Z","title":"GR-LLMs: Recent Advances in Generative Recommendation Based on Large Language Models","version":2},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-06T19:06:02.428274Z"},"links":{"cited_paper":"/paper/2505.16752","citing_paper":"/paper/2507.06507"},"observation_digest":"sha256:68009acffcd1ee6e3b2d555830ccdc16498f576e021c728ae3fecde5429f6b75","observation_id":"99df43f8-8695-4a6c-9ee4-967a197bcace","resolution":{"observed_at":"2026-08-06T19:06:09.375134Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2505.16752/citation-record","integrity":"/paper/2505.16752/integrity","json":"/paper/2505.16752/citation-record.json","paper":"/paper/2505.16752"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:03:14.956736Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.16752","last_updated":"2025-08-18T11:53:56Z","snapshot_observed_at":"2026-08-07T14:53:58.792049Z","submitted_at":"2025-05-22T14:58:53Z","title":"Action is All You Need: Dual-Flow Generative Ranking Network for Recommendation","version":3},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T15:03:14.956736Z"},"links":{"citing_paper":"/paper/2505.16752"},"observation_digest":"sha256:bb3cefab36354c487437ba3419e7a1f4a1c90ea8476b5e74af06235ecf31636a","observation_id":"3711c219-788e-4497-acdf-5f63d3a6f21f","resolution":{"observed_at":"2026-08-07T15:03:14.956736Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:03:14.986830Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.16752","last_updated":"2025-08-18T11:53:56Z","snapshot_observed_at":"2026-08-07T14:53:58.792049Z","submitted_at":"2025-05-22T14:58:53Z","title":"Action is All You Need: Dual-Flow Generative Ranking Network for Recommendation","version":3},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T15:03:14.986830Z"},"links":{"citing_paper":"/paper/2505.16752"},"observation_digest":"sha256:cdedf521837ec0bffe9fa7f2c6983c10ccda80a9f4090ecf3d6dc49111001f62","observation_id":"6cb8bf36-f529-450a-b8b3-e94e6c09f467","resolution":{"observed_at":"2026-08-07T15:03:14.986830Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:03:14.994226Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2505.16752","last_updated":"2025-08-18T11:53:56Z","snapshot_observed_at":"2026-08-07T14:53:58.792049Z","submitted_at":"2025-05-22T14:58:53Z","title":"Action is All You Need: Dual-Flow Generative Ranking Network for Recommendation","version":3},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T15:03:14.994226Z"},"links":{"citing_paper":"/paper/2505.16752"},"observation_digest":"sha256:8116ebd866a8621c700623c3952c06734f9013d199813a01c4c253db59125c3f","observation_id":"aa4e95d5-63ca-4da0-aefa-566198680781","resolution":{"observed_at":"2026-08-07T15:03:14.994226Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1905.06482","last_updated":"2019-05-16T00:31:41Z","snapshot_observed_at":"2026-08-07T19:57:56.678724Z","submitted_at":"2019-05-16T00:31:41Z","title":"Deep Session Interest Network for Click-Through Rate Prediction","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1905.06482","snapshot_observed_at":"2026-08-07T15:03:14.997833Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2505.16752","last_updated":"2025-08-18T11:53:56Z","snapshot_observed_at":"2026-08-07T14:53:58.792049Z","submitted_at":"2025-05-22T14:58:53Z","title":"Action is All You Need: Dual-Flow Generative Ranking Network for Recommendation","version":3},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T15:03:14.997833Z"},"links":{"cited_paper":"/paper/1905.06482","citing_paper":"/paper/2505.16752"},"observation_digest":"sha256:1812b8bf712136ee479960213b3024ee3f18a35a97552a39375e048ad92c6b83","observation_id":"ee0ec794-a624-4a91-af7c-02e25486bdef","resolution":{"observed_at":"2026-08-07T15:03:14.997833Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.21783","last_updated":"2024-11-23T23:27:33Z","snapshot_observed_at":"2026-07-06T18:55:11.576666Z","submitted_at":"2024-07-31T17:54:27Z","title":"The Llama 3 Herd of Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.21783","snapshot_observed_at":"2026-08-07T15:03:15.001635Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.16752","last_updated":"2025-08-18T11:53:56Z","snapshot_observed_at":"2026-08-07T14:53:58.792049Z","submitted_at":"2025-05-22T14:58:53Z","title":"Action is All You Need: Dual-Flow Generative Ranking Network for Recommendation","version":3},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T15:03:15.001635Z"},"links":{"cited_paper":"/paper/2407.21783","citing_paper":"/paper/2505.16752"},"observation_digest":"sha256:e0db779bf5e45248087474ba0acc54fbc1088bfeb30adaa7162e84e2cb40b5cd","observation_id":"e5565ed0-38bb-4e40-adb8-eb156ca86c01","resolution":{"observed_at":"2026-08-07T15:03:15.001635Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1703.04247","last_updated":"2017-03-13T04:55:19Z","snapshot_observed_at":"2026-07-06T05:33:25.278531Z","submitted_at":"2017-03-13T04:55:19Z","title":"DeepFM: A Factorization-Machine based Neural Network for CTR Prediction","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1703.04247","snapshot_observed_at":"2026-08-07T15:03:15.011626Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2505.16752","last_updated":"2025-08-18T11:53:56Z","snapshot_observed_at":"2026-08-07T14:53:58.792049Z","submitted_at":"2025-05-22T14:58:53Z","title":"Action is All You Need: Dual-Flow Generative Ranking Network for Recommendation","version":3},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T15:03:15.011626Z"},"links":{"cited_paper":"/paper/1703.04247","citing_paper":"/paper/2505.16752"},"observation_digest":"sha256:134ebb75cced0893ad8569ec06fbc584f052be34dc96664fb5a4627c9aa3c29f","observation_id":"485a0146-d9de-4f13-8b8a-8ba8b12eeda6","resolution":{"observed_at":"2026-08-07T15:03:15.011626Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:03:15.027702Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2505.16752","last_updated":"2025-08-18T11:53:56Z","snapshot_observed_at":"2026-08-07T14:53:58.792049Z","submitted_at":"2025-05-22T14:58:53Z","title":"Action is All You Need: Dual-Flow Generative Ranking Network for Recommendation","version":3},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T15:03:15.027702Z"},"links":{"citing_paper":"/paper/2505.16752"},"observation_digest":"sha256:84e78a02bdf0eca8ebbf04374f28a97c30396b85dcb73219a4a859d77e843a11","observation_id":"d1c75ce6-5739-4c89-93d5-45e2d5b4506e","resolution":{"observed_at":"2026-08-07T15:03:15.027702Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2203.15556","last_updated":"2022-03-29T13:38:03Z","snapshot_observed_at":"2026-07-06T12:54:11.616335Z","submitted_at":"2022-03-29T13:38:03Z","title":"Training Compute-Optimal Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2203.15556","snapshot_observed_at":"2026-08-07T15:03:15.067459Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.16752","last_updated":"2025-08-18T11:53:56Z","snapshot_observed_at":"2026-08-07T14:53:58.792049Z","submitted_at":"2025-05-22T14:58:53Z","title":"Action is All You Need: Dual-Flow Generative Ranking Network for Recommendation","version":3},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T15:03:15.067459Z"},"links":{"cited_paper":"/paper/2203.15556","citing_paper":"/paper/2505.16752"},"observation_digest":"sha256:216ad8efa2633848b19e708b2984328bb7f80c4643e846cd3095338c4834165f","observation_id":"ae48bbdd-a8a9-43e5-952a-f58888b5277f","resolution":{"observed_at":"2026-08-07T15:03:15.067459Z","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-07T15:03:17.523472Z","title":null,"venue":null,"work_id":"87cf2de2-c43f-4efa-9152-5d159ed681aa","year":2024},"citing_paper":{"arxiv_id":"2505.16752","last_updated":"2025-08-18T11:53:56Z","snapshot_observed_at":"2026-08-07T14:53:58.792049Z","submitted_at":"2025-05-22T14:58:53Z","title":"Action is All You Need: Dual-Flow Generative Ranking Network for Recommendation","version":3},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T15:03:15.142127Z"},"links":{"citing_paper":"/paper/2505.16752"},"observation_digest":"sha256:4f5ce37a0e4f7c97eb54bb153270de1d61f8a2d8da08255784cedc827c246190","observation_id":"13797e13-c719-43fc-bdf9-14775a384dfc","resolution":{"observed_at":"2026-08-07T15:03:17.568845Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:03:15.214780Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.16752","last_updated":"2025-08-18T11:53:56Z","snapshot_observed_at":"2026-08-07T14:53:58.792049Z","submitted_at":"2025-05-22T14:58:53Z","title":"Action is All You Need: Dual-Flow Generative Ranking Network for Recommendation","version":3},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T15:03:15.214780Z"},"links":{"citing_paper":"/paper/2505.16752"},"observation_digest":"sha256:d414044eceb78a0f1928f4fafb5083511103a392f5b3ffa8d5eed095773a1056","observation_id":"51860eb2-5c9f-4189-a94b-5bcb6dea87aa","resolution":{"observed_at":"2026-08-07T15:03:15.214780Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:03:15.279913Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2505.16752","last_updated":"2025-08-18T11:53:56Z","snapshot_observed_at":"2026-08-07T14:53:58.792049Z","submitted_at":"2025-05-22T14:58:53Z","title":"Action is All You Need: Dual-Flow Generative Ranking Network for Recommendation","version":3},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T15:03:15.279913Z"},"links":{"citing_paper":"/paper/2505.16752"},"observation_digest":"sha256:6f88b9a5812a56a9906dffcf29c938b3810a4d340bd73b4aee7e0283fe849b27","observation_id":"26c169db-3720-4c6a-91b3-c63acd060e26","resolution":{"observed_at":"2026-08-07T15:03:15.279913Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:03:15.461560Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2505.16752","last_updated":"2025-08-18T11:53:56Z","snapshot_observed_at":"2026-08-07T14:53:58.792049Z","submitted_at":"2025-05-22T14:58:53Z","title":"Action is All You Need: Dual-Flow Generative Ranking Network for Recommendation","version":3},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T15:03:15.461560Z"},"links":{"citing_paper":"/paper/2505.16752"},"observation_digest":"sha256:d44d1509e88966d83e21e9d5e8e20d324fe9b50f5e19e7acc2e974db87b8e17f","observation_id":"4793c5a3-87fe-4b46-8f1e-5a207301ae8d","resolution":{"observed_at":"2026-08-07T15:03:15.461560Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2001.08361","last_updated":"2020-01-23T03:59:20Z","snapshot_observed_at":"2026-07-06T08:52:12.656082Z","submitted_at":"2020-01-23T03:59:20Z","title":"Scaling Laws for Neural Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2001.08361","snapshot_observed_at":"2026-08-07T15:03:15.484073Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.16752","last_updated":"2025-08-18T11:53:56Z","snapshot_observed_at":"2026-08-07T14:53:58.792049Z","submitted_at":"2025-05-22T14:58:53Z","title":"Action is All You Need: Dual-Flow Generative Ranking Network for Recommendation","version":3},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T15:03:15.484073Z"},"links":{"cited_paper":"/paper/2001.08361","citing_paper":"/paper/2505.16752"},"observation_digest":"sha256:4393acbb045c084c010a7a10d6bfd8a258c0b17f067728d7ff2f01fbce9b2a7d","observation_id":"d9a72abc-92e0-4cca-8a1d-d45b3429f839","resolution":{"observed_at":"2026-08-07T15:03:15.484073Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:03:15.562408Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.16752","last_updated":"2025-08-18T11:53:56Z","snapshot_observed_at":"2026-08-07T14:53:58.792049Z","submitted_at":"2025-05-22T14:58:53Z","title":"Action is All You Need: Dual-Flow Generative Ranking Network for Recommendation","version":3},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T15:03:15.562408Z"},"links":{"citing_paper":"/paper/2505.16752"},"observation_digest":"sha256:7b726e3bd8f97f36b75d02b7f6c72652fec1d145674ad3521bcdc1d50b978e64","observation_id":"9981fd8a-ff08-4c3b-b86d-f09129b05b4c","resolution":{"observed_at":"2026-08-07T15:03:15.562408Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:03:15.662771Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2505.16752","last_updated":"2025-08-18T11:53:56Z","snapshot_observed_at":"2026-08-07T14:53:58.792049Z","submitted_at":"2025-05-22T14:58:53Z","title":"Action is All You Need: Dual-Flow Generative Ranking Network for Recommendation","version":3},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T15:03:15.662771Z"},"links":{"citing_paper":"/paper/2505.16752"},"observation_digest":"sha256:ec7db8cd2271dfd34314415e317f1f6b451d7ad06d59d21c9e3857e6a7ccf530","observation_id":"00f27873-fcef-4a22-ac3c-21a00ad7a785","resolution":{"observed_at":"2026-08-07T15:03:15.662771Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:03:15.692780Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.16752","last_updated":"2025-08-18T11:53:56Z","snapshot_observed_at":"2026-08-07T14:53:58.792049Z","submitted_at":"2025-05-22T14:58:53Z","title":"Action is All You Need: Dual-Flow Generative Ranking Network for Recommendation","version":3},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T15:03:15.692780Z"},"links":{"citing_paper":"/paper/2505.16752"},"observation_digest":"sha256:81f6ee67b6ba8e41713be44f2f0452e4b639678ececa583627d6df4faf296314","observation_id":"3a172113-9111-418a-8896-d45eac759ba7","resolution":{"observed_at":"2026-08-07T15:03:15.692780Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:03:15.705208Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2505.16752","last_updated":"2025-08-18T11:53:56Z","snapshot_observed_at":"2026-08-07T14:53:58.792049Z","submitted_at":"2025-05-22T14:58:53Z","title":"Action is All You Need: Dual-Flow Generative Ranking Network for Recommendation","version":3},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T15:03:15.705208Z"},"links":{"citing_paper":"/paper/2505.16752"},"observation_digest":"sha256:ac31fbdcb99c07b6ca9f46dcb5158114b1f3be763db20e40cc0c6ccea1290924","observation_id":"0bcb3eec-db87-40ca-9518-d0b6b1190b5b","resolution":{"observed_at":"2026-08-07T15:03:15.705208Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:03:15.708214Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.16752","last_updated":"2025-08-18T11:53:56Z","snapshot_observed_at":"2026-08-07T14:53:58.792049Z","submitted_at":"2025-05-22T14:58:53Z","title":"Action is All You Need: Dual-Flow Generative Ranking Network for Recommendation","version":3},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T15:03:15.708214Z"},"links":{"citing_paper":"/paper/2505.16752"},"observation_digest":"sha256:85e81080df345dee8c3c923b8ed310045638fe041081eabf0e8e0b1bd87aabe1","observation_id":"7384600c-7527-4724-b07c-4548d98c2dca","resolution":{"observed_at":"2026-08-07T15:03:15.708214Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2209.12212","last_updated":"2022-09-25T12:59:57Z","snapshot_observed_at":"2026-08-06T19:00:09.782612Z","submitted_at":"2022-09-25T12:59:57Z","title":"Efficient Long Sequential User Data Modeling for Click-Through Rate Prediction","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2209.12212","snapshot_observed_at":"2026-08-07T15:03:15.711978Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.16752","last_updated":"2025-08-18T11:53:56Z","snapshot_observed_at":"2026-08-07T14:53:58.792049Z","submitted_at":"2025-05-22T14:58:53Z","title":"Action is All You Need: Dual-Flow Generative Ranking Network for Recommendation","version":3},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T15:03:15.711978Z"},"links":{"cited_paper":"/paper/2209.12212","citing_paper":"/paper/2505.16752"},"observation_digest":"sha256:140ae9a06211a248088092cc30d248af63df19cf5a0e3db8440086770cbec54c","observation_id":"f3ed0a3c-120a-43e7-ad6e-2e92459b2539","resolution":{"observed_at":"2026-08-07T15:03:15.711978Z","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-07T15:03:17.345037Z","title":null,"venue":null,"work_id":"e6ba2cfd-3912-4855-9d60-693aebddb517","year":null},"citing_paper":{"arxiv_id":"2505.16752","last_updated":"2025-08-18T11:53:56Z","snapshot_observed_at":"2026-08-07T14:53:58.792049Z","submitted_at":"2025-05-22T14:58:53Z","title":"Action is All You Need: Dual-Flow Generative Ranking Network for Recommendation","version":3},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T15:03:15.725734Z"},"links":{"citing_paper":"/paper/2505.16752"},"observation_digest":"sha256:ecc67c19002f590f75c938579c57b712533cd62e220929e462651ac547468cdc","observation_id":"ed2e1cff-f434-466d-921c-f51643b77c72","resolution":{"observed_at":"2026-08-07T15:03:17.403540Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:03:15.844637Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.16752","last_updated":"2025-08-18T11:53:56Z","snapshot_observed_at":"2026-08-07T14:53:58.792049Z","submitted_at":"2025-05-22T14:58:53Z","title":"Action is All You Need: Dual-Flow Generative Ranking Network for Recommendation","version":3},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T15:03:15.844637Z"},"links":{"citing_paper":"/paper/2505.16752"},"observation_digest":"sha256:044c897926722ad61b0ce9742ef05804478bc8c7ac7984db1371a7bfa3a6445b","observation_id":"55e958f2-bf89-469f-bfb4-bf5692d80d34","resolution":{"observed_at":"2026-08-07T15:03:15.844637Z","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-07T15:03:17.217605Z","title":null,"venue":null,"work_id":"c8b4584f-0914-4572-b64a-b85cf1765d3c","year":2016},"citing_paper":{"arxiv_id":"2505.16752","last_updated":"2025-08-18T11:53:56Z","snapshot_observed_at":"2026-08-07T14:53:58.792049Z","submitted_at":"2025-05-22T14:58:53Z","title":"Action is All You Need: Dual-Flow Generative Ranking Network for Recommendation","version":3},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T15:03:15.915878Z"},"links":{"citing_paper":"/paper/2505.16752"},"observation_digest":"sha256:7a2502834377261559bbdeba68798371071f64d8c8220c14f2f31a4ed2b55538","observation_id":"1115f889-d7ee-4935-8087-ad086411fe9d","resolution":{"observed_at":"2026-08-07T15:03:17.269213Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:03:15.954233Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.16752","last_updated":"2025-08-18T11:53:56Z","snapshot_observed_at":"2026-08-07T14:53:58.792049Z","submitted_at":"2025-05-22T14:58:53Z","title":"Action is All You Need: Dual-Flow Generative Ranking Network for Recommendation","version":3},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T15:03:15.954233Z"},"links":{"citing_paper":"/paper/2505.16752"},"observation_digest":"sha256:d68ffaf28329e63c99453e468c31c0bdb66433088b7888c975013224e35c434c","observation_id":"61472f84-e829-46ee-b98d-2ad068a36f1c","resolution":{"observed_at":"2026-08-07T15:03:15.954233Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2307.09288","last_updated":"2023-07-19T17:08:59Z","snapshot_observed_at":"2026-08-07T12:56:43.323460Z","submitted_at":"2023-07-18T14:31:57Z","title":"Llama 2: Open Foundation and Fine-Tuned Chat Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2307.09288","snapshot_observed_at":"2026-08-07T15:03:16.124574Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.16752","last_updated":"2025-08-18T11:53:56Z","snapshot_observed_at":"2026-08-07T14:53:58.792049Z","submitted_at":"2025-05-22T14:58:53Z","title":"Action is All You Need: Dual-Flow Generative Ranking Network for Recommendation","version":3},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T15:03:16.124574Z"},"links":{"cited_paper":"/paper/2307.09288","citing_paper":"/paper/2505.16752"},"observation_digest":"sha256:fadd65952ca600a8eb45debb1dc496efade18687aea8869d1f4c5d894168beda","observation_id":"b4f4b4c2-35eb-4ed9-811f-83378226ed33","resolution":{"observed_at":"2026-08-07T15:03:16.124574Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:03:16.225849Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.16752","last_updated":"2025-08-18T11:53:56Z","snapshot_observed_at":"2026-08-07T14:53:58.792049Z","submitted_at":"2025-05-22T14:58:53Z","title":"Action is All You Need: Dual-Flow Generative Ranking Network for Recommendation","version":3},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T15:03:16.225849Z"},"links":{"citing_paper":"/paper/2505.16752"},"observation_digest":"sha256:5a863c9ca04edb5f68f8586181f1d2cdcb8a1e754149dc89cce39249e1f770d2","observation_id":"f51391c6-e8d5-4425-9435-ce69efa85379","resolution":{"observed_at":"2026-08-07T15:03:16.225849Z","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-07T15:03:17.066972Z","title":null,"venue":null,"work_id":"a7fa66ad-115e-4983-b182-cdb7e7d2af32","year":2019},"citing_paper":{"arxiv_id":"2505.16752","last_updated":"2025-08-18T11:53:56Z","snapshot_observed_at":"2026-08-07T14:53:58.792049Z","submitted_at":"2025-05-22T14:58:53Z","title":"Action is All You Need: Dual-Flow Generative Ranking Network for Recommendation","version":3},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-07T15:03:16.326305Z"},"links":{"citing_paper":"/paper/2505.16752"},"observation_digest":"sha256:b24c09adda8f19fea9d601a0c751d5c4c63a99221912356dfc918125b4e2901e","observation_id":"eefd8397-42cb-44e0-a055-d2c43b45d237","resolution":{"observed_at":"2026-08-07T15:03:17.129352Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:03:16.030209Z","title":"In Proceedings of the 28th ACM international conference on information and knowledge management","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.16752","last_updated":"2025-08-18T11:53:56Z","snapshot_observed_at":"2026-08-07T14:53:58.792049Z","submitted_at":"2025-05-22T14:58:53Z","title":"Action is All You Need: Dual-Flow Generative Ranking Network for Recommendation","version":3},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-07T15:03:16.030209Z"},"links":{"citing_paper":"/paper/2505.16752"},"observation_digest":"sha256:73a2a75e55a9cd9c18ddb2b83ed34fed9293d162eaed7792818ac0414b5de568","observation_id":"48d6b10f-0300-4683-a90f-7a918247e5dd","resolution":{"observed_at":"2026-08-07T15:03:16.030209Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:03:16.491089Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.16752","last_updated":"2025-08-18T11:53:56Z","snapshot_observed_at":"2026-08-07T14:53:58.792049Z","submitted_at":"2025-05-22T14:58:53Z","title":"Action is All You Need: Dual-Flow Generative Ranking Network for Recommendation","version":3},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-07T15:03:16.491089Z"},"links":{"citing_paper":"/paper/2505.16752"},"observation_digest":"sha256:1034e6ec47fb7963320f5b339c88f21b5c1b62d1556eef4fedb4bebbdac54d57","observation_id":"bd3db8eb-e6fb-40c1-913c-b29e44a78250","resolution":{"observed_at":"2026-08-07T15:03:16.491089Z","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-06T03:48:40.952592Z","submitted_at":"2024-02-27T02:37:37Z","title":"Actions Speak Louder than Words: Trillion-Parameter Sequential Transducers for Generative Recommendations","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.17152","snapshot_observed_at":"2026-08-07T15:03:16.623516Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.16752","last_updated":"2025-08-18T11:53:56Z","snapshot_observed_at":"2026-08-07T14:53:58.792049Z","submitted_at":"2025-05-22T14:58:53Z","title":"Action is All You Need: Dual-Flow Generative Ranking Network for Recommendation","version":3},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-07T15:03:16.623516Z"},"links":{"cited_paper":"/paper/2402.17152","citing_paper":"/paper/2505.16752"},"observation_digest":"sha256:335150d4b87f1a7760ee210d05c9a9d26302883108f1d7da1a5f93143f362b1c","observation_id":"c8313ce5-803a-40df-8257-83057b378be6","resolution":{"observed_at":"2026-08-07T15:03:16.623516Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2203.11014","last_updated":"2022-03-11T21:19:31Z","snapshot_observed_at":"2026-08-05T04:18:51.204757Z","submitted_at":"2022-03-11T21:19:31Z","title":"DHEN: A Deep and Hierarchical Ensemble Network for Large-Scale Click-Through Rate Prediction","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2203.11014","snapshot_observed_at":"2026-08-07T15:03:16.692491Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.16752","last_updated":"2025-08-18T11:53:56Z","snapshot_observed_at":"2026-08-07T14:53:58.792049Z","submitted_at":"2025-05-22T14:58:53Z","title":"Action is All You Need: Dual-Flow Generative Ranking Network for Recommendation","version":3},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-07T15:03:16.692491Z"},"links":{"cited_paper":"/paper/2203.11014","citing_paper":"/paper/2505.16752"},"observation_digest":"sha256:3e83e63ba15996c27fe5b5c34b04c8863bee380cb8f499ab636130114a9b5b72","observation_id":"71bc7a0a-5d26-4b41-a236-d9602450161a","resolution":{"observed_at":"2026-08-07T15:03:16.692491Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:03:16.427974Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.16752","last_updated":"2025-08-18T11:53:56Z","snapshot_observed_at":"2026-08-07T14:53:58.792049Z","submitted_at":"2025-05-22T14:58:53Z","title":"Action is All You Need: Dual-Flow Generative Ranking Network for Recommendation","version":3},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-07T15:03:16.427974Z"},"links":{"citing_paper":"/paper/2505.16752"},"observation_digest":"sha256:e5fbb7b7465459182b7b82bea1d3631a0622ca4cb7b8a395dd2ae945e29636af","observation_id":"c0c399cd-5d4c-4e09-9523-511076203286","resolution":{"observed_at":"2026-08-07T15:03:16.427974Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:03:16.811316Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2505.16752","last_updated":"2025-08-18T11:53:56Z","snapshot_observed_at":"2026-08-07T14:53:58.792049Z","submitted_at":"2025-05-22T14:58:53Z","title":"Action is All You Need: Dual-Flow Generative Ranking Network for Recommendation","version":3},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-07T15:03:16.811316Z"},"links":{"citing_paper":"/paper/2505.16752"},"observation_digest":"sha256:f16930ca3722ce025b47c81d5238cef243a187ec77e0ebdac50c0573ceda0c16","observation_id":"67ad07fd-9f2e-4b76-8acd-0b4257588587","resolution":{"observed_at":"2026-08-07T15:03:16.811316Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:03:16.849422Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2505.16752","last_updated":"2025-08-18T11:53:56Z","snapshot_observed_at":"2026-08-07T14:53:58.792049Z","submitted_at":"2025-05-22T14:58:53Z","title":"Action is All You Need: Dual-Flow Generative Ranking Network for Recommendation","version":3},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-07T15:03:16.849422Z"},"links":{"citing_paper":"/paper/2505.16752"},"observation_digest":"sha256:73afd04e21911c95f6529bc07b088103860f553328f0c39701ad896ffe191a27","observation_id":"870aa648-c244-4e47-b334-9c833e670a08","resolution":{"observed_at":"2026-08-07T15:03:16.849422Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2210.05144","last_updated":"2022-10-11T04:54:05Z","snapshot_observed_at":"2026-07-06T14:03:25.739373Z","submitted_at":"2022-10-11T04:54:05Z","title":"Mixture of Attention Heads: Selecting Attention Heads Per Token","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.05144","snapshot_observed_at":"2026-08-07T15:03:16.753361Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.16752","last_updated":"2025-08-18T11:53:56Z","snapshot_observed_at":"2026-08-07T14:53:58.792049Z","submitted_at":"2025-05-22T14:58:53Z","title":"Action is All You Need: Dual-Flow Generative Ranking Network for Recommendation","version":3},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-07T15:03:16.753361Z"},"links":{"cited_paper":"/paper/2210.05144","citing_paper":"/paper/2505.16752"},"observation_digest":"sha256:7306e5c648373ee4651c22e4e956b55c7b903e26e118ea15951b03d9768c0b53","observation_id":"6d3294ea-96b7-4c0a-87d5-33354b077ca3","resolution":{"observed_at":"2026-08-07T15:03:16.753361Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:03:14.990407Z","title":"In Proceedings of the 1st workshop on deep learning for recommender systems","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.16752","last_updated":"2025-08-18T11:53:56Z","snapshot_observed_at":"2026-08-07T14:53:58.792049Z","submitted_at":"2025-05-22T14:58:53Z","title":"Action is All You Need: Dual-Flow Generative Ranking Network for Recommendation","version":3},"reference_index":2016,"source":"pdf_text","source_observed_at":"2026-08-07T15:03:14.990407Z"},"links":{"citing_paper":"/paper/2505.16752"},"observation_digest":"sha256:2b5bceb58e5cc406bedb127644238156d0d4a8ced3f7da2384e607379879bec5","observation_id":"421acfe0-fb65-4565-9967-4c1c1ab19945","resolution":{"observed_at":"2026-08-07T15:03:14.990407Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1708.04617","last_updated":"2017-08-15T05:17:08Z","snapshot_observed_at":"2026-08-07T06:48:21.019981Z","submitted_at":"2017-08-15T05:17:08Z","title":"Attentional Factorization Machines: Learning the Weight of Feature Interactions via Attention Networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1708.04617","snapshot_observed_at":"2026-08-07T15:03:16.540845Z","title":"arXiv preprint arXiv:1708.04617 (2017)","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2505.16752","last_updated":"2025-08-18T11:53:56Z","snapshot_observed_at":"2026-08-07T14:53:58.792049Z","submitted_at":"2025-05-22T14:58:53Z","title":"Action is All You Need: Dual-Flow Generative Ranking Network for Recommendation","version":3},"reference_index":2017,"source":"pdf_text","source_observed_at":"2026-08-07T15:03:16.540845Z"},"links":{"cited_paper":"/paper/1708.04617","citing_paper":"/paper/2505.16752"},"observation_digest":"sha256:3a1a1ada68606dac7612b49fb971f4ab6df760eedd3e08355b8b9f694581db37","observation_id":"6ebb5043-ed73-4d5e-8f8e-7afcf8def497","resolution":{"observed_at":"2026-08-07T15:03:16.540845Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:03:15.571379Z","title":"In The World Wide Web Conference","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.16752","last_updated":"2025-08-18T11:53:56Z","snapshot_observed_at":"2026-08-07T14:53:58.792049Z","submitted_at":"2025-05-22T14:58:53Z","title":"Action is All You Need: Dual-Flow Generative Ranking Network for Recommendation","version":3},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-07T15:03:15.571379Z"},"links":{"citing_paper":"/paper/2505.16752"},"observation_digest":"sha256:333a9b24af0720f545cfb3bf6464530135a7568447daf6322f58ab6e2c24528f","observation_id":"d4b089da-48f1-49c7-8fe3-afec530bc994","resolution":{"observed_at":"2026-08-07T15:03:15.571379Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2108.04468","last_updated":"2021-08-10T06:28:29Z","snapshot_observed_at":"2026-08-05T17:19:23.533620Z","submitted_at":"2021-08-10T06:28:29Z","title":"End-to-End User Behavior Retrieval in Click-Through RatePrediction Model","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2108.04468","snapshot_observed_at":"2026-08-07T15:03:15.784979Z","title":"arXiv preprint arXiv:2108.04468 (2021)","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.16752","last_updated":"2025-08-18T11:53:56Z","snapshot_observed_at":"2026-08-07T14:53:58.792049Z","submitted_at":"2025-05-22T14:58:53Z","title":"Action is All You Need: Dual-Flow Generative Ranking Network for Recommendation","version":3},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-07T15:03:15.784979Z"},"links":{"cited_paper":"/paper/2108.04468","citing_paper":"/paper/2505.16752"},"observation_digest":"sha256:09daf4ce9793002414d9b1005a00a411e3625132d0c0d0c5e85fe4c3714e4d5e","observation_id":"ec8074fb-0b01-447a-a843-fada861b856a","resolution":{"observed_at":"2026-08-07T15:03:15.784979Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2505.16752","last_updated":"2025-08-18T11:53:56Z","latest_version":3,"primary_category":"cs.IR","snapshot_observed_at":"2026-08-07T14:53:58.792049Z","submitted_at":"2025-05-22T14:58:53Z","title":"Action is All You Need: Dual-Flow Generative Ranking Network for Recommendation"},"reference_resolution":{"displayed":38,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":38,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":38},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 38 of 38 outbound references and 1 inbound Pith citation observation for arXiv:2505.16752."}