{"as_of":"2026-08-09T19:12:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:338d4260815e75b8d89555de89c82348fc0a8a1133dccdb747a196eab1cca568","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":4,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":4,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T15:09:58.196771Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-06-29T08:13:14.615611Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2410.04612","last_updated":"2025-04-23T22:44:37Z","snapshot_observed_at":"2026-07-06T19:28:43.743447Z","submitted_at":"2024-10-06T20:20:22Z","title":"Regressing the Relative Future: Efficient Policy Optimization for Multi-turn RLHF","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.04612","snapshot_observed_at":"2026-08-07T15:09:58.196771Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.17147","last_updated":"2025-05-22T08:22:57Z","snapshot_observed_at":"2026-08-08T03:05:46.469319Z","submitted_at":"2025-05-22T08:22:57Z","title":"MTSA: Multi-turn Safety Alignment for LLMs through Multi-round Red-teaming","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-07T15:09:58.196771Z"},"links":{"cited_paper":"/paper/2410.04612","citing_paper":"/paper/2505.17147"},"observation_digest":"sha256:25379781afbf16c7f03524e8761986db3f2e2baeddf804b5c4ea025efc47d3e9","observation_id":"b63126bd-5d10-465d-bd30-d7d590759502","resolution":{"observed_at":"2026-08-07T15:09:58.196771Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.04612","last_updated":"2025-04-23T22:44:37Z","snapshot_observed_at":"2026-07-06T19:28:43.743447Z","submitted_at":"2024-10-06T20:20:22Z","title":"Regressing the Relative Future: Efficient Policy Optimization for Multi-turn RLHF","version":2},"cited_work":{"arxiv_id":"2410.04612","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2410.04612","snapshot_observed_at":"2026-06-29T08:13:14.615611Z","title":"Regressing the relative future: Efficient policy optimization for multi-turn rlhf","venue":null,"work_id":"1af3b079-1723-4d5b-a1d8-315c1a2c6017","year":2026},"citing_paper":{"arxiv_id":"2510.21060","last_updated":"2026-05-13T01:55:58Z","snapshot_observed_at":"2026-08-08T09:53:07.021031Z","submitted_at":"2025-10-24T00:21:38Z","title":"On the Sample Complexity of Differentially Private Policy Optimization","version":3},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-18T04:43:58.646419Z"},"links":{"cited_paper":"/paper/2410.04612","citing_paper":"/paper/2510.21060"},"observation_digest":"sha256:e79db75bfa85f6e87955b96f20636e57a161d8667f1083615f6db390db385517","observation_id":"76f0fedd-7783-4fc8-aaa5-51fb848f22ae","resolution":{"observed_at":"2026-05-18T04:45:54.936660Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.04612","last_updated":"2025-04-23T22:44:37Z","snapshot_observed_at":"2026-07-06T19:28:43.743447Z","submitted_at":"2024-10-06T20:20:22Z","title":"Regressing the Relative Future: Efficient Policy Optimization for Multi-turn RLHF","version":2},"cited_work":{"arxiv_id":"2410.04612","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2410.04612","snapshot_observed_at":"2026-06-29T08:13:14.615611Z","title":"Regressing the relative future: Efficient policy optimization for multi-turn rlhf","venue":null,"work_id":"1af3b079-1723-4d5b-a1d8-315c1a2c6017","year":2026},"citing_paper":{"arxiv_id":"2605.09808","last_updated":"2026-05-10T23:06:24Z","snapshot_observed_at":"2026-08-02T12:27:41.948284Z","submitted_at":"2026-05-10T23:06:24Z","title":"Quantifying the Utility of User Simulators for Building Collaborative LLM Assistants","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-12T02:28:13.317630Z"},"links":{"cited_paper":"/paper/2410.04612","citing_paper":"/paper/2605.09808"},"observation_digest":"sha256:40cfacba4872ff514942fcfedfe2d93a6bb7a2f310b14acd20b3edd6fa290243","observation_id":"8864a2f2-71ab-4c9a-9dbd-87ea82d685ef","resolution":{"observed_at":"2026-05-12T07:36:46.620434Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.04612","last_updated":"2025-04-23T22:44:37Z","snapshot_observed_at":"2026-07-06T19:28:43.743447Z","submitted_at":"2024-10-06T20:20:22Z","title":"Regressing the Relative Future: Efficient Policy Optimization for Multi-turn RLHF","version":2},"cited_work":{"arxiv_id":"2410.04612","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2410.04612","snapshot_observed_at":"2026-06-29T08:13:14.615611Z","title":"Regressing the relative future: Efficient policy optimization for multi-turn rlhf","venue":null,"work_id":"1af3b079-1723-4d5b-a1d8-315c1a2c6017","year":2026},"citing_paper":{"arxiv_id":"2605.29256","last_updated":"2026-05-28T02:20:11Z","snapshot_observed_at":"2026-07-06T23:38:41.516603Z","submitted_at":"2026-05-28T02:20:11Z","title":"DynSess: Dynamic Session-Level Evaluation and Optimization Framework for Role-Playing Agents","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-06-29T08:13:05.451827Z"},"links":{"cited_paper":"/paper/2410.04612","citing_paper":"/paper/2605.29256"},"observation_digest":"sha256:e36158d009ae8665ad964c33bf542d98f06fff92a89c6ba863a90c1b6c0fddc2","observation_id":"c6b35ba7-db79-4f0e-a04e-943b0c1c038d","resolution":{"observed_at":"2026-06-29T08:13:14.617193Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2410.04612/citation-record","integrity":"/paper/2410.04612/integrity","json":"/paper/2410.04612/citation-record.json","paper":"/paper/2410.04612"},"outbound":[],"paper":{"arxiv_id":"2410.04612","last_updated":"2025-04-23T22:44:37Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T19:28:43.743447Z","submitted_at":"2024-10-06T20:20:22Z","title":"Regressing the Relative Future: Efficient Policy Optimization for Multi-turn RLHF"},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 4 inbound Pith citation observations for arXiv:2410.04612."}