{"as_of":"2026-08-14T02:43:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:08762de66f946753d8b692631b6b628c4ff016f46c4b4d978fc2ab55ecaa8fdf","coverage":[{"denominator":24,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":24,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T06:05:31.251081Z","state":"measured"},{"denominator":24,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":24,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-13T06:32:02.005865+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2412.16871/citation-record","integrity":"/paper/2412.16871/integrity","json":"/paper/2412.16871/citation-record.json","paper":"/paper/2412.16871"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2211.12588","last_updated":"2023-10-23T01:27:38Z","snapshot_observed_at":"2026-08-02T13:06:11.850456Z","submitted_at":"2022-11-22T21:06:00Z","title":"Program of Thoughts Prompting: Disentangling Computation from Reasoning for Numerical Reasoning Tasks","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2211.12588","snapshot_observed_at":"2026-08-11T06:05:31.141813Z","title":"Program of thoughts prompt- ing: Disentangling computation from reasoning for numerical reasoning tasks","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.16871","last_updated":"2024-12-22T05:43:50Z","snapshot_observed_at":"2026-08-12T09:26:46.501378Z","submitted_at":"2024-12-22T05:43:50Z","title":"Teaching LLMs to Refine with Tools","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-11T06:05:31.141813Z"},"links":{"cited_paper":"/paper/2211.12588","citing_paper":"/paper/2412.16871"},"observation_digest":"sha256:8aaf2586f64ff88c2105b24d61b7505d2e542b08fd501508cb22a22e1ad9ca25","observation_id":"4463aa3d-661d-4037-8523-8456ed561e41","resolution":{"observed_at":"2026-08-11T06:05:31.141813Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2409.12917","last_updated":"2024-10-04T17:28:45Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-09-19T17:16:21Z","title":"Training Language Models to Self-Correct via Reinforcement Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.12917","snapshot_observed_at":"2026-08-11T06:05:31.151684Z","title":"Aviral Kumar, Vincent Zhuang, Rishabh Agarwal, Yi Su, John D Co-Reyes, Avi Singh, Kate Baumli, Shariq Iqbal, Colton Bishop, Rebecca Roelofs, et al","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.16871","last_updated":"2024-12-22T05:43:50Z","snapshot_observed_at":"2026-08-12T09:26:46.501378Z","submitted_at":"2024-12-22T05:43:50Z","title":"Teaching LLMs to Refine with Tools","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-11T06:05:31.151684Z"},"links":{"cited_paper":"/paper/2409.12917","citing_paper":"/paper/2412.16871"},"observation_digest":"sha256:66395df66a2cacf2319a403059dece09ed8002f34e158abeb9108dc94142b378","observation_id":"ee7d540f-6902-4cc8-aed4-e71f0156c536","resolution":{"observed_at":"2026-08-11T06:05:31.151684Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2305.20050","last_updated":"2023-05-31T17:24:00Z","snapshot_observed_at":"2026-08-11T17:22:43.545531Z","submitted_at":"2023-05-31T17:24:00Z","title":"Let's Verify Step by Step","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.20050","snapshot_observed_at":"2026-08-11T06:05:31.156593Z","title":"Let’s verify step by step","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.16871","last_updated":"2024-12-22T05:43:50Z","snapshot_observed_at":"2026-08-12T09:26:46.501378Z","submitted_at":"2024-12-22T05:43:50Z","title":"Teaching LLMs to Refine with Tools","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-11T06:05:31.156593Z"},"links":{"cited_paper":"/paper/2305.20050","citing_paper":"/paper/2412.16871"},"observation_digest":"sha256:ba913b04594f6cac40aa1ee6694e57c3fe32bfb9800392eb5ba1e85fe446e451","observation_id":"76d6981f-b18b-48d3-bb40-535598651d93","resolution":{"observed_at":"2026-08-11T06:05:31.156593Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.02725","last_updated":"2024-10-03T17:47:29Z","snapshot_observed_at":"2026-08-12T22:31:24.333330Z","submitted_at":"2024-10-03T17:47:29Z","title":"Adaptive Inference-Time Compute: LLMs Can Predict if They Can Do Better, Even Mid-Generation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.02725","snapshot_observed_at":"2026-08-11T06:05:31.171365Z","title":"Adaptive inference-time compute: Llms can predict if they can do better, even mid-generation","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.16871","last_updated":"2024-12-22T05:43:50Z","snapshot_observed_at":"2026-08-12T09:26:46.501378Z","submitted_at":"2024-12-22T05:43:50Z","title":"Teaching LLMs to Refine with Tools","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-11T06:05:31.171365Z"},"links":{"cited_paper":"/paper/2410.02725","citing_paper":"/paper/2412.16871"},"observation_digest":"sha256:2f39ccd579d47aec84b8d2e645c693a768f94bc459b90d51ad34147d51635a70","observation_id":"99907d5d-b151-473e-b0e7-32f1c5d08195","resolution":{"observed_at":"2026-08-11T06:05:31.171365Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.00215","last_updated":"2024-06-28T19:53:17Z","snapshot_observed_at":"2026-08-12T23:32:25.133777Z","submitted_at":"2024-06-28T19:53:17Z","title":"LLM Critics Help Catch LLM Bugs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.00215","snapshot_observed_at":"2026-08-11T06:05:31.176033Z","title":"Llm critics help catch llm bugs","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.16871","last_updated":"2024-12-22T05:43:50Z","snapshot_observed_at":"2026-08-12T09:26:46.501378Z","submitted_at":"2024-12-22T05:43:50Z","title":"Teaching LLMs to Refine with Tools","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-11T06:05:31.176033Z"},"links":{"cited_paper":"/paper/2407.00215","citing_paper":"/paper/2412.16871"},"observation_digest":"sha256:84aaa6a605bc43b1111e439bbbcb4c0cf770f18a0fa2ffd39d01dac4e9b05db5","observation_id":"5c75c41e-3a5a-4e49-b466-6577666deebf","resolution":{"observed_at":"2026-08-11T06:05:31.176033Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.19733","last_updated":"2024-06-26T01:28:35Z","snapshot_observed_at":"2026-08-13T03:45:12.203086Z","submitted_at":"2024-04-30T17:28:05Z","title":"Iterative Reasoning Preference Optimization","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.19733","snapshot_observed_at":"2026-08-11T06:05:31.181251Z","title":"Iterative reasoning preference optimization","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.16871","last_updated":"2024-12-22T05:43:50Z","snapshot_observed_at":"2026-08-12T09:26:46.501378Z","submitted_at":"2024-12-22T05:43:50Z","title":"Teaching LLMs to Refine with Tools","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-11T06:05:31.181251Z"},"links":{"cited_paper":"/paper/2404.19733","citing_paper":"/paper/2412.16871"},"observation_digest":"sha256:5094f044ace840377fa6f46eb5f58797494515a26dc5c5b2c4c8e2400c4b5b01","observation_id":"9d9aa4fb-1abf-4a20-ad00-75503eaf4df3","resolution":{"observed_at":"2026-08-11T06:05:31.181251Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2206.05802","last_updated":"2022-06-14T01:16:24Z","snapshot_observed_at":"2026-08-13T17:24:30.719766Z","submitted_at":"2022-06-12T17:40:53Z","title":"Self-critiquing models for assisting human evaluators","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2206.05802","snapshot_observed_at":"2026-08-11T06:05:31.191300Z","title":"Self-critiquing models for assisting human evaluators","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.16871","last_updated":"2024-12-22T05:43:50Z","snapshot_observed_at":"2026-08-12T09:26:46.501378Z","submitted_at":"2024-12-22T05:43:50Z","title":"Teaching LLMs to Refine with Tools","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-11T06:05:31.191300Z"},"links":{"cited_paper":"/paper/2206.05802","citing_paper":"/paper/2412.16871"},"observation_digest":"sha256:76707260740836fce559b166f5c9d62da953e661b2a83bfe72945251d9ccf489","observation_id":"488e115b-c050-4395-bec6-db881bbb78a9","resolution":{"observed_at":"2026-08-11T06:05:31.191300Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.14622","last_updated":"2024-07-19T18:38:25Z","snapshot_observed_at":"2026-08-12T23:18:24.223291Z","submitted_at":"2024-07-19T18:38:25Z","title":"BOND: Aligning LLMs with Best-of-N Distillation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.14622","snapshot_observed_at":"2026-08-11T06:05:31.198228Z","title":"Bond: Aligning llms with best-of-n distillation","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.16871","last_updated":"2024-12-22T05:43:50Z","snapshot_observed_at":"2026-08-12T09:26:46.501378Z","submitted_at":"2024-12-22T05:43:50Z","title":"Teaching LLMs to Refine with Tools","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-11T06:05:31.198228Z"},"links":{"cited_paper":"/paper/2407.14622","citing_paper":"/paper/2412.16871"},"observation_digest":"sha256:caf50404b6c348f40d24db762772bae863a772716709d406ec738da3ecd81032","observation_id":"f2b20b61-e17f-4fef-987a-e6e465ab953a","resolution":{"observed_at":"2026-08-11T06:05:31.198228Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.03314","last_updated":"2024-08-06T17:35:05Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-08-06T17:35:05Z","title":"Scaling LLM Test-Time Compute Optimally can be More Effective than Scaling Model Parameters","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.03314","snapshot_observed_at":"2026-08-11T06:05:31.203217Z","title":"Scaling llm test-time compute optimally can be more effective than scaling model parameters","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.16871","last_updated":"2024-12-22T05:43:50Z","snapshot_observed_at":"2026-08-12T09:26:46.501378Z","submitted_at":"2024-12-22T05:43:50Z","title":"Teaching LLMs to Refine with Tools","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-11T06:05:31.203217Z"},"links":{"cited_paper":"/paper/2408.03314","citing_paper":"/paper/2412.16871"},"observation_digest":"sha256:0a79feac38191d71e7e1cbfa8cc0f0a716ea3b4e29f16cd352e5309b15a3070f","observation_id":"f1b41003-4031-4cb1-ba6f-19133195b372","resolution":{"observed_at":"2026-08-11T06:05:31.203217Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.12253","last_updated":"2024-12-10T18:19:29Z","snapshot_observed_at":"2026-08-13T15:06:46.341809Z","submitted_at":"2024-04-18T15:21:34Z","title":"Toward Self-Improvement of LLMs via Imagination, Searching, and Criticizing","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.12253","snapshot_observed_at":"2026-08-11T06:05:31.207636Z","title":"Toward self- improvement of llms via imagination, searching, and criticizing","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.16871","last_updated":"2024-12-22T05:43:50Z","snapshot_observed_at":"2026-08-12T09:26:46.501378Z","submitted_at":"2024-12-22T05:43:50Z","title":"Teaching LLMs to Refine with Tools","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-11T06:05:31.207636Z"},"links":{"cited_paper":"/paper/2404.12253","citing_paper":"/paper/2412.16871"},"observation_digest":"sha256:b02990b19379b6f4fd6879f3c20865269bc2ef890c53010f1b779ca8de090cda","observation_id":"1984b41d-d237-4ffe-9ef8-0cc92945c2f8","resolution":{"observed_at":"2026-08-11T06:05:31.207636Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.03731","last_updated":"2023-10-05T17:52:09Z","snapshot_observed_at":"2026-08-13T05:55:59.432178Z","submitted_at":"2023-10-05T17:52:09Z","title":"MathCoder: Seamless Code Integration in LLMs for Enhanced Mathematical Reasoning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.03731","snapshot_observed_at":"2026-08-11T06:05:31.212295Z","title":"Mathcoder: Seamless code integration in llms for enhanced mathematical reasoning","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.16871","last_updated":"2024-12-22T05:43:50Z","snapshot_observed_at":"2026-08-12T09:26:46.501378Z","submitted_at":"2024-12-22T05:43:50Z","title":"Teaching LLMs to Refine with Tools","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-11T06:05:31.212295Z"},"links":{"cited_paper":"/paper/2310.03731","citing_paper":"/paper/2412.16871"},"observation_digest":"sha256:9d74681a731d84f8fdadcff32d08965bc7c0b4cf30d56444b022e26bbc8c5e8f","observation_id":"a8cea3ad-7e1c-4cdc-a79f-96fd14e23a31","resolution":{"observed_at":"2026-08-11T06:05:31.212295Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2306.16636","last_updated":"2023-06-29T02:19:50Z","snapshot_observed_at":"2026-08-13T11:07:06.526620Z","submitted_at":"2023-06-29T02:19:50Z","title":"CMATH: Can Your Language Model Pass Chinese Elementary School Math Test?","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.16636","snapshot_observed_at":"2026-08-11T06:05:31.216495Z","title":"Cmath: can your language model pass chinese elementary school math test? arXiv preprint arXiv:2306.16636,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.16871","last_updated":"2024-12-22T05:43:50Z","snapshot_observed_at":"2026-08-12T09:26:46.501378Z","submitted_at":"2024-12-22T05:43:50Z","title":"Teaching LLMs to Refine with Tools","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-11T06:05:31.216495Z"},"links":{"cited_paper":"/paper/2306.16636","citing_paper":"/paper/2412.16871"},"observation_digest":"sha256:2e3d6acca3c2d9fab1cad9dde4c5a04306795e446b8c5a10d6239a91a564d5d8","observation_id":"38231b56-f0fe-4a7c-8444-93464939d40d","resolution":{"observed_at":"2026-08-11T06:05:31.216495Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2211.00053","last_updated":"2022-10-31T18:09:51Z","snapshot_observed_at":"2026-08-13T13:52:42.978034Z","submitted_at":"2022-10-31T18:09:51Z","title":"Generating Sequences by Learning to Self-Correct","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2211.00053","snapshot_observed_at":"2026-08-11T06:05:31.220595Z","title":"Generating sequences by learning to self-correct","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.16871","last_updated":"2024-12-22T05:43:50Z","snapshot_observed_at":"2026-08-12T09:26:46.501378Z","submitted_at":"2024-12-22T05:43:50Z","title":"Teaching LLMs to Refine with Tools","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-11T06:05:31.220595Z"},"links":{"cited_paper":"/paper/2211.00053","citing_paper":"/paper/2412.16871"},"observation_digest":"sha256:63942931785c0d6c1c8ca1055bb85bac756119aac63e449cb64b1a85a71b1660","observation_id":"398eefc4-0f30-462d-83cd-4fde728dc9c0","resolution":{"observed_at":"2026-08-11T06:05:31.220595Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.02893","last_updated":"2024-04-03T17:51:18Z","snapshot_observed_at":"2026-08-13T00:38:17.242638Z","submitted_at":"2024-04-03T17:51:18Z","title":"ChatGLM-Math: Improving Math Problem-Solving in Large Language Models with a Self-Critique Pipeline","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.02893","snapshot_observed_at":"2026-08-11T06:05:31.224575Z","title":"Chatglm-math: Improving math problem-solving in large language models with a self-critique pipeline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.16871","last_updated":"2024-12-22T05:43:50Z","snapshot_observed_at":"2026-08-12T09:26:46.501378Z","submitted_at":"2024-12-22T05:43:50Z","title":"Teaching LLMs to Refine with Tools","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-11T06:05:31.224575Z"},"links":{"cited_paper":"/paper/2404.02893","citing_paper":"/paper/2412.16871"},"observation_digest":"sha256:32a45de44ec68b49c6367f0ddc47b4f159c56874e118dfe9994b2238621a1d77","observation_id":"b1cfb3a5-3345-450a-a9e7-aa6f0da57552","resolution":{"observed_at":"2026-08-11T06:05:31.224575Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.10671","last_updated":"2024-09-10T13:25:53Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-07-15T12:35:42Z","title":"Qwen2 Technical Report","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.10671","snapshot_observed_at":"2026-08-11T06:05:31.229765Z","title":"Qwen2 technical report","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.16871","last_updated":"2024-12-22T05:43:50Z","snapshot_observed_at":"2026-08-12T09:26:46.501378Z","submitted_at":"2024-12-22T05:43:50Z","title":"Teaching LLMs to Refine with Tools","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-11T06:05:31.229765Z"},"links":{"cited_paper":"/paper/2407.10671","citing_paper":"/paper/2412.16871"},"observation_digest":"sha256:1f87f6b19744fcb7daedc5a8a1c1ae7d56399b7a4e820ccf8fe2b26151d84ce9","observation_id":"369021d9-523d-4905-b6bf-6b9e9fd5e8b6","resolution":{"observed_at":"2026-08-11T06:05:31.229765Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.15565","last_updated":"2024-08-28T06:33:03Z","snapshot_observed_at":"2026-08-12T22:56:08.041493Z","submitted_at":"2024-08-28T06:33:03Z","title":"SIaM: Self-Improving Code-Assisted Mathematical Reasoning of Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.15565","snapshot_observed_at":"2026-08-11T06:05:31.234167Z","title":"Siam: Self-improving code-assisted mathematical reasoning of large language models","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.16871","last_updated":"2024-12-22T05:43:50Z","snapshot_observed_at":"2026-08-12T09:26:46.501378Z","submitted_at":"2024-12-22T05:43:50Z","title":"Teaching LLMs to Refine with Tools","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-11T06:05:31.234167Z"},"links":{"cited_paper":"/paper/2408.15565","citing_paper":"/paper/2412.16871"},"observation_digest":"sha256:f5c31e270b60c4b40d22a9add190d8dd8cd605b871903b5900a8c8ac4ff40c24","observation_id":"95eb5713-a90a-483e-8b1c-fe8659182d85","resolution":{"observed_at":"2026-08-11T06:05:31.234167Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.03864","last_updated":"2025-08-07T06:34:52Z","snapshot_observed_at":"2026-08-12T22:30:27.272591Z","submitted_at":"2024-10-04T18:58:09Z","title":"DOTS: Learning to Reason Dynamically in LLMs via Optimal Reasoning Trajectories Search","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.03864","snapshot_observed_at":"2026-08-11T06:05:31.238102Z","title":"Dots: Learning to reason dynamically in llms via optimal reasoning trajectories search","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.16871","last_updated":"2024-12-22T05:43:50Z","snapshot_observed_at":"2026-08-12T09:26:46.501378Z","submitted_at":"2024-12-22T05:43:50Z","title":"Teaching LLMs to Refine with Tools","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-11T06:05:31.238102Z"},"links":{"cited_paper":"/paper/2410.03864","citing_paper":"/paper/2412.16871"},"observation_digest":"sha256:a92f86e23af572cf156033ceb2a28ff7d79612a6211571651f61730fb51856f9","observation_id":"3ce726e7-ce31-42b3-af25-d3b4b9123604","resolution":{"observed_at":"2026-08-11T06:05:31.238102Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.15240","last_updated":"2025-02-22T10:21:46Z","snapshot_observed_at":"2026-08-12T22:56:24.326978Z","submitted_at":"2024-08-27T17:57:45Z","title":"Generative Verifiers: Reward Modeling as Next-Token Prediction","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.15240","snapshot_observed_at":"2026-08-11T06:05:31.242190Z","title":"Generative verifiers: Reward modeling as next-token prediction","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.16871","last_updated":"2024-12-22T05:43:50Z","snapshot_observed_at":"2026-08-12T09:26:46.501378Z","submitted_at":"2024-12-22T05:43:50Z","title":"Teaching LLMs to Refine with Tools","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-11T06:05:31.242190Z"},"links":{"cited_paper":"/paper/2408.15240","citing_paper":"/paper/2412.16871"},"observation_digest":"sha256:4884255152134b0ddcf5c3ecc7afc9adb2ab47221db9442e2a78837855dbfcfc","observation_id":"a233914d-be8c-45f4-8dff-6a0500e2f22c","resolution":{"observed_at":"2026-08-11T06:05:31.242190Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2009.11506","last_updated":"2020-10-09T01:36:35Z","snapshot_observed_at":"2026-07-06T09:58:22.699198Z","submitted_at":"2020-09-24T06:17:10Z","title":"Ape210K: A Large-Scale and Template-Rich Dataset of Math Word Problems","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2009.11506","snapshot_observed_at":"2026-08-11T06:05:31.246208Z","title":"Ape210k: A large-scale and template-rich dataset of math word problems","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2412.16871","last_updated":"2024-12-22T05:43:50Z","snapshot_observed_at":"2026-08-12T09:26:46.501378Z","submitted_at":"2024-12-22T05:43:50Z","title":"Teaching LLMs to Refine with Tools","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-11T06:05:31.246208Z"},"links":{"cited_paper":"/paper/2009.11506","citing_paper":"/paper/2412.16871"},"observation_digest":"sha256:73eb4e255362d0b6c4f2a2980b7739d74f36dcfef83cab308600788d3bc8c179","observation_id":"f5453ccd-5ad8-449a-be72-0ad08986aee8","resolution":{"observed_at":"2026-08-11T06:05:31.246208Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.13372","last_updated":"2024-06-27T22:44:48Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-03-20T08:08:54Z","title":"LlamaFactory: Unified Efficient Fine-Tuning of 100+ Language Models","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.13372","snapshot_observed_at":"2026-08-11T06:05:31.251081Z","title":"h \" and the d ia me ter of its base be","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.16871","last_updated":"2024-12-22T05:43:50Z","snapshot_observed_at":"2026-08-12T09:26:46.501378Z","submitted_at":"2024-12-22T05:43:50Z","title":"Teaching LLMs to Refine with Tools","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-11T06:05:31.251081Z"},"links":{"cited_paper":"/paper/2403.13372","citing_paper":"/paper/2412.16871"},"observation_digest":"sha256:e88eb268a2ef8dcb0eb742942a8ba0c7b65d62efef7903929796c9725e86c408","observation_id":"24eda0b8-b944-46fc-a3c0-ef5c5af74b96","resolution":{"observed_at":"2026-08-11T06:05:31.251081Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.18219","last_updated":"2024-07-26T17:50:27Z","snapshot_observed_at":"2026-08-12T23:14:40.641743Z","submitted_at":"2024-07-25T17:35:59Z","title":"Recursive Introspection: Teaching Language Model Agents How to Self-Improve","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.18219","snapshot_observed_at":"2026-08-11T06:05:31.186318Z","title":"Recursive introspection: Teaching language model agents how to self-improve","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.16871","last_updated":"2024-12-22T05:43:50Z","snapshot_observed_at":"2026-08-12T09:26:46.501378Z","submitted_at":"2024-12-22T05:43:50Z","title":"Teaching LLMs to Refine with Tools","version":1},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-11T06:05:31.186318Z"},"links":{"cited_paper":"/paper/2407.18219","citing_paper":"/paper/2412.16871"},"observation_digest":"sha256:b182ac63256d9ae1d1f9b84573a64b597e375ba028f28d4424ce56ee1a55a390","observation_id":"d216fba5-44b4-4519-8c64-70ecabdfa56a","resolution":{"observed_at":"2026-08-11T06:05:31.186318Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.09136","last_updated":"2024-07-12T10:11:40Z","snapshot_observed_at":"2026-08-12T23:37:50.934650Z","submitted_at":"2024-07-12T10:11:40Z","title":"Stepwise Verification and Remediation of Student Reasoning Errors with Large Language Model Tutors","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.09136","snapshot_observed_at":"2026-08-11T06:05:31.146889Z","title":"Stepwise verification and remediation of student reasoning errors with large language model tutors","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.16871","last_updated":"2024-12-22T05:43:50Z","snapshot_observed_at":"2026-08-12T09:26:46.501378Z","submitted_at":"2024-12-22T05:43:50Z","title":"Teaching LLMs to Refine with Tools","version":1},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-11T06:05:31.146889Z"},"links":{"cited_paper":"/paper/2407.09136","citing_paper":"/paper/2412.16871"},"observation_digest":"sha256:d2aa8c92802ef03150cd4526ef41f37eefe26aa330bfcdafa328d77d897f765a","observation_id":"9be5e479-3a9c-4a3b-bf5e-6bd433228d9b","resolution":{"observed_at":"2026-08-11T06:05:31.146889Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.16436","last_updated":"2024-12-04T08:15:35Z","snapshot_observed_at":"2026-08-12T23:57:54.839711Z","submitted_at":"2024-05-26T05:38:50Z","title":"Provably Mitigating Overoptimization in RLHF: Your SFT Loss is Implicitly an Adversarial Regularizer","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.16436","snapshot_observed_at":"2026-08-11T06:05:31.165998Z","title":"Provably mitigating overoptimization in rlhf: Your sft loss is implicitly an adversarial regularizer","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.16871","last_updated":"2024-12-22T05:43:50Z","snapshot_observed_at":"2026-08-12T09:26:46.501378Z","submitted_at":"2024-12-22T05:43:50Z","title":"Teaching LLMs to Refine with Tools","version":1},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-11T06:05:31.165998Z"},"links":{"cited_paper":"/paper/2405.16436","citing_paper":"/paper/2412.16871"},"observation_digest":"sha256:34e8cd09dffd3e2f75551fa700afc4600fe8aacdf8dc3bd274d5b63bdc45f8b9","observation_id":"0ab72e31-c006-48d2-a228-b9f56114878b","resolution":{"observed_at":"2026-08-11T06:05:31.165998Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.21787","last_updated":"2024-12-30T19:03:24Z","snapshot_observed_at":"2026-07-06T18:55:11.576666Z","submitted_at":"2024-07-31T17:57:25Z","title":"Large Language Monkeys: Scaling Inference Compute with Repeated Sampling","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.21787","snapshot_observed_at":"2026-08-11T06:05:31.136611Z","title":"Large language monkeys: Scaling inference compute with repeated sampling","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.16871","last_updated":"2024-12-22T05:43:50Z","snapshot_observed_at":"2026-08-12T09:26:46.501378Z","submitted_at":"2024-12-22T05:43:50Z","title":"Teaching LLMs to Refine with Tools","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-11T06:05:31.136611Z"},"links":{"cited_paper":"/paper/2407.21787","citing_paper":"/paper/2412.16871"},"observation_digest":"sha256:36acf728f8f71140f3921200acc5515746bc21d849155747686e2907b43fd2d3","observation_id":"12851464-d289-43a9-bc89-b1a639642103","resolution":{"observed_at":"2026-08-11T06:05:31.136611Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2412.16871","last_updated":"2024-12-22T05:43:50Z","latest_version":1,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-12T09:26:46.501378Z","submitted_at":"2024-12-22T05:43:50Z","title":"Teaching LLMs to Refine with Tools"},"reference_resolution":{"displayed":24,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":24,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":24},"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-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 24 of 24 outbound references and 0 inbound Pith citation observations for arXiv:2412.16871."}