{"as_of":"2026-08-08T17:53:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:59050fb4a0044365efb80b38b4672881a62433346e0d19516f935abf5e9c77fc","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-08T06:32:00.761636+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-07T12:12:58.566244Z","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-15T21:40:21.053123Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2305.16217","last_updated":"2023-06-09T07:48:49Z","snapshot_observed_at":"2026-08-03T21:59:17.886008Z","submitted_at":"2023-05-25T16:24:11Z","title":"Beyond Reward: Offline Preference-guided Policy Optimization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.16217","snapshot_observed_at":"2026-08-07T12:12:58.566244Z","title":"Beyond reward: Offline preference-guided policy optimization","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.00388","last_updated":"2025-06-10T13:10:39Z","snapshot_observed_at":"2026-08-07T15:00:04.313363Z","submitted_at":"2025-05-31T04:37:07Z","title":"CLARIFY: Contrastive Preference Reinforcement Learning for Untangling Ambiguous Queries","version":3},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-07T12:12:58.566244Z"},"links":{"cited_paper":"/paper/2305.16217","citing_paper":"/paper/2506.00388"},"observation_digest":"sha256:7a1f5e93afc3632f9300130d8c9b1156343f572cd62cabc47b1ccee92bc59a6e","observation_id":"39893ad9-687e-45ad-949f-f43fe432dbf1","resolution":{"observed_at":"2026-08-07T12:12:58.566244Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2305.16217","last_updated":"2023-06-09T07:48:49Z","snapshot_observed_at":"2026-08-03T21:59:17.886008Z","submitted_at":"2023-05-25T16:24:11Z","title":"Beyond Reward: Offline Preference-guided Policy Optimization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.16217","snapshot_observed_at":"2026-08-06T22:18:40.007912Z","title":"it’ s unwieldy and it takes a lot of time","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.22008","last_updated":"2025-06-27T08:22:41Z","snapshot_observed_at":"2026-08-06T22:10:50.860649Z","submitted_at":"2025-06-27T08:22:41Z","title":"TROFI: Trajectory-Ranked Offline Inverse Reinforcement Learning","version":1},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-06T22:18:40.007912Z"},"links":{"cited_paper":"/paper/2305.16217","citing_paper":"/paper/2506.22008"},"observation_digest":"sha256:37102cafa04a233606b846e4ef7fae0ef5bb1ef18866d9ba82edb28d088f1d78","observation_id":"3ebf8c51-d315-40b4-bddf-d33506d93911","resolution":{"observed_at":"2026-08-06T22:18:40.007912Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2305.16217","last_updated":"2023-06-09T07:48:49Z","snapshot_observed_at":"2026-08-03T21:59:17.886008Z","submitted_at":"2023-05-25T16:24:11Z","title":"Beyond Reward: Offline Preference-guided Policy Optimization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.16217","snapshot_observed_at":"2026-08-06T20:00:53.964866Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.04072","last_updated":"2025-07-05T15:32:41Z","snapshot_observed_at":"2026-08-07T20:33:16.060921Z","submitted_at":"2025-07-05T15:32:41Z","title":"CTR-Guided Generative Query Suggestion in Conversational Search","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-06T20:00:53.964866Z"},"links":{"cited_paper":"/paper/2305.16217","citing_paper":"/paper/2507.04072"},"observation_digest":"sha256:4813b226912e61cf68e440d468224709778e19560038a45beeec62b38d0d2739","observation_id":"e2b62f56-ad88-4238-a446-7e976e98ffd3","resolution":{"observed_at":"2026-08-06T20:00:53.964866Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2305.16217","last_updated":"2023-06-09T07:48:49Z","snapshot_observed_at":"2026-08-03T21:59:17.886008Z","submitted_at":"2023-05-25T16:24:11Z","title":"Beyond Reward: Offline Preference-guided Policy Optimization","version":2},"cited_work":{"arxiv_id":"2305.16217","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2305.16217","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Beyond reward: Offline preference-guided policy optimization","venue":null,"work_id":"dd8c7272-ff72-41af-8c3a-6edce7a03735","year":2023},"citing_paper":{"arxiv_id":"2604.02349","last_updated":"2026-02-19T02:11:01Z","snapshot_observed_at":"2026-07-06T22:51:44.663367Z","submitted_at":"2026-02-19T02:11:01Z","title":"OPRIDE: Offline Preference-based Reinforcement Learning via In-Dataset Exploration","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-05-15T21:38:53.792221Z"},"links":{"cited_paper":"/paper/2305.16217","citing_paper":"/paper/2604.02349"},"observation_digest":"sha256:e54841ca69503bf39bbb0bd74c1a1454889b54d6d0dbe3215682520331d098e9","observation_id":"807c4657-a484-4c82-bf69-c6e9493dd44a","resolution":{"observed_at":"2026-05-15T21:40:21.057067Z","resolver_source":"arxiv_id","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/2305.16217/citation-record","integrity":"/paper/2305.16217/integrity","json":"/paper/2305.16217/citation-record.json","paper":"/paper/2305.16217"},"outbound":[],"paper":{"arxiv_id":"2305.16217","last_updated":"2023-06-09T07:48:49Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-03T21:59:17.886008Z","submitted_at":"2023-05-25T16:24:11Z","title":"Beyond Reward: Offline Preference-guided Policy Optimization"},"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-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 0 of 0 outbound references and 4 inbound Pith citation observations for arXiv:2305.16217."}