{"as_of":"2026-08-10T20:32:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c96335ea401933aaaaecaf81153b5a6fea8e2da668521eaa0c10b28efaf30129","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":5,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":5,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":5,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":5,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-09T14:52:27.233425Z","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-09T05:50:27.096272Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2402.17257","last_updated":"2024-10-28T12:26:53Z","snapshot_observed_at":"2026-08-08T16:10:23.543354Z","submitted_at":"2024-02-27T07:03:25Z","title":"RIME: Robust Preference-based Reinforcement Learning with Noisy Preferences","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.17257","snapshot_observed_at":"2026-08-09T14:52:27.233425Z","title":"Rime: Robust preference-based reinforcement learning with noisy preferences","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.01616","last_updated":"2025-02-03T18:50:15Z","snapshot_observed_at":"2026-08-10T11:21:50.562010Z","submitted_at":"2025-02-03T18:50:15Z","title":"Preference VLM: Leveraging VLMs for Scalable Preference-Based Reinforcement Learning","version":1},"reference_index":1952,"source":"pdf_text","source_observed_at":"2026-08-09T14:52:27.233425Z"},"links":{"cited_paper":"/paper/2402.17257","citing_paper":"/paper/2502.01616"},"observation_digest":"sha256:6534d47d61ae4e7d5c9f4e72a0ff3913eedc3d5e0eff293aa2889afb4d62c9b2","observation_id":"1a9940bf-a6dd-433e-b83f-9670b9018ae3","resolution":{"observed_at":"2026-08-09T14:52:27.233425Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.17257","last_updated":"2024-10-28T12:26:53Z","snapshot_observed_at":"2026-08-08T16:10:23.543354Z","submitted_at":"2024-02-27T07:03:25Z","title":"RIME: Robust Preference-based Reinforcement Learning with Noisy Preferences","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.17257","snapshot_observed_at":"2026-08-07T12:12:57.502734Z","title":"Rime: Robust preference-based reinforcement learning with noisy preferences","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.00388","last_updated":"2025-06-10T13:10:39Z","snapshot_observed_at":"2026-08-09T05:52:49.452533Z","submitted_at":"2025-05-31T04:37:07Z","title":"CLARIFY: Contrastive Preference Reinforcement Learning for Untangling Ambiguous Queries","version":3},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-07T12:12:57.502734Z"},"links":{"cited_paper":"/paper/2402.17257","citing_paper":"/paper/2506.00388"},"observation_digest":"sha256:b50785a193f73455d3d7b5f5903cbb4457c88c98173f4a581ce1084d75016de7","observation_id":"d7ec4a76-b6b0-47f6-ae4f-ccec4cdd5be6","resolution":{"observed_at":"2026-08-07T12:12:57.502734Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.17257","last_updated":"2024-10-28T12:26:53Z","snapshot_observed_at":"2026-08-08T16:10:23.543354Z","submitted_at":"2024-02-27T07:03:25Z","title":"RIME: Robust Preference-based Reinforcement Learning with Noisy Preferences","version":4},"cited_work":{"arxiv_id":"2402.17257","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2402.17257","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2402.17257 , year=","venue":null,"work_id":"e3f0b368-afb1-4dda-9f17-01743a92362e","year":null},"citing_paper":{"arxiv_id":"2605.02495","last_updated":"2026-05-25T07:21:41Z","snapshot_observed_at":"2026-07-06T23:15:32.349713Z","submitted_at":"2026-05-04T11:45:38Z","title":"Efficient Preference Poisoning Attack on Offline RLHF","version":1},"reference_index":74,"source":"arxiv_source","source_observed_at":"2026-05-08T19:29:25.000361Z"},"links":{"cited_paper":"/paper/2402.17257","citing_paper":"/paper/2605.02495"},"observation_digest":"sha256:94c08bfa4ac98aa1459b0cf8e68b92ceee0025f67ace0a866c953b95ff6a0a6b","observation_id":"472eb190-1a61-43b5-b310-65446938b326","resolution":{"observed_at":"2026-05-09T05:50:27.097641Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.17257","last_updated":"2024-10-28T12:26:53Z","snapshot_observed_at":"2026-08-08T16:10:23.543354Z","submitted_at":"2024-02-27T07:03:25Z","title":"RIME: Robust Preference-based Reinforcement Learning with Noisy Preferences","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.17257","snapshot_observed_at":"2026-07-12T07:49:57.204875Z","title":"arXiv preprint arXiv:2402.17257 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.02672","last_updated":"2026-07-17T16:36:37Z","snapshot_observed_at":"2026-08-03T12:51:35.947898Z","submitted_at":"2026-07-02T18:08:50Z","title":"Internal Pluralism and the Limits of Pairwise Comparisons","version":1},"reference_index":174,"source":"arxiv_source","source_observed_at":"2026-07-12T07:49:57.204875Z"},"links":{"cited_paper":"/paper/2402.17257","citing_paper":"/paper/2607.02672"},"observation_digest":"sha256:38f2d33c826fee4b6af17ede936b347fa37c99c03312a1ffc5cf4e3dde280d5c","observation_id":"29e85e52-b7e4-4951-b3ea-3992fe8e8c90","resolution":{"observed_at":"2026-07-12T07:49:57.204875Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.17257","last_updated":"2024-10-28T12:26:53Z","snapshot_observed_at":"2026-08-08T16:10:23.543354Z","submitted_at":"2024-02-27T07:03:25Z","title":"RIME: Robust Preference-based Reinforcement Learning with Noisy Preferences","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.17257","snapshot_observed_at":"2026-08-02T09:03:15.440243Z","title":"arXiv preprint arXiv:2402.17257 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.02672","last_updated":"2026-07-17T16:36:37Z","snapshot_observed_at":"2026-08-03T12:51:35.947898Z","submitted_at":"2026-07-02T18:08:50Z","title":"Internal Pluralism and the Limits of Pairwise Comparisons","version":2},"reference_index":271,"source":"arxiv_source","source_observed_at":"2026-08-02T09:03:15.440243Z"},"links":{"cited_paper":"/paper/2402.17257","citing_paper":"/paper/2607.02672"},"observation_digest":"sha256:764e7f6cddf6b72491dff99d46da0009ca8b0cde50041f26d4b87fda2fdaf1c9","observation_id":"c3e2db5d-f8da-4a84-a301-6e65b215a348","resolution":{"observed_at":"2026-08-02T09:03:15.440243Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2402.17257/citation-record","integrity":"/paper/2402.17257/integrity","json":"/paper/2402.17257/citation-record.json","paper":"/paper/2402.17257"},"outbound":[],"paper":{"arxiv_id":"2402.17257","last_updated":"2024-10-28T12:26:53Z","latest_version":4,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-08T16:10:23.543354Z","submitted_at":"2024-02-27T07:03:25Z","title":"RIME: Robust Preference-based Reinforcement Learning with Noisy Preferences"},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 5 inbound Pith citation observations for arXiv:2402.17257."}