{"as_of":"2026-08-09T11:48:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a981f7981bdcd0cde4917a267fed11796bcbde82cfb9dc9c99306b1ecc0bb810","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-09T06:31:02.800959+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:35:54.275667Z","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-03T20:38:55.982366Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2503.19618","last_updated":"2025-05-28T14:42:09Z","snapshot_observed_at":"2026-08-07T16:38:29.183974Z","submitted_at":"2025-03-25T13:03:09Z","title":"Beyond Verifiable Rewards: Scaling Reinforcement Learning for Language Models to Unverifiable Data","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.19618","snapshot_observed_at":"2026-08-07T13:35:54.275667Z","title":"Learning to chain-of-thought with jensen’s evidence lower bound.arXiv preprint arXiv:2503.19618, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.21493","last_updated":"2025-05-27T17:56:27Z","snapshot_observed_at":"2026-08-07T21:57:36.964068Z","submitted_at":"2025-05-27T17:56:27Z","title":"Reinforcing General Reasoning without Verifiers","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-07T13:35:54.275667Z"},"links":{"cited_paper":"/paper/2503.19618","citing_paper":"/paper/2505.21493"},"observation_digest":"sha256:07cb2fea3e9d17a69ef3e3f3320c2395f7d0da8863e8c95de07ff207b59b6582","observation_id":"c5e30f52-8d0b-4008-a8f2-fc41b25e47ad","resolution":{"observed_at":"2026-08-07T13:35:54.275667Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.19618","last_updated":"2025-05-28T14:42:09Z","snapshot_observed_at":"2026-08-07T16:38:29.183974Z","submitted_at":"2025-03-25T13:03:09Z","title":"Beyond Verifiable Rewards: Scaling Reinforcement Learning for Language Models to Unverifiable Data","version":2},"cited_work":{"arxiv_id":"2503.19618","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2503.19618","snapshot_observed_at":"2026-07-03T20:38:55.982366Z","title":"Beyond Verifiable Rewards: Scaling Reinforcement Learning in Language Models to Unverifiable Data","venue":null,"work_id":"03ad91b0-bdfa-4379-ba78-275537609db4","year":2025},"citing_paper":{"arxiv_id":"2506.13351","last_updated":"2026-05-07T20:19:13Z","snapshot_observed_at":"2026-07-31T17:48:52.945760Z","submitted_at":"2025-06-16T10:43:38Z","title":"Direct Reasoning Optimization: Token-Level Reasoning Reflectivity Meets Rubric Gates for Unverifiable Tasks","version":3},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-05-19T09:48:56.990745Z"},"links":{"cited_paper":"/paper/2503.19618","citing_paper":"/paper/2506.13351"},"observation_digest":"sha256:650aca85f301a37c8a84e1ac0c38262f6c86fa7f6fe1f96be122fe5a6c695c00","observation_id":"ed179084-8be9-4cb2-abeb-95217cf7a310","resolution":{"observed_at":"2026-05-19T09:52:14.141843Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2503.19618","last_updated":"2025-05-28T14:42:09Z","snapshot_observed_at":"2026-08-07T16:38:29.183974Z","submitted_at":"2025-03-25T13:03:09Z","title":"Beyond Verifiable Rewards: Scaling Reinforcement Learning for Language Models to Unverifiable Data","version":2},"cited_work":{"arxiv_id":"2503.19618","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2503.19618","snapshot_observed_at":"2026-07-03T20:38:55.982366Z","title":"Beyond Verifiable Rewards: Scaling Reinforcement Learning in Language Models to Unverifiable Data","venue":null,"work_id":"03ad91b0-bdfa-4379-ba78-275537609db4","year":2025},"citing_paper":{"arxiv_id":"2509.14234","last_updated":"2026-05-09T12:06:02Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-09-17T17:59:42Z","title":"Compute as Teacher: Turning Inference Compute Into Reference-Free Supervision","version":3},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-05-18T15:45:09.730804Z"},"links":{"cited_paper":"/paper/2503.19618","citing_paper":"/paper/2509.14234"},"observation_digest":"sha256:73992b9ba2606074266ea99c5645082b6ef23da8b99a37917fcbee8488adafce","observation_id":"163a6772-576c-499a-86c3-32ddb7dde046","resolution":{"observed_at":"2026-05-18T15:46:34.079688Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2503.19618","last_updated":"2025-05-28T14:42:09Z","snapshot_observed_at":"2026-08-07T16:38:29.183974Z","submitted_at":"2025-03-25T13:03:09Z","title":"Beyond Verifiable Rewards: Scaling Reinforcement Learning for Language Models to Unverifiable Data","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.19618","snapshot_observed_at":"2026-08-03T16:43:57.074776Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2512.12576","last_updated":"2026-05-23T02:48:11Z","snapshot_observed_at":"2026-08-07T00:51:43.825252Z","submitted_at":"2025-12-14T07:03:51Z","title":"Coupled Variational Reinforcement Learning for Language Model General Reasoning","version":3},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-03T16:43:57.074776Z"},"links":{"cited_paper":"/paper/2503.19618","citing_paper":"/paper/2512.12576"},"observation_digest":"sha256:a6166fb208bd0a0c5ba210fc83b17a245010c8e6156343117ed08c118e95addf","observation_id":"9793575a-5edd-46e4-a648-7609fd8e5b4f","resolution":{"observed_at":"2026-08-03T16:43:57.074776Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.19618","last_updated":"2025-05-28T14:42:09Z","snapshot_observed_at":"2026-08-07T16:38:29.183974Z","submitted_at":"2025-03-25T13:03:09Z","title":"Beyond Verifiable Rewards: Scaling Reinforcement Learning for Language Models to Unverifiable Data","version":2},"cited_work":{"arxiv_id":"2503.19618","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2503.19618","snapshot_observed_at":"2026-07-03T20:38:55.982366Z","title":"Beyond Verifiable Rewards: Scaling Reinforcement Learning in Language Models to Unverifiable Data","venue":null,"work_id":"03ad91b0-bdfa-4379-ba78-275537609db4","year":2025},"citing_paper":{"arxiv_id":"2604.10110","last_updated":"2026-04-11T09:08:27Z","snapshot_observed_at":"2026-07-06T22:58:47.599383Z","submitted_at":"2026-04-11T09:08:27Z","title":"Trust Your Memory: Verifiable Control of Smart Homes through Reinforcement Learning with Multi-dimensional Rewards","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-10T16:49:00.343580Z"},"links":{"cited_paper":"/paper/2503.19618","citing_paper":"/paper/2604.10110"},"observation_digest":"sha256:b7564927da9386ed694cd1fd1edf9c6c05da5953fc1c7fe6711016cb73ddb451","observation_id":"ac37b85a-00d4-4752-a6e6-1bca5813bced","resolution":{"observed_at":"2026-05-11T08:06:01.140815Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2503.19618","last_updated":"2025-05-28T14:42:09Z","snapshot_observed_at":"2026-08-07T16:38:29.183974Z","submitted_at":"2025-03-25T13:03:09Z","title":"Beyond Verifiable Rewards: Scaling Reinforcement Learning for Language Models to Unverifiable Data","version":2},"cited_work":{"arxiv_id":"2503.19618","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2503.19618","snapshot_observed_at":"2026-07-03T20:38:55.982366Z","title":"Beyond Verifiable Rewards: Scaling Reinforcement Learning in Language Models to Unverifiable Data","venue":null,"work_id":"03ad91b0-bdfa-4379-ba78-275537609db4","year":2025},"citing_paper":{"arxiv_id":"2605.10810","last_updated":"2026-05-15T15:01:38Z","snapshot_observed_at":"2026-08-01T14:39:13.243144Z","submitted_at":"2026-05-11T16:32:06Z","title":"Likelihood scoring for continuations of mathematical text: a self-supervised benchmark with tests for shortcut vulnerabilities","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-05-19T17:20:39.969447Z"},"links":{"cited_paper":"/paper/2503.19618","citing_paper":"/paper/2605.10810"},"observation_digest":"sha256:6246570c122ceb235884b093fe038f8025a59651568db8ee5ebffb2d33d732a1","observation_id":"4f3fdcbb-411b-4dd3-b2fa-138136a6315d","resolution":{"observed_at":"2026-05-19T17:22:41.904395Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2503.19618","last_updated":"2025-05-28T14:42:09Z","snapshot_observed_at":"2026-08-07T16:38:29.183974Z","submitted_at":"2025-03-25T13:03:09Z","title":"Beyond Verifiable Rewards: Scaling Reinforcement Learning for Language Models to Unverifiable Data","version":2},"cited_work":{"arxiv_id":"2503.19618","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2503.19618","snapshot_observed_at":"2026-07-03T20:38:55.982366Z","title":"Beyond Verifiable Rewards: Scaling Reinforcement Learning in Language Models to Unverifiable Data","venue":null,"work_id":"03ad91b0-bdfa-4379-ba78-275537609db4","year":2025},"citing_paper":{"arxiv_id":"2606.18089","last_updated":"2026-07-05T17:40:26Z","snapshot_observed_at":"2026-07-12T13:34:39.011240Z","submitted_at":"2026-06-16T15:55:28Z","title":"From Reasoning Traces to Reusable Modules: Understanding Compositional Generalization in Language Model Reasoning","version":1},"reference_index":63,"source":"arxiv_source","source_observed_at":"2026-06-27T01:13:11.483599Z"},"links":{"cited_paper":"/paper/2503.19618","citing_paper":"/paper/2606.18089"},"observation_digest":"sha256:aaa4399824a0975769db46def5ebd493ae20e1bc68af61cb775853b405c7664f","observation_id":"98a01425-21af-4464-8e2a-77a6619d7ce1","resolution":{"observed_at":"2026-07-03T20:38:55.983717Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2503.19618/citation-record","integrity":"/paper/2503.19618/integrity","json":"/paper/2503.19618/citation-record.json","paper":"/paper/2503.19618"},"outbound":[],"paper":{"arxiv_id":"2503.19618","last_updated":"2025-05-28T14:42:09Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-07T16:38:29.183974Z","submitted_at":"2025-03-25T13:03:09Z","title":"Beyond Verifiable Rewards: Scaling Reinforcement Learning for Language Models to Unverifiable Data"},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 7 inbound Pith citation observations for arXiv:2503.19618."}