{"as_of":"2026-08-21T13:14:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a0eeb38da8e7cc3fa8d54391ffdee483c6187c6c7199be916bf11dae4c4a6d33","coverage":[{"denominator":20,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":20,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T18:27:58.962618Z","state":"measured"},{"denominator":20,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":20,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-21T06:32:19.484+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/2608.09380/citation-record","integrity":"/paper/2608.09380/integrity","json":"/paper/2608.09380/citation-record.json","paper":"/paper/2608.09380"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2210.03629","last_updated":"2023-03-10T01:00:17Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2022-10-06T01:00:32Z","title":"ReAct: Synergizing Reasoning and Acting in Language Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.03629","snapshot_observed_at":"2026-08-11T18:27:58.850006Z","title":"ReAct: Synergizing reasoning and acting in language models,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2608.09380","last_updated":"2026-08-10T09:57:26Z","snapshot_observed_at":"2026-08-19T12:36:49.596571Z","submitted_at":"2026-08-10T09:57:26Z","title":"OpenLoopEvolve: A Verifiable Self-Evolution Framework for Loop Policies in Long-Horizon Complex Tasks","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-11T18:27:58.850006Z"},"links":{"cited_paper":"/paper/2210.03629","citing_paper":"/paper/2608.09380"},"observation_digest":"sha256:4e4d9e6c070b2c4f25a85c7b7c5c2cc3693890b35117789c0def1f33d1fe7f13","observation_id":"7f26375e-56ad-4298-85a6-9af0b3a70593","resolution":{"observed_at":"2026-08-11T18:27:58.850006Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2308.03688","last_updated":"2025-10-04T03:54:18Z","snapshot_observed_at":"2026-08-20T10:21:12.032735Z","submitted_at":"2023-08-07T16:08:11Z","title":"AgentBench: Evaluating LLMs as Agents","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2308.03688","snapshot_observed_at":"2026-08-11T18:27:58.856815Z","title":"AgentBench: Evaluating LLMs as agents,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.09380","last_updated":"2026-08-10T09:57:26Z","snapshot_observed_at":"2026-08-19T12:36:49.596571Z","submitted_at":"2026-08-10T09:57:26Z","title":"OpenLoopEvolve: A Verifiable Self-Evolution Framework for Loop Policies in Long-Horizon Complex Tasks","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-11T18:27:58.856815Z"},"links":{"cited_paper":"/paper/2308.03688","citing_paper":"/paper/2608.09380"},"observation_digest":"sha256:ccbe50c1f54863a9518069e346ce1149c44f1755f106dcb09c1f94ed86b61f67","observation_id":"816c8581-fb1b-4f82-8984-c6dd8eb7bafe","resolution":{"observed_at":"2026-08-11T18:27:58.856815Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.13178","last_updated":"2024-12-23T20:12:48Z","snapshot_observed_at":"2026-08-20T13:31:05.293801Z","submitted_at":"2024-01-24T01:51:00Z","title":"AgentBoard: An Analytical Evaluation Board of Multi-turn LLM Agents","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.13178","snapshot_observed_at":"2026-08-11T18:27:58.862620Z","title":"AgentBoard: An analytical evaluation board of multi-turn LLM agents,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.09380","last_updated":"2026-08-10T09:57:26Z","snapshot_observed_at":"2026-08-19T12:36:49.596571Z","submitted_at":"2026-08-10T09:57:26Z","title":"OpenLoopEvolve: A Verifiable Self-Evolution Framework for Loop Policies in Long-Horizon Complex Tasks","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-11T18:27:58.862620Z"},"links":{"cited_paper":"/paper/2401.13178","citing_paper":"/paper/2608.09380"},"observation_digest":"sha256:8218252a08089115cb313f019fe78a5e3fd5f25ce579517ff940d23d1254871b","observation_id":"87786bf2-c7e6-417a-aa04-9517838d8462","resolution":{"observed_at":"2026-08-11T18:27:58.862620Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2307.13854","last_updated":"2024-04-16T15:13:18Z","snapshot_observed_at":"2026-08-14T11:14:55.351653Z","submitted_at":"2023-07-25T22:59:32Z","title":"WebArena: A Realistic Web Environment for Building Autonomous Agents","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2307.13854","snapshot_observed_at":"2026-08-11T18:27:58.869149Z","title":"WebArena: A realistic web environment for building autonomous agents,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.09380","last_updated":"2026-08-10T09:57:26Z","snapshot_observed_at":"2026-08-19T12:36:49.596571Z","submitted_at":"2026-08-10T09:57:26Z","title":"OpenLoopEvolve: A Verifiable Self-Evolution Framework for Loop Policies in Long-Horizon Complex Tasks","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-11T18:27:58.869149Z"},"links":{"cited_paper":"/paper/2307.13854","citing_paper":"/paper/2608.09380"},"observation_digest":"sha256:ce58db8b07455b197bbfb226672003f87b1a091db872cf567478ccd046e1b7b3","observation_id":"a315ea4a-0d71-43c3-a5ae-b348e1e6b325","resolution":{"observed_at":"2026-08-11T18:27:58.869149Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.12045","last_updated":"2024-06-17T19:33:08Z","snapshot_observed_at":"2026-08-17T20:31:29.818313Z","submitted_at":"2024-06-17T19:33:08Z","title":"$\\tau$-bench: A Benchmark for Tool-Agent-User Interaction in Real-World Domains","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.12045","snapshot_observed_at":"2026-08-11T18:27:58.875146Z","title":"τ -bench: A benchmark for tool-agent-user interaction in real-world domains,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.09380","last_updated":"2026-08-10T09:57:26Z","snapshot_observed_at":"2026-08-19T12:36:49.596571Z","submitted_at":"2026-08-10T09:57:26Z","title":"OpenLoopEvolve: A Verifiable Self-Evolution Framework for Loop Policies in Long-Horizon Complex Tasks","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-11T18:27:58.875146Z"},"links":{"cited_paper":"/paper/2406.12045","citing_paper":"/paper/2608.09380"},"observation_digest":"sha256:2d9bad695eebdb1aef0c581550d9bf4bbdf8b45566337d93980695e0281da47c","observation_id":"cf4931d1-b518-4f8d-9ff1-0ec6ef9e6706","resolution":{"observed_at":"2026-08-11T18:27:58.875146Z","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-11T18:27:58.880809Z","title":"YC-Bench: Benchmarking AI agents for long-term planning and consistent execution,","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2608.09380","last_updated":"2026-08-10T09:57:26Z","snapshot_observed_at":"2026-08-19T12:36:49.596571Z","submitted_at":"2026-08-10T09:57:26Z","title":"OpenLoopEvolve: A Verifiable Self-Evolution Framework for Loop Policies in Long-Horizon Complex Tasks","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-11T18:27:58.880809Z"},"links":{"citing_paper":"/paper/2608.09380"},"observation_digest":"sha256:3f9eb055c2f17dd0b277bcaa72a986d4b0cf970d65a15be9e48bc471c227cd68","observation_id":"bbd90916-0a7e-43c7-ae39-b5cd85e9fdce","resolution":{"observed_at":"2026-08-11T18:27:58.880809Z","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-11T18:27:58.887288Z","title":"Generative agents: Interactive simulacra of human behavior,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2608.09380","last_updated":"2026-08-10T09:57:26Z","snapshot_observed_at":"2026-08-19T12:36:49.596571Z","submitted_at":"2026-08-10T09:57:26Z","title":"OpenLoopEvolve: A Verifiable Self-Evolution Framework for Loop Policies in Long-Horizon Complex Tasks","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-11T18:27:58.887288Z"},"links":{"citing_paper":"/paper/2608.09380"},"observation_digest":"sha256:643982935e8a8c0ae13a0952aacba42793cb3700478a6ceb7952079427d17676","observation_id":"8cf4b08c-2c4a-451d-898a-4f0700d2f60e","resolution":{"observed_at":"2026-08-11T18:27:58.887288Z","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-11T18:27:59.677929Z","title":"Reflexion: Language agents with verbal reinforcement learning,","venue":null,"work_id":"9d475a88-1597-444b-bce9-e02284b0a251","year":2023},"citing_paper":{"arxiv_id":"2608.09380","last_updated":"2026-08-10T09:57:26Z","snapshot_observed_at":"2026-08-19T12:36:49.596571Z","submitted_at":"2026-08-10T09:57:26Z","title":"OpenLoopEvolve: A Verifiable Self-Evolution Framework for Loop Policies in Long-Horizon Complex Tasks","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-11T18:27:58.892940Z"},"links":{"citing_paper":"/paper/2608.09380"},"observation_digest":"sha256:861e1a6199b8a99bc2f16286e9d5cdcebe5587bbae898a8e0c3734beb7c01015","observation_id":"e7babd3e-6764-495d-acc1-a3e706527095","resolution":{"observed_at":"2026-08-11T18:27:59.683598Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:27:59.661482Z","title":"ExpeL: LLM agents are experiential learners,","venue":null,"work_id":"fd934b54-3fe0-4bf1-991e-50c8cbffccae","year":2024},"citing_paper":{"arxiv_id":"2608.09380","last_updated":"2026-08-10T09:57:26Z","snapshot_observed_at":"2026-08-19T12:36:49.596571Z","submitted_at":"2026-08-10T09:57:26Z","title":"OpenLoopEvolve: A Verifiable Self-Evolution Framework for Loop Policies in Long-Horizon Complex Tasks","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-11T18:27:58.897978Z"},"links":{"citing_paper":"/paper/2608.09380"},"observation_digest":"sha256:2ca4155a227c9ff15747b8272498a230f1b63608b2401a9510e789b2d0c4238d","observation_id":"29c2253b-335d-4524-b589-3a79dc62d1af","resolution":{"observed_at":"2026-08-11T18:27:59.666889Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:27:59.641158Z","title":"Voyager: An open-ended embodied agent with large language models,","venue":null,"work_id":"72eb3641-72eb-46d7-a552-465c70217726","year":2024},"citing_paper":{"arxiv_id":"2608.09380","last_updated":"2026-08-10T09:57:26Z","snapshot_observed_at":"2026-08-19T12:36:49.596571Z","submitted_at":"2026-08-10T09:57:26Z","title":"OpenLoopEvolve: A Verifiable Self-Evolution Framework for Loop Policies in Long-Horizon Complex Tasks","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-11T18:27:58.902896Z"},"links":{"citing_paper":"/paper/2608.09380"},"observation_digest":"sha256:133b05c606df96db38e8d7d772ceec98287ec40bf927edace7a9a567242f3ae7","observation_id":"98d3d76d-025c-426e-807b-14a9ffb49198","resolution":{"observed_at":"2026-08-11T18:27:59.648013Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:27:59.622562Z","title":"DSPy: Compiling declarative language model calls into self-improving pipelines,","venue":null,"work_id":"625e9005-ad9d-4795-896c-d1f95a725aab","year":2024},"citing_paper":{"arxiv_id":"2608.09380","last_updated":"2026-08-10T09:57:26Z","snapshot_observed_at":"2026-08-19T12:36:49.596571Z","submitted_at":"2026-08-10T09:57:26Z","title":"OpenLoopEvolve: A Verifiable Self-Evolution Framework for Loop Policies in Long-Horizon Complex Tasks","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-11T18:27:58.910824Z"},"links":{"citing_paper":"/paper/2608.09380"},"observation_digest":"sha256:802f57273847e97c34f8f487763b928535ec5a7a9c1ae586ea87eae6125b0dc1","observation_id":"d70ba899-d379-4104-b53e-cadadb1eff61","resolution":{"observed_at":"2026-08-11T18:27:59.627854Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2408.08435","last_updated":"2025-03-02T05:13:28Z","snapshot_observed_at":"2026-08-06T11:45:45.286982Z","submitted_at":"2024-08-15T21:59:23Z","title":"Automated Design of Agentic Systems","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.08435","snapshot_observed_at":"2026-08-11T18:27:58.916246Z","title":"Automated design of agentic systems,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.09380","last_updated":"2026-08-10T09:57:26Z","snapshot_observed_at":"2026-08-19T12:36:49.596571Z","submitted_at":"2026-08-10T09:57:26Z","title":"OpenLoopEvolve: A Verifiable Self-Evolution Framework for Loop Policies in Long-Horizon Complex Tasks","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-11T18:27:58.916246Z"},"links":{"cited_paper":"/paper/2408.08435","citing_paper":"/paper/2608.09380"},"observation_digest":"sha256:ba0d4907c602c635f32e280495ee9c8b9f873a67c942924f9505660f117c15ea","observation_id":"73ed6c2b-7102-4a01-a4fe-ef7850155f19","resolution":{"observed_at":"2026-08-11T18:27:58.916246Z","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-11T18:27:59.604908Z","title":"AFlow: Automating agentic workflow generation,","venue":null,"work_id":"8ed9f52b-7757-49d4-9dd6-3f12dbda4fae","year":2025},"citing_paper":{"arxiv_id":"2608.09380","last_updated":"2026-08-10T09:57:26Z","snapshot_observed_at":"2026-08-19T12:36:49.596571Z","submitted_at":"2026-08-10T09:57:26Z","title":"OpenLoopEvolve: A Verifiable Self-Evolution Framework for Loop Policies in Long-Horizon Complex Tasks","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-11T18:27:58.922005Z"},"links":{"citing_paper":"/paper/2608.09380"},"observation_digest":"sha256:0831900ec7b290392927829133d40caa780c42a19c9b288c41163354cbc46cfc","observation_id":"5db2ea45-18d7-496c-80c5-ec3ac34a6981","resolution":{"observed_at":"2026-08-11T18:27:59.610862Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:27:59.587810Z","title":"AgentSquare: Automatic LLM agent search in modular design space,","venue":null,"work_id":"443fe7b7-7811-4392-a74c-18f0b96fe038","year":2025},"citing_paper":{"arxiv_id":"2608.09380","last_updated":"2026-08-10T09:57:26Z","snapshot_observed_at":"2026-08-19T12:36:49.596571Z","submitted_at":"2026-08-10T09:57:26Z","title":"OpenLoopEvolve: A Verifiable Self-Evolution Framework for Loop Policies in Long-Horizon Complex Tasks","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-11T18:27:58.927023Z"},"links":{"citing_paper":"/paper/2608.09380"},"observation_digest":"sha256:42bd4c30a4e2c7d0cb84f08869be58c2e9b269a809fa7dd9e8df4240dc08a6d4","observation_id":"3feaa09a-5271-4c84-963e-b39705eebad7","resolution":{"observed_at":"2026-08-11T18:27:59.592786Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:27:59.571094Z","title":"SE-Agent: Self-evolution trajectory optimization in multi-step reasoning with LLM-based agents,","venue":null,"work_id":"e1bdf209-f2dd-4e20-b4ea-b56d72edac40","year":2025},"citing_paper":{"arxiv_id":"2608.09380","last_updated":"2026-08-10T09:57:26Z","snapshot_observed_at":"2026-08-19T12:36:49.596571Z","submitted_at":"2026-08-10T09:57:26Z","title":"OpenLoopEvolve: A Verifiable Self-Evolution Framework for Loop Policies in Long-Horizon Complex Tasks","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-11T18:27:58.931463Z"},"links":{"citing_paper":"/paper/2608.09380"},"observation_digest":"sha256:2972509650785e685f61165bc7520961ed37d6c034088d144b7238fd0c24cd4c","observation_id":"608b9388-2840-47c5-9d8b-411388f05104","resolution":{"observed_at":"2026-08-11T18:27:59.576156Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2607.14890","last_updated":"2026-07-16T12:06:21Z","snapshot_observed_at":"2026-08-12T23:14:45.259932Z","submitted_at":"2026-07-16T12:06:21Z","title":"Proof-or-Stop: Don't Trust the Agent, Trust the Evidence -- Loop Engineering for Verifiable Evidence-Gated Lifecycle Control","version":1},"cited_work":{"arxiv_id":"2607.14890","doi":null,"metadata_source":"pith","pith_arxiv_id":"2607.14890","snapshot_observed_at":"2026-08-11T18:27:59.225356Z","title":"Proof-or-Stop: Don't Trust the Agent, Trust the Evidence -- Loop Engineering for Verifiable Evidence-Gated Lifecycle Control","venue":"cs.AI","work_id":"b59f1c4b-88cd-4882-8b86-881d74c7570d","year":2026},"citing_paper":{"arxiv_id":"2608.09380","last_updated":"2026-08-10T09:57:26Z","snapshot_observed_at":"2026-08-19T12:36:49.596571Z","submitted_at":"2026-08-10T09:57:26Z","title":"OpenLoopEvolve: A Verifiable Self-Evolution Framework for Loop Policies in Long-Horizon Complex Tasks","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-11T18:27:58.946562Z"},"links":{"cited_paper":"/paper/2607.14890","citing_paper":"/paper/2608.09380"},"observation_digest":"sha256:0e83c339a70a886222f88d1e35b43039d74be6be892173e3b552bf36c34ec452","observation_id":"8aa9e58d-1112-4f97-a4b8-600dbcc63cd1","resolution":{"observed_at":"2026-08-11T18:27:59.231403Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2007.34289","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:27:59.196580Z","title":"Champion-challenger based predictive model selection,","venue":null,"work_id":"5cacac58-bd52-468a-bf22-9ccdc02dfb6b","year":2007},"citing_paper":{"arxiv_id":"2608.09380","last_updated":"2026-08-10T09:57:26Z","snapshot_observed_at":"2026-08-19T12:36:49.596571Z","submitted_at":"2026-08-10T09:57:26Z","title":"OpenLoopEvolve: A Verifiable Self-Evolution Framework for Loop Policies in Long-Horizon Complex Tasks","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-11T18:27:58.951870Z"},"links":{"citing_paper":"/paper/2608.09380"},"observation_digest":"sha256:df9551854b781366855eb2c773fa3bad91248834511645b037164250dac8b20a","observation_id":"64bdc37c-2463-405f-885c-481b6033192e","resolution":{"observed_at":"2026-08-11T18:27:59.207215Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:27:59.553615Z","title":"ChaCha for online AutoML,","venue":null,"work_id":"e98518f8-e623-4c46-b883-ff599a36b677","year":2021},"citing_paper":{"arxiv_id":"2608.09380","last_updated":"2026-08-10T09:57:26Z","snapshot_observed_at":"2026-08-19T12:36:49.596571Z","submitted_at":"2026-08-10T09:57:26Z","title":"OpenLoopEvolve: A Verifiable Self-Evolution Framework for Loop Policies in Long-Horizon Complex Tasks","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-11T18:27:58.956991Z"},"links":{"citing_paper":"/paper/2608.09380"},"observation_digest":"sha256:8a227b943df6c6b5dd36d2177a325616cc9197f5febc55fba71f0ec769755873","observation_id":"1657cb9b-664e-48eb-9518-463e6b58a941","resolution":{"observed_at":"2026-08-11T18:27:59.559502Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-11T18:27:58.962618Z","title":"DeepSeek-V4: Towards highly efficient million-token context intelligence,","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2608.09380","last_updated":"2026-08-10T09:57:26Z","snapshot_observed_at":"2026-08-19T12:36:49.596571Z","submitted_at":"2026-08-10T09:57:26Z","title":"OpenLoopEvolve: A Verifiable Self-Evolution Framework for Loop Policies in Long-Horizon Complex Tasks","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-11T18:27:58.962618Z"},"links":{"citing_paper":"/paper/2608.09380"},"observation_digest":"sha256:19fe25ffb66e8ee47a8c0258148589af4f337e08c97b925a6aff74d11ed9ea11","observation_id":"62c2c3b7-eb25-45f9-8a3c-f0f664bd199a","resolution":{"observed_at":"2026-08-11T18:27:58.962618Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2607.00038","last_updated":"2026-06-28T18:30:46Z","snapshot_observed_at":"2026-08-01T16:40:43.486088Z","submitted_at":"2026-06-28T18:30:46Z","title":"Stop Hand-Holding Your Coding Agent: Engineering the Loops that Replace Step-by-Step Prompting","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2607.00038","snapshot_observed_at":"2026-08-11T18:27:58.941309Z","title":"Available: https://arxiv.org/abs/2607.00038","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.09380","last_updated":"2026-08-10T09:57:26Z","snapshot_observed_at":"2026-08-19T12:36:49.596571Z","submitted_at":"2026-08-10T09:57:26Z","title":"OpenLoopEvolve: A Verifiable Self-Evolution Framework for Loop Policies in Long-Horizon Complex Tasks","version":1},"reference_index":2026,"source":"pdf_text","source_observed_at":"2026-08-11T18:27:58.941309Z"},"links":{"cited_paper":"/paper/2607.00038","citing_paper":"/paper/2608.09380"},"observation_digest":"sha256:e6c842b3a2b2314e8bcdf76542875ef6ab3f69b5e99d42463958d4beed5bba9a","observation_id":"cfaf5bf0-6f43-40e7-bebd-6f7f2957636a","resolution":{"observed_at":"2026-08-11T18:27:58.941309Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2608.09380","last_updated":"2026-08-10T09:57:26Z","latest_version":1,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-19T12:36:49.596571Z","submitted_at":"2026-08-10T09:57:26Z","title":"OpenLoopEvolve: A Verifiable Self-Evolution Framework for Loop Policies in Long-Horizon Complex Tasks"},"reference_resolution":{"displayed":20,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":10,"verified_exact":1,"verified_fuzzy":8},"total_outbound_references":20},"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-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"As of 21 August 2026, this Paper Citation Record lists 20 of 20 outbound references and 0 inbound Pith citation observations for arXiv:2608.09380."}