{"as_of":"2026-08-10T02:42:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ae8c41b578afbf8d27c694e20d81b8f3a6f06f06342deac8e096a67d15e439cf","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-09T06:31:02.800959+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-05T14:57:39.505938Z","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-04T08:09:40.654394Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2508.10293","last_updated":"2025-08-16T13:14:36Z","snapshot_observed_at":"2026-08-05T20:35:00.904619Z","submitted_at":"2025-08-14T02:43:53Z","title":"Promoting Efficient Reasoning with Verifiable Stepwise Reward","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2508.10293","snapshot_observed_at":"2026-08-05T14:57:39.505938Z","title":"Promoting efficient reasoning with verifiable stepwise reward","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2508.20722","last_updated":"2025-08-28T12:45:25Z","snapshot_observed_at":"2026-08-09T05:32:48.085714Z","submitted_at":"2025-08-28T12:45:25Z","title":"rStar2-Agent: Agentic Reasoning Technical Report","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-05T14:57:39.505938Z"},"links":{"cited_paper":"/paper/2508.10293","citing_paper":"/paper/2508.20722"},"observation_digest":"sha256:15a5e16614d47f32eaab4ff88c4e1f1bed868f705365c0f1a8fc0391542d98c2","observation_id":"5c478112-4f81-4129-80cc-85d947720eb5","resolution":{"observed_at":"2026-08-05T14:57:39.505938Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2508.10293","last_updated":"2025-08-16T13:14:36Z","snapshot_observed_at":"2026-08-05T20:35:00.904619Z","submitted_at":"2025-08-14T02:43:53Z","title":"Promoting Efficient Reasoning with Verifiable Stepwise Reward","version":2},"cited_work":{"arxiv_id":"2508.10293","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2508.10293","snapshot_observed_at":"2026-07-04T08:09:40.654394Z","title":"Promoting efficient reasoning with verifiable stepwise reward","venue":null,"work_id":"3e87aefb-889f-4f33-a301-5a4e7c68f5c9","year":2025},"citing_paper":{"arxiv_id":"2510.07794","last_updated":"2026-04-11T16:18:46Z","snapshot_observed_at":"2026-08-06T07:19:52.565265Z","submitted_at":"2025-10-09T05:13:10Z","title":"HiPRAG: Hierarchical Process Rewards for Efficient Agentic Retrieval Augmented Generation","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-05-18T09:27:17.760078Z"},"links":{"cited_paper":"/paper/2508.10293","citing_paper":"/paper/2510.07794"},"observation_digest":"sha256:22adb5c98b2a60beb7630d5c7c9577067bd920e47803887660a385d948f38fdf","observation_id":"055bdc7b-2e7d-4442-9e7e-e062846636c4","resolution":{"observed_at":"2026-05-18T09:31:11.931184Z","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":"2508.10293","last_updated":"2025-08-16T13:14:36Z","snapshot_observed_at":"2026-08-05T20:35:00.904619Z","submitted_at":"2025-08-14T02:43:53Z","title":"Promoting Efficient Reasoning with Verifiable Stepwise Reward","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2508.10293","snapshot_observed_at":"2026-08-03T18:00:18.128402Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2512.07436","last_updated":"2026-05-31T11:02:36Z","snapshot_observed_at":"2026-08-07T09:13:55.130091Z","submitted_at":"2025-12-08T11:12:39Z","title":"LocalSearchBench: Benchmarking Agentic Search in Real-World Local Life Services","version":3},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-03T18:00:18.128402Z"},"links":{"cited_paper":"/paper/2508.10293","citing_paper":"/paper/2512.07436"},"observation_digest":"sha256:8885c3c6e1568ffc6a2758b78d15756023d9a075e8c88db5089695760b57c433","observation_id":"2f8f2d3d-6dc4-464d-a219-dd45a6c67fca","resolution":{"observed_at":"2026-08-03T18:00:18.128402Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2508.10293","last_updated":"2025-08-16T13:14:36Z","snapshot_observed_at":"2026-08-05T20:35:00.904619Z","submitted_at":"2025-08-14T02:43:53Z","title":"Promoting Efficient Reasoning with Verifiable Stepwise Reward","version":2},"cited_work":{"arxiv_id":"2508.10293","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2508.10293","snapshot_observed_at":"2026-07-04T08:09:40.654394Z","title":"Promoting efficient reasoning with verifiable stepwise reward","venue":null,"work_id":"3e87aefb-889f-4f33-a301-5a4e7c68f5c9","year":2025},"citing_paper":{"arxiv_id":"2604.14054","last_updated":"2026-05-25T13:50:41Z","snapshot_observed_at":"2026-08-02T01:13:47.904200Z","submitted_at":"2026-04-15T16:34:39Z","title":"$\\pi$-Play: Multi-Agent Self-Play via Privileged Self-Distillation without External Data","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-05-10T13:43:09.581054Z"},"links":{"cited_paper":"/paper/2508.10293","citing_paper":"/paper/2604.14054"},"observation_digest":"sha256:fa275eb86b0d846653945e3e5e5dba5185c14532e00c475372ac380c5a33c238","observation_id":"f3c24be6-b02c-455b-bf3e-56f36e296403","resolution":{"observed_at":"2026-05-10T13:45:27.845500Z","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":"2508.10293","last_updated":"2025-08-16T13:14:36Z","snapshot_observed_at":"2026-08-05T20:35:00.904619Z","submitted_at":"2025-08-14T02:43:53Z","title":"Promoting Efficient Reasoning with Verifiable Stepwise Reward","version":2},"cited_work":{"arxiv_id":"2508.10293","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2508.10293","snapshot_observed_at":"2026-07-04T08:09:40.654394Z","title":"Promoting efficient reasoning with verifiable stepwise reward","venue":null,"work_id":"3e87aefb-889f-4f33-a301-5a4e7c68f5c9","year":2025},"citing_paper":{"arxiv_id":"2604.18936","last_updated":"2026-04-21T00:21:05Z","snapshot_observed_at":"2026-07-06T23:05:39.724237Z","submitted_at":"2026-04-21T00:21:05Z","title":"Fine-Tuning Small Reasoning Models for Quantum Field Theory","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-05-10T03:23:18.770963Z"},"links":{"cited_paper":"/paper/2508.10293","citing_paper":"/paper/2604.18936"},"observation_digest":"sha256:0f75b94a7ce4786219919adb465706d7e01bd108a1b6eff6adfd5cec8356c3f9","observation_id":"c6476c08-7542-4f3f-ac06-4276f9e59ca8","resolution":{"observed_at":"2026-05-10T03:24:15.052196Z","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":"2508.10293","last_updated":"2025-08-16T13:14:36Z","snapshot_observed_at":"2026-08-05T20:35:00.904619Z","submitted_at":"2025-08-14T02:43:53Z","title":"Promoting Efficient Reasoning with Verifiable Stepwise Reward","version":2},"cited_work":{"arxiv_id":"2508.10293","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2508.10293","snapshot_observed_at":"2026-07-04T08:09:40.654394Z","title":"Promoting efficient reasoning with verifiable stepwise reward","venue":null,"work_id":"3e87aefb-889f-4f33-a301-5a4e7c68f5c9","year":2025},"citing_paper":{"arxiv_id":"2606.01249","last_updated":"2026-06-17T04:44:10Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-05-31T14:04:51Z","title":"Trust Region On-Policy Distillation","version":3},"reference_index":135,"source":"arxiv_source","source_observed_at":"2026-06-28T17:38:50.313305Z"},"links":{"cited_paper":"/paper/2508.10293","citing_paper":"/paper/2606.01249"},"observation_digest":"sha256:94bb8364d6dc55ef7d443d25c21062922199d76892b2be6ac3096557ed6cf242","observation_id":"cc82efbf-ee5f-4456-85df-57d8301e4550","resolution":{"observed_at":"2026-07-01T20:56:13.347811Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"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":"2508.10293","last_updated":"2025-08-16T13:14:36Z","snapshot_observed_at":"2026-08-05T20:35:00.904619Z","submitted_at":"2025-08-14T02:43:53Z","title":"Promoting Efficient Reasoning with Verifiable Stepwise Reward","version":2},"cited_work":{"arxiv_id":"2508.10293","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2508.10293","snapshot_observed_at":"2026-07-04T08:09:40.654394Z","title":"Promoting efficient reasoning with verifiable stepwise reward","venue":null,"work_id":"3e87aefb-889f-4f33-a301-5a4e7c68f5c9","year":2025},"citing_paper":{"arxiv_id":"2606.03503","last_updated":"2026-06-02T11:21:27Z","snapshot_observed_at":"2026-08-09T19:58:40.083423Z","submitted_at":"2026-06-02T11:21:27Z","title":"ThoughtFold: Folding Reasoning Chains via Introspective Preference Learning","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-06-28T10:07:16.700499Z"},"links":{"cited_paper":"/paper/2508.10293","citing_paper":"/paper/2606.03503"},"observation_digest":"sha256:0ee15f8b47a2ad60386500f6f53280dbf0129c452044c4ccc8825025e3dc9a47","observation_id":"bdade60b-217c-4cc8-8d78-7d16e40bf6c8","resolution":{"observed_at":"2026-07-02T03:26:28.773789Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"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":"2508.10293","last_updated":"2025-08-16T13:14:36Z","snapshot_observed_at":"2026-08-05T20:35:00.904619Z","submitted_at":"2025-08-14T02:43:53Z","title":"Promoting Efficient Reasoning with Verifiable Stepwise Reward","version":2},"cited_work":{"arxiv_id":"2508.10293","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2508.10293","snapshot_observed_at":"2026-07-04T08:09:40.654394Z","title":"Promoting efficient reasoning with verifiable stepwise reward","venue":null,"work_id":"3e87aefb-889f-4f33-a301-5a4e7c68f5c9","year":2025},"citing_paper":{"arxiv_id":"2606.21943","last_updated":"2026-06-20T08:20:41Z","snapshot_observed_at":"2026-07-06T23:56:54.959593Z","submitted_at":"2026-06-20T08:20:41Z","title":"Modularized Reinforcement Learning on LLMs: From MDP Creation to Exploration and Learning","version":1},"reference_index":255,"source":"pdf_text","source_observed_at":"2026-06-26T12:15:08.304150Z"},"links":{"cited_paper":"/paper/2508.10293","citing_paper":"/paper/2606.21943"},"observation_digest":"sha256:4abb98b0faa93f5e66ccbbe0a860f8a8e0f35274aca26f930b6384422f107407","observation_id":"84d4564e-5cd4-4782-85c1-61ed209bd671","resolution":{"observed_at":"2026-07-04T08:09:40.655921Z","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/2508.10293/citation-record","integrity":"/paper/2508.10293/integrity","json":"/paper/2508.10293/citation-record.json","paper":"/paper/2508.10293"},"outbound":[],"paper":{"arxiv_id":"2508.10293","last_updated":"2025-08-16T13:14:36Z","latest_version":2,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-05T20:35:00.904619Z","submitted_at":"2025-08-14T02:43:53Z","title":"Promoting Efficient Reasoning with Verifiable Stepwise Reward"},"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 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 8 inbound Pith citation observations for arXiv:2508.10293."}