{"as_of":"2026-08-12T07:42:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ca74962c0b55dc6d2bb59c7f4451c7fc100e2e8368c4847f42154b5520521f45","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-12T06:34:41.77262+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-02T03:01:41.653988Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":1,"source":"arxiv_reference","source_observed_at":"2026-08-05T02:28:24.338817Z","state":"measured"}],"external_citation_measurements":[{"count":0,"observed_at":"2026-08-05T02:28:24.338817Z","source":"arxiv_reference"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2503.02382","last_updated":"2025-07-23T07:19:41Z","snapshot_observed_at":"2026-08-08T14:45:40.984426Z","submitted_at":"2025-03-04T08:18:46Z","title":"An Efficient and Precise Training Data Construction Framework for Process-supervised Reward Model in Mathematical Reasoning","version":2},"cited_work":{"arxiv_id":"2503.02382","doi":"10.48550/arxiv.2503.02382","metadata_source":"arxiv_reference","pith_arxiv_id":"2503.02382","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"An efficient and precise training data construc- tion framework for process-supervised reward model in mathematical reasoning.arXiv preprint arXiv:2503.02382, 2025a","venue":"ArXiv.org","work_id":"437199d2-89e6-444d-9709-abf5c3941270","year":2025},"citing_paper":{"arxiv_id":"2510.10649","last_updated":"2026-04-16T14:51:36Z","snapshot_observed_at":"2026-07-06T22:32:27.698678Z","submitted_at":"2025-10-12T15:06:53Z","title":"Unlocking Exploration in RLVR: Uncertainty-aware Advantage Shaping for Deeper Reasoning","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-18T07:20:01.505216Z"},"links":{"cited_paper":"/paper/2503.02382","citing_paper":"/paper/2510.10649"},"observation_digest":"sha256:844bd46ad7b5eec488b3c05f3bc56e6dcf124f67276658538d20aef2fcd5548b","observation_id":"6384c430-559b-40ec-b5c6-3138d9824478","resolution":{"observed_at":"2026-05-18T07:21:04.401137Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2503.02382","last_updated":"2025-07-23T07:19:41Z","snapshot_observed_at":"2026-08-08T14:45:40.984426Z","submitted_at":"2025-03-04T08:18:46Z","title":"An Efficient and Precise Training Data Construction Framework for Process-supervised Reward Model in Mathematical Reasoning","version":2},"cited_work":{"arxiv_id":"2503.02382","doi":"10.48550/arxiv.2503.02382","metadata_source":"arxiv_reference","pith_arxiv_id":"2503.02382","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"An efficient and precise training data construc- tion framework for process-supervised reward model in mathematical reasoning.arXiv preprint arXiv:2503.02382, 2025a","venue":"ArXiv.org","work_id":"437199d2-89e6-444d-9709-abf5c3941270","year":2025},"citing_paper":{"arxiv_id":"2604.02341","last_updated":"2026-02-08T06:38:20Z","snapshot_observed_at":"2026-08-11T14:52:00.824484Z","submitted_at":"2026-02-08T06:38:20Z","title":"LLM Reasoning with Process Rewards for Outcome-Guided Steps","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-05-16T06:43:19.869111Z"},"links":{"cited_paper":"/paper/2503.02382","citing_paper":"/paper/2604.02341"},"observation_digest":"sha256:5b08c70bb84d16b5c6a4690c0e212eb466795ea96a61092f0ff7eb5e2e0838a5","observation_id":"88bb40ad-7ed1-4801-8813-cee20273a3a0","resolution":{"observed_at":"2026-05-16T06:47:28.419331Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2503.02382","last_updated":"2025-07-23T07:19:41Z","snapshot_observed_at":"2026-08-08T14:45:40.984426Z","submitted_at":"2025-03-04T08:18:46Z","title":"An Efficient and Precise Training Data Construction Framework for Process-supervised Reward Model in Mathematical Reasoning","version":2},"cited_work":{"arxiv_id":"2503.02382","doi":"10.48550/arxiv.2503.02382","metadata_source":"arxiv_reference","pith_arxiv_id":"2503.02382","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"An efficient and precise training data construc- tion framework for process-supervised reward model in mathematical reasoning.arXiv preprint arXiv:2503.02382, 2025a","venue":"ArXiv.org","work_id":"437199d2-89e6-444d-9709-abf5c3941270","year":2025},"citing_paper":{"arxiv_id":"2604.17957","last_updated":"2026-04-20T08:39:13Z","snapshot_observed_at":"2026-08-11T04:46:04.671429Z","submitted_at":"2026-04-20T08:39:13Z","title":"Process Reward Models Meet Planning: Generating Precise and Scalable Datasets for Step-Level Rewards","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-05-10T04:40:52.854907Z"},"links":{"cited_paper":"/paper/2503.02382","citing_paper":"/paper/2604.17957"},"observation_digest":"sha256:bff77308fcb2cfbbbc9bcabcc567c8563a4909b8fa94e70ab8ee2720eafd3a54","observation_id":"97bc4bfb-ff1c-4138-82a6-6dec922afe40","resolution":{"observed_at":"2026-05-10T04:45:21.116929Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2503.02382","last_updated":"2025-07-23T07:19:41Z","snapshot_observed_at":"2026-08-08T14:45:40.984426Z","submitted_at":"2025-03-04T08:18:46Z","title":"An Efficient and Precise Training Data Construction Framework for Process-supervised Reward Model in Mathematical Reasoning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.02382","snapshot_observed_at":"2026-08-02T03:01:41.653988Z","title":"Anthropic Team","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.14049","last_updated":"2026-07-15T17:16:43Z","snapshot_observed_at":"2026-08-08T03:42:13.263825Z","submitted_at":"2026-07-15T17:16:43Z","title":"Deep Interaction: An Efficient Human-AI Interaction Method for Large Reasoning Models","version":1},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-02T03:01:41.653988Z"},"links":{"cited_paper":"/paper/2503.02382","citing_paper":"/paper/2607.14049"},"observation_digest":"sha256:41477a9db7e4addb992f08f630f2d9b8c78dfcc7453db93aeadd3f93642444ab","observation_id":"b007d93f-ecba-42dc-810f-f22a70946847","resolution":{"observed_at":"2026-08-02T03:01:41.653988Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2503.02382/citation-record","integrity":"/paper/2503.02382/integrity","json":"/paper/2503.02382/citation-record.json","paper":"/paper/2503.02382"},"outbound":[],"paper":{"arxiv_id":"2503.02382","last_updated":"2025-07-23T07:19:41Z","latest_version":2,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-08T14:45:40.984426Z","submitted_at":"2025-03-04T08:18:46Z","title":"An Efficient and Precise Training Data Construction Framework for Process-supervised Reward Model in Mathematical Reasoning"},"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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 12 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 4 inbound Pith citation observations for arXiv:2503.02382."}