{"as_of":"2026-08-08T03:59:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5a2292e8a63b2e9645c0ae7957753357211a39a8eec16a1bc03218f10888f4e4","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":11,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":11,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+00:00","state":"measured"},{"denominator":11,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":11,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T13:52:20.737033Z","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-07-06T18:30:23.849880Z","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-07T13:44:57.163994Z","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:10c2b5070107afb2f252e0c96d234b7558dd9098b0ec1daae30ddc79e7f49aa6","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-07-06T18:30:23.849880Z","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-07T12:02:49.537916Z","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:9692bf288cc638f46a0e10b443a7ca02e2c54c5debc631f199ad8d8ebd605461","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-07-06T18:30:23.849880Z","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-07T05:44:16.121754Z","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:00e2a98715ea94471fb57c8eadd2c3ef330c03a13684b8f17f0ff1c583c7df82","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-07-06T18:30:23.849880Z","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-06T23:48:16.195892Z","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:7dc6e670abfb49ec37d78496077dd593ba2e7aa8c53aa8b6ade0df16f4706a3a","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-07-06T18:30:23.849880Z","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-07T00:48:44.224867Z","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:d98f03be8b76b45f730b9a47fcb72c63b9f0b2a036d3b95175f3e77d8b702bfb","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-07-06T18:30:23.849880Z","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-07T12:15:49.235126Z","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:11b92aaa0d0b1a34ab9758abe4cf6569a731a0e7180bf4b467f7b3fb5099c6e7","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-07-06T18:30:23.849880Z","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-06T19:27:53.110737Z","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:8beff2cd55eaa21f77ebb3b9fa0193d3a54bfd00cab969f3157248bb606265b3","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07-06T18:30:23.849880Z","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-06T18:59:54.024229Z","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:8bcd7c81934b75e4986eb6540acd49e25363d6a248e4a800685b450ccceb4775","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-07-06T18:30:23.849880Z","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-07-06T23:22:42.512039Z","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:30b94d2595dfceaa428687bda60424422d007d4722fb9fc4dabdaa793b714146","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07-06T18:30:23.849880Z","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-06T07:59:33.038923Z","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:c4c906d624eba24e948cec3921995d6b61fa0a24e96d56f45edfc5c13d30ccfd","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-07-06T18:30:23.849880Z","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-06T23:19:16.536876Z","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:bf38b35e0ab904d60d57fa9b5737503ed3801abd3b8a94ef9ff86f77d7dc39e0","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-07-06T18:30:23.849880Z","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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 11 inbound Pith citation observations for arXiv:2406.09215."}