{"as_of":"2026-08-08T02:18:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:436eff7514cf254d3150dc7ee4c28cfd09e2312da6cb6bcd27f28e4480f9c639","coverage":[{"denominator":27,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":27,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T13:51:43.605901Z","state":"measured"},{"denominator":27,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":27,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+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/2505.20737/citation-record","integrity":"/paper/2505.20737/integrity","json":"/paper/2505.20737/citation-record.json","paper":"/paper/2505.20737"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:51:41.015662Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.20737","last_updated":"2025-05-27T05:27:54Z","snapshot_observed_at":"2026-08-07T13:45:22.968013Z","submitted_at":"2025-05-27T05:27:54Z","title":"RRO: LLM Agent Optimization Through Rising Reward Trajectories","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-07T13:51:41.015662Z"},"links":{"citing_paper":"/paper/2505.20737"},"observation_digest":"sha256:7ded0aef3037c4d09eea1bfee38f3c8113239f37ab7824262a33cb7dd68d8c85","observation_id":"0faff669-6ec0-4b39-a99e-fe973c712998","resolution":{"observed_at":"2026-08-07T13:51:41.015662Z","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-07T13:51:41.148103Z","title":"Language models are few-shot learners","venue":null,"work_id":null,"year":1901},"citing_paper":{"arxiv_id":"2505.20737","last_updated":"2025-05-27T05:27:54Z","snapshot_observed_at":"2026-08-07T13:45:22.968013Z","submitted_at":"2025-05-27T05:27:54Z","title":"RRO: LLM Agent Optimization Through Rising Reward Trajectories","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-07T13:51:41.148103Z"},"links":{"citing_paper":"/paper/2505.20737"},"observation_digest":"sha256:b5ea721068a83139573ae25d07e092db719e12145db7646cdfa150e92da0c7ba","observation_id":"4c2f4002-50e6-489d-adf2-d869cb36b850","resolution":{"observed_at":"2026-08-07T13:51:41.148103Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.05915","last_updated":"2023-10-09T17:58:38Z","snapshot_observed_at":"2026-08-05T18:32:49.850038Z","submitted_at":"2023-10-09T17:58:38Z","title":"FireAct: Toward Language Agent Fine-tuning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.05915","snapshot_observed_at":"2026-08-07T13:51:41.263415Z","title":"Fireact: Toward language agent fine-tuning","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.20737","last_updated":"2025-05-27T05:27:54Z","snapshot_observed_at":"2026-08-07T13:45:22.968013Z","submitted_at":"2025-05-27T05:27:54Z","title":"RRO: LLM Agent Optimization Through Rising Reward Trajectories","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-07T13:51:41.263415Z"},"links":{"cited_paper":"/paper/2310.05915","citing_paper":"/paper/2505.20737"},"observation_digest":"sha256:4e737343155943f17a590376a352b22a439e23fc2dd17d44307e94498c973efe","observation_id":"34e23431-e069-445d-90ab-5951361985e9","resolution":{"observed_at":"2026-08-07T13:51:41.263415Z","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-07T13:51:44.706878Z","title":null,"venue":null,"work_id":"d40f37b2-6152-43d5-8863-5be5a139d21b","year":2023},"citing_paper":{"arxiv_id":"2505.20737","last_updated":"2025-05-27T05:27:54Z","snapshot_observed_at":"2026-08-07T13:45:22.968013Z","submitted_at":"2025-05-27T05:27:54Z","title":"RRO: LLM Agent Optimization Through Rising Reward Trajectories","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-07T13:51:41.347777Z"},"links":{"citing_paper":"/paper/2505.20737"},"observation_digest":"sha256:0d5fa093ead9ec0a872ec74445c11a6fbf62d96a83f4bd9742485b8375deda30","observation_id":"bd212bbe-d3f0-4958-8578-56ae96444fd3","resolution":{"observed_at":"2026-08-07T13:51:44.799382Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T13:51:41.442326Z","title":"Deep reinforcement learning from human preferences","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2505.20737","last_updated":"2025-05-27T05:27:54Z","snapshot_observed_at":"2026-08-07T13:45:22.968013Z","submitted_at":"2025-05-27T05:27:54Z","title":"RRO: LLM Agent Optimization Through Rising Reward Trajectories","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-07T13:51:41.442326Z"},"links":{"citing_paper":"/paper/2505.20737"},"observation_digest":"sha256:208e63daad035b3120c4af74dd6cbf035e084fb469cbe8922eef6e34482d072d","observation_id":"0ae589bc-8a04-4b7e-92cb-0bc154a358af","resolution":{"observed_at":"2026-08-07T13:51:41.442326Z","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-07T13:51:44.536620Z","title":"Complexity-based prompting for multi-step reasoning","venue":null,"work_id":"f05bbb8b-2180-4771-bef4-27cb6f2ba4a7","year":2022},"citing_paper":{"arxiv_id":"2505.20737","last_updated":"2025-05-27T05:27:54Z","snapshot_observed_at":"2026-08-07T13:45:22.968013Z","submitted_at":"2025-05-27T05:27:54Z","title":"RRO: LLM Agent Optimization Through Rising Reward Trajectories","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-07T13:51:41.525532Z"},"links":{"citing_paper":"/paper/2505.20737"},"observation_digest":"sha256:768dd67c37061320780da4d99d5cf7c5d4cf8e9263e619ae589bd55396d42c01","observation_id":"9651b20e-3ac5-41c8-a74d-50a085c7d770","resolution":{"observed_at":"2026-08-07T13:51:44.616698Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T13:51:41.647817Z","title":"Large language models are zero-shot reasoners","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.20737","last_updated":"2025-05-27T05:27:54Z","snapshot_observed_at":"2026-08-07T13:45:22.968013Z","submitted_at":"2025-05-27T05:27:54Z","title":"RRO: LLM Agent Optimization Through Rising Reward Trajectories","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-07T13:51:41.647817Z"},"links":{"citing_paper":"/paper/2505.20737"},"observation_digest":"sha256:f02d1fcbb308c22fbbaeede74687fb65e5a9a6a6648da217bfdcd0f3fa47e1f8","observation_id":"55751f3d-ce1b-40cb-a013-31ebdee19dab","resolution":{"observed_at":"2026-08-07T13:51:41.647817Z","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-07T13:51:41.770139Z","title":"Let's verify step by step","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.20737","last_updated":"2025-05-27T05:27:54Z","snapshot_observed_at":"2026-08-07T13:45:22.968013Z","submitted_at":"2025-05-27T05:27:54Z","title":"RRO: LLM Agent Optimization Through Rising Reward Trajectories","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-07T13:51:41.770139Z"},"links":{"citing_paper":"/paper/2505.20737"},"observation_digest":"sha256:4975a0e2c36d9d51c08a0ebb6bc3877ae90fca11e386074ddafcdb417f35600e","observation_id":"0fa6e4be-6a92-465d-9c0b-61f713909791","resolution":{"observed_at":"2026-08-07T13:51:41.770139Z","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-07T13:51:41.851235Z","title":"Let's verify step by step","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.20737","last_updated":"2025-05-27T05:27:54Z","snapshot_observed_at":"2026-08-07T13:45:22.968013Z","submitted_at":"2025-05-27T05:27:54Z","title":"RRO: LLM Agent Optimization Through Rising Reward Trajectories","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-07T13:51:41.851235Z"},"links":{"citing_paper":"/paper/2505.20737"},"observation_digest":"sha256:7043e4f1eee7884a62f44b21a1804d7b3007c24c3890ae8f955da5468716617b","observation_id":"bfbee95e-0654-4dbc-9ef7-d123955fa6bf","resolution":{"observed_at":"2026-08-07T13:51:41.851235Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.06592","last_updated":"2024-12-11T22:59:10Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-06-05T19:25:40Z","title":"Improve Mathematical Reasoning in Language Models by Automated Process Supervision","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.06592","snapshot_observed_at":"2026-08-07T13:51:41.974215Z","title":"Improve mathematical reasoning in language models by automated process supervision","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.20737","last_updated":"2025-05-27T05:27:54Z","snapshot_observed_at":"2026-08-07T13:45:22.968013Z","submitted_at":"2025-05-27T05:27:54Z","title":"RRO: LLM Agent Optimization Through Rising Reward Trajectories","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-07T13:51:41.974215Z"},"links":{"cited_paper":"/paper/2406.06592","citing_paper":"/paper/2505.20737"},"observation_digest":"sha256:f852c24a158803cee5cb0a644f26ffc09c9d7b758e196ed2bcac3e2e6aa81c2f","observation_id":"e3ca2ecf-ebce-4e01-8414-30e0e656cd66","resolution":{"observed_at":"2026-08-07T13:51:41.974215Z","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-07T13:51:42.072863Z","title":"Training language models to follow instructions with human feedback","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.20737","last_updated":"2025-05-27T05:27:54Z","snapshot_observed_at":"2026-08-07T13:45:22.968013Z","submitted_at":"2025-05-27T05:27:54Z","title":"RRO: LLM Agent Optimization Through Rising Reward Trajectories","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-07T13:51:42.072863Z"},"links":{"citing_paper":"/paper/2505.20737"},"observation_digest":"sha256:ffb9d16e39c2bf34bbff77722215c4d623f7a14f130624a434ff917dde30fabb","observation_id":"ba0de3c6-a8df-4580-8830-c8cb4ec0ff69","resolution":{"observed_at":"2026-08-07T13:51:42.072863Z","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-07T13:51:42.132509Z","title":"Direct preference optimization: Your language model is secretly a reward model","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.20737","last_updated":"2025-05-27T05:27:54Z","snapshot_observed_at":"2026-08-07T13:45:22.968013Z","submitted_at":"2025-05-27T05:27:54Z","title":"RRO: LLM Agent Optimization Through Rising Reward Trajectories","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-07T13:51:42.132509Z"},"links":{"citing_paper":"/paper/2505.20737"},"observation_digest":"sha256:b2771277ccb482262ca64d736599cbd42cee6667ce5973c032848b6cf8e52fcd","observation_id":"c7627424-038d-4c6c-b72c-cd0a68fa5f26","resolution":{"observed_at":"2026-08-07T13:51:42.132509Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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-07T13:51:42.247181Z","title":"Proximal policy optimization algorithms","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2505.20737","last_updated":"2025-05-27T05:27:54Z","snapshot_observed_at":"2026-08-07T13:45:22.968013Z","submitted_at":"2025-05-27T05:27:54Z","title":"RRO: LLM Agent Optimization Through Rising Reward Trajectories","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-07T13:51:42.247181Z"},"links":{"cited_paper":"/paper/1707.06347","citing_paper":"/paper/2505.20737"},"observation_digest":"sha256:615284eb13e2ac53c6c58273cc072ffb0894b4b06ec48877f59bbd24d19076af","observation_id":"0a5508d8-bd6f-4483-a7d7-4feb62be20b3","resolution":{"observed_at":"2026-08-07T13:51:42.247181Z","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-07T13:51:42.374197Z","title":"Trial and error: Exploration-based trajectory optimization of LLM agents","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.20737","last_updated":"2025-05-27T05:27:54Z","snapshot_observed_at":"2026-08-07T13:45:22.968013Z","submitted_at":"2025-05-27T05:27:54Z","title":"RRO: LLM Agent Optimization Through Rising Reward Trajectories","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-07T13:51:42.374197Z"},"links":{"citing_paper":"/paper/2505.20737"},"observation_digest":"sha256:ef1abceb9204f74d50b0da01178a279a1ff29b43d7f73b95447a35a5d6b81698","observation_id":"ca9dc9fc-7c7f-414a-9001-8d0c75cf5792","resolution":{"observed_at":"2026-08-07T13:51:42.374197Z","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-07T13:51:42.452605Z","title":"Math-shepherd: Verify and reinforce LLM s step-by-step without human annotations","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.20737","last_updated":"2025-05-27T05:27:54Z","snapshot_observed_at":"2026-08-07T13:45:22.968013Z","submitted_at":"2025-05-27T05:27:54Z","title":"RRO: LLM Agent Optimization Through Rising Reward Trajectories","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-07T13:51:42.452605Z"},"links":{"citing_paper":"/paper/2505.20737"},"observation_digest":"sha256:07e0d504578fc69505155893c0efc234d4ba60272e389892d29c93b84a90376a","observation_id":"0b254d60-96f2-4a93-8945-e698f000a5d8","resolution":{"observed_at":"2026-08-07T13:51:42.452605Z","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-07T13:51:44.310214Z","title":"Math-shepherd: Verify and reinforce llms step-by-step without human annotations","venue":null,"work_id":"320ea711-55f9-4904-aac0-63ba6059e8a0","year":2024},"citing_paper":{"arxiv_id":"2505.20737","last_updated":"2025-05-27T05:27:54Z","snapshot_observed_at":"2026-08-07T13:45:22.968013Z","submitted_at":"2025-05-27T05:27:54Z","title":"RRO: LLM Agent Optimization Through Rising Reward Trajectories","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-07T13:51:42.540673Z"},"links":{"citing_paper":"/paper/2505.20737"},"observation_digest":"sha256:d348c346e554b31809893309dc1462b0dfd417f833d9b93fbb2ab823caf77fdd","observation_id":"ad41f962-9107-4136-8949-6e47c652b4d7","resolution":{"observed_at":"2026-08-07T13:51:44.417785Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.02658","last_updated":"2024-10-14T19:33:00Z","snapshot_observed_at":"2026-07-06T17:25:14.115360Z","submitted_at":"2024-02-05T00:57:51Z","title":"Multi-step Problem Solving Through a Verifier: An Empirical Analysis on Model-induced Process Supervision","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.02658","snapshot_observed_at":"2026-08-07T13:51:42.634639Z","title":"Multi-step problem solving through a verifier: An empirical analysis on model-induced process supervision","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.20737","last_updated":"2025-05-27T05:27:54Z","snapshot_observed_at":"2026-08-07T13:45:22.968013Z","submitted_at":"2025-05-27T05:27:54Z","title":"RRO: LLM Agent Optimization Through Rising Reward Trajectories","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-07T13:51:42.634639Z"},"links":{"cited_paper":"/paper/2402.02658","citing_paper":"/paper/2505.20737"},"observation_digest":"sha256:0a429289a16b5b2513623bb7cd628066183ba3f4361a721e4818ec0a373963bd","observation_id":"742ac0a8-38d1-4a25-b960-0002ac15c9f1","resolution":{"observed_at":"2026-08-07T13:51:42.634639Z","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-07T13:51:42.713789Z","title":"Chain-of-thought prompting elicits reasoning in large language models","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.20737","last_updated":"2025-05-27T05:27:54Z","snapshot_observed_at":"2026-08-07T13:45:22.968013Z","submitted_at":"2025-05-27T05:27:54Z","title":"RRO: LLM Agent Optimization Through Rising Reward Trajectories","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-07T13:51:42.713789Z"},"links":{"citing_paper":"/paper/2505.20737"},"observation_digest":"sha256:a59b99e22a62c252dd35afe147a2aa3ed1d9c804dfdc8f36d34fa1d9486abc34","observation_id":"21b930cb-cdb7-4214-ab74-04d336c0e2a8","resolution":{"observed_at":"2026-08-07T13:51:42.713789Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.11176","last_updated":"2024-09-24T10:01:31Z","snapshot_observed_at":"2026-08-01T17:35:58.677762Z","submitted_at":"2024-06-17T03:29:13Z","title":"Watch Every Step! LLM Agent Learning via Iterative Step-Level Process Refinement","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.11176","snapshot_observed_at":"2026-08-07T13:51:42.816272Z","title":"Watch every step! llm agent learning via iterative step-level process refinement","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.20737","last_updated":"2025-05-27T05:27:54Z","snapshot_observed_at":"2026-08-07T13:45:22.968013Z","submitted_at":"2025-05-27T05:27:54Z","title":"RRO: LLM Agent Optimization Through Rising Reward Trajectories","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-07T13:51:42.816272Z"},"links":{"cited_paper":"/paper/2406.11176","citing_paper":"/paper/2505.20737"},"observation_digest":"sha256:a34bd87d20fbd8bc91f003ea38c0062a0e9c6aa90db982aa5d1925c17d468b1c","observation_id":"9eb5afc0-64c0-48da-b24b-8ccaca91f770","resolution":{"observed_at":"2026-08-07T13:51:42.816272Z","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-07T13:51:44.075337Z","title":"Intercode: Standardizing and benchmarking interactive coding with execution feedback","venue":null,"work_id":"98db8538-26d1-41f8-b91e-077c86eb70b1","year":2023},"citing_paper":{"arxiv_id":"2505.20737","last_updated":"2025-05-27T05:27:54Z","snapshot_observed_at":"2026-08-07T13:45:22.968013Z","submitted_at":"2025-05-27T05:27:54Z","title":"RRO: LLM Agent Optimization Through Rising Reward Trajectories","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-07T13:51:42.879826Z"},"links":{"citing_paper":"/paper/2505.20737"},"observation_digest":"sha256:ba13e8574278f2f9462554a19c55e6547fea11a7fcdbd881880a8914b5d32f9d","observation_id":"168df566-aeae-4b62-bb23-f970c537a8b9","resolution":{"observed_at":"2026-08-07T13:51:44.176909Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T13:51:43.009609Z","title":"Webshop: Towards scalable real-world web interaction with grounded language agents","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.20737","last_updated":"2025-05-27T05:27:54Z","snapshot_observed_at":"2026-08-07T13:45:22.968013Z","submitted_at":"2025-05-27T05:27:54Z","title":"RRO: LLM Agent Optimization Through Rising Reward Trajectories","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-07T13:51:43.009609Z"},"links":{"citing_paper":"/paper/2505.20737"},"observation_digest":"sha256:4888f0353128e56fcab75c1b2c1a7c63052bab37531dce2ec79b07f401c5dd87","observation_id":"26ca5ac3-7e97-4b7c-8ede-2f9a8aa11425","resolution":{"observed_at":"2026-08-07T13:51:43.009609Z","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-07T13:51:43.080279Z","title":"React: Synergizing reasoning and acting in language models","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.20737","last_updated":"2025-05-27T05:27:54Z","snapshot_observed_at":"2026-08-07T13:45:22.968013Z","submitted_at":"2025-05-27T05:27:54Z","title":"RRO: LLM Agent Optimization Through Rising Reward Trajectories","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-07T13:51:43.080279Z"},"links":{"citing_paper":"/paper/2505.20737"},"observation_digest":"sha256:c27092dce7c80a74852ccb514801868cdc3cd7c109cda90cf82c7cb573b649c9","observation_id":"8a53a5e1-3352-4d9a-9141-eb749838ead0","resolution":{"observed_at":"2026-08-07T13:51:43.080279Z","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-07T13:51:43.139184Z","title":"Debug like a human: A large language model debugger via verifying runtime execution step by step","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.20737","last_updated":"2025-05-27T05:27:54Z","snapshot_observed_at":"2026-08-07T13:45:22.968013Z","submitted_at":"2025-05-27T05:27:54Z","title":"RRO: LLM Agent Optimization Through Rising Reward Trajectories","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-07T13:51:43.139184Z"},"links":{"citing_paper":"/paper/2505.20737"},"observation_digest":"sha256:75796875a7ae5a04dc1bb6ca37ddeff038e34686a7285b41c7038fec7cec5b70","observation_id":"eb73a048-7729-42ef-8dd7-71ebfd3c7c38","resolution":{"observed_at":"2026-08-07T13:51:43.139184Z","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-07T13:51:43.785147Z","title":"Least-to-most prompting enables complex reasoning in large language models","venue":null,"work_id":"d2997ea3-5468-499b-b353-60896357f43f","year":2023},"citing_paper":{"arxiv_id":"2505.20737","last_updated":"2025-05-27T05:27:54Z","snapshot_observed_at":"2026-08-07T13:45:22.968013Z","submitted_at":"2025-05-27T05:27:54Z","title":"RRO: LLM Agent Optimization Through Rising Reward Trajectories","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-07T13:51:43.257177Z"},"links":{"citing_paper":"/paper/2505.20737"},"observation_digest":"sha256:5be9ff4adfe17c299d8ba7a21832829c4bdb36f656c489eba2fbceb2aa0810d2","observation_id":"c9aaadfe-1183-415f-8367-027decb7b1da","resolution":{"observed_at":"2026-08-07T13:51:43.901711Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T13:51:43.371191Z","title":"@esa (Ref","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.20737","last_updated":"2025-05-27T05:27:54Z","snapshot_observed_at":"2026-08-07T13:45:22.968013Z","submitted_at":"2025-05-27T05:27:54Z","title":"RRO: LLM Agent Optimization Through Rising Reward Trajectories","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-07T13:51:43.371191Z"},"links":{"citing_paper":"/paper/2505.20737"},"observation_digest":"sha256:00549d9fb3b3f0d31218a0e6cca7fa5de5ccaa9f00fb46f9d9607c3a7d421b15","observation_id":"89da84bb-3e8e-4bba-bb80-1899d29d02a5","resolution":{"observed_at":"2026-08-07T13:51:43.371191Z","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-07T13:51:43.499214Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.20737","last_updated":"2025-05-27T05:27:54Z","snapshot_observed_at":"2026-08-07T13:45:22.968013Z","submitted_at":"2025-05-27T05:27:54Z","title":"RRO: LLM Agent Optimization Through Rising Reward Trajectories","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-07T13:51:43.499214Z"},"links":{"citing_paper":"/paper/2505.20737"},"observation_digest":"sha256:18d0a15f43e90d28563703526b97cd20dc27c7b13a05ee93b968ed728ffbb6d9","observation_id":"3a0a0449-7562-4032-8f2a-51fe5889d20f","resolution":{"observed_at":"2026-08-07T13:51:43.499214Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2204.05862","last_updated":"2022-04-12T15:02:38Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2022-04-12T15:02:38Z","title":"Training a Helpful and Harmless Assistant with Reinforcement Learning from Human Feedback","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2204.05862","snapshot_observed_at":"2026-08-07T13:51:43.605901Z","title":"Math-Shepherd: Verify and Reinforce LLM s Step-by-step without Human Annotations","venue":null,"work_id":null,"year":1992},"citing_paper":{"arxiv_id":"2505.20737","last_updated":"2025-05-27T05:27:54Z","snapshot_observed_at":"2026-08-07T13:45:22.968013Z","submitted_at":"2025-05-27T05:27:54Z","title":"RRO: LLM Agent Optimization Through Rising Reward Trajectories","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-07T13:51:43.605901Z"},"links":{"cited_paper":"/paper/2204.05862","citing_paper":"/paper/2505.20737"},"observation_digest":"sha256:dd94c1c044b287c31df8841b085e9c441ec3b7a2897f3e4b8b5ca5a4a0cbc93b","observation_id":"6c2b883c-d0da-4453-b261-85cf64a77b70","resolution":{"observed_at":"2026-08-07T13:51:43.605901Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2505.20737","last_updated":"2025-05-27T05:27:54Z","latest_version":1,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-07T13:45:22.968013Z","submitted_at":"2025-05-27T05:27:54Z","title":"RRO: LLM Agent Optimization Through Rising Reward Trajectories"},"reference_resolution":{"displayed":27,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":23,"verified_exact":0,"verified_fuzzy":4},"total_outbound_references":27},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 27 of 27 outbound references and 0 inbound Pith citation observations for arXiv:2505.20737."}