{"as_of":"2026-08-17T17:22:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:141534e712ca57217c9bc17982155463ee434c9e53dd774f00074e03a074aa85","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":18,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":18,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-17T06:30:58.91139+00:00","state":"measured"},{"denominator":18,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":18,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T11:27:36.791252Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-19T06:12:07.183224Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2406.09215","last_updated":"2024-11-07T18:30:53Z","snapshot_observed_at":"2026-08-16T13:43:17.896821Z","submitted_at":"2024-06-13T15:16:11Z","title":"On Softmax Direct Preference Optimization for Recommendation","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.09215","snapshot_observed_at":"2026-08-10T22:58:38.524165Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.00244","last_updated":"2024-12-31T03:20:22Z","snapshot_observed_at":"2026-08-16T12:40:34.942207Z","submitted_at":"2024-12-31T03:20:22Z","title":"Have We Designed Generalizable Structural Knowledge Promptings? Systematic Evaluation and Rethinking","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-10T22:58:38.524165Z"},"links":{"cited_paper":"/paper/2406.09215","citing_paper":"/paper/2501.00244"},"observation_digest":"sha256:0fb8ad404a6b65ed02434a9870bd797fb8bfba38f38656b9d1707731227403ed","observation_id":"54a4fae7-86a3-4061-b5c8-7a4506657d87","resolution":{"observed_at":"2026-08-10T22:58:38.524165Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.09215","last_updated":"2024-11-07T18:30:53Z","snapshot_observed_at":"2026-08-16T13:43:17.896821Z","submitted_at":"2024-06-13T15:16:11Z","title":"On Softmax Direct Preference Optimization for Recommendation","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.09215","snapshot_observed_at":"2026-08-10T19:06:25.032843Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.13943","last_updated":"2025-01-18T03:35:44Z","snapshot_observed_at":"2026-08-13T19:11:15.653862Z","submitted_at":"2025-01-18T03:35:44Z","title":"Language Representation Favored Zero-Shot Cross-Domain Cognitive Diagnosis","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-10T19:06:25.032843Z"},"links":{"cited_paper":"/paper/2406.09215","citing_paper":"/paper/2501.13943"},"observation_digest":"sha256:fffbcd12619d93a592c92f505014c4e6f7690377c7353948ea1f3f83c9cb1331","observation_id":"3caf8c4f-9b2e-4398-a553-7db4283ccac9","resolution":{"observed_at":"2026-08-10T19:06:25.032843Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.09215","last_updated":"2024-11-07T18:30:53Z","snapshot_observed_at":"2026-08-16T13:43:17.896821Z","submitted_at":"2024-06-13T15:16:11Z","title":"On Softmax Direct Preference Optimization for Recommendation","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.09215","snapshot_observed_at":"2026-08-09T13:33:57.544882Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.02061","last_updated":"2026-07-28T04:34:05Z","snapshot_observed_at":"2026-08-17T12:00:35.498109Z","submitted_at":"2025-02-04T07:17:54Z","title":"Reason4Rec: Deliberative User Preference Alignment of Large Language Models for Recommendation","version":3},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-09T13:33:57.544882Z"},"links":{"cited_paper":"/paper/2406.09215","citing_paper":"/paper/2502.02061"},"observation_digest":"sha256:7b6df96374506520dd59ab23276b08313a1221afc71835a7bec5abeee6f7d03e","observation_id":"4d18f5ef-be66-44c5-ae50-cd093331c008","resolution":{"observed_at":"2026-08-09T13:33:57.544882Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.09215","last_updated":"2024-11-07T18:30:53Z","snapshot_observed_at":"2026-08-16T13:43:17.896821Z","submitted_at":"2024-06-13T15:16:11Z","title":"On Softmax Direct Preference Optimization for Recommendation","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.09215","snapshot_observed_at":"2026-08-16T11:27:36.791252Z","title":"On softmax direct preference optimization for recommendation","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2504.15619","last_updated":"2025-04-22T06:19:38Z","snapshot_observed_at":"2026-08-16T11:35:04.116801Z","submitted_at":"2025-04-22T06:19:38Z","title":"AdaViP: Aligning Multi-modal LLMs via Adaptive Vision-enhanced Preference Optimization","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-16T11:27:36.791252Z"},"links":{"cited_paper":"/paper/2406.09215","citing_paper":"/paper/2504.15619"},"observation_digest":"sha256:a232a3c757c384c92010778b7e44792be5d9d1d2c673b1018e3d68d4fe207162","observation_id":"d81c4bbe-ef1f-4e95-a20b-9f4be29fe3b7","resolution":{"observed_at":"2026-08-16T11:27:36.791252Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.09215","last_updated":"2024-11-07T18:30:53Z","snapshot_observed_at":"2026-08-16T13:43:17.896821Z","submitted_at":"2024-06-13T15:16:11Z","title":"On Softmax Direct Preference Optimization for Recommendation","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.09215","snapshot_observed_at":"2026-08-16T10:22:00.750600Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2504.18383","last_updated":"2025-04-25T14:30:25Z","snapshot_observed_at":"2026-08-17T00:03:15.338768Z","submitted_at":"2025-04-25T14:30:25Z","title":"Bridge the Domains: Large Language Models Enhanced Cross-domain Sequential Recommendation","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-16T10:22:00.750600Z"},"links":{"cited_paper":"/paper/2406.09215","citing_paper":"/paper/2504.18383"},"observation_digest":"sha256:9692de64cf255d639afdb799ebf1a03cafedd356886e54076051ab5ec476f742","observation_id":"94fddb47-855c-4353-9a27-da86c50881f3","resolution":{"observed_at":"2026-08-16T10:22:00.750600Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.09215","last_updated":"2024-11-07T18:30:53Z","snapshot_observed_at":"2026-08-16T13:43:17.896821Z","submitted_at":"2024-06-13T15:16:11Z","title":"On Softmax Direct Preference Optimization for Recommendation","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.09215","snapshot_observed_at":"2026-08-07T13:52:20.737033Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.20771","last_updated":"2025-05-27T06:22:50Z","snapshot_observed_at":"2026-08-16T10:08:09.592937Z","submitted_at":"2025-05-27T06:22:50Z","title":"Bridging the Gap: Self-Optimized Fine-Tuning for LLM-based Recommender Systems","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-07T13:52:20.737033Z"},"links":{"cited_paper":"/paper/2406.09215","citing_paper":"/paper/2505.20771"},"observation_digest":"sha256:8b55aaab42b4f39402e7b5c2e3ba8fe5cf967d3ce20a93a7f52b8293d9871e5a","observation_id":"7dd27941-252e-4501-b937-392cfaf8d324","resolution":{"observed_at":"2026-08-07T13:52:20.737033Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.09215","last_updated":"2024-11-07T18:30:53Z","snapshot_observed_at":"2026-08-16T13:43:17.896821Z","submitted_at":"2024-06-13T15:16:11Z","title":"On Softmax Direct Preference Optimization for Recommendation","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.09215","snapshot_observed_at":"2026-08-07T12:12:57.548054Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.00441","last_updated":"2025-05-31T07:46:42Z","snapshot_observed_at":"2026-08-16T04:58:46.353404Z","submitted_at":"2025-05-31T07:46:42Z","title":"K-order Ranking Preference Optimization for Large Language Models","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-07T12:12:57.548054Z"},"links":{"cited_paper":"/paper/2406.09215","citing_paper":"/paper/2506.00441"},"observation_digest":"sha256:29793566621345a81b96fab5d3208835253b00d9b7ac8b5ac1f8f37e2b99e41b","observation_id":"6a056e33-371f-4d29-be1d-44dd0b141a0a","resolution":{"observed_at":"2026-08-07T12:12:57.548054Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.09215","last_updated":"2024-11-07T18:30:53Z","snapshot_observed_at":"2026-08-16T13:43:17.896821Z","submitted_at":"2024-06-13T15:16:11Z","title":"On Softmax Direct Preference Optimization for Recommendation","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.09215","snapshot_observed_at":"2026-08-07T05:52:06.324152Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.06913","last_updated":"2025-06-07T20:24:05Z","snapshot_observed_at":"2026-08-14T21:57:34.861448Z","submitted_at":"2025-06-07T20:24:05Z","title":"OneSug: The Unified End-to-End Generative Framework for E-commerce Query Suggestion","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T05:52:06.324152Z"},"links":{"cited_paper":"/paper/2406.09215","citing_paper":"/paper/2506.06913"},"observation_digest":"sha256:ec44fb3087e913dd27604a3eb469cd49b93a2907fd93aa895e3d1bca493e70d8","observation_id":"ddf04fbe-c9bd-4099-bdcf-30c220db718f","resolution":{"observed_at":"2026-08-07T05:52:06.324152Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.09215","last_updated":"2024-11-07T18:30:53Z","snapshot_observed_at":"2026-08-16T13:43:17.896821Z","submitted_at":"2024-06-13T15:16:11Z","title":"On Softmax Direct Preference Optimization for Recommendation","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.09215","snapshot_observed_at":"2026-08-06T23:53:55.075833Z","title":"On softmax direct preference optimization for recommendation","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.15833","last_updated":"2025-06-18T19:18:49Z","snapshot_observed_at":"2026-08-17T03:10:03.379574Z","submitted_at":"2025-06-18T19:18:49Z","title":"Architecture is All You Need: Improving LLM Recommenders by Dropping the Text","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-06T23:53:55.075833Z"},"links":{"cited_paper":"/paper/2406.09215","citing_paper":"/paper/2506.15833"},"observation_digest":"sha256:e40b89d7536d5826dab96ec192bdc55e7c5ad6eb4076f5412d084a8f80727767","observation_id":"27f72de6-d020-4950-adcf-811ecb1f854f","resolution":{"observed_at":"2026-08-06T23:53:55.075833Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.09215","last_updated":"2024-11-07T18:30:53Z","snapshot_observed_at":"2026-08-16T13:43:17.896821Z","submitted_at":"2024-06-13T15:16:11Z","title":"On Softmax Direct Preference Optimization for Recommendation","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.09215","snapshot_observed_at":"2026-08-07T01:00:02.848067Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.17281","last_updated":"2025-06-14T08:20:15Z","snapshot_observed_at":"2026-08-16T06:44:36.042139Z","submitted_at":"2025-06-14T08:20:15Z","title":"CORONA: A Coarse-to-Fine Framework for Graph-based Recommendation with Large Language Models","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T01:00:02.848067Z"},"links":{"cited_paper":"/paper/2406.09215","citing_paper":"/paper/2506.17281"},"observation_digest":"sha256:15826c811acffaac94a4c3ef97a87ca8011e66f9da521fbbbe2dfc7c0530551b","observation_id":"60ff1f0c-ca0b-4374-98c0-617cd29ac5eb","resolution":{"observed_at":"2026-08-07T01:00:02.848067Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.09215","last_updated":"2024-11-07T18:30:53Z","snapshot_observed_at":"2026-08-16T13:43:17.896821Z","submitted_at":"2024-06-13T15:16:11Z","title":"On Softmax Direct Preference Optimization for Recommendation","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.09215","snapshot_observed_at":"2026-08-15T20:05:22.625006Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.21579","last_updated":"2025-06-16T13:27:06Z","snapshot_observed_at":"2026-08-17T11:11:36.144227Z","submitted_at":"2025-06-16T13:27:06Z","title":"LLM2Rec: Large Language Models Are Powerful Embedding Models for Sequential Recommendation","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-15T20:05:22.625006Z"},"links":{"cited_paper":"/paper/2406.09215","citing_paper":"/paper/2506.21579"},"observation_digest":"sha256:0ae3af04fdbec3886b5ae6bd7365dbe8aa42a9ca1fcaa6a3a9ab5b3e13ce389d","observation_id":"e2f393d3-b271-434d-bc19-19447d0239a6","resolution":{"observed_at":"2026-08-15T20:05:22.625006Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.09215","last_updated":"2024-11-07T18:30:53Z","snapshot_observed_at":"2026-08-16T13:43:17.896821Z","submitted_at":"2024-06-13T15:16:11Z","title":"On Softmax Direct Preference Optimization for Recommendation","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.09215","snapshot_observed_at":"2026-08-06T20:41:39.479977Z","title":"On softmax direct preference optimization for recommen- dation,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.02255","last_updated":"2025-07-03T03:08:23Z","snapshot_observed_at":"2026-08-15T09:06:18.092733Z","submitted_at":"2025-07-03T03:08:23Z","title":"Listwise Preference Alignment Optimization for Tail Item Recommendation","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-06T20:41:39.479977Z"},"links":{"cited_paper":"/paper/2406.09215","citing_paper":"/paper/2507.02255"},"observation_digest":"sha256:3c88aa6923170d869b71f18e2d79f334130dd0a7d12fa35ab5fe215c2aa16a8e","observation_id":"fad1daed-fa3a-4b89-9834-89612dc169fb","resolution":{"observed_at":"2026-08-06T20:41:39.479977Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.09215","last_updated":"2024-11-07T18:30:53Z","snapshot_observed_at":"2026-08-16T13:43:17.896821Z","submitted_at":"2024-06-13T15:16:11Z","title":"On Softmax Direct Preference Optimization for Recommendation","version":3},"cited_work":{"arxiv_id":"2406.09215","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2406.09215","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"On softmax direct preference optimization for recommendation","venue":null,"work_id":"561a169f-1d90-4d89-9586-fe679a7ba945","year":2024},"citing_paper":{"arxiv_id":"2507.05179","last_updated":"2026-05-31T04:19:46Z","snapshot_observed_at":"2026-08-17T07:43:51.853231Z","submitted_at":"2025-07-07T16:34:28Z","title":"From Fragments to Facts: A Curriculum-Driven DPO Approach for Generating Hindi News Veracity Explanations","version":5},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-05-19T06:09:26.269452Z"},"links":{"cited_paper":"/paper/2406.09215","citing_paper":"/paper/2507.05179"},"observation_digest":"sha256:d0d70ad2adf4a652e26dd45575e677233c095122f548663f8c09c7d01d574bbc","observation_id":"24526583-bcc9-4d3f-862a-9cecab13d95f","resolution":{"observed_at":"2026-05-19T06:12:07.185925Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.09215","last_updated":"2024-11-07T18:30:53Z","snapshot_observed_at":"2026-08-16T13:43:17.896821Z","submitted_at":"2024-06-13T15:16:11Z","title":"On Softmax Direct Preference Optimization for Recommendation","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.09215","snapshot_observed_at":"2026-08-06T19:06:00.797289Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.06507","last_updated":"2025-07-14T07:46:11Z","snapshot_observed_at":"2026-08-14T10:34:25.109370Z","submitted_at":"2025-07-09T03:13:08Z","title":"GR-LLMs: Recent Advances in Generative Recommendation Based on Large Language Models","version":2},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-06T19:06:00.797289Z"},"links":{"cited_paper":"/paper/2406.09215","citing_paper":"/paper/2507.06507"},"observation_digest":"sha256:b1646f818063bba37ab2283e8c1440b01fcb6217c19de0002051df4206a3b41c","observation_id":"2704fad7-c4c6-4742-a6ed-fccbf8d77064","resolution":{"observed_at":"2026-08-06T19:06:00.797289Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.09215","last_updated":"2024-11-07T18:30:53Z","snapshot_observed_at":"2026-08-16T13:43:17.896821Z","submitted_at":"2024-06-13T15:16:11Z","title":"On Softmax Direct Preference Optimization for Recommendation","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.09215","snapshot_observed_at":"2026-08-15T16:07:31.269548Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.10245","last_updated":"2025-09-12T13:43:16Z","snapshot_observed_at":"2026-08-16T07:43:04.086432Z","submitted_at":"2025-09-12T13:43:16Z","title":"Model-agnostic post-hoc explainability for recommender systems","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-15T16:07:31.269548Z"},"links":{"cited_paper":"/paper/2406.09215","citing_paper":"/paper/2509.10245"},"observation_digest":"sha256:0e99b7f5c301e23f17ac91826019415bb4689cbceea08c624b93e906ef0ae653","observation_id":"8185fc33-9f35-4393-ab53-a497484015fe","resolution":{"observed_at":"2026-08-15T16:07:31.269548Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.09215","last_updated":"2024-11-07T18:30:53Z","snapshot_observed_at":"2026-08-16T13:43:17.896821Z","submitted_at":"2024-06-13T15:16:11Z","title":"On Softmax Direct Preference Optimization for Recommendation","version":3},"cited_work":{"arxiv_id":"2406.09215","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2406.09215","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"On softmax direct preference optimization for recommendation","venue":null,"work_id":"561a169f-1d90-4d89-9586-fe679a7ba945","year":2024},"citing_paper":{"arxiv_id":"2605.10784","last_updated":"2026-05-11T16:18:08Z","snapshot_observed_at":"2026-08-13T05:08:32.306279Z","submitted_at":"2026-05-11T16:18:08Z","title":"MASS-DPO: Multi-negative Active Sample Selection for Direct Policy Optimization","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-12T04:14:37.374346Z"},"links":{"cited_paper":"/paper/2406.09215","citing_paper":"/paper/2605.10784"},"observation_digest":"sha256:f34b9b9d77d446162dc41244db97b5208046e3621af5ab3902dae82d48b32877","observation_id":"80673dda-7453-4243-88fc-e6f7a97f22c4","resolution":{"observed_at":"2026-05-12T06:31:24.667019Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.09215","last_updated":"2024-11-07T18:30:53Z","snapshot_observed_at":"2026-08-16T13:43:17.896821Z","submitted_at":"2024-06-13T15:16:11Z","title":"On Softmax Direct Preference Optimization for Recommendation","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.09215","snapshot_observed_at":"2026-07-11T20:29:43.700229Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.04270","last_updated":"2026-07-05T12:31:11Z","snapshot_observed_at":"2026-08-13T16:42:47.307712Z","submitted_at":"2026-07-05T12:31:11Z","title":"LBR: Towards Mitigating Length Bias in Large Language Models for Recommendation","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-07-11T20:29:43.700229Z"},"links":{"cited_paper":"/paper/2406.09215","citing_paper":"/paper/2607.04270"},"observation_digest":"sha256:1fcfc0ebf0a21fe6497d50eab962232363e9cd1ce4c729cd80e83a0b7b801618","observation_id":"93f58120-0ddf-4593-b5ef-8a10bf9d1858","resolution":{"observed_at":"2026-07-11T20:29:43.700229Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.09215","last_updated":"2024-11-07T18:30:53Z","snapshot_observed_at":"2026-08-16T13:43:17.896821Z","submitted_at":"2024-06-13T15:16:11Z","title":"On Softmax Direct Preference Optimization for Recommendation","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.09215","snapshot_observed_at":"2026-08-05T00:28:19.449017Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.00750","last_updated":"2026-08-01T16:33:15Z","snapshot_observed_at":"2026-08-16T04:29:46.345202Z","submitted_at":"2026-08-01T16:33:15Z","title":"Hierarchical Residual Policy Optimization for Generative Recommendations","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-05T00:28:19.449017Z"},"links":{"cited_paper":"/paper/2406.09215","citing_paper":"/paper/2608.00750"},"observation_digest":"sha256:6c3a9fe28f487b992ae4d6ce5064ce636833df05c4a983b78686724ab1879577","observation_id":"a11a2abc-46f6-4e0e-93aa-17f9b87f18dc","resolution":{"observed_at":"2026-08-05T00:28:19.449017Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2406.09215/citation-record","integrity":"/paper/2406.09215/integrity","json":"/paper/2406.09215/citation-record.json","paper":"/paper/2406.09215"},"outbound":[],"paper":{"arxiv_id":"2406.09215","last_updated":"2024-11-07T18:30:53Z","latest_version":3,"primary_category":"cs.IR","snapshot_observed_at":"2026-08-16T13:43:17.896821Z","submitted_at":"2024-06-13T15:16:11Z","title":"On Softmax Direct Preference Optimization for Recommendation"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 18 inbound Pith citation observations for arXiv:2406.09215."}