{"as_of":"2026-08-15T12:42:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:881e2357fe88688b3b80144e9841aa224338e27d23f3985066574e4095535314","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":8,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":8,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-15T06:32:42.880941+00:00","state":"measured"},{"denominator":8,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":8,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T16:10:15.160284Z","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-01T20:56:13.361747Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2505.17063","last_updated":"2025-05-18T05:35:13Z","snapshot_observed_at":"2026-08-14T06:29:01.624729Z","submitted_at":"2025-05-18T05:35:13Z","title":"Synthetic Data RL: Task Definition Is All You Need","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.17063","snapshot_observed_at":"2026-08-06T16:10:15.160284Z","title":"Synthetic data rl: Task definition is all you need","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2507.14447","last_updated":"2025-07-22T10:01:32Z","snapshot_observed_at":"2026-08-15T09:05:49.263600Z","submitted_at":"2025-07-19T02:46:19Z","title":"Routine: A Structural Planning Framework for LLM Agent System in Enterprise","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-06T16:10:15.160284Z"},"links":{"cited_paper":"/paper/2505.17063","citing_paper":"/paper/2507.14447"},"observation_digest":"sha256:8e4fe825de9172c0f9f812aef09afd7d0f93a6f9b8c1c0c3ff725e12a602e759","observation_id":"f1ed5885-b819-4dcc-9787-d2ae736e12dc","resolution":{"observed_at":"2026-08-06T16:10:15.160284Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.17063","last_updated":"2025-05-18T05:35:13Z","snapshot_observed_at":"2026-08-14T06:29:01.624729Z","submitted_at":"2025-05-18T05:35:13Z","title":"Synthetic Data RL: Task Definition Is All You Need","version":1},"cited_work":{"arxiv_id":"2505.17063","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2505.17063","snapshot_observed_at":"2026-07-01T20:56:13.361747Z","title":"Synthetic data rl: Task definition is all you need","venue":null,"work_id":"73704596-4394-43a1-98e7-403ed211ca20","year":2025},"citing_paper":{"arxiv_id":"2509.02547","last_updated":"2026-04-17T18:09:08Z","snapshot_observed_at":"2026-08-03T09:07:42.489237Z","submitted_at":"2025-09-02T17:46:26Z","title":"The Landscape of Agentic Reinforcement Learning for LLMs: A Survey","version":5},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-18T19:19:36.427337Z"},"links":{"cited_paper":"/paper/2505.17063","citing_paper":"/paper/2509.02547"},"observation_digest":"sha256:cbdcf0dbe2209553dd29b321f8cffe61ff3cb7a3383560e8bb1f76b7cbf87503","observation_id":"974982fd-1f54-4684-bc3f-518d10cee338","resolution":{"observed_at":"2026-05-18T19:21:48.858237Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.17063","last_updated":"2025-05-18T05:35:13Z","snapshot_observed_at":"2026-08-14T06:29:01.624729Z","submitted_at":"2025-05-18T05:35:13Z","title":"Synthetic Data RL: Task Definition Is All You Need","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.17063","snapshot_observed_at":"2026-08-04T16:07:29.655928Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.16679","last_updated":"2025-09-20T13:11:28Z","snapshot_observed_at":"2026-08-14T21:41:31.710262Z","submitted_at":"2025-09-20T13:11:28Z","title":"Reinforcement Learning Meets Large Language Models: A Survey of Advancements and Applications Across the LLM Lifecycle","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-04T16:07:29.655928Z"},"links":{"cited_paper":"/paper/2505.17063","citing_paper":"/paper/2509.16679"},"observation_digest":"sha256:4e1c1219c9485fe1ef22e637c48b4cd7730258ca992fb7c3c270f63f39f4372d","observation_id":"e9aff45a-0e39-4acf-9076-ba84fa7fa73c","resolution":{"observed_at":"2026-08-04T16:07:29.655928Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.17063","last_updated":"2025-05-18T05:35:13Z","snapshot_observed_at":"2026-08-14T06:29:01.624729Z","submitted_at":"2025-05-18T05:35:13Z","title":"Synthetic Data RL: Task Definition Is All You Need","version":1},"cited_work":{"arxiv_id":"2505.17063","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2505.17063","snapshot_observed_at":"2026-07-01T20:56:13.361747Z","title":"Synthetic data rl: Task definition is all you need","venue":null,"work_id":"73704596-4394-43a1-98e7-403ed211ca20","year":2025},"citing_paper":{"arxiv_id":"2511.09907","last_updated":"2026-05-08T08:34:38Z","snapshot_observed_at":"2026-07-06T22:35:41.533403Z","submitted_at":"2025-11-13T03:08:51Z","title":"Learning to Pose Problems: Reasoning-Driven and Solver-Adaptive Data Synthesis","version":5},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-17T22:59:48.260121Z"},"links":{"cited_paper":"/paper/2505.17063","citing_paper":"/paper/2511.09907"},"observation_digest":"sha256:5f7e6a1ec2d70a018185804914fa99354ec28548b0be3434a844791bed8e85c9","observation_id":"7f9af066-a144-4ba4-a756-72dbbcdb5828","resolution":{"observed_at":"2026-05-17T23:00:25.524260Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.17063","last_updated":"2025-05-18T05:35:13Z","snapshot_observed_at":"2026-08-14T06:29:01.624729Z","submitted_at":"2025-05-18T05:35:13Z","title":"Synthetic Data RL: Task Definition Is All You Need","version":1},"cited_work":{"arxiv_id":"2505.17063","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2505.17063","snapshot_observed_at":"2026-07-01T20:56:13.361747Z","title":"Synthetic data rl: Task definition is all you need","venue":null,"work_id":"73704596-4394-43a1-98e7-403ed211ca20","year":2025},"citing_paper":{"arxiv_id":"2601.04809","last_updated":"2026-05-04T13:55:24Z","snapshot_observed_at":"2026-08-14T00:52:49.914352Z","submitted_at":"2026-01-08T10:42:04Z","title":"SCALER:Synthetic Scalable Adaptive Learning Environment for Reasoning","version":5},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-16T16:24:04.132572Z"},"links":{"cited_paper":"/paper/2505.17063","citing_paper":"/paper/2601.04809"},"observation_digest":"sha256:bc53ff86ebdb55c72d5be362d57d0c33120ed682033feb79f2fa0f74632d9977","observation_id":"c7db921e-29da-4d4f-9e56-27c6397a1989","resolution":{"observed_at":"2026-05-16T16:28:05.665983Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.17063","last_updated":"2025-05-18T05:35:13Z","snapshot_observed_at":"2026-08-14T06:29:01.624729Z","submitted_at":"2025-05-18T05:35:13Z","title":"Synthetic Data RL: Task Definition Is All You Need","version":1},"cited_work":{"arxiv_id":"2505.17063","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2505.17063","snapshot_observed_at":"2026-07-01T20:56:13.361747Z","title":"Synthetic data rl: Task definition is all you need","venue":null,"work_id":"73704596-4394-43a1-98e7-403ed211ca20","year":2025},"citing_paper":{"arxiv_id":"2605.08138","last_updated":"2026-05-02T05:37:58Z","snapshot_observed_at":"2026-08-11T15:30:00.924149Z","submitted_at":"2026-05-02T05:37:58Z","title":"DataArc-SynData-Toolkit: A Unified Closed-Loop Framework for Multi-Path, Multimodal, and Multilingual Data Synthesis","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-05-12T02:40:13.547881Z"},"links":{"cited_paper":"/paper/2505.17063","citing_paper":"/paper/2605.08138"},"observation_digest":"sha256:7a1543cbc47805f7aed1690379ee47a21cbf5d4a91b5ee965c7add31a89812b3","observation_id":"728190bc-6402-4fb4-b239-173e01d4fd5f","resolution":{"observed_at":"2026-05-12T02:41:17.485825Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.17063","last_updated":"2025-05-18T05:35:13Z","snapshot_observed_at":"2026-08-14T06:29:01.624729Z","submitted_at":"2025-05-18T05:35:13Z","title":"Synthetic Data RL: Task Definition Is All You Need","version":1},"cited_work":{"arxiv_id":"2505.17063","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2505.17063","snapshot_observed_at":"2026-07-01T20:56:13.361747Z","title":"Synthetic data rl: Task definition is all you need","venue":null,"work_id":"73704596-4394-43a1-98e7-403ed211ca20","year":2025},"citing_paper":{"arxiv_id":"2605.31238","last_updated":"2026-05-29T12:39:03Z","snapshot_observed_at":"2026-08-09T08:17:18.379552Z","submitted_at":"2026-05-29T12:39:03Z","title":"Scaling Multi-Hop Training Data via Graph-Constrained Path Selection","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-06-28T22:26:03.073002Z"},"links":{"cited_paper":"/paper/2505.17063","citing_paper":"/paper/2605.31238"},"observation_digest":"sha256:ef5a3c6b5f9fe7134c16fd06079ee9a6a65cbd74ace11a52b477322298ce2ce3","observation_id":"7b555c43-706d-459b-97ad-bbaefd98321b","resolution":{"observed_at":"2026-06-28T22:32:44.586800Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.17063","last_updated":"2025-05-18T05:35:13Z","snapshot_observed_at":"2026-08-14T06:29:01.624729Z","submitted_at":"2025-05-18T05:35:13Z","title":"Synthetic Data RL: Task Definition Is All You Need","version":1},"cited_work":{"arxiv_id":"2505.17063","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2505.17063","snapshot_observed_at":"2026-07-01T20:56:13.361747Z","title":"Synthetic data rl: Task definition is all you need","venue":null,"work_id":"73704596-4394-43a1-98e7-403ed211ca20","year":2025},"citing_paper":{"arxiv_id":"2606.01249","last_updated":"2026-06-17T04:44:10Z","snapshot_observed_at":"2026-08-12T03:28:30.781632Z","submitted_at":"2026-05-31T14:04:51Z","title":"Trust Region On-Policy Distillation","version":3},"reference_index":238,"source":"arxiv_source","source_observed_at":"2026-06-28T17:38:50.313305Z"},"links":{"cited_paper":"/paper/2505.17063","citing_paper":"/paper/2606.01249"},"observation_digest":"sha256:2354355094d5d603135764bead8fae8ebadd12e23448a03a1933178187dd5655","observation_id":"362495bb-2095-4405-8ddb-1d7fca3075bc","resolution":{"observed_at":"2026-07-01T20:56:13.363404Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2505.17063/citation-record","integrity":"/paper/2505.17063/integrity","json":"/paper/2505.17063/citation-record.json","paper":"/paper/2505.17063"},"outbound":[],"paper":{"arxiv_id":"2505.17063","last_updated":"2025-05-18T05:35:13Z","latest_version":1,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-14T06:29:01.624729Z","submitted_at":"2025-05-18T05:35:13Z","title":"Synthetic Data RL: Task Definition Is All You Need"},"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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 8 inbound Pith citation observations for arXiv:2505.17063."}