{"as_of":"2026-08-08T09:14:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5d1798f97abc061d6260c1a2ca213f53874e2f242cd2cd58aa1d89156a76ba24","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":9,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":9,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":9,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":9,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T14:10:42.886665Z","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-04T13:09:51.330383Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2306.14111","last_updated":"2023-11-03T18:36:03Z","snapshot_observed_at":"2026-07-06T15:46:21.260261Z","submitted_at":"2023-06-25T03:18:15Z","title":"Is RLHF More Difficult than Standard RL?","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.14111","snapshot_observed_at":"2026-08-07T14:10:42.886665Z","title":"Is rlhf more difficult than standard rl? arXiv preprint arXiv:2306.14111, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.20268","last_updated":"2025-07-24T14:21:12Z","snapshot_observed_at":"2026-08-07T13:53:33.149103Z","submitted_at":"2025-05-26T17:44:08Z","title":"Outcome-Based Online Reinforcement Learning: Algorithms and Fundamental Limits","version":2},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-07T14:10:42.886665Z"},"links":{"cited_paper":"/paper/2306.14111","citing_paper":"/paper/2505.20268"},"observation_digest":"sha256:741501dc55537797da06634c84fed5f97d398ae1600470f33a91b0ef08156918","observation_id":"f0ca88e5-076b-4d1f-974d-5f4c209eb44a","resolution":{"observed_at":"2026-08-07T14:10:42.886665Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2306.14111","last_updated":"2023-11-03T18:36:03Z","snapshot_observed_at":"2026-07-06T15:46:21.260261Z","submitted_at":"2023-06-25T03:18:15Z","title":"Is RLHF More Difficult than Standard RL?","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.14111","snapshot_observed_at":"2026-08-07T13:45:02.561160Z","title":"Is RLHF more difficult than standard RL ? arXiv preprint arXiv:2306.14111, 2023 b","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":81,"source":"arxiv_source","source_observed_at":"2026-08-07T13:45:02.561160Z"},"links":{"cited_paper":"/paper/2306.14111","citing_paper":"/paper/2505.21395"},"observation_digest":"sha256:7287729b85c9d81f99b4ea435d0bf719ce759efabd81efa6cd0c181ef8dbf3d7","observation_id":"bc6e284f-0f30-4db7-b4a7-e9324e6af1ae","resolution":{"observed_at":"2026-08-07T13:45:02.561160Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2306.14111","last_updated":"2023-11-03T18:36:03Z","snapshot_observed_at":"2026-07-06T15:46:21.260261Z","submitted_at":"2023-06-25T03:18:15Z","title":"Is RLHF More Difficult than Standard RL?","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.14111","snapshot_observed_at":"2026-08-07T11:20:12.854603Z","title":"Is rlhf more difficult than standard rl? arXiv preprint arXiv:2306.14111, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.03066","last_updated":"2026-07-17T19:03:49Z","snapshot_observed_at":"2026-08-07T11:06:58.974594Z","submitted_at":"2025-06-03T16:42:39Z","title":"Sign-SZPO: Provable Preference-based Reinforcement Learning with an Unknown Link Function","version":2},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-07T11:20:12.854603Z"},"links":{"cited_paper":"/paper/2306.14111","citing_paper":"/paper/2506.03066"},"observation_digest":"sha256:2422373b9fd1dd4f22fad7471126c40269c9957975f19cf0b767a56ab8377cc2","observation_id":"68c03123-55da-4bc6-a574-bbf61d4e86f5","resolution":{"observed_at":"2026-08-07T11:20:12.854603Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2306.14111","last_updated":"2023-11-03T18:36:03Z","snapshot_observed_at":"2026-07-06T15:46:21.260261Z","submitted_at":"2023-06-25T03:18:15Z","title":"Is RLHF More Difficult than Standard RL?","version":2},"cited_work":{"arxiv_id":"2306.14111","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2306.14111","snapshot_observed_at":"2026-07-04T13:09:51.330383Z","title":"arXiv preprint arXiv:2306.14111 , year=","venue":null,"work_id":"06c97220-a402-4c19-b1ae-54bba20dfe47","year":2023},"citing_paper":{"arxiv_id":"2510.08539","last_updated":"2026-05-07T17:44:57Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-10-09T17:53:41Z","title":"On the optimization dynamics of RLVR: Gradient gap and step size thresholds","version":4},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-05-18T08:34:36.543874Z"},"links":{"cited_paper":"/paper/2306.14111","citing_paper":"/paper/2510.08539"},"observation_digest":"sha256:10cfb4f27fff67a4a9ce1ee748fdd7e4fa7c704a668de4b83de59bf3cf93303f","observation_id":"a076c2a1-5fe0-4a7e-ae2c-54027c45ddc9","resolution":{"observed_at":"2026-05-18T08:36:07.373729Z","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"}},{"citation":{"cited_paper":{"arxiv_id":"2306.14111","last_updated":"2023-11-03T18:36:03Z","snapshot_observed_at":"2026-07-06T15:46:21.260261Z","submitted_at":"2023-06-25T03:18:15Z","title":"Is RLHF More Difficult than Standard RL?","version":2},"cited_work":{"arxiv_id":"2306.14111","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2306.14111","snapshot_observed_at":"2026-07-04T13:09:51.330383Z","title":"arXiv preprint arXiv:2306.14111 , year=","venue":null,"work_id":"06c97220-a402-4c19-b1ae-54bba20dfe47","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":47,"source":"arxiv_source","source_observed_at":"2026-05-15T21:38:53.792221Z"},"links":{"cited_paper":"/paper/2306.14111","citing_paper":"/paper/2604.02349"},"observation_digest":"sha256:fb71e772fb0f15f1df13308719efc7d8292688db3346744cc6422ac612b4abcc","observation_id":"6befe8be-e0f8-434d-84d1-92d2498a0dd2","resolution":{"observed_at":"2026-05-15T21:40:20.961449Z","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"}},{"citation":{"cited_paper":{"arxiv_id":"2306.14111","last_updated":"2023-11-03T18:36:03Z","snapshot_observed_at":"2026-07-06T15:46:21.260261Z","submitted_at":"2023-06-25T03:18:15Z","title":"Is RLHF More Difficult than Standard RL?","version":2},"cited_work":{"arxiv_id":"2306.14111","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2306.14111","snapshot_observed_at":"2026-07-04T13:09:51.330383Z","title":"arXiv preprint arXiv:2306.14111 , year=","venue":null,"work_id":"06c97220-a402-4c19-b1ae-54bba20dfe47","year":2023},"citing_paper":{"arxiv_id":"2605.23244","last_updated":"2026-05-22T05:25:00Z","snapshot_observed_at":"2026-08-01T14:10:27.190441Z","submitted_at":"2026-05-22T05:25:00Z","title":"Convex Optimization for Alignment and Preference Learning on a Single GPU","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-05-25T05:01:31.560963Z"},"links":{"cited_paper":"/paper/2306.14111","citing_paper":"/paper/2605.23244"},"observation_digest":"sha256:3a945494c24c05885bd8919d1a140fbdf77f4c5dee86cfc4fae43412dc9d3b42","observation_id":"52f4111c-04ef-40a4-8821-5420410760d2","resolution":{"observed_at":"2026-05-25T05:05:23.015101Z","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"}},{"citation":{"cited_paper":{"arxiv_id":"2306.14111","last_updated":"2023-11-03T18:36:03Z","snapshot_observed_at":"2026-07-06T15:46:21.260261Z","submitted_at":"2023-06-25T03:18:15Z","title":"Is RLHF More Difficult than Standard RL?","version":2},"cited_work":{"arxiv_id":"2306.14111","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2306.14111","snapshot_observed_at":"2026-07-04T13:09:51.330383Z","title":"arXiv preprint arXiv:2306.14111 , year=","venue":null,"work_id":"06c97220-a402-4c19-b1ae-54bba20dfe47","year":2023},"citing_paper":{"arxiv_id":"2606.06053","last_updated":"2026-07-12T09:46:20Z","snapshot_observed_at":"2026-08-05T13:47:01.053562Z","submitted_at":"2026-06-04T11:54:23Z","title":"Online KL-Regularized Reinforcement Learning with Function Approximation under Misspecification","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-06-28T02:31:11.200818Z"},"links":{"cited_paper":"/paper/2306.14111","citing_paper":"/paper/2606.06053"},"observation_digest":"sha256:f37527b92e1f6b47b48a9dd423f2bd71be9164cd5ff557a557eb09c215238c53","observation_id":"5604856b-fb3b-4589-a8f2-4086f6b651d6","resolution":{"observed_at":"2026-07-02T12:06:55.886189Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"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"}},{"citation":{"cited_paper":{"arxiv_id":"2306.14111","last_updated":"2023-11-03T18:36:03Z","snapshot_observed_at":"2026-07-06T15:46:21.260261Z","submitted_at":"2023-06-25T03:18:15Z","title":"Is RLHF More Difficult than Standard RL?","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.14111","snapshot_observed_at":"2026-07-14T18:23:21.126826Z","title":"Di Wu, Chengshuai Shi, Jing Yang, and Cong Shen","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.06053","last_updated":"2026-07-12T09:46:20Z","snapshot_observed_at":"2026-08-05T13:47:01.053562Z","submitted_at":"2026-06-04T11:54:23Z","title":"Online KL-Regularized Reinforcement Learning with Function Approximation under Misspecification","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-07-14T18:23:21.126826Z"},"links":{"cited_paper":"/paper/2306.14111","citing_paper":"/paper/2606.06053"},"observation_digest":"sha256:d46dfee90e9fb29d4a98020319241c78bc738abedd1d3eb8b4e5a6815709661a","observation_id":"6d598499-4ca3-44e8-90fc-58b233a99fd8","resolution":{"observed_at":"2026-07-14T18:23:21.126826Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2306.14111","last_updated":"2023-11-03T18:36:03Z","snapshot_observed_at":"2026-07-06T15:46:21.260261Z","submitted_at":"2023-06-25T03:18:15Z","title":"Is RLHF More Difficult than Standard RL?","version":2},"cited_work":{"arxiv_id":"2306.14111","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2306.14111","snapshot_observed_at":"2026-07-04T13:09:51.330383Z","title":"arXiv preprint arXiv:2306.14111 , year=","venue":null,"work_id":"06c97220-a402-4c19-b1ae-54bba20dfe47","year":2023},"citing_paper":{"arxiv_id":"2606.27082","last_updated":"2026-06-25T14:20:03Z","snapshot_observed_at":"2026-08-07T21:42:58.159964Z","submitted_at":"2026-06-25T14:20:03Z","title":"Finding Stationary Points by Comparisons","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-06-26T05:26:07.720218Z"},"links":{"cited_paper":"/paper/2306.14111","citing_paper":"/paper/2606.27082"},"observation_digest":"sha256:8d8591842780135df255a931c26cecd0b1030833fdb28d199ea804660776b803","observation_id":"b36b1692-97d3-438d-b55e-ac2f3ea1231f","resolution":{"observed_at":"2026-07-04T13:09:51.331914Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"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/2306.14111/citation-record","integrity":"/paper/2306.14111/integrity","json":"/paper/2306.14111/citation-record.json","paper":"/paper/2306.14111"},"outbound":[],"paper":{"arxiv_id":"2306.14111","last_updated":"2023-11-03T18:36:03Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T15:46:21.260261Z","submitted_at":"2023-06-25T03:18:15Z","title":"Is RLHF More Difficult than Standard RL?"},"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 9 inbound Pith citation observations for arXiv:2306.14111."}