{"as_of":"2026-08-16T13:14:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:303655d925021f63bfb7bba1dc35dd2cf4faa4c8e9141fadf2f85de0025432aa","coverage":[{"denominator":18,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":18,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-27T17:21:10.240399Z","state":"measured"},{"denominator":18,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":18,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+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/2606.08893/citation-record","integrity":"/paper/2606.08893/integrity","json":"/paper/2606.08893/citation-record.json","paper":"/paper/2606.08893"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"1606.06565","last_updated":"2016-07-25T17:23:29Z","snapshot_observed_at":"2026-07-06T05:00:46.434335Z","submitted_at":"2016-06-21T13:37:05Z","title":"Concrete Problems in AI Safety","version":2},"cited_work":{"arxiv_id":"1606.06565","doi":"10.48550/arxiv.1606.06565","metadata_source":"pith","pith_arxiv_id":"1606.06565","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"Concrete Problems in AI Safety","venue":"cs.AI","work_id":"c8d14fbe-6eab-464a-95b3-778aabd82fa3","year":2016},"citing_paper":{"arxiv_id":"2606.08893","last_updated":"2026-06-08T00:35:54Z","snapshot_observed_at":"2026-08-02T01:17:24.757981Z","submitted_at":"2026-06-08T00:35:54Z","title":"Cheap Reward Hacking Detection","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-06-27T17:21:10.240399Z"},"links":{"cited_paper":"/paper/1606.06565","citing_paper":"/paper/2606.08893"},"observation_digest":"sha256:0254289d272794634133813b88a5f5baa40e46c8f9609af09622a137672291f6","observation_id":"b98d42d3-42e0-4dc5-b116-2cbe51c41ca6","resolution":{"observed_at":"2026-07-03T00:17:29.187103Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-07-13T23:49:52.215761+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-13T23:49:52.215761+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2201.03544","last_updated":"2022-02-14T09:05:38Z","snapshot_observed_at":"2026-08-16T03:45:29.671274Z","submitted_at":"2022-01-10T18:58:52Z","title":"The Effects of Reward Misspecification: Mapping and Mitigating Misaligned Models","version":2},"cited_work":{"arxiv_id":"2201.03544","doi":"10.48550/arxiv.2201.03544","metadata_source":"pith","pith_arxiv_id":"2201.03544","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"The Effects of Reward Misspecification: Mapping and Mitigating Misaligned Models","venue":"cs.LG","work_id":"8cc80123-1403-4332-8cf4-e35242de7490","year":2022},"citing_paper":{"arxiv_id":"2606.08893","last_updated":"2026-06-08T00:35:54Z","snapshot_observed_at":"2026-08-02T01:17:24.757981Z","submitted_at":"2026-06-08T00:35:54Z","title":"Cheap Reward Hacking Detection","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-06-27T17:21:10.240399Z"},"links":{"cited_paper":"/paper/2201.03544","citing_paper":"/paper/2606.08893"},"observation_digest":"sha256:7b6efb83d131fd15a34c926d012112a97dc7e81b7db802a177cfea3f9aefbb95","observation_id":"f6c44add-2e91-4fe2-bed6-c673b284f936","resolution":{"observed_at":"2026-07-03T00:17:29.183546Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T17:21:10.240399Z","title":"Reward tampering problems and solutions in reinforcement learning: A causal influence diagram perspective","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2606.08893","last_updated":"2026-06-08T00:35:54Z","snapshot_observed_at":"2026-08-02T01:17:24.757981Z","submitted_at":"2026-06-08T00:35:54Z","title":"Cheap Reward Hacking Detection","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-06-27T17:21:10.240399Z"},"links":{"citing_paper":"/paper/2606.08893"},"observation_digest":"sha256:1ec523595597341590e8b3f612030ff47b6782693170fda7d44ebfa07010b122","observation_id":"75304bcd-3933-46db-a0bb-907d47025a69","resolution":{"observed_at":"2026-06-27T17:21:10.240399Z","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-06-27T17:21:10.240399Z","title":"Bisimulation metrics for continuous Markov decision processes.SIAM Journal on Computing, 40(6):1662–1714, 2011","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2606.08893","last_updated":"2026-06-08T00:35:54Z","snapshot_observed_at":"2026-08-02T01:17:24.757981Z","submitted_at":"2026-06-08T00:35:54Z","title":"Cheap Reward Hacking Detection","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-06-27T17:21:10.240399Z"},"links":{"citing_paper":"/paper/2606.08893"},"observation_digest":"sha256:0daca90c5727bcf0fb16576bdad47af4cc184a236698bc06a2b36e9d708934ca","observation_id":"f4c636e4-01cc-494a-bd20-a951750d9980","resolution":{"observed_at":"2026-06-27T17:21:10.240399Z","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-06-27T17:21:10.240399Z","title":"Density-based clustering based on hierarchical density estimates","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2606.08893","last_updated":"2026-06-08T00:35:54Z","snapshot_observed_at":"2026-08-02T01:17:24.757981Z","submitted_at":"2026-06-08T00:35:54Z","title":"Cheap Reward Hacking Detection","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-06-27T17:21:10.240399Z"},"links":{"citing_paper":"/paper/2606.08893"},"observation_digest":"sha256:cc1d963523912041f1279a0383804147e622c18369b5a936f8b37f47a5d72411","observation_id":"0cd2434e-3a9e-4f52-bce5-0ab395094a7d","resolution":{"observed_at":"2026-06-27T17:21:10.240399Z","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-06-27T17:21:10.240399Z","title":"Attention is all you need.Advances in Neural Information Processing Systems, 30, 2017","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2606.08893","last_updated":"2026-06-08T00:35:54Z","snapshot_observed_at":"2026-08-02T01:17:24.757981Z","submitted_at":"2026-06-08T00:35:54Z","title":"Cheap Reward Hacking Detection","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-06-27T17:21:10.240399Z"},"links":{"citing_paper":"/paper/2606.08893"},"observation_digest":"sha256:ce086b72135435bc4e4a0d5c4d030a84e8ae7030aa36605d64989fb736a06f59","observation_id":"df62f231-477d-40c4-8ffe-f23000abefd9","resolution":{"observed_at":"2026-06-27T17:21:10.240399Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1802.03426","last_updated":"2020-09-18T01:56:41Z","snapshot_observed_at":"2026-08-02T15:32:07.466568Z","submitted_at":"2018-02-09T19:39:33Z","title":"UMAP: Uniform Manifold Approximation and Projection for Dimension Reduction","version":3},"cited_work":{"arxiv_id":"1802.03426","doi":"10.1037/adb0001138","metadata_source":"pith","pith_arxiv_id":"1802.03426","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"UMAP: Uniform Manifold Approximation and Projection for Dimension Reduction","venue":"stat.ML","work_id":"54c15172-6304-4008-a3b6-c4cc0803c054","year":2018},"citing_paper":{"arxiv_id":"2606.08893","last_updated":"2026-06-08T00:35:54Z","snapshot_observed_at":"2026-08-02T01:17:24.757981Z","submitted_at":"2026-06-08T00:35:54Z","title":"Cheap Reward Hacking Detection","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-06-27T17:21:10.240399Z"},"links":{"cited_paper":"/paper/1802.03426","citing_paper":"/paper/2606.08893"},"observation_digest":"sha256:e47e243921a83ed163f1ddf433d4e0ad1b497e2a3997df69da8d6d49a2331839","observation_id":"5a308ce9-e430-4ec5-9104-14a2540bed16","resolution":{"observed_at":"2026-07-03T00:17:29.178304Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-05-25T15:24:07.856203+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T15:24:07.856203+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T17:21:10.240399Z","title":"SMART: Robust and efficient fine-tuning for pre-trained natural language models through principled regularized optimization","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2606.08893","last_updated":"2026-06-08T00:35:54Z","snapshot_observed_at":"2026-08-02T01:17:24.757981Z","submitted_at":"2026-06-08T00:35:54Z","title":"Cheap Reward Hacking Detection","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-06-27T17:21:10.240399Z"},"links":{"citing_paper":"/paper/2606.08893"},"observation_digest":"sha256:4e250461fa9cacb33023f5ba28f82658ebc4ecd169bc65e159303f4fc375a545","observation_id":"311741cf-968a-4359-826b-21266dbd64a1","resolution":{"observed_at":"2026-06-27T17:21:10.240399Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1909.11764","last_updated":"2020-04-23T07:19:00Z","snapshot_observed_at":"2026-08-12T16:06:14.773530Z","submitted_at":"2019-09-25T20:50:32Z","title":"FreeLB: Enhanced Adversarial Training for Natural Language Understanding","version":5},"cited_work":{"arxiv_id":"1909.11764","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1909.11764","snapshot_observed_at":"2026-07-03T00:17:29.179388Z","title":"Freelb: Enhanced adversarial training for natural language understanding.arXiv preprint arXiv:1909.11764","venue":null,"work_id":"76c6e9af-6c10-4ecb-9bc8-18b5bb8110c6","year":1909},"citing_paper":{"arxiv_id":"2606.08893","last_updated":"2026-06-08T00:35:54Z","snapshot_observed_at":"2026-08-02T01:17:24.757981Z","submitted_at":"2026-06-08T00:35:54Z","title":"Cheap Reward Hacking Detection","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-06-27T17:21:10.240399Z"},"links":{"cited_paper":"/paper/1909.11764","citing_paper":"/paper/2606.08893"},"observation_digest":"sha256:76c9ea4adc575e4637553fd527f3e6f2641529bd86e58b7b00feca2a83dca005","observation_id":"6548c4b7-cd22-4814-bec6-1667cfdc27e0","resolution":{"observed_at":"2026-07-03T00:17:29.181042Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T17:21:10.240399Z","title":"A simple framework for contrastive learning of visual representations","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2606.08893","last_updated":"2026-06-08T00:35:54Z","snapshot_observed_at":"2026-08-02T01:17:24.757981Z","submitted_at":"2026-06-08T00:35:54Z","title":"Cheap Reward Hacking Detection","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-06-27T17:21:10.240399Z"},"links":{"citing_paper":"/paper/2606.08893"},"observation_digest":"sha256:62d1bed3276855ceecc66e8f933206ba40cba2a8597f717eaa175718744119c7","observation_id":"7e5d8476-de37-433c-a6cd-cfa907876a1f","resolution":{"observed_at":"2026-06-27T17:21:10.240399Z","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-06-27T17:21:10.240399Z","title":"Defining and characterizing reward gaming.Advances in Neural Information Processing Systems, 35: 9460–9471, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.08893","last_updated":"2026-06-08T00:35:54Z","snapshot_observed_at":"2026-08-02T01:17:24.757981Z","submitted_at":"2026-06-08T00:35:54Z","title":"Cheap Reward Hacking Detection","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-06-27T17:21:10.240399Z"},"links":{"citing_paper":"/paper/2606.08893"},"observation_digest":"sha256:4e8b29d373a50c073fcd1284c5bf610796835f6bc72ddd2e4b038df7cdbc85ba","observation_id":"2a2af24e-cfda-4ac2-b784-81dff15a4a67","resolution":{"observed_at":"2026-06-27T17:21:10.240399Z","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-06-27T17:21:10.240399Z","title":"Specification gaming: The flip side of AI ingenuity.DeepMind Blog, 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2606.08893","last_updated":"2026-06-08T00:35:54Z","snapshot_observed_at":"2026-08-02T01:17:24.757981Z","submitted_at":"2026-06-08T00:35:54Z","title":"Cheap Reward Hacking Detection","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-06-27T17:21:10.240399Z"},"links":{"citing_paper":"/paper/2606.08893"},"observation_digest":"sha256:d31431a38fe3713297745a5c33a7f78971ac614b90d7ed27386f7d41b02bd839","observation_id":"038e4a77-d0d3-4382-910e-df59295d96a7","resolution":{"observed_at":"2026-06-27T17:21:10.240399Z","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-06-27T17:21:10.240399Z","title":"Programming as theory building.Microprocessing and Microprogramming, 15(5): 253–261, 1985","venue":null,"work_id":null,"year":1985},"citing_paper":{"arxiv_id":"2606.08893","last_updated":"2026-06-08T00:35:54Z","snapshot_observed_at":"2026-08-02T01:17:24.757981Z","submitted_at":"2026-06-08T00:35:54Z","title":"Cheap Reward Hacking Detection","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-06-27T17:21:10.240399Z"},"links":{"citing_paper":"/paper/2606.08893"},"observation_digest":"sha256:bd61352f297c33e0c843bc1dcc224e4aa38223f6230fa2453989c8ebdd00dd52","observation_id":"4b5f902d-6ae9-49ea-9ed0-625d913bfc38","resolution":{"observed_at":"2026-06-27T17:21:10.240399Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1803.04585","last_updated":"2019-02-24T08:12:46Z","snapshot_observed_at":"2026-08-14T19:36:53.167878Z","submitted_at":"2018-03-13T01:15:39Z","title":"Categorizing Variants of Goodhart's Law","version":4},"cited_work":{"arxiv_id":"1803.04585","doi":"10.48550/arxiv.1803.04585","metadata_source":"pith","pith_arxiv_id":"1803.04585","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Categorizing Variants of Goodhart's Law","venue":"cs.AI","work_id":"d48b72c4-dc63-4043-8449-5672df8a64fd","year":2018},"citing_paper":{"arxiv_id":"2606.08893","last_updated":"2026-06-08T00:35:54Z","snapshot_observed_at":"2026-08-02T01:17:24.757981Z","submitted_at":"2026-06-08T00:35:54Z","title":"Cheap Reward Hacking Detection","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-06-27T17:21:10.240399Z"},"links":{"cited_paper":"/paper/1803.04585","citing_paper":"/paper/2606.08893"},"observation_digest":"sha256:d702d96f5477675a405dc3f6d023485601aee8ec3f1d6fcabf84b31058fd027a","observation_id":"b89209f8-608c-4713-859f-45358207db56","resolution":{"observed_at":"2026-07-03T00:17:29.175446Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T17:21:10.240399Z","title":"Towards understanding sycophancy in language models","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.08893","last_updated":"2026-06-08T00:35:54Z","snapshot_observed_at":"2026-08-02T01:17:24.757981Z","submitted_at":"2026-06-08T00:35:54Z","title":"Cheap Reward Hacking Detection","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-06-27T17:21:10.240399Z"},"links":{"citing_paper":"/paper/2606.08893"},"observation_digest":"sha256:667b1167e008a502bfdcbc50146262d7d4ec1262d176d361f0fca80a667fc415","observation_id":"443cbe0c-506b-4760-8ced-f122b6570d5e","resolution":{"observed_at":"2026-06-27T17:21:10.240399Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2604.17596","last_updated":"2026-04-19T20:04:02Z","snapshot_observed_at":"2026-08-14T09:00:24.133684Z","submitted_at":"2026-04-19T20:04:02Z","title":"Terminal Wrench: A Dataset of 331 Reward-Hackable Environments and 3,632 Exploit Trajectories","version":1},"cited_work":{"arxiv_id":"2604.17596","doi":null,"metadata_source":"pith","pith_arxiv_id":"2604.17596","snapshot_observed_at":"2026-07-03T00:17:29.169141Z","title":"Terminal Wrench: A Dataset of 331 Reward-Hackable Environments and 3,632 Exploit Trajectories","venue":"cs.CR","work_id":"ade05ec7-e557-4a99-892c-be73d02525d5","year":2026},"citing_paper":{"arxiv_id":"2606.08893","last_updated":"2026-06-08T00:35:54Z","snapshot_observed_at":"2026-08-02T01:17:24.757981Z","submitted_at":"2026-06-08T00:35:54Z","title":"Cheap Reward Hacking Detection","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-06-27T17:21:10.240399Z"},"links":{"cited_paper":"/paper/2604.17596","citing_paper":"/paper/2606.08893"},"observation_digest":"sha256:7237f669a63fc87870f666f50b5cde341da82cdd1e01ce0b98197dfb651cd749","observation_id":"dc3b7ddc-d012-4c3e-89f0-82089c723d66","resolution":{"observed_at":"2026-07-03T00:17:29.170778Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T17:21:10.240399Z","title":"MICo: Improved representations via sampling-based state similarity for Markov decision processes","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2606.08893","last_updated":"2026-06-08T00:35:54Z","snapshot_observed_at":"2026-08-02T01:17:24.757981Z","submitted_at":"2026-06-08T00:35:54Z","title":"Cheap Reward Hacking Detection","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-06-27T17:21:10.240399Z"},"links":{"citing_paper":"/paper/2606.08893"},"observation_digest":"sha256:a82316758806ed3058b270394bc0716d38ee4a277c9c4460f10165855aa7fbe0","observation_id":"639a4d60-33d8-451a-a12a-3787297e5964","resolution":{"observed_at":"2026-06-27T17:21:10.240399Z","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-06-27T17:21:10.240399Z","title":"Sliced and Radon Wasserstein barycenters of measures.Journal of Mathematical Imaging and Vision, 51(1): 22–45, 2015","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2606.08893","last_updated":"2026-06-08T00:35:54Z","snapshot_observed_at":"2026-08-02T01:17:24.757981Z","submitted_at":"2026-06-08T00:35:54Z","title":"Cheap Reward Hacking Detection","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-06-27T17:21:10.240399Z"},"links":{"citing_paper":"/paper/2606.08893"},"observation_digest":"sha256:2dabe9c5935c91e1c58d5a385a8a4edf2cffb02ff68ca4898de2b95cae646e73","observation_id":"1a837e36-267a-4c60-b80e-1eb9aa0e2e2f","resolution":{"observed_at":"2026-06-27T17:21:10.240399Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2606.08893","last_updated":"2026-06-08T00:35:54Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-02T01:17:24.757981Z","submitted_at":"2026-06-08T00:35:54Z","title":"Cheap Reward Hacking Detection"},"reference_resolution":{"displayed":18,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":12,"verified_exact":6,"verified_fuzzy":0},"total_outbound_references":18},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 18 of 18 outbound references and 0 inbound Pith citation observations for arXiv:2606.08893."}