{"as_of":"2026-08-08T13:29:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:232defbdfa38f70b977dcc8a1a4e13e957d8d314b6feca15350432922ad59689","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-07T15:42:22.042716Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-07T15:42:26.911183Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2402.00658","last_updated":"2024-10-15T09:16:38Z","snapshot_observed_at":"2026-08-05T12:38:35.392849Z","submitted_at":"2024-02-01T15:18:33Z","title":"Learning Planning-based Reasoning by Trajectories Collection and Process Reward Synthesizing","version":3},"cited_work":{"arxiv_id":"2402.00658","doi":null,"metadata_source":"pith","pith_arxiv_id":"2402.00658","snapshot_observed_at":"2026-08-07T15:42:26.911183Z","title":"Learning Planning-based Reasoning by Trajectories Collection and Process Reward Synthesizing","venue":"cs.AI","work_id":"0787ec82-e2b6-40ef-a5b0-81a31a0967d7","year":2024},"citing_paper":{"arxiv_id":"2505.14107","last_updated":"2025-05-29T08:24:00Z","snapshot_observed_at":"2026-08-07T23:55:00.741921Z","submitted_at":"2025-05-20T09:14:53Z","title":"DiagnosisArena: Benchmarking Diagnostic Reasoning for Large Language Models","version":4},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T15:42:22.042716Z"},"links":{"cited_paper":"/paper/2402.00658","citing_paper":"/paper/2505.14107"},"observation_digest":"sha256:71f37c29d5345a0635f64bdb37f94e5ad1097858cfd2b7ff7d05bfd1758f9e67","observation_id":"7749b063-e0fb-4649-b3c8-43bf035ed78e","resolution":{"observed_at":"2026-08-07T15:42:27.076360Z","resolver_source":"local_arxiv","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":"2402.00658","last_updated":"2024-10-15T09:16:38Z","snapshot_observed_at":"2026-08-05T12:38:35.392849Z","submitted_at":"2024-02-01T15:18:33Z","title":"Learning Planning-based Reasoning by Trajectories Collection and Process Reward Synthesizing","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.00658","snapshot_observed_at":"2026-08-07T14:11:57.753578Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.19683","last_updated":"2025-05-26T08:44:53Z","snapshot_observed_at":"2026-08-08T09:25:43.689145Z","submitted_at":"2025-05-26T08:44:53Z","title":"Large Language Models for Planning: A Comprehensive and Systematic Survey","version":1},"reference_index":111,"source":"pdf_text","source_observed_at":"2026-08-07T14:11:57.753578Z"},"links":{"cited_paper":"/paper/2402.00658","citing_paper":"/paper/2505.19683"},"observation_digest":"sha256:1777062e59a2eb74d3171c0b408f41fc89598df7be8b6ed6d397caad611bcd04","observation_id":"0c4735c7-4597-42d8-a28f-021c161a5a18","resolution":{"observed_at":"2026-08-07T14:11:57.753578Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.00658","last_updated":"2024-10-15T09:16:38Z","snapshot_observed_at":"2026-08-05T12:38:35.392849Z","submitted_at":"2024-02-01T15:18:33Z","title":"Learning Planning-based Reasoning by Trajectories Collection and Process Reward Synthesizing","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.00658","snapshot_observed_at":"2026-07-11T13:53:36.775836Z","title":"arXiv preprint arXiv:2402.00658 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.04763","last_updated":"2026-07-26T14:17:18Z","snapshot_observed_at":"2026-08-02T10:24:43.977557Z","submitted_at":"2026-07-06T07:56:53Z","title":"Multi-Turn On-Policy Distillation with Prefix Replay","version":1},"reference_index":92,"source":"arxiv_source","source_observed_at":"2026-07-11T13:53:36.775836Z"},"links":{"cited_paper":"/paper/2402.00658","citing_paper":"/paper/2607.04763"},"observation_digest":"sha256:ca4baf21f0fb02ce1244515ce82ed0bed8e1b808717f1174540301bf672fbefb","observation_id":"990160fb-6307-4daa-9858-00d3fdbbe47c","resolution":{"observed_at":"2026-07-11T13:53:36.775836Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.00658","last_updated":"2024-10-15T09:16:38Z","snapshot_observed_at":"2026-08-05T12:38:35.392849Z","submitted_at":"2024-02-01T15:18:33Z","title":"Learning Planning-based Reasoning by Trajectories Collection and Process Reward Synthesizing","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.00658","snapshot_observed_at":"2026-08-02T08:40:41.861888Z","title":"arXiv preprint arXiv:2402.00658 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.04763","last_updated":"2026-07-26T14:17:18Z","snapshot_observed_at":"2026-08-02T10:24:43.977557Z","submitted_at":"2026-07-06T07:56:53Z","title":"Multi-Turn On-Policy Distillation with Prefix Replay","version":3},"reference_index":93,"source":"arxiv_source","source_observed_at":"2026-08-02T08:40:41.861888Z"},"links":{"cited_paper":"/paper/2402.00658","citing_paper":"/paper/2607.04763"},"observation_digest":"sha256:f9342caf6ae0f506633df46dca1244634b46de16db5b956fc0a319c6b3d377bd","observation_id":"594a8fd3-7461-4573-91c8-b2fdff369f9e","resolution":{"observed_at":"2026-08-02T08:40:41.861888Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2402.00658/citation-record","integrity":"/paper/2402.00658/integrity","json":"/paper/2402.00658/citation-record.json","paper":"/paper/2402.00658"},"outbound":[],"paper":{"arxiv_id":"2402.00658","last_updated":"2024-10-15T09:16:38Z","latest_version":3,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-05T12:38:35.392849Z","submitted_at":"2024-02-01T15:18:33Z","title":"Learning Planning-based Reasoning by Trajectories Collection and Process Reward Synthesizing"},"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:2402.00658."}