{"as_of":"2026-08-09T13:15:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0b911a06f275d6cd1b2cd751b1aad1c0d4e68a3b184ab114d19cddf1136ad470","coverage":[{"denominator":50,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":50,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T06:07:02.121912Z","state":"measured"},{"denominator":50,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":50,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+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/2506.06009/citation-record","integrity":"/paper/2506.06009/integrity","json":"/paper/2506.06009/citation-record.json","paper":"/paper/2506.06009"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:07:01.972708Z","title":"online\" 'onlinestring :=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.06009","last_updated":"2025-06-06T11:54:06Z","snapshot_observed_at":"2026-08-09T07:03:13.377140Z","submitted_at":"2025-06-06T11:54:06Z","title":"Unlocking Recursive Thinking of LLMs: Alignment via Refinement","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-07T06:07:01.972708Z"},"links":{"citing_paper":"/paper/2506.06009"},"observation_digest":"sha256:91d388bbb41742064521d99169f4e849fee923353a4f2a42350ef2b5ceb32c66","observation_id":"246ca00c-68a2-4c84-bd15-805de75a1b75","resolution":{"observed_at":"2026-08-07T06:07:01.972708Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:07:01.976315Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.06009","last_updated":"2025-06-06T11:54:06Z","snapshot_observed_at":"2026-08-09T07:03:13.377140Z","submitted_at":"2025-06-06T11:54:06Z","title":"Unlocking Recursive Thinking of LLMs: Alignment via Refinement","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-07T06:07:01.976315Z"},"links":{"citing_paper":"/paper/2506.06009"},"observation_digest":"sha256:4e12ee8123768bb656455b195b3820e40d10c5c47f612c566fdc66ba88597b9a","observation_id":"939f3c85-c716-43fe-821c-736597ed7817","resolution":{"observed_at":"2026-08-07T06:07:01.976315Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:07:01.979925Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.06009","last_updated":"2025-06-06T11:54:06Z","snapshot_observed_at":"2026-08-09T07:03:13.377140Z","submitted_at":"2025-06-06T11:54:06Z","title":"Unlocking Recursive Thinking of LLMs: Alignment via Refinement","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-07T06:07:01.979925Z"},"links":{"citing_paper":"/paper/2506.06009"},"observation_digest":"sha256:f6a99533673d270545665b12fa084771d809361a046cc226c118bb37c470ecfb","observation_id":"6a23e769-4d86-4c64-9a8e-9603b5d2a836","resolution":{"observed_at":"2026-08-07T06:07:01.979925Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.11791","last_updated":"2024-08-21T17:24:15Z","snapshot_observed_at":"2026-07-06T19:04:09.389583Z","submitted_at":"2024-08-21T17:24:15Z","title":"Critique-out-Loud Reward Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.11791","snapshot_observed_at":"2026-08-07T06:07:01.983009Z","title":"Chang, and Prithviraj Ammanabrolu","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.06009","last_updated":"2025-06-06T11:54:06Z","snapshot_observed_at":"2026-08-09T07:03:13.377140Z","submitted_at":"2025-06-06T11:54:06Z","title":"Unlocking Recursive Thinking of LLMs: Alignment via Refinement","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-07T06:07:01.983009Z"},"links":{"cited_paper":"/paper/2408.11791","citing_paper":"/paper/2506.06009"},"observation_digest":"sha256:2f784d4bef4c34899e78170a4d6fe3b555b98731b786acb26194418fbed702bd","observation_id":"47b801cc-3afb-4edc-95fa-edd60c593ab1","resolution":{"observed_at":"2026-08-07T06:07:01.983009Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:07:02.548836Z","title":null,"venue":null,"work_id":"fed0bac9-0804-4824-8da3-e188da532bf9","year":2013},"citing_paper":{"arxiv_id":"2506.06009","last_updated":"2025-06-06T11:54:06Z","snapshot_observed_at":"2026-08-09T07:03:13.377140Z","submitted_at":"2025-06-06T11:54:06Z","title":"Unlocking Recursive Thinking of LLMs: Alignment via Refinement","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-07T06:07:01.986290Z"},"links":{"citing_paper":"/paper/2506.06009"},"observation_digest":"sha256:addba1de5e10d546222fb91f353088fda113c8283b29073ef382d945b271c806","observation_id":"c55dfe77-2b6c-49ab-b566-62fab778e8b4","resolution":{"observed_at":"2026-08-07T06:07:02.551702Z","resolver_source":"raw_fallback","status":"unresolved"},"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":"2412.21187","last_updated":"2025-02-01T07:57:37Z","snapshot_observed_at":"2026-08-01T16:43:44.704797Z","submitted_at":"2024-12-30T18:55:12Z","title":"Do NOT Think That Much for 2+3=? On the Overthinking of o1-Like LLMs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.21187","snapshot_observed_at":"2026-08-07T06:07:01.989412Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.06009","last_updated":"2025-06-06T11:54:06Z","snapshot_observed_at":"2026-08-09T07:03:13.377140Z","submitted_at":"2025-06-06T11:54:06Z","title":"Unlocking Recursive Thinking of LLMs: Alignment via Refinement","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-07T06:07:01.989412Z"},"links":{"cited_paper":"/paper/2412.21187","citing_paper":"/paper/2506.06009"},"observation_digest":"sha256:31d9341b7aa1e71b9bc264c310053f9d72d899f02cec77e9da12a4439efe8598","observation_id":"6c04a003-9f19-46bf-b99d-54b7299b459f","resolution":{"observed_at":"2026-08-07T06:07:01.989412Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.01377","last_updated":"2024-07-16T03:24:39Z","snapshot_observed_at":"2026-08-02T07:46:40.319683Z","submitted_at":"2023-10-02T17:40:01Z","title":"UltraFeedback: Boosting Language Models with Scaled AI Feedback","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.01377","snapshot_observed_at":"2026-08-07T06:07:01.992586Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.06009","last_updated":"2025-06-06T11:54:06Z","snapshot_observed_at":"2026-08-09T07:03:13.377140Z","submitted_at":"2025-06-06T11:54:06Z","title":"Unlocking Recursive Thinking of LLMs: Alignment via Refinement","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-07T06:07:01.992586Z"},"links":{"cited_paper":"/paper/2310.01377","citing_paper":"/paper/2506.06009"},"observation_digest":"sha256:3ad0241e0f2020ca5709135091f349fe4f2e78e9b2f3c1d4b3a03cb526248b4a","observation_id":"6839484a-01ee-4961-8192-6cd9c52c977e","resolution":{"observed_at":"2026-08-07T06:07:01.992586Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2307.08691","last_updated":"2023-07-17T17:50:36Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-07-17T17:50:36Z","title":"FlashAttention-2: Faster Attention with Better Parallelism and Work Partitioning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2307.08691","snapshot_observed_at":"2026-08-07T06:07:01.995800Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.06009","last_updated":"2025-06-06T11:54:06Z","snapshot_observed_at":"2026-08-09T07:03:13.377140Z","submitted_at":"2025-06-06T11:54:06Z","title":"Unlocking Recursive Thinking of LLMs: Alignment via Refinement","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-07T06:07:01.995800Z"},"links":{"cited_paper":"/paper/2307.08691","citing_paper":"/paper/2506.06009"},"observation_digest":"sha256:53d70764a99a3ac01861fbe3b22b0c4a7f026cd5c91d105318809a8306199940","observation_id":"7813797b-1ee3-4912-9539-35b925349318","resolution":{"observed_at":"2026-08-07T06:07:01.995800Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:07:02.539559Z","title":null,"venue":null,"work_id":"8c609661-119b-4e2d-a1ab-2571a2c3329c","year":2024},"citing_paper":{"arxiv_id":"2506.06009","last_updated":"2025-06-06T11:54:06Z","snapshot_observed_at":"2026-08-09T07:03:13.377140Z","submitted_at":"2025-06-06T11:54:06Z","title":"Unlocking Recursive Thinking of LLMs: Alignment via Refinement","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-07T06:07:01.999001Z"},"links":{"citing_paper":"/paper/2506.06009"},"observation_digest":"sha256:40b2bb0872e8f2c96ffc159d246f02f2737580e4d0522ed571afdc05b9b06ea5","observation_id":"380dbae0-c436-4b05-80cd-67d470103764","resolution":{"observed_at":"2026-08-07T06:07:02.542765Z","resolver_source":"raw_fallback","status":"unresolved"},"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":"2402.01306","last_updated":"2024-11-19T18:12:45Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-02-02T10:53:36Z","title":"KTO: Model Alignment as Prospect Theoretic Optimization","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.01306","snapshot_observed_at":"2026-08-07T06:07:02.002272Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.06009","last_updated":"2025-06-06T11:54:06Z","snapshot_observed_at":"2026-08-09T07:03:13.377140Z","submitted_at":"2025-06-06T11:54:06Z","title":"Unlocking Recursive Thinking of LLMs: Alignment via Refinement","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-07T06:07:02.002272Z"},"links":{"cited_paper":"/paper/2402.01306","citing_paper":"/paper/2506.06009"},"observation_digest":"sha256:61fe074ac4302b0bb6a136846c1e8859cee256281d5bdd886a0f832276ce49f2","observation_id":"70eb2ecf-2649-4acf-a152-1efe251e6f61","resolution":{"observed_at":"2026-08-07T06:07:02.002272Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.04519","last_updated":"2025-01-08T14:12:57Z","snapshot_observed_at":"2026-08-04T20:57:22.329262Z","submitted_at":"2025-01-08T14:12:57Z","title":"rStar-Math: Small LLMs Can Master Math Reasoning with Self-Evolved Deep Thinking","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.04519","snapshot_observed_at":"2026-08-07T06:07:02.005898Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.06009","last_updated":"2025-06-06T11:54:06Z","snapshot_observed_at":"2026-08-09T07:03:13.377140Z","submitted_at":"2025-06-06T11:54:06Z","title":"Unlocking Recursive Thinking of LLMs: Alignment via Refinement","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-07T06:07:02.005898Z"},"links":{"cited_paper":"/paper/2501.04519","citing_paper":"/paper/2506.06009"},"observation_digest":"sha256:7955374cae469bd6053a65b54ec93d55029376e6e8236428972b3330247ebfa7","observation_id":"ffc07461-ffdc-44a3-8845-da654ca7584f","resolution":{"observed_at":"2026-08-07T06:07:02.005898Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:07:02.530492Z","title":null,"venue":null,"work_id":"8aa94a7a-1bc1-45ad-b213-1bacddf94287","year":2024},"citing_paper":{"arxiv_id":"2506.06009","last_updated":"2025-06-06T11:54:06Z","snapshot_observed_at":"2026-08-09T07:03:13.377140Z","submitted_at":"2025-06-06T11:54:06Z","title":"Unlocking Recursive Thinking of LLMs: Alignment via Refinement","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-07T06:07:02.009364Z"},"links":{"citing_paper":"/paper/2506.06009"},"observation_digest":"sha256:d1ade565a9f36606dce3ca0fda31c147f4f345e49a8d15a26e52d2db155d0029","observation_id":"1deacb34-0eb5-4a6d-8403-2b305905c92a","resolution":{"observed_at":"2026-08-07T06:07:02.533322Z","resolver_source":"raw_fallback","status":"unresolved"},"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":"2404.04298","last_updated":"2024-09-06T01:14:26Z","snapshot_observed_at":"2026-08-06T01:39:33.613496Z","submitted_at":"2024-04-04T20:27:37Z","title":"SELF-[IN]CORRECT: LLMs Struggle with Discriminating Self-Generated Responses","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.04298","snapshot_observed_at":"2026-08-07T06:07:02.012071Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.06009","last_updated":"2025-06-06T11:54:06Z","snapshot_observed_at":"2026-08-09T07:03:13.377140Z","submitted_at":"2025-06-06T11:54:06Z","title":"Unlocking Recursive Thinking of LLMs: Alignment via Refinement","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-07T06:07:02.012071Z"},"links":{"cited_paper":"/paper/2404.04298","citing_paper":"/paper/2506.06009"},"observation_digest":"sha256:16eac88de32134eea62de4e55d40b6e59cb3a6ee0cd3e38336e91c227531094e","observation_id":"99d2a96c-a0a0-4b41-b672-bf9620c8ca44","resolution":{"observed_at":"2026-08-07T06:07:02.012071Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:07:02.015165Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.06009","last_updated":"2025-06-06T11:54:06Z","snapshot_observed_at":"2026-08-09T07:03:13.377140Z","submitted_at":"2025-06-06T11:54:06Z","title":"Unlocking Recursive Thinking of LLMs: Alignment via Refinement","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-07T06:07:02.015165Z"},"links":{"citing_paper":"/paper/2506.06009"},"observation_digest":"sha256:8e01c9171c90b0ca668b22b3b6f9923aeb90d66946fce3fc6ed4d7598f1c58f2","observation_id":"6509816e-6a6d-47dd-a93c-8d7edb8b66f2","resolution":{"observed_at":"2026-08-07T06:07:02.015165Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:07:02.515029Z","title":null,"venue":null,"work_id":"667c0516-ccca-4a80-8a25-e4a2be5a00ee","year":2023},"citing_paper":{"arxiv_id":"2506.06009","last_updated":"2025-06-06T11:54:06Z","snapshot_observed_at":"2026-08-09T07:03:13.377140Z","submitted_at":"2025-06-06T11:54:06Z","title":"Unlocking Recursive Thinking of LLMs: Alignment via Refinement","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-07T06:07:02.018445Z"},"links":{"citing_paper":"/paper/2506.06009"},"observation_digest":"sha256:c8798c35ef993587293d3078c19216dcc49e9d4424755e5ed4fa45d4ba7dff78","observation_id":"204fcbc4-8020-47c9-b96e-6a8676ecf97c","resolution":{"observed_at":"2026-08-07T06:07:02.517796Z","resolver_source":"raw_fallback","status":"unresolved"},"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":"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-07T06:07:02.021435Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.06009","last_updated":"2025-06-06T11:54:06Z","snapshot_observed_at":"2026-08-09T07:03:13.377140Z","submitted_at":"2025-06-06T11:54:06Z","title":"Unlocking Recursive Thinking of LLMs: Alignment via Refinement","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-07T06:07:02.021435Z"},"links":{"cited_paper":"/paper/2409.12917","citing_paper":"/paper/2506.06009"},"observation_digest":"sha256:9394e3b059416f5a0bf247c05f1535f56c177a6a7dddaee99cddc16bfa63cbcc","observation_id":"705a9ac5-f8aa-43a1-acfa-18a3e9b4fbe4","resolution":{"observed_at":"2026-08-07T06:07:02.021435Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.11939","last_updated":"2024-10-14T18:11:58Z","snapshot_observed_at":"2026-08-02T11:33:41.297984Z","submitted_at":"2024-06-17T17:26:10Z","title":"From Crowdsourced Data to High-Quality Benchmarks: Arena-Hard and BenchBuilder Pipeline","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.11939","snapshot_observed_at":"2026-08-07T06:07:02.024636Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.06009","last_updated":"2025-06-06T11:54:06Z","snapshot_observed_at":"2026-08-09T07:03:13.377140Z","submitted_at":"2025-06-06T11:54:06Z","title":"Unlocking Recursive Thinking of LLMs: Alignment via Refinement","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-07T06:07:02.024636Z"},"links":{"cited_paper":"/paper/2406.11939","citing_paper":"/paper/2506.06009"},"observation_digest":"sha256:2daa614ffd7de52b98d7f574e17552409e2f46e0a415eca8fcf5ee7c9fbaa436","observation_id":"a7932206-d0a4-4c75-bb3e-9b990646251b","resolution":{"observed_at":"2026-08-07T06:07:02.024636Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:07:02.027559Z","title":"Hashimoto","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.06009","last_updated":"2025-06-06T11:54:06Z","snapshot_observed_at":"2026-08-09T07:03:13.377140Z","submitted_at":"2025-06-06T11:54:06Z","title":"Unlocking Recursive Thinking of LLMs: Alignment via Refinement","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-07T06:07:02.027559Z"},"links":{"citing_paper":"/paper/2506.06009"},"observation_digest":"sha256:7a5aa25287df624fe8e7a2c840faea80d4fa3c38985be8e786811522c9b9ccef","observation_id":"9d099228-8a1c-4a64-9c96-40bce31657d7","resolution":{"observed_at":"2026-08-07T06:07:02.027559Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.12163","last_updated":"2024-05-20T16:47:22Z","snapshot_observed_at":"2026-07-06T18:16:51.116432Z","submitted_at":"2024-05-20T16:47:22Z","title":"Fennec: Fine-grained Language Model Evaluation and Correction Extended through Branching and Bridging","version":1},"cited_work":{"arxiv_id":"2405.12163","doi":null,"metadata_source":"pith","pith_arxiv_id":"2405.12163","snapshot_observed_at":"2026-08-07T06:07:02.323155Z","title":"Fennec: Fine-grained Language Model Evaluation and Correction Extended through Branching and Bridging","venue":"cs.CL","work_id":"ed610644-d01b-4e70-8b6d-c29a03a4a5f7","year":2024},"citing_paper":{"arxiv_id":"2506.06009","last_updated":"2025-06-06T11:54:06Z","snapshot_observed_at":"2026-08-09T07:03:13.377140Z","submitted_at":"2025-06-06T11:54:06Z","title":"Unlocking Recursive Thinking of LLMs: Alignment via Refinement","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-07T06:07:02.030197Z"},"links":{"cited_paper":"/paper/2405.12163","citing_paper":"/paper/2506.06009"},"observation_digest":"sha256:1a17b71bea48a1fd95e4795decc7f8e5948dce202f66070abc8b8db6261c1f53","observation_id":"9ff1999d-45be-4193-9751-ae2c244ffcd8","resolution":{"observed_at":"2026-08-07T06:07:02.326602Z","resolver_source":"local_arxiv","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":"2305.20050","last_updated":"2023-05-31T17:24:00Z","snapshot_observed_at":"2026-08-05T13:11:04.104454Z","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-07T06:07:02.033102Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.06009","last_updated":"2025-06-06T11:54:06Z","snapshot_observed_at":"2026-08-09T07:03:13.377140Z","submitted_at":"2025-06-06T11:54:06Z","title":"Unlocking Recursive Thinking of LLMs: Alignment via Refinement","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-07T06:07:02.033102Z"},"links":{"cited_paper":"/paper/2305.20050","citing_paper":"/paper/2506.06009"},"observation_digest":"sha256:1889eb2b3b833c4e6e73594d08740990e934c9c62b8608855836d69402a5c1d0","observation_id":"e9d85ba7-afeb-4fd9-a028-9647961ba4e8","resolution":{"observed_at":"2026-08-07T06:07:02.033102Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.18451","last_updated":"2024-10-24T06:06:26Z","snapshot_observed_at":"2026-08-07T05:53:12.643515Z","submitted_at":"2024-10-24T06:06:26Z","title":"Skywork-Reward: Bag of Tricks for Reward Modeling in LLMs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.18451","snapshot_observed_at":"2026-08-07T06:07:02.036124Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.06009","last_updated":"2025-06-06T11:54:06Z","snapshot_observed_at":"2026-08-09T07:03:13.377140Z","submitted_at":"2025-06-06T11:54:06Z","title":"Unlocking Recursive Thinking of LLMs: Alignment via Refinement","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-07T06:07:02.036124Z"},"links":{"cited_paper":"/paper/2410.18451","citing_paper":"/paper/2506.06009"},"observation_digest":"sha256:428d9c858762536c658c44276c97528bb681a9f384caf8dcca40f461ff509efb","observation_id":"71669695-99c8-4e6d-8853-be1d52f87454","resolution":{"observed_at":"2026-08-07T06:07:02.036124Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:07:02.039027Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.06009","last_updated":"2025-06-06T11:54:06Z","snapshot_observed_at":"2026-08-09T07:03:13.377140Z","submitted_at":"2025-06-06T11:54:06Z","title":"Unlocking Recursive Thinking of LLMs: Alignment via Refinement","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-07T06:07:02.039027Z"},"links":{"citing_paper":"/paper/2506.06009"},"observation_digest":"sha256:2f1623e2c87321f7cfe25b847461cf2878cb11d1cd6ab129ebd8c8571f56e120","observation_id":"d449e7df-6801-4529-a0c1-68995e4c7361","resolution":{"observed_at":"2026-08-07T06:07:02.039027Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.09413","last_updated":"2024-12-22T10:44:13Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-12-12T16:20:36Z","title":"Imitate, Explore, and Self-Improve: A Reproduction Report on Slow-thinking Reasoning Systems","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.09413","snapshot_observed_at":"2026-08-07T06:07:02.041738Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.06009","last_updated":"2025-06-06T11:54:06Z","snapshot_observed_at":"2026-08-09T07:03:13.377140Z","submitted_at":"2025-06-06T11:54:06Z","title":"Unlocking Recursive Thinking of LLMs: Alignment via Refinement","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-07T06:07:02.041738Z"},"links":{"cited_paper":"/paper/2412.09413","citing_paper":"/paper/2506.06009"},"observation_digest":"sha256:2ce14227e9b21e71628a6c5cea3c4f3883b130d5039f8fb632a6ca7f9cd34798","observation_id":"cda1544f-8451-41de-9077-a474bf655e98","resolution":{"observed_at":"2026-08-07T06:07:02.041738Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.19393","last_updated":"2025-03-01T06:07:39Z","snapshot_observed_at":"2026-07-06T20:29:11.710285Z","submitted_at":"2025-01-31T18:48:08Z","title":"s1: Simple test-time scaling","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.19393","snapshot_observed_at":"2026-08-07T06:07:02.044561Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.06009","last_updated":"2025-06-06T11:54:06Z","snapshot_observed_at":"2026-08-09T07:03:13.377140Z","submitted_at":"2025-06-06T11:54:06Z","title":"Unlocking Recursive Thinking of LLMs: Alignment via Refinement","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-07T06:07:02.044561Z"},"links":{"cited_paper":"/paper/2501.19393","citing_paper":"/paper/2506.06009"},"observation_digest":"sha256:dd911f386bda643ed2ccf184f212989197da65394f3f577c135903e88a11d14f","observation_id":"48c893e3-c9f5-446b-931b-6ef14232d5c1","resolution":{"observed_at":"2026-08-07T06:07:02.044561Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:07:02.494208Z","title":null,"venue":null,"work_id":"d6f7fc82-652b-48dc-a5c3-64949e4e67ec","year":2024},"citing_paper":{"arxiv_id":"2506.06009","last_updated":"2025-06-06T11:54:06Z","snapshot_observed_at":"2026-08-09T07:03:13.377140Z","submitted_at":"2025-06-06T11:54:06Z","title":"Unlocking Recursive Thinking of LLMs: Alignment via Refinement","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-07T06:07:02.047780Z"},"links":{"citing_paper":"/paper/2506.06009"},"observation_digest":"sha256:5fce18c05a41079e71e6bb078548a137fb2153ab56e4495827999d6ad09bb01b","observation_id":"dd036561-2dc0-4c25-ae10-2a2b251de0ae","resolution":{"observed_at":"2026-08-07T06:07:02.497164Z","resolver_source":"raw_fallback","status":"unresolved"},"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":"2403.19159","last_updated":"2024-09-09T04:39:31Z","snapshot_observed_at":"2026-08-08T10:19:27.268855Z","submitted_at":"2024-03-28T06:03:47Z","title":"Disentangling Length from Quality in Direct Preference Optimization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.19159","snapshot_observed_at":"2026-08-07T06:07:02.051648Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.06009","last_updated":"2025-06-06T11:54:06Z","snapshot_observed_at":"2026-08-09T07:03:13.377140Z","submitted_at":"2025-06-06T11:54:06Z","title":"Unlocking Recursive Thinking of LLMs: Alignment via Refinement","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-07T06:07:02.051648Z"},"links":{"cited_paper":"/paper/2403.19159","citing_paper":"/paper/2506.06009"},"observation_digest":"sha256:ccefb40f165a63a3f54db7c024b121796b43515c3a210e008b3d9d0c7f9ec5de","observation_id":"7faebdb5-bce8-4568-9819-96e8c32d9373","resolution":{"observed_at":"2026-08-07T06:07:02.051648Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.18982","last_updated":"2024-10-08T15:13:01Z","snapshot_observed_at":"2026-07-06T19:39:15.025945Z","submitted_at":"2024-10-08T15:13:01Z","title":"O1 Replication Journey: A Strategic Progress Report -- Part 1","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.18982","snapshot_observed_at":"2026-08-07T06:07:02.055033Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.06009","last_updated":"2025-06-06T11:54:06Z","snapshot_observed_at":"2026-08-09T07:03:13.377140Z","submitted_at":"2025-06-06T11:54:06Z","title":"Unlocking Recursive Thinking of LLMs: Alignment via Refinement","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-07T06:07:02.055033Z"},"links":{"cited_paper":"/paper/2410.18982","citing_paper":"/paper/2506.06009"},"observation_digest":"sha256:77932a68574f717aa314b889a672fbc2501f8c3ffa117e37818c738e8c55c0ca","observation_id":"2d7ca1f7-6c45-49c7-8011-f26477e5e3b3","resolution":{"observed_at":"2026-08-07T06:07:02.055033Z","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-07T12:10:53.303603Z","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-07T06:07:02.058112Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.06009","last_updated":"2025-06-06T11:54:06Z","snapshot_observed_at":"2026-08-09T07:03:13.377140Z","submitted_at":"2025-06-06T11:54:06Z","title":"Unlocking Recursive Thinking of LLMs: Alignment via Refinement","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-07T06:07:02.058112Z"},"links":{"cited_paper":"/paper/2407.18219","citing_paper":"/paper/2506.06009"},"observation_digest":"sha256:f132ef0233701ab5824232db7b01d3cdf33b8303035565922a67b94a30f58b03","observation_id":"240fdee3-e6fb-4e72-ab6c-d236343dbeff","resolution":{"observed_at":"2026-08-07T06:07:02.058112Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:07:02.484777Z","title":null,"venue":null,"work_id":"94143787-50de-448c-ab20-c9969e0ce0d3","year":2024},"citing_paper":{"arxiv_id":"2506.06009","last_updated":"2025-06-06T11:54:06Z","snapshot_observed_at":"2026-08-09T07:03:13.377140Z","submitted_at":"2025-06-06T11:54:06Z","title":"Unlocking Recursive Thinking of LLMs: Alignment via Refinement","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-07T06:07:02.061385Z"},"links":{"citing_paper":"/paper/2506.06009"},"observation_digest":"sha256:429b4c00001e6be4d76bb67482997ec45354e5d7655196202ffc3f5bf0d36972","observation_id":"a0289a2f-f48d-4367-9d62-3fb1d7e8a19a","resolution":{"observed_at":"2026-08-07T06:07:02.488026Z","resolver_source":"raw_fallback","status":"unresolved"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:07:02.064199Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.06009","last_updated":"2025-06-06T11:54:06Z","snapshot_observed_at":"2026-08-09T07:03:13.377140Z","submitted_at":"2025-06-06T11:54:06Z","title":"Unlocking Recursive Thinking of LLMs: Alignment via Refinement","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-07T06:07:02.064199Z"},"links":{"citing_paper":"/paper/2506.06009"},"observation_digest":"sha256:f7cc2695ad8d36a6916403f0d22101e0c0436fd42198579eab9733b48940bd28","observation_id":"e3c7f2da-8a66-47c0-b9b9-cb3b863d71f2","resolution":{"observed_at":"2026-08-07T06:07:02.064199Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:07:02.066957Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.06009","last_updated":"2025-06-06T11:54:06Z","snapshot_observed_at":"2026-08-09T07:03:13.377140Z","submitted_at":"2025-06-06T11:54:06Z","title":"Unlocking Recursive Thinking of LLMs: Alignment via Refinement","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-07T06:07:02.066957Z"},"links":{"citing_paper":"/paper/2506.06009"},"observation_digest":"sha256:0130e52d0405ec7753dbc8b4b60368d6e381155715e085dfec7bce8fb9996a55","observation_id":"8d62d28c-59f8-4d8d-a541-ff514de9200d","resolution":{"observed_at":"2026-08-07T06:07:02.066957Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:07:02.069605Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2506.06009","last_updated":"2025-06-06T11:54:06Z","snapshot_observed_at":"2026-08-09T07:03:13.377140Z","submitted_at":"2025-06-06T11:54:06Z","title":"Unlocking Recursive Thinking of LLMs: Alignment via Refinement","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-07T06:07:02.069605Z"},"links":{"citing_paper":"/paper/2506.06009"},"observation_digest":"sha256:ff3d6e5463a69dd524a1f9e21dd6526949f7c024abf0afbf01014aa0abf0c9bc","observation_id":"0f14bae8-f08e-4f62-ba2d-9cb358d8eb81","resolution":{"observed_at":"2026-08-07T06:07:02.069605Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:07:02.072269Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2506.06009","last_updated":"2025-06-06T11:54:06Z","snapshot_observed_at":"2026-08-09T07:03:13.377140Z","submitted_at":"2025-06-06T11:54:06Z","title":"Unlocking Recursive Thinking of LLMs: Alignment via Refinement","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-07T06:07:02.072269Z"},"links":{"citing_paper":"/paper/2506.06009"},"observation_digest":"sha256:f7c1ac106cd051a3e09c6249a07638eb1460af5159e98059b128b301a3433f04","observation_id":"429d58db-9a7f-433a-92e6-8cd9a2964ec3","resolution":{"observed_at":"2026-08-07T06:07:02.072269Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:07:02.450877Z","title":null,"venue":null,"work_id":"619c1ff6-ee59-4c53-88e8-5034bbba88dc","year":1979},"citing_paper":{"arxiv_id":"2506.06009","last_updated":"2025-06-06T11:54:06Z","snapshot_observed_at":"2026-08-09T07:03:13.377140Z","submitted_at":"2025-06-06T11:54:06Z","title":"Unlocking Recursive Thinking of LLMs: Alignment via Refinement","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-07T06:07:02.075154Z"},"links":{"citing_paper":"/paper/2506.06009"},"observation_digest":"sha256:8a422bedaa9e02b3b7082f7a7b1a62d0b3c948a574c0a19a8bbb9925e6daa461","observation_id":"b414345b-aa49-4c5e-a267-65b1183c2d77","resolution":{"observed_at":"2026-08-07T06:07:02.453762Z","resolver_source":"raw_fallback","status":"unresolved"},"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":"1707.06347","last_updated":"2017-08-28T09:20:06Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2017-07-20T02:32:33Z","title":"Proximal Policy Optimization Algorithms","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1707.06347","snapshot_observed_at":"2026-08-07T06:07:02.078218Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2506.06009","last_updated":"2025-06-06T11:54:06Z","snapshot_observed_at":"2026-08-09T07:03:13.377140Z","submitted_at":"2025-06-06T11:54:06Z","title":"Unlocking Recursive Thinking of LLMs: Alignment via Refinement","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-07T06:07:02.078218Z"},"links":{"cited_paper":"/paper/1707.06347","citing_paper":"/paper/2506.06009"},"observation_digest":"sha256:5313603ab04cc1dcc4ece5f209dce6217277c5086f65454d0e7b07d5ac919ce5","observation_id":"7ca97041-5f81-428c-8287-3dc77c8239d5","resolution":{"observed_at":"2026-08-07T06:07:02.078218Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:07:02.441833Z","title":null,"venue":null,"work_id":"98e36126-5bc2-4bdc-b7ff-3ee6fda9476b","year":1971},"citing_paper":{"arxiv_id":"2506.06009","last_updated":"2025-06-06T11:54:06Z","snapshot_observed_at":"2026-08-09T07:03:13.377140Z","submitted_at":"2025-06-06T11:54:06Z","title":"Unlocking Recursive Thinking of LLMs: Alignment via Refinement","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-07T06:07:02.081251Z"},"links":{"citing_paper":"/paper/2506.06009"},"observation_digest":"sha256:3810f4e69a1d31ad207b3310a3c0dd8bbeed1c180a2644115b319327c9c018de","observation_id":"3a8cd4f1-5e19-4997-bd32-5b4e9ae2bd3e","resolution":{"observed_at":"2026-08-07T06:07:02.444742Z","resolver_source":"raw_fallback","status":"unresolved"},"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":"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-07T06:07:02.084050Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.06009","last_updated":"2025-06-06T11:54:06Z","snapshot_observed_at":"2026-08-09T07:03:13.377140Z","submitted_at":"2025-06-06T11:54:06Z","title":"Unlocking Recursive Thinking of LLMs: Alignment via Refinement","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-07T06:07:02.084050Z"},"links":{"cited_paper":"/paper/2408.03314","citing_paper":"/paper/2506.06009"},"observation_digest":"sha256:41b211fff597052eb666de3445eb7ccd01c71108ca90c6a9195fd7408dae9c49","observation_id":"ecba1e32-ca90-4164-998b-5c71dbe261b2","resolution":{"observed_at":"2026-08-07T06:07:02.084050Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:07:02.432631Z","title":null,"venue":null,"work_id":"0eedef3c-ade8-46bd-9b4c-4fb33b2757c0","year":1988},"citing_paper":{"arxiv_id":"2506.06009","last_updated":"2025-06-06T11:54:06Z","snapshot_observed_at":"2026-08-09T07:03:13.377140Z","submitted_at":"2025-06-06T11:54:06Z","title":"Unlocking Recursive Thinking of LLMs: Alignment via Refinement","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-07T06:07:02.087091Z"},"links":{"citing_paper":"/paper/2506.06009"},"observation_digest":"sha256:3a9a0f3b40dca1657f969c256f61c6c0bee6190448a28b1c201371291d6b6efd","observation_id":"5e4046cb-f43d-485f-a977-3299fb9f0052","resolution":{"observed_at":"2026-08-07T06:07:02.435618Z","resolver_source":"raw_fallback","status":"unresolved"},"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":"2501.12599","last_updated":"2025-06-03T02:14:54Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-01-22T02:48:14Z","title":"Kimi k1.5: Scaling Reinforcement Learning with LLMs","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.12599","snapshot_observed_at":"2026-08-07T06:07:02.089755Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.06009","last_updated":"2025-06-06T11:54:06Z","snapshot_observed_at":"2026-08-09T07:03:13.377140Z","submitted_at":"2025-06-06T11:54:06Z","title":"Unlocking Recursive Thinking of LLMs: Alignment via Refinement","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-07T06:07:02.089755Z"},"links":{"cited_paper":"/paper/2501.12599","citing_paper":"/paper/2506.06009"},"observation_digest":"sha256:3c145a1fa76985accccc3249c6b1dc083bc8e63c41e020a3113b124a43e2d8f9","observation_id":"e5792110-ad88-4671-964a-a5b8859a5d18","resolution":{"observed_at":"2026-08-07T06:07:02.089755Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:07:02.092644Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.06009","last_updated":"2025-06-06T11:54:06Z","snapshot_observed_at":"2026-08-09T07:03:13.377140Z","submitted_at":"2025-06-06T11:54:06Z","title":"Unlocking Recursive Thinking of LLMs: Alignment via Refinement","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-07T06:07:02.092644Z"},"links":{"citing_paper":"/paper/2506.06009"},"observation_digest":"sha256:7d04d940c0f8fa17e69d7eac60d2d7c91c848e1c00e9fae936f633a6fa5874d0","observation_id":"bfb59995-fcf9-4ed4-a7c5-2584175072a5","resolution":{"observed_at":"2026-08-07T06:07:02.092644Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.17498","last_updated":"2025-08-24T16:41:54Z","snapshot_observed_at":"2026-07-06T20:12:04.557004Z","submitted_at":"2024-12-23T11:55:33Z","title":"DRT: Deep Reasoning Translation via Long Chain-of-Thought","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.17498","snapshot_observed_at":"2026-08-07T06:07:02.095155Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.06009","last_updated":"2025-06-06T11:54:06Z","snapshot_observed_at":"2026-08-09T07:03:13.377140Z","submitted_at":"2025-06-06T11:54:06Z","title":"Unlocking Recursive Thinking of LLMs: Alignment via Refinement","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-07T06:07:02.095155Z"},"links":{"cited_paper":"/paper/2412.17498","citing_paper":"/paper/2506.06009"},"observation_digest":"sha256:359b141b617c25c0389cef1e5bf7b1714da85e9e6be667181724e37600c7b726","observation_id":"617291b0-867b-4816-97f9-e09c6666a867","resolution":{"observed_at":"2026-08-07T06:07:02.095155Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:07:02.098175Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.06009","last_updated":"2025-06-06T11:54:06Z","snapshot_observed_at":"2026-08-09T07:03:13.377140Z","submitted_at":"2025-06-06T11:54:06Z","title":"Unlocking Recursive Thinking of LLMs: Alignment via Refinement","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-07T06:07:02.098175Z"},"links":{"citing_paper":"/paper/2506.06009"},"observation_digest":"sha256:984c606df887f19470c2c3c996bc20327e229d1bd137e501d7e3a167a899437c","observation_id":"491b5ac9-a129-4783-ba7c-6607f705e9b3","resolution":{"observed_at":"2026-08-07T06:07:02.098175Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2306.05087","last_updated":"2024-05-24T06:37:31Z","snapshot_observed_at":"2026-08-07T12:09:31.277517Z","submitted_at":"2023-06-08T10:41:56Z","title":"PandaLM: An Automatic Evaluation Benchmark for LLM Instruction Tuning Optimization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.05087","snapshot_observed_at":"2026-08-07T06:07:02.101272Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.06009","last_updated":"2025-06-06T11:54:06Z","snapshot_observed_at":"2026-08-09T07:03:13.377140Z","submitted_at":"2025-06-06T11:54:06Z","title":"Unlocking Recursive Thinking of LLMs: Alignment via Refinement","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-07T06:07:02.101272Z"},"links":{"cited_paper":"/paper/2306.05087","citing_paper":"/paper/2506.06009"},"observation_digest":"sha256:b355819f195957d408ff30c109735374bb081eeafefb43b07d28c9a847195adc","observation_id":"95bf17a7-838b-45b7-9e5f-4411dfae52a6","resolution":{"observed_at":"2026-08-07T06:07:02.101272Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.18585","last_updated":"2025-02-18T16:51:53Z","snapshot_observed_at":"2026-08-08T15:09:27.177867Z","submitted_at":"2025-01-30T18:58:18Z","title":"Thoughts Are All Over the Place: On the Underthinking of o1-Like LLMs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.18585","snapshot_observed_at":"2026-08-07T06:07:02.104060Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.06009","last_updated":"2025-06-06T11:54:06Z","snapshot_observed_at":"2026-08-09T07:03:13.377140Z","submitted_at":"2025-06-06T11:54:06Z","title":"Unlocking Recursive Thinking of LLMs: Alignment via Refinement","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-07T06:07:02.104060Z"},"links":{"cited_paper":"/paper/2501.18585","citing_paper":"/paper/2506.06009"},"observation_digest":"sha256:337560ba49bec01efee5b31136419d2f54603404abfc293c80c568a2c9e49c7b","observation_id":"76841248-9d69-4b5e-b366-47d44e28e2b8","resolution":{"observed_at":"2026-08-07T06:07:02.104060Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:07:02.107069Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.06009","last_updated":"2025-06-06T11:54:06Z","snapshot_observed_at":"2026-08-09T07:03:13.377140Z","submitted_at":"2025-06-06T11:54:06Z","title":"Unlocking Recursive Thinking of LLMs: Alignment via Refinement","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-07T06:07:02.107069Z"},"links":{"citing_paper":"/paper/2506.06009"},"observation_digest":"sha256:55b39ad8f8c8332530e1e9f3a256dfc88215c632e32cb2732606a5af472f9482","observation_id":"861754ea-92b0-4b77-ab47-7d256420d134","resolution":{"observed_at":"2026-08-07T06:07:02.107069Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.19594","last_updated":"2024-07-30T01:38:06Z","snapshot_observed_at":"2026-07-06T18:53:00.965448Z","submitted_at":"2024-07-28T21:58:28Z","title":"Meta-Rewarding Language Models: Self-Improving Alignment with LLM-as-a-Meta-Judge","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.19594","snapshot_observed_at":"2026-08-07T06:07:02.109745Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.06009","last_updated":"2025-06-06T11:54:06Z","snapshot_observed_at":"2026-08-09T07:03:13.377140Z","submitted_at":"2025-06-06T11:54:06Z","title":"Unlocking Recursive Thinking of LLMs: Alignment via Refinement","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-07T06:07:02.109745Z"},"links":{"cited_paper":"/paper/2407.19594","citing_paper":"/paper/2506.06009"},"observation_digest":"sha256:e9e2ef0f06fce854667744dd3d3b47c9e0406b0ab4ceb1e07569ca75b68741ac","observation_id":"922c3bed-baff-4497-b9b8-297001d79be1","resolution":{"observed_at":"2026-08-07T06:07:02.109745Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.10020","last_updated":"2025-03-28T00:06:51Z","snapshot_observed_at":"2026-08-07T08:02:34.857823Z","submitted_at":"2024-01-18T14:43:47Z","title":"Self-Rewarding Language Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.10020","snapshot_observed_at":"2026-08-07T06:07:02.112916Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.06009","last_updated":"2025-06-06T11:54:06Z","snapshot_observed_at":"2026-08-09T07:03:13.377140Z","submitted_at":"2025-06-06T11:54:06Z","title":"Unlocking Recursive Thinking of LLMs: Alignment via Refinement","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-07T06:07:02.112916Z"},"links":{"cited_paper":"/paper/2401.10020","citing_paper":"/paper/2506.06009"},"observation_digest":"sha256:2bdfdc9497c6ce765891b858caf6e5cdb651a3171674a617d743d4c734e16d28","observation_id":"25ec39e4-7325-4bf2-93cd-bd83a1ca71c3","resolution":{"observed_at":"2026-08-07T06:07:02.112916Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.14959","last_updated":"2025-07-15T07:07:14Z","snapshot_observed_at":"2026-08-07T23:29:36.918663Z","submitted_at":"2024-12-19T15:39:31Z","title":"Understanding the Dark Side of LLMs' Intrinsic Self-Correction","version":2},"cited_work":{"arxiv_id":"2412.14959","doi":null,"metadata_source":"pith","pith_arxiv_id":"2412.14959","snapshot_observed_at":"2026-08-07T06:07:02.170366Z","title":"Understanding the Dark Side of LLMs' Intrinsic Self-Correction","venue":"cs.CL","work_id":"1023339a-7f68-4367-b0ad-ccdf61e0fb38","year":2024},"citing_paper":{"arxiv_id":"2506.06009","last_updated":"2025-06-06T11:54:06Z","snapshot_observed_at":"2026-08-09T07:03:13.377140Z","submitted_at":"2025-06-06T11:54:06Z","title":"Unlocking Recursive Thinking of LLMs: Alignment via Refinement","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-07T06:07:02.115821Z"},"links":{"cited_paper":"/paper/2412.14959","citing_paper":"/paper/2506.06009"},"observation_digest":"sha256:9eed66ee5c31b8c92f9fa360efee87eae232f27f843c5081950ff73b22134775","observation_id":"33364e88-0301-43cb-82b7-a273cb02dc70","resolution":{"observed_at":"2026-08-07T06:07:02.175915Z","resolver_source":"local_arxiv","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":"2412.00154","last_updated":"2024-12-10T04:39:25Z","snapshot_observed_at":"2026-08-05T17:55:01.214018Z","submitted_at":"2024-11-29T07:19:56Z","title":"o1-Coder: an o1 Replication for Coding","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.00154","snapshot_observed_at":"2026-08-07T06:07:02.118750Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.06009","last_updated":"2025-06-06T11:54:06Z","snapshot_observed_at":"2026-08-09T07:03:13.377140Z","submitted_at":"2025-06-06T11:54:06Z","title":"Unlocking Recursive Thinking of LLMs: Alignment via Refinement","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-07T06:07:02.118750Z"},"links":{"cited_paper":"/paper/2412.00154","citing_paper":"/paper/2506.06009"},"observation_digest":"sha256:3134022e371b9c20061fd544f5575428be719fe376c645f49a8be9ee34fac061","observation_id":"19cb7ee1-9951-4eca-8ed0-a9302ad030b9","resolution":{"observed_at":"2026-08-07T06:07:02.118750Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2411.14405","last_updated":"2024-11-25T17:57:55Z","snapshot_observed_at":"2026-07-06T19:53:56.407834Z","submitted_at":"2024-11-21T18:37:33Z","title":"Marco-o1: Towards Open Reasoning Models for Open-Ended Solutions","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.14405","snapshot_observed_at":"2026-08-07T06:07:02.121912Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.06009","last_updated":"2025-06-06T11:54:06Z","snapshot_observed_at":"2026-08-09T07:03:13.377140Z","submitted_at":"2025-06-06T11:54:06Z","title":"Unlocking Recursive Thinking of LLMs: Alignment via Refinement","version":1},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-07T06:07:02.121912Z"},"links":{"cited_paper":"/paper/2411.14405","citing_paper":"/paper/2506.06009"},"observation_digest":"sha256:479fd7c2d4b42cbcd8802f549813e17818225db1fafd1ef235e7f124a8c69c23","observation_id":"b1d0106d-abe3-4a86-b6f0-07b718b24a5d","resolution":{"observed_at":"2026-08-07T06:07:02.121912Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2506.06009","last_updated":"2025-06-06T11:54:06Z","latest_version":1,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-09T07:03:13.377140Z","submitted_at":"2025-06-06T11:54:06Z","title":"Unlocking Recursive Thinking of LLMs: Alignment via Refinement"},"reference_resolution":{"displayed":50,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":48,"verified_exact":2,"verified_fuzzy":0},"total_outbound_references":50},"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 9 August 2026, this Paper Citation Record lists 50 of 50 outbound references and 0 inbound Pith citation observations for arXiv:2506.06009."}