{"as_of":"2026-08-09T14:13:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:673300ceb0f45e546ea1858639f37570551e583d9c172b5808b4b5a9bcaf057f","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-09T06:31:02.800959+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-07T11:31:54.286136Z","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-06-30T12:44:40.230064Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2502.01715","last_updated":"2025-02-03T16:22:06Z","snapshot_observed_at":"2026-07-06T20:30:31.588538Z","submitted_at":"2025-02-03T16:22:06Z","title":"Process-Supervised Reinforcement Learning for Code Generation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.01715","snapshot_observed_at":"2026-08-07T11:31:54.286136Z","title":"PRLCoder: Leveraging Process-Supervised Reinforcement Learning to Enhance Code Generation","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.02211","last_updated":"2025-06-02T19:50:16Z","snapshot_observed_at":"2026-08-07T11:26:06.598387Z","submitted_at":"2025-06-02T19:50:16Z","title":"Improving LLM-Generated Code Quality with GRPO","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T11:31:54.286136Z"},"links":{"cited_paper":"/paper/2502.01715","citing_paper":"/paper/2506.02211"},"observation_digest":"sha256:bfc04304ab30462118dd36ec38724d772bde3893fc1229826a54ad71d5e16d54","observation_id":"18e4674b-e365-46e7-8ec7-e59fadbb27af","resolution":{"observed_at":"2026-08-07T11:31:54.286136Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.01715","last_updated":"2025-02-03T16:22:06Z","snapshot_observed_at":"2026-07-06T20:30:31.588538Z","submitted_at":"2025-02-03T16:22:06Z","title":"Process-Supervised Reinforcement Learning for Code Generation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.01715","snapshot_observed_at":"2026-08-06T15:24:25.819837Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2507.16864","last_updated":"2025-07-21T21:59:05Z","snapshot_observed_at":"2026-08-07T08:20:45.010409Z","submitted_at":"2025-07-21T21:59:05Z","title":"Reinforcement Learning in hyperbolic space for multi-step reasoning","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-06T15:24:25.819837Z"},"links":{"cited_paper":"/paper/2502.01715","citing_paper":"/paper/2507.16864"},"observation_digest":"sha256:4b14b27f54215ec39d4fb13d7db7efe90e49414725473daa1d7ac34399cecbad","observation_id":"aaffbf05-6329-479d-bf10-f10098639611","resolution":{"observed_at":"2026-08-06T15:24:25.819837Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.01715","last_updated":"2025-02-03T16:22:06Z","snapshot_observed_at":"2026-07-06T20:30:31.588538Z","submitted_at":"2025-02-03T16:22:06Z","title":"Process-Supervised Reinforcement Learning for Code Generation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.01715","snapshot_observed_at":"2026-08-03T23:27:38.089096Z","title":"Process-supervised reinforcement learning for code generation","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2511.05933","last_updated":"2026-06-24T14:20:52Z","snapshot_observed_at":"2026-08-07T19:34:44.238702Z","submitted_at":"2025-11-08T08:56:29Z","title":"Reinforcement Learning Improves Traversal of Parametric Knowledge in LLMs","version":2},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-03T23:27:38.089096Z"},"links":{"cited_paper":"/paper/2502.01715","citing_paper":"/paper/2511.05933"},"observation_digest":"sha256:ef77f089f27ab72c1d28f2c91b2fa5e28355fb40fda374dee4f613326d6f20e4","observation_id":"1ebf6c85-9541-44f4-ba5d-45ae9cf8dc64","resolution":{"observed_at":"2026-08-03T23:27:38.089096Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.01715","last_updated":"2025-02-03T16:22:06Z","snapshot_observed_at":"2026-07-06T20:30:31.588538Z","submitted_at":"2025-02-03T16:22:06Z","title":"Process-Supervised Reinforcement Learning for Code Generation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.01715","snapshot_observed_at":"2026-08-03T12:19:35.177823Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2601.03525","last_updated":"2026-05-26T16:39:06Z","snapshot_observed_at":"2026-08-06T03:27:45.707151Z","submitted_at":"2026-01-07T02:29:49Z","title":"Beyond Binary: Turning Partial Success into Dense Verifiable Rewards for Reinforcement Learning in Code Generation","version":3},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-03T12:19:35.177823Z"},"links":{"cited_paper":"/paper/2502.01715","citing_paper":"/paper/2601.03525"},"observation_digest":"sha256:e69d498ac1fd9939a0a19f54b9cd535f8ac8e46006cc83a4732976bf016e6af7","observation_id":"862d71d8-3201-45e2-a169-e6611ec11551","resolution":{"observed_at":"2026-08-03T12:19:35.177823Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.01715","last_updated":"2025-02-03T16:22:06Z","snapshot_observed_at":"2026-07-06T20:30:31.588538Z","submitted_at":"2025-02-03T16:22:06Z","title":"Process-Supervised Reinforcement Learning for Code Generation","version":1},"cited_work":{"arxiv_id":"2502.01715","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.01715","snapshot_observed_at":"2026-06-30T12:44:40.230064Z","title":"arXiv preprint arXiv:2502.01715 , year=","venue":null,"work_id":"cb4abcb3-63bf-4564-9b7f-887a01f9163e","year":2025},"citing_paper":{"arxiv_id":"2604.01799","last_updated":"2026-04-17T04:26:54Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-04-02T09:13:52Z","title":"TestDecision: Sequential Test Suite Generation via Greedy Optimization and Reinforcement Learning","version":2},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-05-13T21:36:14.478007Z"},"links":{"cited_paper":"/paper/2502.01715","citing_paper":"/paper/2604.01799"},"observation_digest":"sha256:13f548eacc76739cd3f76c9d719f4e03ecf19ea3ef53542291316a1b0836bdcb","observation_id":"e0374b31-8d81-4623-8e1e-6d44d37a3bfb","resolution":{"observed_at":"2026-05-13T21:38:18.788744Z","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":"2502.01715","last_updated":"2025-02-03T16:22:06Z","snapshot_observed_at":"2026-07-06T20:30:31.588538Z","submitted_at":"2025-02-03T16:22:06Z","title":"Process-Supervised Reinforcement Learning for Code Generation","version":1},"cited_work":{"arxiv_id":"2502.01715","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.01715","snapshot_observed_at":"2026-06-30T12:44:40.230064Z","title":"arXiv preprint arXiv:2502.01715 , year=","venue":null,"work_id":"cb4abcb3-63bf-4564-9b7f-887a01f9163e","year":2025},"citing_paper":{"arxiv_id":"2605.04065","last_updated":"2026-05-07T04:49:30Z","snapshot_observed_at":"2026-07-06T23:16:54.673178Z","submitted_at":"2026-04-11T07:26:04Z","title":"Free Energy-Driven Reinforcement Learning with Adaptive Advantage Shaping for Unsupervised Reasoning in LLMs","version":2},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-05-10T16:58:10.013475Z"},"links":{"cited_paper":"/paper/2502.01715","citing_paper":"/paper/2605.04065"},"observation_digest":"sha256:618b028a46f06a98e090e31e03923a0478a38eba25dde291a5b66af2cf7bdce9","observation_id":"6a3feea1-6dfe-49be-aa00-6b9d94158540","resolution":{"observed_at":"2026-05-11T07:45:59.984342Z","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":"2502.01715","last_updated":"2025-02-03T16:22:06Z","snapshot_observed_at":"2026-07-06T20:30:31.588538Z","submitted_at":"2025-02-03T16:22:06Z","title":"Process-Supervised Reinforcement Learning for Code Generation","version":1},"cited_work":{"arxiv_id":"2502.01715","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.01715","snapshot_observed_at":"2026-06-30T12:44:40.230064Z","title":"arXiv preprint arXiv:2502.01715 , year=","venue":null,"work_id":"cb4abcb3-63bf-4564-9b7f-887a01f9163e","year":2025},"citing_paper":{"arxiv_id":"2605.04066","last_updated":"2026-05-07T04:57:40Z","snapshot_observed_at":"2026-08-02T15:49:26.057284Z","submitted_at":"2026-04-11T07:34:59Z","title":"Adapt to Thrive! Adaptive Power-Mean Policy Optimization for Improved LLM Reasoning","version":2},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-05-10T16:51:19.555272Z"},"links":{"cited_paper":"/paper/2502.01715","citing_paper":"/paper/2605.04066"},"observation_digest":"sha256:95fb4404d136f5aa2c4a3eb30eac42dc6d4feab87da94d022c12849c4cb72326","observation_id":"cd0ae5ae-5a2c-43c2-abbf-20c4a72c161e","resolution":{"observed_at":"2026-05-11T08:01:00.233468Z","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":"2502.01715","last_updated":"2025-02-03T16:22:06Z","snapshot_observed_at":"2026-07-06T20:30:31.588538Z","submitted_at":"2025-02-03T16:22:06Z","title":"Process-Supervised Reinforcement Learning for Code Generation","version":1},"cited_work":{"arxiv_id":"2502.01715","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.01715","snapshot_observed_at":"2026-06-30T12:44:40.230064Z","title":"arXiv preprint arXiv:2502.01715 , year=","venue":null,"work_id":"cb4abcb3-63bf-4564-9b7f-887a01f9163e","year":2025},"citing_paper":{"arxiv_id":"2605.29697","last_updated":"2026-05-28T09:57:12Z","snapshot_observed_at":"2026-08-05T09:39:33.107372Z","submitted_at":"2026-05-28T09:57:12Z","title":"Beyond Trajectory Rewards: Step-level Credit Assignment for Agentic Search via Graph Modeling","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-06-29T07:58:55.548382Z"},"links":{"cited_paper":"/paper/2502.01715","citing_paper":"/paper/2605.29697"},"observation_digest":"sha256:65e333c1c14bf0c24b462d194068a97383ab4339a4d65105196827ebedf8bc62","observation_id":"1d03fe18-37d5-47bd-8db7-482b1e88f803","resolution":{"observed_at":"2026-06-29T08:03:14.288936Z","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":"2502.01715","last_updated":"2025-02-03T16:22:06Z","snapshot_observed_at":"2026-07-06T20:30:31.588538Z","submitted_at":"2025-02-03T16:22:06Z","title":"Process-Supervised Reinforcement Learning for Code Generation","version":1},"cited_work":{"arxiv_id":"2502.01715","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.01715","snapshot_observed_at":"2026-06-30T12:44:40.230064Z","title":"arXiv preprint arXiv:2502.01715 , year=","venue":null,"work_id":"cb4abcb3-63bf-4564-9b7f-887a01f9163e","year":2025},"citing_paper":{"arxiv_id":"2606.28707","last_updated":"2026-06-27T03:25:53Z","snapshot_observed_at":"2026-07-07T00:02:47.924620Z","submitted_at":"2026-06-27T03:25:53Z","title":"BV-Blend: Uncertainty-Weighted Historical Baselines for Stable Critic-Free RL with Verifiable Rewards","version":1},"reference_index":105,"source":"arxiv_source","source_observed_at":"2026-06-30T10:07:39.554999Z"},"links":{"cited_paper":"/paper/2502.01715","citing_paper":"/paper/2606.28707"},"observation_digest":"sha256:de69be60fa5497493912c164c0256107c3b3b54117b2ab900db8617226397b7e","observation_id":"fae0bdb1-6d17-4048-8adb-07a787463b99","resolution":{"observed_at":"2026-06-30T12:44:40.231715Z","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"}}],"links":{"evidence":"/evidence","html":"/paper/2502.01715/citation-record","integrity":"/paper/2502.01715/integrity","json":"/paper/2502.01715/citation-record.json","paper":"/paper/2502.01715"},"outbound":[],"paper":{"arxiv_id":"2502.01715","last_updated":"2025-02-03T16:22:06Z","latest_version":1,"primary_category":"cs.SE","snapshot_observed_at":"2026-07-06T20:30:31.588538Z","submitted_at":"2025-02-03T16:22:06Z","title":"Process-Supervised Reinforcement Learning for Code Generation"},"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 9 inbound Pith citation observations for arXiv:2502.01715."}