{"as_of":"2026-08-20T06:15:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:6bc8eed70c10da6679e6c169d42320a4fde5d72864db2a50cc792ff7d831943c","coverage":[{"denominator":19,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":19,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T15:55:14.514424Z","state":"measured"},{"denominator":19,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":19,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-19T06:32:44.657259+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2412.10529/citation-record","integrity":"/paper/2412.10529/integrity","json":"/paper/2412.10529/citation-record.json","paper":"/paper/2412.10529"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2204.05862","last_updated":"2022-04-12T15:02:38Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2022-04-12T15:02:38Z","title":"Training a Helpful and Harmless Assistant with Reinforcement Learning from Human Feedback","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2204.05862","snapshot_observed_at":"2026-08-11T15:55:14.399260Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2412.10529","last_updated":"2024-12-13T19:47:38Z","snapshot_observed_at":"2026-08-16T17:35:23.139282Z","submitted_at":"2024-12-13T19:47:38Z","title":"Solving the Inverse Alignment Problem for Efficient RLHF","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-11T15:55:14.399260Z"},"links":{"cited_paper":"/paper/2204.05862","citing_paper":"/paper/2412.10529"},"observation_digest":"sha256:bd3bc6be6067a64b18f180eab0a5531104bd1f1db081d1e67891e843fbab9b60","observation_id":"07c87c11-fa96-48a2-9e95-02d4caa3a219","resolution":{"observed_at":"2026-08-11T15:55:14.399260Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T15:55:14.407227Z","title":null,"venue":null,"work_id":null,"year":1952},"citing_paper":{"arxiv_id":"2412.10529","last_updated":"2024-12-13T19:47:38Z","snapshot_observed_at":"2026-08-16T17:35:23.139282Z","submitted_at":"2024-12-13T19:47:38Z","title":"Solving the Inverse Alignment Problem for Efficient RLHF","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-11T15:55:14.407227Z"},"links":{"citing_paper":"/paper/2412.10529"},"observation_digest":"sha256:4726f6be75e0d2c89e6c1de83baa9af90cc293e860ce36911d12af7c813e2545","observation_id":"c499bb23-9f36-4e99-8080-eacd0bf158e8","resolution":{"observed_at":"2026-08-11T15:55:14.407227Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1810.04805","last_updated":"2019-05-24T20:37:26Z","snapshot_observed_at":"2026-08-14T18:16:28.847993Z","submitted_at":"2018-10-11T00:50:01Z","title":"BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1810.04805","snapshot_observed_at":"2026-08-11T15:55:14.413400Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2412.10529","last_updated":"2024-12-13T19:47:38Z","snapshot_observed_at":"2026-08-16T17:35:23.139282Z","submitted_at":"2024-12-13T19:47:38Z","title":"Solving the Inverse Alignment Problem for Efficient RLHF","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-11T15:55:14.413400Z"},"links":{"cited_paper":"/paper/1810.04805","citing_paper":"/paper/2412.10529"},"observation_digest":"sha256:c9ed1f7ac82a95b72a02d8ad058f69ff6aeff6db441c00753a5484822c10f73b","observation_id":"718eef58-0d97-4394-8095-5bd116d189ae","resolution":{"observed_at":"2026-08-11T15:55:14.413400Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2212.04717","last_updated":"2023-10-30T05:01:12Z","snapshot_observed_at":"2026-08-16T16:09:51.815789Z","submitted_at":"2022-12-09T08:16:20Z","title":"On the Sensitivity of Reward Inference to Misspecified Human Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2212.04717","snapshot_observed_at":"2026-08-11T15:55:14.418381Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.10529","last_updated":"2024-12-13T19:47:38Z","snapshot_observed_at":"2026-08-16T17:35:23.139282Z","submitted_at":"2024-12-13T19:47:38Z","title":"Solving the Inverse Alignment Problem for Efficient RLHF","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-11T15:55:14.418381Z"},"links":{"cited_paper":"/paper/2212.04717","citing_paper":"/paper/2412.10529"},"observation_digest":"sha256:340cf7eada76d5a6494f3565600bdffaab2067b62bf5a82d9eafd81a08e22922","observation_id":"135f7846-d08d-45df-a25d-07eb56de92bc","resolution":{"observed_at":"2026-08-11T15:55:14.418381Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1412.6980","last_updated":"2017-01-30T01:27:54Z","snapshot_observed_at":"2026-08-17T19:26:44.032537Z","submitted_at":"2014-12-22T13:54:29Z","title":"Adam: A Method for Stochastic Optimization","version":9},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1412.6980","snapshot_observed_at":"2026-08-11T15:55:14.424376Z","title":"Kingma and Jimmy Ba","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2412.10529","last_updated":"2024-12-13T19:47:38Z","snapshot_observed_at":"2026-08-16T17:35:23.139282Z","submitted_at":"2024-12-13T19:47:38Z","title":"Solving the Inverse Alignment Problem for Efficient RLHF","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-11T15:55:14.424376Z"},"links":{"cited_paper":"/paper/1412.6980","citing_paper":"/paper/2412.10529"},"observation_digest":"sha256:0300cc2d16eb7589601312c45094ea002bc7ba714f427bbb33f1b68ae48c7dfc","observation_id":"418aed5e-c154-45f6-9a0f-ef2cc201f03c","resolution":{"observed_at":"2026-08-11T15:55:14.424376Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2206.02231","last_updated":"2023-09-06T21:13:28Z","snapshot_observed_at":"2026-08-19T23:09:58.025502Z","submitted_at":"2022-06-05T17:58:02Z","title":"Models of human preference for learning reward functions","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2206.02231","snapshot_observed_at":"2026-08-11T15:55:14.429741Z","title":"Bradley Knox, Stephane Hatgis-Kessell, Serena Booth, Scott Niekum, Peter Stone, and Alessandro Allievi","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.10529","last_updated":"2024-12-13T19:47:38Z","snapshot_observed_at":"2026-08-16T17:35:23.139282Z","submitted_at":"2024-12-13T19:47:38Z","title":"Solving the Inverse Alignment Problem for Efficient RLHF","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-11T15:55:14.429741Z"},"links":{"cited_paper":"/paper/2206.02231","citing_paper":"/paper/2412.10529"},"observation_digest":"sha256:e07a134e7600b904601d7eee812f65e4a7712eed0d74501a14bf4c49e6db6fa8","observation_id":"f398cc95-f2a7-411e-910d-76a946347aab","resolution":{"observed_at":"2026-08-11T15:55:14.429741Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T15:55:15.195487Z","title":null,"venue":null,"work_id":"a0f3b19e-08f2-4093-80bc-faba13ed8320","year":2023},"citing_paper":{"arxiv_id":"2412.10529","last_updated":"2024-12-13T19:47:38Z","snapshot_observed_at":"2026-08-16T17:35:23.139282Z","submitted_at":"2024-12-13T19:47:38Z","title":"Solving the Inverse Alignment Problem for Efficient RLHF","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-11T15:55:14.436590Z"},"links":{"citing_paper":"/paper/2412.10529"},"observation_digest":"sha256:c43c441ddae969decfb03904e1aad65e79ff101aca3b9a9ce464dbf119b21cc8","observation_id":"369f9ae1-2567-4743-af88-144ccb68a72f","resolution":{"observed_at":"2026-08-11T15:55:15.200644Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1907.11692","last_updated":"2019-07-26T17:48:29Z","snapshot_observed_at":"2026-08-16T14:33:50.657682Z","submitted_at":"2019-07-26T17:48:29Z","title":"RoBERTa: A Robustly Optimized BERT Pretraining Approach","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1907.11692","snapshot_observed_at":"2026-08-11T15:55:14.441779Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2412.10529","last_updated":"2024-12-13T19:47:38Z","snapshot_observed_at":"2026-08-16T17:35:23.139282Z","submitted_at":"2024-12-13T19:47:38Z","title":"Solving the Inverse Alignment Problem for Efficient RLHF","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-11T15:55:14.441779Z"},"links":{"cited_paper":"/paper/1907.11692","citing_paper":"/paper/2412.10529"},"observation_digest":"sha256:5709f62dccbf7d2aba88b738914e842fbc68b43fd756d068d3a16509f615294e","observation_id":"715fa89e-d95b-4611-b27f-8216179a7733","resolution":{"observed_at":"2026-08-11T15:55:14.441779Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2203.02155","last_updated":"2022-03-04T07:04:42Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2022-03-04T07:04:42Z","title":"Training language models to follow instructions with human feedback","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2203.02155","snapshot_observed_at":"2026-08-11T15:55:14.446632Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2412.10529","last_updated":"2024-12-13T19:47:38Z","snapshot_observed_at":"2026-08-16T17:35:23.139282Z","submitted_at":"2024-12-13T19:47:38Z","title":"Solving the Inverse Alignment Problem for Efficient RLHF","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-11T15:55:14.446632Z"},"links":{"cited_paper":"/paper/2203.02155","citing_paper":"/paper/2412.10529"},"observation_digest":"sha256:40b083c186dc63f02e659e2fe7ea6b33c791b157f6d2c2fd4930778d78c268d8","observation_id":"cc78cb53-29be-42d4-83af-d1313c893a74","resolution":{"observed_at":"2026-08-11T15:55:14.446632Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T15:55:14.452073Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2412.10529","last_updated":"2024-12-13T19:47:38Z","snapshot_observed_at":"2026-08-16T17:35:23.139282Z","submitted_at":"2024-12-13T19:47:38Z","title":"Solving the Inverse Alignment Problem for Efficient RLHF","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-11T15:55:14.452073Z"},"links":{"citing_paper":"/paper/2412.10529"},"observation_digest":"sha256:b5a57f1405150f3a034ba55e88d03be5637a4dcc9a3473a9bd6446f6d98a9ad7","observation_id":"a8f90746-c415-4a97-97d1-077ba8ce998a","resolution":{"observed_at":"2026-08-11T15:55:14.452073Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1908.10084","last_updated":"2019-08-27T08:50:17Z","snapshot_observed_at":"2026-08-14T05:02:11.716316Z","submitted_at":"2019-08-27T08:50:17Z","title":"Sentence-BERT: Sentence Embeddings using Siamese BERT-Networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1908.10084","snapshot_observed_at":"2026-08-11T15:55:14.456371Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2412.10529","last_updated":"2024-12-13T19:47:38Z","snapshot_observed_at":"2026-08-16T17:35:23.139282Z","submitted_at":"2024-12-13T19:47:38Z","title":"Solving the Inverse Alignment Problem for Efficient RLHF","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-11T15:55:14.456371Z"},"links":{"cited_paper":"/paper/1908.10084","citing_paper":"/paper/2412.10529"},"observation_digest":"sha256:f4007f25d875e572c0be2b96c28f147d42ba3bc103e99375e036240af381a88d","observation_id":"8840e782-3196-432a-9ed7-dc356ce3859e","resolution":{"observed_at":"2026-08-11T15:55:14.456371Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1707.06347","last_updated":"2017-08-28T09:20:06Z","snapshot_observed_at":"2026-08-15T20:26:32.102285Z","submitted_at":"2017-07-20T02:32:33Z","title":"Proximal Policy Optimization Algorithms","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1707.06347","snapshot_observed_at":"2026-08-11T15:55:14.461402Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2412.10529","last_updated":"2024-12-13T19:47:38Z","snapshot_observed_at":"2026-08-16T17:35:23.139282Z","submitted_at":"2024-12-13T19:47:38Z","title":"Solving the Inverse Alignment Problem for Efficient RLHF","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-11T15:55:14.461402Z"},"links":{"cited_paper":"/paper/1707.06347","citing_paper":"/paper/2412.10529"},"observation_digest":"sha256:1e590bc2b9749271e5f8e7db15cd9f9175b20d529807beebc8084f49aa62a7d1","observation_id":"3afdc876-f7ec-42e6-af5d-90c4ee1588a9","resolution":{"observed_at":"2026-08-11T15:55:14.461402Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.05910","last_updated":"2024-04-09T23:21:45Z","snapshot_observed_at":"2026-08-16T15:50:18.539467Z","submitted_at":"2023-10-09T17:56:53Z","title":"SALMON: Self-Alignment with Instructable Reward Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.05910","snapshot_observed_at":"2026-08-11T15:55:14.466628Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.10529","last_updated":"2024-12-13T19:47:38Z","snapshot_observed_at":"2026-08-16T17:35:23.139282Z","submitted_at":"2024-12-13T19:47:38Z","title":"Solving the Inverse Alignment Problem for Efficient RLHF","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-11T15:55:14.466628Z"},"links":{"cited_paper":"/paper/2310.05910","citing_paper":"/paper/2412.10529"},"observation_digest":"sha256:4d5ef6ce723da43a3d52e0076ef0be2b5e2584bf72f3e0d88bbfc21e47b097fd","observation_id":"ef2a9466-bebd-4926-8336-bf23dd87f1fc","resolution":{"observed_at":"2026-08-11T15:55:14.466628Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.05530","last_updated":"2024-12-16T17:39:39Z","snapshot_observed_at":"2026-08-14T18:15:53.516440Z","submitted_at":"2024-03-08T18:54:20Z","title":"Gemini 1.5: Unlocking multimodal understanding across millions of tokens of context","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.05530","snapshot_observed_at":"2026-08-11T15:55:14.474557Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.10529","last_updated":"2024-12-13T19:47:38Z","snapshot_observed_at":"2026-08-16T17:35:23.139282Z","submitted_at":"2024-12-13T19:47:38Z","title":"Solving the Inverse Alignment Problem for Efficient RLHF","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-11T15:55:14.474557Z"},"links":{"cited_paper":"/paper/2403.05530","citing_paper":"/paper/2412.10529"},"observation_digest":"sha256:8b5dbe14c70b5e620831212e8be370c3c67665bbb954b6f76bfec96739aedfb8","observation_id":"699d589d-bd1a-49db-8cbd-9c0051b1a8e5","resolution":{"observed_at":"2026-08-11T15:55:14.474557Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T15:55:15.158090Z","title":null,"venue":null,"work_id":"45c958ad-118b-46fa-b406-8f9a085077ca","year":2010},"citing_paper":{"arxiv_id":"2412.10529","last_updated":"2024-12-13T19:47:38Z","snapshot_observed_at":"2026-08-16T17:35:23.139282Z","submitted_at":"2024-12-13T19:47:38Z","title":"Solving the Inverse Alignment Problem for Efficient RLHF","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-11T15:55:14.484126Z"},"links":{"citing_paper":"/paper/2412.10529"},"observation_digest":"sha256:1c77382ae3b35809978d925418a8d86a1f09e7c671f4c6e3875779fd3349ea03","observation_id":"df5f3f17-5997-4c7f-a644-b7df2a879671","resolution":{"observed_at":"2026-08-11T15:55:15.165304Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T15:55:15.135275Z","title":null,"venue":null,"work_id":"691ba185-e732-4ba8-b645-284284f9cdf2","year":2022},"citing_paper":{"arxiv_id":"2412.10529","last_updated":"2024-12-13T19:47:38Z","snapshot_observed_at":"2026-08-16T17:35:23.139282Z","submitted_at":"2024-12-13T19:47:38Z","title":"Solving the Inverse Alignment Problem for Efficient RLHF","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-11T15:55:14.489830Z"},"links":{"citing_paper":"/paper/2412.10529"},"observation_digest":"sha256:1408146f0c2a2238b81b52ccbc936602623e8748a2d5c3d12fa645dd7bbff4db","observation_id":"4f31d886-6ea6-4106-bbab-67ccbb15feb1","resolution":{"observed_at":"2026-08-11T15:55:15.143893Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.13210","last_updated":"2024-07-03T00:23:41Z","snapshot_observed_at":"2026-08-16T14:16:51.679855Z","submitted_at":"2024-02-20T18:20:59Z","title":"Bayesian Reward Models for LLM Alignment","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.13210","snapshot_observed_at":"2026-08-11T15:55:14.495738Z","title":"Yang, Maxime Robeyns, Thomas Coste, Jun Wang, Haitham Bou-Ammar, and Laurence Aitchison","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.10529","last_updated":"2024-12-13T19:47:38Z","snapshot_observed_at":"2026-08-16T17:35:23.139282Z","submitted_at":"2024-12-13T19:47:38Z","title":"Solving the Inverse Alignment Problem for Efficient RLHF","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-11T15:55:14.495738Z"},"links":{"cited_paper":"/paper/2402.13210","citing_paper":"/paper/2412.10529"},"observation_digest":"sha256:d05442f2b139b4c37c79796b8730e218566ee41d3a781681b15fd695f22d2c12","observation_id":"96f0f89b-53c5-4a16-919a-2d875d3b71d2","resolution":{"observed_at":"2026-08-11T15:55:14.495738Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T15:55:14.504316Z","title":"online\" 'onlinestring :=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.10529","last_updated":"2024-12-13T19:47:38Z","snapshot_observed_at":"2026-08-16T17:35:23.139282Z","submitted_at":"2024-12-13T19:47:38Z","title":"Solving the Inverse Alignment Problem for Efficient RLHF","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-11T15:55:14.504316Z"},"links":{"citing_paper":"/paper/2412.10529"},"observation_digest":"sha256:c35171770006013ad5cf1c656b665e52f58dda37f969be53698927237a1d8864","observation_id":"4ae95ce3-8b36-46ca-9134-70117210163d","resolution":{"observed_at":"2026-08-11T15:55:14.504316Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T15:55:14.514424Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.10529","last_updated":"2024-12-13T19:47:38Z","snapshot_observed_at":"2026-08-16T17:35:23.139282Z","submitted_at":"2024-12-13T19:47:38Z","title":"Solving the Inverse Alignment Problem for Efficient RLHF","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-11T15:55:14.514424Z"},"links":{"citing_paper":"/paper/2412.10529"},"observation_digest":"sha256:9a69fbdc25976b9da28e97111c26726b152d1ee64c9e0b6d2da50f60b2d619e2","observation_id":"cec60575-ca6d-4e77-8662-1f307e5bf472","resolution":{"observed_at":"2026-08-11T15:55:14.514424Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2412.10529","last_updated":"2024-12-13T19:47:38Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-16T17:35:23.139282Z","submitted_at":"2024-12-13T19:47:38Z","title":"Solving the Inverse Alignment Problem for Efficient RLHF"},"reference_resolution":{"displayed":19,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":19,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":19},"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-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 20 August 2026, this Paper Citation Record lists 19 of 19 outbound references and 0 inbound Pith citation observations for arXiv:2412.10529."}