{"as_of":"2026-08-08T06:12:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f88ee4ff1d3cd3bffe0408caad9dbaf45e21c2b7bec5761871be6bff07ee60dd","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":7,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":7,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+00:00","state":"measured"},{"denominator":7,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":7,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T13:45:00.273913Z","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-07-03T12:18:06.214750Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2301.01392","last_updated":"2023-01-03T23:52:16Z","snapshot_observed_at":"2026-07-06T14:37:16.907677Z","submitted_at":"2023-01-03T23:52:16Z","title":"Benchmarks and Algorithms for Offline Preference-Based Reward Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2301.01392","snapshot_observed_at":"2026-08-07T13:45:00.273913Z","title":"D., and Brown, D","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.21395","last_updated":"2025-05-27T16:23:24Z","snapshot_observed_at":"2026-08-07T13:26:21.678395Z","submitted_at":"2025-05-27T16:23:24Z","title":"Square$\\chi$PO: Differentially Private and Robust $\\chi^2$-Preference Optimization in Offline Direct Alignment","version":1},"reference_index":66,"source":"arxiv_source","source_observed_at":"2026-08-07T13:45:00.273913Z"},"links":{"cited_paper":"/paper/2301.01392","citing_paper":"/paper/2505.21395"},"observation_digest":"sha256:b627ad7118b2ffcf0e8271571e2096de9490a09c1520092d507d85a336c36f94","observation_id":"876b151e-b9d3-4fb6-92b3-4596e38486f6","resolution":{"observed_at":"2026-08-07T13:45:00.273913Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2301.01392","last_updated":"2023-01-03T23:52:16Z","snapshot_observed_at":"2026-07-06T14:37:16.907677Z","submitted_at":"2023-01-03T23:52:16Z","title":"Benchmarks and Algorithms for Offline Preference-Based Reward Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2301.01392","snapshot_observed_at":"2026-08-07T12:13:00.672841Z","title":"D., and Brown, D","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":36,"source":"arxiv_source","source_observed_at":"2026-08-07T12:13:00.672841Z"},"links":{"cited_paper":"/paper/2301.01392","citing_paper":"/paper/2506.00388"},"observation_digest":"sha256:308ec1e7400a75d9453a1c317f22febfa58f6095dd98327eadfb1f547e6af482","observation_id":"3931ac7b-a868-4eec-9af1-bf714c641b6c","resolution":{"observed_at":"2026-08-07T12:13:00.672841Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2301.01392","last_updated":"2023-01-03T23:52:16Z","snapshot_observed_at":"2026-07-06T14:37:16.907677Z","submitted_at":"2023-01-03T23:52:16Z","title":"Benchmarks and Algorithms for Offline Preference-Based Reward Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2301.01392","snapshot_observed_at":"2026-08-06T21:17:39.261586Z","title":"Benchmarks and algorithms for offline preference- based reward learning,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.00611","last_updated":"2025-07-01T09:43:57Z","snapshot_observed_at":"2026-08-06T21:08:39.566215Z","submitted_at":"2025-07-01T09:43:57Z","title":"Residual Reward Models for Preference-based Reinforcement Learning","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-06T21:17:39.261586Z"},"links":{"cited_paper":"/paper/2301.01392","citing_paper":"/paper/2507.00611"},"observation_digest":"sha256:b6b4a6aabd4bae821610557657c1b8f8b98265d16fe9d2cfcfe343ce6e1ef8d2","observation_id":"ffb01e19-fb44-4a5f-a819-c5e26406ef07","resolution":{"observed_at":"2026-08-06T21:17:39.261586Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2301.01392","last_updated":"2023-01-03T23:52:16Z","snapshot_observed_at":"2026-07-06T14:37:16.907677Z","submitted_at":"2023-01-03T23:52:16Z","title":"Benchmarks and Algorithms for Offline Preference-Based Reward Learning","version":1},"cited_work":{"arxiv_id":"2301.01392","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2301.01392","snapshot_observed_at":"2026-07-03T12:18:06.214750Z","title":"D., and Brown, D","venue":null,"work_id":"351e391d-79ed-423c-bb9a-568ef7345a38","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":44,"source":"arxiv_source","source_observed_at":"2026-05-15T21:38:53.792221Z"},"links":{"cited_paper":"/paper/2301.01392","citing_paper":"/paper/2604.02349"},"observation_digest":"sha256:3bae6cb910acc4af82ac8bd5b5d24f6e062b06758c58af5e1e555a25858efbf1","observation_id":"1454ab01-6b28-4d9b-b892-9307e16442ce","resolution":{"observed_at":"2026-05-15T21:40:21.002736Z","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":"2301.01392","last_updated":"2023-01-03T23:52:16Z","snapshot_observed_at":"2026-07-06T14:37:16.907677Z","submitted_at":"2023-01-03T23:52:16Z","title":"Benchmarks and Algorithms for Offline Preference-Based Reward Learning","version":1},"cited_work":{"arxiv_id":"2301.01392","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2301.01392","snapshot_observed_at":"2026-07-03T12:18:06.214750Z","title":"D., and Brown, D","venue":null,"work_id":"351e391d-79ed-423c-bb9a-568ef7345a38","year":2023},"citing_paper":{"arxiv_id":"2607.01925","last_updated":"2026-07-02T09:21:17Z","snapshot_observed_at":"2026-08-07T11:55:07.376854Z","submitted_at":"2026-07-02T09:21:17Z","title":"SPLC: Social Preference Learning for Crowd Robot Navigation","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-07-03T12:10:03.492401Z"},"links":{"cited_paper":"/paper/2301.01392","citing_paper":"/paper/2607.01925"},"observation_digest":"sha256:4af52e8561ec0e6dc87c787afbf2eadddaf31efa0491b64fefae8c076860ece7","observation_id":"62244405-13a5-4f60-aefa-2ef2d81d2be4","resolution":{"observed_at":"2026-07-03T12:18:06.216403Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"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":"2301.01392","last_updated":"2023-01-03T23:52:16Z","snapshot_observed_at":"2026-07-06T14:37:16.907677Z","submitted_at":"2023-01-03T23:52:16Z","title":"Benchmarks and Algorithms for Offline Preference-Based Reward Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2301.01392","snapshot_observed_at":"2026-07-11T13:53:36.775836Z","title":"arXiv preprint arXiv:2301.01392 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.04763","last_updated":"2026-07-26T14:17:18Z","snapshot_observed_at":"2026-08-02T10:24:43.977557Z","submitted_at":"2026-07-06T07:56:53Z","title":"Multi-Turn On-Policy Distillation with Prefix Replay","version":1},"reference_index":281,"source":"arxiv_source","source_observed_at":"2026-07-11T13:53:36.775836Z"},"links":{"cited_paper":"/paper/2301.01392","citing_paper":"/paper/2607.04763"},"observation_digest":"sha256:4bb0ed262fb1381598b093032b030447c3a8a0b14772eb877f78e59ef3c807a3","observation_id":"83171e37-a26e-4543-b3c8-9e6034f87ddb","resolution":{"observed_at":"2026-07-11T13:53:36.775836Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2301.01392","last_updated":"2023-01-03T23:52:16Z","snapshot_observed_at":"2026-07-06T14:37:16.907677Z","submitted_at":"2023-01-03T23:52:16Z","title":"Benchmarks and Algorithms for Offline Preference-Based Reward Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2301.01392","snapshot_observed_at":"2026-08-02T08:41:05.320411Z","title":"arXiv preprint arXiv:2301.01392 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.04763","last_updated":"2026-07-26T14:17:18Z","snapshot_observed_at":"2026-08-02T10:24:43.977557Z","submitted_at":"2026-07-06T07:56:53Z","title":"Multi-Turn On-Policy Distillation with Prefix Replay","version":3},"reference_index":282,"source":"arxiv_source","source_observed_at":"2026-08-02T08:41:05.320411Z"},"links":{"cited_paper":"/paper/2301.01392","citing_paper":"/paper/2607.04763"},"observation_digest":"sha256:a230669e4cae7d131dc507464c6a480dcc17e41bf6dce82334c56b65270bef5f","observation_id":"3bfe8de6-3dbf-4c42-b71c-7908cd313927","resolution":{"observed_at":"2026-08-02T08:41:05.320411Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2301.01392/citation-record","integrity":"/paper/2301.01392/integrity","json":"/paper/2301.01392/citation-record.json","paper":"/paper/2301.01392"},"outbound":[],"paper":{"arxiv_id":"2301.01392","last_updated":"2023-01-03T23:52:16Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T14:37:16.907677Z","submitted_at":"2023-01-03T23:52:16Z","title":"Benchmarks and Algorithms for Offline Preference-Based Reward Learning"},"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 7 inbound Pith citation observations for arXiv:2301.01392."}