{"as_of":"2026-08-09T18:03:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:6224f9232b8d6ef7d0ecf8389b57aaaf8d83c5ba5b1ea1abf9ca2bdd916b08fb","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-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/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-09T16:02:11.744109Z","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:676df2125eba5c5937556c42957bf9f879c94228f4a576836ee8de24a6c40d69","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-09T16:02:11.744109Z","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:1117d98c6e8bb60ed3e24dd0acf0871b788c8f3c8a5a98aca744986ccd18d5b6","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-09T16:02:11.744109Z","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:87056dc985a8d8f4daa550204179d1318db92f86a3c63eb058a30c20d7ed832f","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-09T16:02:11.744109Z","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:3829342a7963a14b2551ca42da661451b0b5b8c26b1f23d74e8d23c0f2eb1099","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-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-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-09T16:02:11.744109Z","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:7ac18f5ba71ee131ec933e4bce36126049019cb832088404dc373d1bb414463e","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-09T16:02:11.744109Z","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:b2145a261613337b2d40fc62e19f8b234d777af2667d7f9f586425865cfa2a93","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-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-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-09T16:02:11.744109Z","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:086b404e200a48d991137aeac5fd6d2f0d0a324d4a0bc060bf43b7b98df0ff6a","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-09T16:02:11.744109Z","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:3ab9927735303bca5183e759d767ac2a40362e81ed25915b7065d191e9dd2441","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-09T16:02:11.744109Z","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:903f3b63f7fb6e95e0fcca7176c9c75f6652a6d97cceb9dbd3312dd22c45a2fc","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-09T16:02:11.744109Z","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:69ac0661889ace6bb17c815cc607392d76dd1e1dc302d9e25ada525c24c6b546","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-09T16:02:11.744109Z","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:87284851a10eb234df9a55f5d80b1b908b9420db647ce76d6e79af0c89438f3b","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-09T16:02:11.744109Z","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:308a0eb2505578eca2872656b7fbbbf85ba0390982ea64ec9a5b784acae44d5e","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-09T16:02:11.744109Z","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:ba62544724463145e82d203f29c143aab15eaf5e8a105b4a2ed1182b84ade0c9","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-09T16:02:11.744109Z","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:d25e71d8f9d6179e9fbcf5478c246253e5aac3302bca276354adc7c9032014a1","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-09T16:02:11.744109Z","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:6537d89b986ffbae2620eebb4ab9496f0bbfb099079063c30fc93f64cd8f2271","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-09T16:02:11.744109Z","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:9f2191e6ca4e2ad7b8281a83d5aacbfc70b8e7d06f852b4e7b3eca3a26d5f5b6","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-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.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-09T16:02:11.744109Z","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:1bbfac8ce8ad5aeef02f3723df5c3a0c2ec90aa579589513f10d8b226a94ed1a","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-09T16:02:11.744109Z","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:d84fbb1cc2774279a38c796a0d058a5bb103eb1b35362c52044ca4eb219b0a20","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-09T16:02:11.744109Z","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:c2b866d08162d3e03f5e4a65d504a497dc82dde6b52810be25ab19dd12ffee13","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-09T16:02:11.744109Z","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:ecd03647341cca6a807f07d3698544894ffcee9549e89d112c6067be7cbed306","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-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-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-09T16:02:11.744109Z","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:b8474d0c3dd0275cfb727978e94573d1122d4e06f653daeffe4f19ccc242b2bf","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-09T16:02:11.744109Z","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:f2cc09cdf94578bacb21c78a5f0bbe132e3be5de583f95c9c1feb45176d68096","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-09T16:02:11.744109Z","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:c4150f1f50a6f9e21d0a059a1de428a4255089a7d1e09f612133306fb44811a0","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-09T16:02:11.744109Z","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:72bd3c28240e5dda00a1d7cec2be032cc3d517a6f5ef67d0cfc8bc6459344e65","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-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-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-09T16:02:11.744109Z","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:2d17e5738b1305284632a483ea18ef52bc71b8d220f4505fad177fe0e3560b7b","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-09T16:02:11.744109Z","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:11caf88f1d526222228205e1b5e3438a86fd3966394f62ca403b35dd6d1a95f8","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-09T16:02:11.744109Z","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:4b914d34781a974d7379ada9045c1f593a4670e7eb108f0567c5b91d486a5330","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-09T16:02:11.744109Z","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-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 27 of 27 outbound references and 0 inbound Pith citation observations for arXiv:2505.20737."}