{"as_of":"2026-08-08T21:56:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:627e219c22ff8d6e28eb5ee130bb3f4bc46fd6731ed160a23ae3a1dd059589c2","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":4,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":4,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T12:02:42.910462Z","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-04T00:29:15.134963Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2502.20380","last_updated":"2025-06-27T15:47:52Z","snapshot_observed_at":"2026-08-07T17:41:58.175541Z","submitted_at":"2025-02-27T18:55:05Z","title":"Multi-Turn Code Generation Through Single-Step Rewards","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.20380","snapshot_observed_at":"2026-08-07T12:02:42.910462Z","title":"Multi-turn code generation through single-step rewards","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.00845","last_updated":"2025-08-17T12:17:48Z","snapshot_observed_at":"2026-08-07T16:09:18.251031Z","submitted_at":"2025-06-01T05:39:56Z","title":"Generalizable LLM Learning of Graph Synthetic Data with Post-training Alignment","version":3},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-07T12:02:42.910462Z"},"links":{"cited_paper":"/paper/2502.20380","citing_paper":"/paper/2506.00845"},"observation_digest":"sha256:65b8ffbf7c20b489a09361d571f2d735ee937d9c9487ddfb81d283f814b42861","observation_id":"8d5a76bf-7f5f-43f4-9896-b5edec46eeb9","resolution":{"observed_at":"2026-08-07T12:02:42.910462Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.20380","last_updated":"2025-06-27T15:47:52Z","snapshot_observed_at":"2026-08-07T17:41:58.175541Z","submitted_at":"2025-02-27T18:55:05Z","title":"Multi-Turn Code Generation Through Single-Step Rewards","version":2},"cited_work":{"arxiv_id":"2502.20380","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.20380","snapshot_observed_at":"2026-07-04T00:29:15.134963Z","title":"Multi-turn code generation through single-step rewards.arXiv preprint arXiv:2502.20380","venue":null,"work_id":"e79af7ea-7281-4c9c-964e-1aeb0ee620ae","year":2025},"citing_paper":{"arxiv_id":"2604.27308","last_updated":"2026-04-30T01:43:00Z","snapshot_observed_at":"2026-08-05T18:40:47.957436Z","submitted_at":"2026-04-30T01:43:00Z","title":"BoostLoRA: Growing Effective Rank by Boosting Adapters","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-05-07T08:00:21.048408Z"},"links":{"cited_paper":"/paper/2502.20380","citing_paper":"/paper/2604.27308"},"observation_digest":"sha256:478d60e3340146dfb9195ae7de817b80a51cd24ce4cfc80c0344a6a0a302d61d","observation_id":"b42d15cd-5214-4e6e-b9b9-b008808cd982","resolution":{"observed_at":"2026-05-12T10:06:27.723433Z","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":"2502.20380","last_updated":"2025-06-27T15:47:52Z","snapshot_observed_at":"2026-08-07T17:41:58.175541Z","submitted_at":"2025-02-27T18:55:05Z","title":"Multi-Turn Code Generation Through Single-Step Rewards","version":2},"cited_work":{"arxiv_id":"2502.20380","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.20380","snapshot_observed_at":"2026-07-04T00:29:15.134963Z","title":"Multi-turn code generation through single-step rewards.arXiv preprint arXiv:2502.20380","venue":null,"work_id":"e79af7ea-7281-4c9c-964e-1aeb0ee620ae","year":2025},"citing_paper":{"arxiv_id":"2605.17174","last_updated":"2026-05-16T22:18:04Z","snapshot_observed_at":"2026-08-02T13:33:29.826456Z","submitted_at":"2026-05-16T22:18:04Z","title":"Beyond Execution: Static-Analysis Rewards and Hint-Conditioned Diffusion RL for Code Generation","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-20T14:03:45.869373Z"},"links":{"cited_paper":"/paper/2502.20380","citing_paper":"/paper/2605.17174"},"observation_digest":"sha256:90e3b4c1a76b6c9d73a3db7317097d0d472946a65f2a13e16d0a809fdb7e8d28","observation_id":"cbc27763-cf5b-4986-b8be-c19188a9a2e4","resolution":{"observed_at":"2026-05-20T14:08:21.247702Z","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":"2502.20380","last_updated":"2025-06-27T15:47:52Z","snapshot_observed_at":"2026-08-07T17:41:58.175541Z","submitted_at":"2025-02-27T18:55:05Z","title":"Multi-Turn Code Generation Through Single-Step Rewards","version":2},"cited_work":{"arxiv_id":"2502.20380","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.20380","snapshot_observed_at":"2026-07-04T00:29:15.134963Z","title":"Multi-turn code generation through single-step rewards.arXiv preprint arXiv:2502.20380","venue":null,"work_id":"e79af7ea-7281-4c9c-964e-1aeb0ee620ae","year":2025},"citing_paper":{"arxiv_id":"2606.18910","last_updated":"2026-06-17T10:37:23Z","snapshot_observed_at":"2026-08-02T21:25:42.997753Z","submitted_at":"2026-06-17T10:37:23Z","title":"REVES: REvision and VErification--Augmented Training for Test-Time Scaling","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-06-26T21:14:15.337979Z"},"links":{"cited_paper":"/paper/2502.20380","citing_paper":"/paper/2606.18910"},"observation_digest":"sha256:8d4324513e516a849a36a7b6c19921801aa40ad884589d4f3b51ffd184cd3d43","observation_id":"1c592372-9c75-4d88-9e87-57660607199b","resolution":{"observed_at":"2026-07-04T00:29:15.137334Z","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"}}],"links":{"evidence":"/evidence","html":"/paper/2502.20380/citation-record","integrity":"/paper/2502.20380/integrity","json":"/paper/2502.20380/citation-record.json","paper":"/paper/2502.20380"},"outbound":[],"paper":{"arxiv_id":"2502.20380","last_updated":"2025-06-27T15:47:52Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-07T17:41:58.175541Z","submitted_at":"2025-02-27T18:55:05Z","title":"Multi-Turn Code Generation Through Single-Step Rewards"},"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 4 inbound Pith citation observations for arXiv:2502.20380."}