{"as_of":"2026-08-11T06:33:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c2cf187be2528e816ff830c0e910624eb24cb9ef4b8f0be9b58a2171bfff9332","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":36,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":36,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":36,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":36,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T00:08:01.364378Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-07-10T13:57:06.971993Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2308.09687","last_updated":"2024-02-06T18:00:18Z","snapshot_observed_at":"2026-08-06T03:16:16.175894Z","submitted_at":"2023-08-18T17:29:23Z","title":"Graph of Thoughts: Solving Elaborate Problems with Large Language Models","version":4},"cited_work":{"arxiv_id":"2308.09687","doi":null,"metadata_source":"pith","pith_arxiv_id":"2308.09687","snapshot_observed_at":"2026-07-10T13:57:06.971993Z","title":"Besta, N","venue":"cs.CL","work_id":"34ed66c5-13ac-4799-b958-8e57d3de4705","year":2023},"citing_paper":{"arxiv_id":"2308.11432","last_updated":"2025-03-02T04:04:03Z","snapshot_observed_at":"2026-08-02T07:33:16.089197Z","submitted_at":"2023-08-22T13:30:37Z","title":"A Survey on Large Language Model based Autonomous Agents","version":7},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-05-15T04:03:00.340349Z"},"links":{"cited_paper":"/paper/2308.09687","citing_paper":"/paper/2308.11432"},"observation_digest":"sha256:1a1a59351dc321a2167581c385031588c7ae5e9d6c16db10dcb461403c11749d","observation_id":"9ee0cd9e-d408-4e73-991b-91249e1b3553","resolution":{"observed_at":"2026-05-15T04:03:00.806511Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2308.09687","last_updated":"2024-02-06T18:00:18Z","snapshot_observed_at":"2026-08-06T03:16:16.175894Z","submitted_at":"2023-08-18T17:29:23Z","title":"Graph of Thoughts: Solving Elaborate Problems with Large Language Models","version":4},"cited_work":{"arxiv_id":"2308.09687","doi":null,"metadata_source":"pith","pith_arxiv_id":"2308.09687","snapshot_observed_at":"2026-07-10T13:57:06.971993Z","title":"Besta, N","venue":"cs.CL","work_id":"34ed66c5-13ac-4799-b958-8e57d3de4705","year":2023},"citing_paper":{"arxiv_id":"2310.04406","last_updated":"2024-06-06T02:51:17Z","snapshot_observed_at":"2026-08-06T23:53:10.606737Z","submitted_at":"2023-10-06T17:55:11Z","title":"Language Agent Tree Search Unifies Reasoning Acting and Planning in Language Models","version":3},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-16T23:26:04.445225Z"},"links":{"cited_paper":"/paper/2308.09687","citing_paper":"/paper/2310.04406"},"observation_digest":"sha256:e5fbc7e070c3957216d2032d4612389a427b889c2e9fa6409065998871bb9710","observation_id":"9b782529-0c06-47c0-8743-6190a714da5c","resolution":{"observed_at":"2026-05-16T23:26:04.473909Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2308.09687","last_updated":"2024-02-06T18:00:18Z","snapshot_observed_at":"2026-08-06T03:16:16.175894Z","submitted_at":"2023-08-18T17:29:23Z","title":"Graph of Thoughts: Solving Elaborate Problems with Large Language Models","version":4},"cited_work":{"arxiv_id":"2308.09687","doi":null,"metadata_source":"pith","pith_arxiv_id":"2308.09687","snapshot_observed_at":"2026-07-10T13:57:06.971993Z","title":"Besta, N","venue":"cs.CL","work_id":"34ed66c5-13ac-4799-b958-8e57d3de4705","year":2023},"citing_paper":{"arxiv_id":"2402.02716","last_updated":"2024-02-05T04:25:24Z","snapshot_observed_at":"2026-08-10T13:27:24.204831Z","submitted_at":"2024-02-05T04:25:24Z","title":"Understanding the planning of LLM agents: A survey","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-13T18:12:57.568144Z"},"links":{"cited_paper":"/paper/2308.09687","citing_paper":"/paper/2402.02716"},"observation_digest":"sha256:248161bb3a66cc0080901b6f87d58745e99518c373f480f0068d35aacfd2cdb2","observation_id":"e938d815-b0ec-4aae-8cba-7acae41d74e4","resolution":{"observed_at":"2026-05-13T18:12:57.606371Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2308.09687","last_updated":"2024-02-06T18:00:18Z","snapshot_observed_at":"2026-08-06T03:16:16.175894Z","submitted_at":"2023-08-18T17:29:23Z","title":"Graph of Thoughts: Solving Elaborate Problems with Large Language Models","version":4},"cited_work":{"arxiv_id":"2308.09687","doi":null,"metadata_source":"pith","pith_arxiv_id":"2308.09687","snapshot_observed_at":"2026-07-10T13:57:06.971993Z","title":"Besta, N","venue":"cs.CL","work_id":"34ed66c5-13ac-4799-b958-8e57d3de4705","year":2023},"citing_paper":{"arxiv_id":"2402.03578","last_updated":"2026-01-28T04:55:23Z","snapshot_observed_at":"2026-07-06T17:25:53.950578Z","submitted_at":"2024-02-05T23:06:42Z","title":"LLM Multi-Agent Systems: Challenges and Open Problems","version":3},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-05-17T10:23:05.028790Z"},"links":{"cited_paper":"/paper/2308.09687","citing_paper":"/paper/2402.03578"},"observation_digest":"sha256:36d88e854661899b0390cf7c600176394166e7caa2fd55988380a15de657501e","observation_id":"c89adc74-387f-4c01-a182-3d1a88a18e8b","resolution":{"observed_at":"2026-05-17T10:23:05.166469Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2308.09687","last_updated":"2024-02-06T18:00:18Z","snapshot_observed_at":"2026-08-06T03:16:16.175894Z","submitted_at":"2023-08-18T17:29:23Z","title":"Graph of Thoughts: Solving Elaborate Problems with Large Language Models","version":4},"cited_work":{"arxiv_id":"2308.09687","doi":null,"metadata_source":"pith","pith_arxiv_id":"2308.09687","snapshot_observed_at":"2026-07-10T13:57:06.971993Z","title":"Besta, N","venue":"cs.CL","work_id":"34ed66c5-13ac-4799-b958-8e57d3de4705","year":2023},"citing_paper":{"arxiv_id":"2410.23218","last_updated":"2024-10-30T17:10:19Z","snapshot_observed_at":"2026-08-05T06:30:40.974506Z","submitted_at":"2024-10-30T17:10:19Z","title":"OS-ATLAS: A Foundation Action Model for Generalist GUI Agents","version":1},"reference_index":82,"source":"arxiv_source","source_observed_at":"2026-05-13T09:29:27.173784Z"},"links":{"cited_paper":"/paper/2308.09687","citing_paper":"/paper/2410.23218"},"observation_digest":"sha256:c9dd0d4dbd6c1ca39d65cb80cf7abefd44cc08fddfa649ee97155714c7c93e75","observation_id":"f8483fde-2f15-4fd7-9f98-4557de6f23c7","resolution":{"observed_at":"2026-05-13T09:29:27.648664Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2308.09687","last_updated":"2024-02-06T18:00:18Z","snapshot_observed_at":"2026-08-06T03:16:16.175894Z","submitted_at":"2023-08-18T17:29:23Z","title":"Graph of Thoughts: Solving Elaborate Problems with Large Language Models","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2308.09687","snapshot_observed_at":"2026-08-11T00:08:01.364378Z","title":"Graph of thoughts: Solving elaborate problems with large language models","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.19707","last_updated":"2024-12-27T16:02:34Z","snapshot_observed_at":"2026-08-10T23:54:55.110908Z","submitted_at":"2024-12-27T16:02:34Z","title":"Toward Adaptive Reasoning in Large Language Models with Thought Rollback","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-11T00:08:01.364378Z"},"links":{"cited_paper":"/paper/2308.09687","citing_paper":"/paper/2412.19707"},"observation_digest":"sha256:d405f115a1c75aa5214ebf966c3c62c98a8f15a24610856e11cd1ad543bd6c4f","observation_id":"996fd295-1f92-483f-aa7b-f377dafd20cb","resolution":{"observed_at":"2026-08-11T00:08:01.364378Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2308.09687","last_updated":"2024-02-06T18:00:18Z","snapshot_observed_at":"2026-08-06T03:16:16.175894Z","submitted_at":"2023-08-18T17:29:23Z","title":"Graph of Thoughts: Solving Elaborate Problems with Large Language Models","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2308.09687","snapshot_observed_at":"2026-08-10T23:06:05.460054Z","title":"Available: http://arxiv.org/abs/2308.09687","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.00083","last_updated":"2024-12-30T16:58:17Z","snapshot_observed_at":"2026-08-10T23:00:35.795378Z","submitted_at":"2024-12-30T16:58:17Z","title":"AI Agent for Education: von Neumann Multi-Agent System Framework","version":1},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-10T23:06:05.460054Z"},"links":{"cited_paper":"/paper/2308.09687","citing_paper":"/paper/2501.00083"},"observation_digest":"sha256:dbdb94a76ac4481da898396e348ea4d7c99af9dd9a3840a2494a53693977fc89","observation_id":"81262f30-9243-4995-b19b-d3de8d3e70c4","resolution":{"observed_at":"2026-08-10T23:06:05.460054Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2308.09687","last_updated":"2024-02-06T18:00:18Z","snapshot_observed_at":"2026-08-06T03:16:16.175894Z","submitted_at":"2023-08-18T17:29:23Z","title":"Graph of Thoughts: Solving Elaborate Problems with Large Language Models","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2308.09687","snapshot_observed_at":"2026-08-10T22:29:00.469175Z","title":"Graph of thoughts: Solving elaborate problems with large language models","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.02026","last_updated":"2025-01-03T02:55:44Z","snapshot_observed_at":"2026-08-11T01:14:46.906783Z","submitted_at":"2025-01-03T02:55:44Z","title":"Recursive Decomposition of Logical Thoughts: Framework for Superior Reasoning and Knowledge Propagation in Large Language Models","version":1},"reference_index":68,"source":"arxiv_source","source_observed_at":"2026-08-10T22:29:00.469175Z"},"links":{"cited_paper":"/paper/2308.09687","citing_paper":"/paper/2501.02026"},"observation_digest":"sha256:5c17b1aee2d96bb9c80f8e1ad421f1fc96299ca5a6b9801143c85d9e808433f8","observation_id":"6d29a68c-e119-4a78-b8fb-a01f5a46119a","resolution":{"observed_at":"2026-08-10T22:29:00.469175Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2308.09687","last_updated":"2024-02-06T18:00:18Z","snapshot_observed_at":"2026-08-06T03:16:16.175894Z","submitted_at":"2023-08-18T17:29:23Z","title":"Graph of Thoughts: Solving Elaborate Problems with Large Language Models","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2308.09687","snapshot_observed_at":"2026-08-10T20:38:52.579600Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2501.07815","last_updated":"2025-01-14T03:26:43Z","snapshot_observed_at":"2026-08-10T20:32:53.064261Z","submitted_at":"2025-01-14T03:26:43Z","title":"Agent-Centric Projection of Prompting Techniques and Implications for Synthetic Training Data for Large Language Models","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-10T20:38:52.579600Z"},"links":{"cited_paper":"/paper/2308.09687","citing_paper":"/paper/2501.07815"},"observation_digest":"sha256:3dd7fec33878eb0da53099cba2555b87773c4c2808fe6bb99b83b5c25377dbf5","observation_id":"6add0a04-565e-484e-93c3-8a45ccbba43a","resolution":{"observed_at":"2026-08-10T20:38:52.579600Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2308.09687","last_updated":"2024-02-06T18:00:18Z","snapshot_observed_at":"2026-08-06T03:16:16.175894Z","submitted_at":"2023-08-18T17:29:23Z","title":"Graph of Thoughts: Solving Elaborate Problems with Large Language Models","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2308.09687","snapshot_observed_at":"2026-08-09T20:47:53.550748Z","title":"Graph of Thoughts : Solving Elaborate Problems with Large Language Models","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.19278","last_updated":"2025-01-31T16:42:31Z","snapshot_observed_at":"2026-08-09T20:40:17.563626Z","submitted_at":"2025-01-31T16:42:31Z","title":"Pheromone-based Learning of Optimal Reasoning Paths","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-09T20:47:53.550748Z"},"links":{"cited_paper":"/paper/2308.09687","citing_paper":"/paper/2501.19278"},"observation_digest":"sha256:770f19936ffb0e436edf520bd5055e8e4efc1d1d5addd332fc2655bee96f438c","observation_id":"07cf43b2-d80d-4545-9adc-1e6f938570cd","resolution":{"observed_at":"2026-08-09T20:47:53.550748Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2308.09687","last_updated":"2024-02-06T18:00:18Z","snapshot_observed_at":"2026-08-06T03:16:16.175894Z","submitted_at":"2023-08-18T17:29:23Z","title":"Graph of Thoughts: Solving Elaborate Problems with Large Language Models","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2308.09687","snapshot_observed_at":"2026-08-07T12:11:42.045200Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.00396","last_updated":"2025-05-31T05:32:12Z","snapshot_observed_at":"2026-08-08T00:41:55.641308Z","submitted_at":"2025-05-31T05:32:12Z","title":"Speculative Reward Model Boosts Decision Making Ability of LLMs Cost-Effectively","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-07T12:11:42.045200Z"},"links":{"cited_paper":"/paper/2308.09687","citing_paper":"/paper/2506.00396"},"observation_digest":"sha256:289e1ab66e1a8b27f9d923c8b72ac51ab562bfb37b94bbb8b1eaf4c0cded4b8c","observation_id":"f4499d80-d173-495d-aa62-b5e11faf4df3","resolution":{"observed_at":"2026-08-07T12:11:42.045200Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2308.09687","last_updated":"2024-02-06T18:00:18Z","snapshot_observed_at":"2026-08-06T03:16:16.175894Z","submitted_at":"2023-08-18T17:29:23Z","title":"Graph of Thoughts: Solving Elaborate Problems with Large Language Models","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2308.09687","snapshot_observed_at":"2026-08-07T04:47:16.421238Z","title":"Graph of thoughts: Solving elaborate problems with large language models","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.09581","last_updated":"2025-06-11T10:19:49Z","snapshot_observed_at":"2026-08-10T11:14:10.573003Z","submitted_at":"2025-06-11T10:19:49Z","title":"Integrating Quantized LLMs into Robotics Systems as Edge AI to Leverage their Natural Language Processing Capabilities","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-07T04:47:16.421238Z"},"links":{"cited_paper":"/paper/2308.09687","citing_paper":"/paper/2506.09581"},"observation_digest":"sha256:544f86017392fae344253b8b652d363f1a1d48e006c4466f0d8c60997ec71b01","observation_id":"9c1a23a5-bff6-45b1-a460-12f6957f1ea7","resolution":{"observed_at":"2026-08-07T04:47:16.421238Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2308.09687","last_updated":"2024-02-06T18:00:18Z","snapshot_observed_at":"2026-08-06T03:16:16.175894Z","submitted_at":"2023-08-18T17:29:23Z","title":"Graph of Thoughts: Solving Elaborate Problems with Large Language Models","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2308.09687","snapshot_observed_at":"2026-08-07T00:58:05.413190Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.12259","last_updated":"2025-06-13T22:20:18Z","snapshot_observed_at":"2026-08-09T21:08:12.207752Z","submitted_at":"2025-06-13T22:20:18Z","title":"Improving Public Service Chatbot Design and Civic Impact: Investigation of Citizens' Perceptions of a Metro City 311 Chatbot","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T00:58:05.413190Z"},"links":{"cited_paper":"/paper/2308.09687","citing_paper":"/paper/2506.12259"},"observation_digest":"sha256:ae065e48551be6962e0ab6bc7be92b47ac719e64b0f51319ef9fb67cefba79d6","observation_id":"d397d2d5-6fe5-4a19-bf17-dec64d887695","resolution":{"observed_at":"2026-08-07T00:58:05.413190Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2308.09687","last_updated":"2024-02-06T18:00:18Z","snapshot_observed_at":"2026-08-06T03:16:16.175894Z","submitted_at":"2023-08-18T17:29:23Z","title":"Graph of Thoughts: Solving Elaborate Problems with Large Language Models","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2308.09687","snapshot_observed_at":"2026-08-06T21:38:14.282150Z","title":"Graph of thoughts: Solving elaborate problems with large language models","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.00092","last_updated":"2025-06-30T09:53:41Z","snapshot_observed_at":"2026-08-08T10:51:41.279421Z","submitted_at":"2025-06-30T09:53:41Z","title":"Thinking About Thinking: SAGE-nano's Inverse Reasoning for Self-Aware Language Models","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-06T21:38:14.282150Z"},"links":{"cited_paper":"/paper/2308.09687","citing_paper":"/paper/2507.00092"},"observation_digest":"sha256:7597160299433777321a0da56a88fe8c125aa079c1295f36b444ea8e63e74da1","observation_id":"dc4bf6d9-bde0-4ee6-a461-71b0e049e817","resolution":{"observed_at":"2026-08-06T21:38:14.282150Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2308.09687","last_updated":"2024-02-06T18:00:18Z","snapshot_observed_at":"2026-08-06T03:16:16.175894Z","submitted_at":"2023-08-18T17:29:23Z","title":"Graph of Thoughts: Solving Elaborate Problems with Large Language Models","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2308.09687","snapshot_observed_at":"2026-08-06T19:43:48.242812Z","title":"Graph of thoughts: Solving elaborate problems with large language models,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.04893","last_updated":"2025-07-07T11:27:49Z","snapshot_observed_at":"2026-08-08T08:39:52.710455Z","submitted_at":"2025-07-07T11:27:49Z","title":"MARBLE: A Multi-Agent Rule-Based LLM Reasoning Engine for Accident Severity Prediction","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-06T19:43:48.242812Z"},"links":{"cited_paper":"/paper/2308.09687","citing_paper":"/paper/2507.04893"},"observation_digest":"sha256:1acbc35aac89ffb9a15e524d45552ba05f473182f3cae56fe194aa00193065aa","observation_id":"d890be8c-0ce0-4046-ab17-4e2787b952de","resolution":{"observed_at":"2026-08-06T19:43:48.242812Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2308.09687","last_updated":"2024-02-06T18:00:18Z","snapshot_observed_at":"2026-08-06T03:16:16.175894Z","submitted_at":"2023-08-18T17:29:23Z","title":"Graph of Thoughts: Solving Elaborate Problems with Large Language Models","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2308.09687","snapshot_observed_at":"2026-08-06T16:26:36.967990Z","title":"Graph of thoughts: Solving elaborate problems with large language models,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.13511","last_updated":"2025-07-17T19:41:09Z","snapshot_observed_at":"2026-08-09T03:48:19.559554Z","submitted_at":"2025-07-17T19:41:09Z","title":"GraphTrafficGPT: Enhancing Traffic Management Through Graph-Based AI Agent Coordination","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-06T16:26:36.967990Z"},"links":{"cited_paper":"/paper/2308.09687","citing_paper":"/paper/2507.13511"},"observation_digest":"sha256:28a8d9653fe633fe974be9d6e7daa5e1eb637423ef3ebeefe0ce7b1cae977ca8","observation_id":"d1cccac2-7244-4ec2-845c-a4b2bafacf5a","resolution":{"observed_at":"2026-08-06T16:26:36.967990Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2308.09687","last_updated":"2024-02-06T18:00:18Z","snapshot_observed_at":"2026-08-06T03:16:16.175894Z","submitted_at":"2023-08-18T17:29:23Z","title":"Graph of Thoughts: Solving Elaborate Problems with Large Language Models","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2308.09687","snapshot_observed_at":"2026-08-06T16:14:06.824346Z","title":"Graph of thoughts: Solving elaborate problems with large language models, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.14295","last_updated":"2025-08-22T16:49:10Z","snapshot_observed_at":"2026-08-11T04:45:14.137765Z","submitted_at":"2025-07-18T18:07:38Z","title":"A Simple \"Try Again\" Can Elicit Multi-Turn LLM Reasoning","version":2},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-06T16:14:06.824346Z"},"links":{"cited_paper":"/paper/2308.09687","citing_paper":"/paper/2507.14295"},"observation_digest":"sha256:9121e1d5a253438e3ee50591e8cfee806b48c6aab15ef0c46df97a3e62bf66e5","observation_id":"951c7202-42bb-417f-9270-96f43c8cebe4","resolution":{"observed_at":"2026-08-06T16:14:06.824346Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2308.09687","last_updated":"2024-02-06T18:00:18Z","snapshot_observed_at":"2026-08-06T03:16:16.175894Z","submitted_at":"2023-08-18T17:29:23Z","title":"Graph of Thoughts: Solving Elaborate Problems with Large Language Models","version":4},"cited_work":{"arxiv_id":"2308.09687","doi":null,"metadata_source":"pith","pith_arxiv_id":"2308.09687","snapshot_observed_at":"2026-07-10T13:57:06.971993Z","title":"Besta, N","venue":"cs.CL","work_id":"34ed66c5-13ac-4799-b958-8e57d3de4705","year":2023},"citing_paper":{"arxiv_id":"2507.21035","last_updated":"2026-05-17T21:43:43Z","snapshot_observed_at":"2026-07-06T22:04:01.721229Z","submitted_at":"2025-07-28T17:55:08Z","title":"GenoMAS: A Multi-Agent Framework for Scientific Discovery via Code-Driven Gene Expression Analysis","version":3},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-22T00:37:11.945418Z"},"links":{"cited_paper":"/paper/2308.09687","citing_paper":"/paper/2507.21035"},"observation_digest":"sha256:db77b35c0c197645cd65c462536a9efd80800647bc0e8f6fb6089b3347373328","observation_id":"f1490e15-553b-47ff-af57-86b3674371fa","resolution":{"observed_at":"2026-05-22T00:40:51.118296Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2308.09687","last_updated":"2024-02-06T18:00:18Z","snapshot_observed_at":"2026-08-06T03:16:16.175894Z","submitted_at":"2023-08-18T17:29:23Z","title":"Graph of Thoughts: Solving Elaborate Problems with Large Language Models","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2308.09687","snapshot_observed_at":"2026-08-05T12:38:26.513507Z","title":"Graph-of-thoughts: Solving elaborate problems with large language models","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.01412","last_updated":"2026-06-25T14:37:37Z","snapshot_observed_at":"2026-08-09T16:58:50.233501Z","submitted_at":"2025-09-01T12:09:43Z","title":"Vis-CoT: A Human-in-the-Loop Framework for Interactive Visualization and Intervention in LLM Chain-of-Thought Reasoning","version":3},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-05T12:38:26.513507Z"},"links":{"cited_paper":"/paper/2308.09687","citing_paper":"/paper/2509.01412"},"observation_digest":"sha256:88f050003b7cb11a64adbfe336665a1fbe64a28b736fab4ae0764091fce5a4cd","observation_id":"f073928c-814a-4243-bb98-6410dc2c2ad8","resolution":{"observed_at":"2026-08-05T12:38:26.513507Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2308.09687","last_updated":"2024-02-06T18:00:18Z","snapshot_observed_at":"2026-08-06T03:16:16.175894Z","submitted_at":"2023-08-18T17:29:23Z","title":"Graph of Thoughts: Solving Elaborate Problems with Large Language Models","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2308.09687","snapshot_observed_at":"2026-08-05T05:34:40.231322Z","title":"Besta, N","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.05226","last_updated":"2025-09-05T16:40:13Z","snapshot_observed_at":"2026-08-09T08:01:23.924366Z","submitted_at":"2025-09-05T16:40:13Z","title":"Less is More Tokens: Efficient Math Reasoning via Difficulty-Aware Chain-of-Thought Distillation","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-05T05:34:40.231322Z"},"links":{"cited_paper":"/paper/2308.09687","citing_paper":"/paper/2509.05226"},"observation_digest":"sha256:c3e04b201952e70ddf60f36914cbbadd7ac683542e50df1477ac325c3eded274","observation_id":"f6b32aef-6953-401a-8476-42a15b4b4c36","resolution":{"observed_at":"2026-08-05T05:34:40.231322Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2308.09687","last_updated":"2024-02-06T18:00:18Z","snapshot_observed_at":"2026-08-06T03:16:16.175894Z","submitted_at":"2023-08-18T17:29:23Z","title":"Graph of Thoughts: Solving Elaborate Problems with Large Language Models","version":4},"cited_work":{"arxiv_id":"2308.09687","doi":null,"metadata_source":"pith","pith_arxiv_id":"2308.09687","snapshot_observed_at":"2026-07-10T13:57:06.971993Z","title":"Besta, N","venue":"cs.CL","work_id":"34ed66c5-13ac-4799-b958-8e57d3de4705","year":2023},"citing_paper":{"arxiv_id":"2510.08804","last_updated":"2026-05-04T16:48:58Z","snapshot_observed_at":"2026-08-02T08:04:43.071958Z","submitted_at":"2025-10-09T20:35:23Z","title":"MOSAIC: Multi-agent Orchestration for Task-Intelligent Scientific Coding","version":3},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-05-18T08:28:59.161675Z"},"links":{"cited_paper":"/paper/2308.09687","citing_paper":"/paper/2510.08804"},"observation_digest":"sha256:adf9a4a4ba4023d3191483e05fa59d8ce5bac0b41f63abdd1557329a17780457","observation_id":"5492920a-e52f-48fb-8e99-76a4586ec987","resolution":{"observed_at":"2026-05-18T08:31:06.821511Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2308.09687","last_updated":"2024-02-06T18:00:18Z","snapshot_observed_at":"2026-08-06T03:16:16.175894Z","submitted_at":"2023-08-18T17:29:23Z","title":"Graph of Thoughts: Solving Elaborate Problems with Large Language Models","version":4},"cited_work":{"arxiv_id":"2308.09687","doi":null,"metadata_source":"pith","pith_arxiv_id":"2308.09687","snapshot_observed_at":"2026-07-10T13:57:06.971993Z","title":"Besta, N","venue":"cs.CL","work_id":"34ed66c5-13ac-4799-b958-8e57d3de4705","year":2023},"citing_paper":{"arxiv_id":"2601.14053","last_updated":"2026-04-16T15:26:17Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-01-20T15:06:19Z","title":"LLMOrbit: A Circular Taxonomy of Large Language Models -From Scaling Walls to Agentic AI Systems","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-16T12:47:28.248540Z"},"links":{"cited_paper":"/paper/2308.09687","citing_paper":"/paper/2601.14053"},"observation_digest":"sha256:31272ec40f3ef59b423a94952aceac5ef0265cff6f10e1f92fdcbf31afddaa4f","observation_id":"d4714c41-2c48-45f3-ae12-a2609c6e2351","resolution":{"observed_at":"2026-05-16T12:47:53.975204Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2308.09687","last_updated":"2024-02-06T18:00:18Z","snapshot_observed_at":"2026-08-06T03:16:16.175894Z","submitted_at":"2023-08-18T17:29:23Z","title":"Graph of Thoughts: Solving Elaborate Problems with Large Language Models","version":4},"cited_work":{"arxiv_id":"2308.09687","doi":null,"metadata_source":"pith","pith_arxiv_id":"2308.09687","snapshot_observed_at":"2026-07-10T13:57:06.971993Z","title":"Besta, N","venue":"cs.CL","work_id":"34ed66c5-13ac-4799-b958-8e57d3de4705","year":2023},"citing_paper":{"arxiv_id":"2604.23106","last_updated":"2026-04-25T02:01:54Z","snapshot_observed_at":"2026-08-11T00:15:53.606002Z","submitted_at":"2026-04-25T02:01:54Z","title":"No Test Cases, No Problem: Distillation-Driven Code Generation for Scientific Workflows","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-08T08:12:07.708441Z"},"links":{"cited_paper":"/paper/2308.09687","citing_paper":"/paper/2604.23106"},"observation_digest":"sha256:a3ec5264a8a6c18167ffbf41f9825e0dd47fd585633ab2401f322de2843b4fce","observation_id":"626e0f14-c900-4d3d-ba5b-6f8b317be3c8","resolution":{"observed_at":"2026-05-11T20:46:10.077255Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2308.09687","last_updated":"2024-02-06T18:00:18Z","snapshot_observed_at":"2026-08-06T03:16:16.175894Z","submitted_at":"2023-08-18T17:29:23Z","title":"Graph of Thoughts: Solving Elaborate Problems with Large Language Models","version":4},"cited_work":{"arxiv_id":"2308.09687","doi":null,"metadata_source":"pith","pith_arxiv_id":"2308.09687","snapshot_observed_at":"2026-07-10T13:57:06.971993Z","title":"Besta, N","venue":"cs.CL","work_id":"34ed66c5-13ac-4799-b958-8e57d3de4705","year":2023},"citing_paper":{"arxiv_id":"2605.06690","last_updated":"2026-05-02T07:40:09Z","snapshot_observed_at":"2026-07-06T23:19:05.764765Z","submitted_at":"2026-05-02T07:40:09Z","title":"State Representation and Termination for Recursive Reasoning Systems","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-11T01:07:19.199344Z"},"links":{"cited_paper":"/paper/2308.09687","citing_paper":"/paper/2605.06690"},"observation_digest":"sha256:6de533f5881d0ab3a37bfb2baa807ccbb8add2ff958c605a93e388c9ffc15566","observation_id":"9a3c7f1a-ab27-4e68-a8ff-dde396b93985","resolution":{"observed_at":"2026-05-11T04:45:56.688203Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2308.09687","last_updated":"2024-02-06T18:00:18Z","snapshot_observed_at":"2026-08-06T03:16:16.175894Z","submitted_at":"2023-08-18T17:29:23Z","title":"Graph of Thoughts: Solving Elaborate Problems with Large Language Models","version":4},"cited_work":{"arxiv_id":"2308.09687","doi":null,"metadata_source":"pith","pith_arxiv_id":"2308.09687","snapshot_observed_at":"2026-07-10T13:57:06.971993Z","title":"Besta, N","venue":"cs.CL","work_id":"34ed66c5-13ac-4799-b958-8e57d3de4705","year":2023},"citing_paper":{"arxiv_id":"2605.08904","last_updated":"2026-05-09T11:51:34Z","snapshot_observed_at":"2026-07-06T23:21:02.177557Z","submitted_at":"2026-05-09T11:51:34Z","title":"OPT-BENCH: Evaluating the Iterative Self-Optimization of LLM Agents in Large-Scale Search Spaces","version":1},"reference_index":94,"source":"arxiv_source","source_observed_at":"2026-05-12T02:57:15.521594Z"},"links":{"cited_paper":"/paper/2308.09687","citing_paper":"/paper/2605.08904"},"observation_digest":"sha256:549bc6daea8666028ae6f5eef2ba90858efca005c83178ddde2e56bd08ba2504","observation_id":"dad6b0c9-9e66-440c-b738-e9fdef654e9b","resolution":{"observed_at":"2026-05-12T03:01:18.768810Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2308.09687","last_updated":"2024-02-06T18:00:18Z","snapshot_observed_at":"2026-08-06T03:16:16.175894Z","submitted_at":"2023-08-18T17:29:23Z","title":"Graph of Thoughts: Solving Elaborate Problems with Large Language Models","version":4},"cited_work":{"arxiv_id":"2308.09687","doi":null,"metadata_source":"pith","pith_arxiv_id":"2308.09687","snapshot_observed_at":"2026-07-10T13:57:06.971993Z","title":"Besta, N","venue":"cs.CL","work_id":"34ed66c5-13ac-4799-b958-8e57d3de4705","year":2023},"citing_paper":{"arxiv_id":"2605.15425","last_updated":"2026-05-14T21:16:23Z","snapshot_observed_at":"2026-08-05T21:03:12.238075Z","submitted_at":"2026-05-14T21:16:23Z","title":"Runtime-Structured Task Decomposition for Agentic Coding Systems","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-05-19T14:46:37.166185Z"},"links":{"cited_paper":"/paper/2308.09687","citing_paper":"/paper/2605.15425"},"observation_digest":"sha256:6f19ad2c285774f78fe5b8f0551e0985071a6bec0d76742e50ecb5f5940c138c","observation_id":"090baeea-5d54-43bf-be3c-9f8658b97d03","resolution":{"observed_at":"2026-05-19T14:47:36.139789Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2308.09687","last_updated":"2024-02-06T18:00:18Z","snapshot_observed_at":"2026-08-06T03:16:16.175894Z","submitted_at":"2023-08-18T17:29:23Z","title":"Graph of Thoughts: Solving Elaborate Problems with Large Language Models","version":4},"cited_work":{"arxiv_id":"2308.09687","doi":null,"metadata_source":"pith","pith_arxiv_id":"2308.09687","snapshot_observed_at":"2026-07-10T13:57:06.971993Z","title":"Besta, N","venue":"cs.CL","work_id":"34ed66c5-13ac-4799-b958-8e57d3de4705","year":2023},"citing_paper":{"arxiv_id":"2606.05030","last_updated":"2026-06-03T15:58:48Z","snapshot_observed_at":"2026-08-03T13:33:30.393549Z","submitted_at":"2026-06-03T15:58:48Z","title":"Imbuing Large Language Models with Bidirectional Logic for Robust Chain Repair","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-06-28T05:46:17.481698Z"},"links":{"cited_paper":"/paper/2308.09687","citing_paper":"/paper/2606.05030"},"observation_digest":"sha256:ad84296f1bf692323b599bb20795b15cc61f119cf715570632585c3f2899ae6c","observation_id":"a144d5a6-55f6-4e28-a735-7f97007a01c2","resolution":{"observed_at":"2026-07-02T08:46:49.009555Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2308.09687","last_updated":"2024-02-06T18:00:18Z","snapshot_observed_at":"2026-08-06T03:16:16.175894Z","submitted_at":"2023-08-18T17:29:23Z","title":"Graph of Thoughts: Solving Elaborate Problems with Large Language Models","version":4},"cited_work":{"arxiv_id":"2308.09687","doi":null,"metadata_source":"pith","pith_arxiv_id":"2308.09687","snapshot_observed_at":"2026-07-10T13:57:06.971993Z","title":"Besta, N","venue":"cs.CL","work_id":"34ed66c5-13ac-4799-b958-8e57d3de4705","year":2023},"citing_paper":{"arxiv_id":"2606.22610","last_updated":"2026-06-21T17:37:01Z","snapshot_observed_at":"2026-07-06T23:57:28.172988Z","submitted_at":"2026-06-21T17:37:01Z","title":"PaperClaw: Harnessing Agents for Autonomous Research and Human-in-the-Loop Refinement","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-06-26T10:36:14.840581Z"},"links":{"cited_paper":"/paper/2308.09687","citing_paper":"/paper/2606.22610"},"observation_digest":"sha256:e8ca660a91488d558437ec80d2668f9233982ec463deb529974ebfb16cfbac6b","observation_id":"2d6596bd-d1d2-4f43-811b-2f469e404cd2","resolution":{"observed_at":"2026-07-04T08:59:43.466624Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2308.09687","last_updated":"2024-02-06T18:00:18Z","snapshot_observed_at":"2026-08-06T03:16:16.175894Z","submitted_at":"2023-08-18T17:29:23Z","title":"Graph of Thoughts: Solving Elaborate Problems with Large Language Models","version":4},"cited_work":{"arxiv_id":"2308.09687","doi":null,"metadata_source":"pith","pith_arxiv_id":"2308.09687","snapshot_observed_at":"2026-07-10T13:57:06.971993Z","title":"Besta, N","venue":"cs.CL","work_id":"34ed66c5-13ac-4799-b958-8e57d3de4705","year":2023},"citing_paper":{"arxiv_id":"2606.29999","last_updated":"2026-06-29T09:09:16Z","snapshot_observed_at":"2026-08-08T05:27:30.032761Z","submitted_at":"2026-06-29T09:09:16Z","title":"AlgoSkill: Learning to Design Algorithms by Scheduling Human-Like Skills","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-06-30T06:09:43.645011Z"},"links":{"cited_paper":"/paper/2308.09687","citing_paper":"/paper/2606.29999"},"observation_digest":"sha256:e90b2605fdd35d6070c303f1fa9d85e77eae5e04e70fca7b43a40edb5cc03adb","observation_id":"24daacc4-6574-4eb2-a992-46ca36daecbf","resolution":{"observed_at":"2026-06-30T08:14:26.494231Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2308.09687","last_updated":"2024-02-06T18:00:18Z","snapshot_observed_at":"2026-08-06T03:16:16.175894Z","submitted_at":"2023-08-18T17:29:23Z","title":"Graph of Thoughts: Solving Elaborate Problems with Large Language Models","version":4},"cited_work":{"arxiv_id":"2308.09687","doi":null,"metadata_source":"pith","pith_arxiv_id":"2308.09687","snapshot_observed_at":"2026-07-10T13:57:06.971993Z","title":"Besta, N","venue":"cs.CL","work_id":"34ed66c5-13ac-4799-b958-8e57d3de4705","year":2023},"citing_paper":{"arxiv_id":"2607.05391","last_updated":"2026-07-07T17:26:37Z","snapshot_observed_at":"2026-08-06T03:00:58.001418Z","submitted_at":"2026-07-06T17:59:35Z","title":"LLM-as-a-Verifier: A General-Purpose Verification Framework","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-07-07T12:47:29.552283Z"},"links":{"cited_paper":"/paper/2308.09687","citing_paper":"/paper/2607.05391"},"observation_digest":"sha256:2eead9829677a96b790293a8c0aee6a76bf8f5fedb35c623928ddbb4a7fe3c5f","observation_id":"50b169fc-275f-42fe-8020-56811cce8a3b","resolution":{"observed_at":"2026-07-07T12:53:50.297497Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2308.09687","last_updated":"2024-02-06T18:00:18Z","snapshot_observed_at":"2026-08-06T03:16:16.175894Z","submitted_at":"2023-08-18T17:29:23Z","title":"Graph of Thoughts: Solving Elaborate Problems with Large Language Models","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2308.09687","snapshot_observed_at":"2026-07-11T07:02:51.850836Z","title":"Graph of thoughts: Solving elaborate problems with large language models, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.05391","last_updated":"2026-07-07T17:26:37Z","snapshot_observed_at":"2026-08-06T03:00:58.001418Z","submitted_at":"2026-07-06T17:59:35Z","title":"LLM-as-a-Verifier: A General-Purpose Verification Framework","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-07-11T07:02:51.850836Z"},"links":{"cited_paper":"/paper/2308.09687","citing_paper":"/paper/2607.05391"},"observation_digest":"sha256:b226294c6749696b6e79fdfa55da698756743dea33538094fbfd9169ae03c35c","observation_id":"5a6667e2-6171-4962-bdc5-b66d87e6ac1a","resolution":{"observed_at":"2026-07-11T07:02:51.850836Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2308.09687","last_updated":"2024-02-06T18:00:18Z","snapshot_observed_at":"2026-08-06T03:16:16.175894Z","submitted_at":"2023-08-18T17:29:23Z","title":"Graph of Thoughts: Solving Elaborate Problems with Large Language Models","version":4},"cited_work":{"arxiv_id":"2308.09687","doi":null,"metadata_source":"pith","pith_arxiv_id":"2308.09687","snapshot_observed_at":"2026-07-10T13:57:06.971993Z","title":"Besta, N","venue":"cs.CL","work_id":"34ed66c5-13ac-4799-b958-8e57d3de4705","year":2023},"citing_paper":{"arxiv_id":"2607.06157","last_updated":"2026-07-07T11:34:10Z","snapshot_observed_at":"2026-08-06T16:57:43.297582Z","submitted_at":"2026-07-07T11:34:10Z","title":"LLM Agents for Deliberative Collaboration: A Study on Joint Decision Making Under Partial Observability","version":1},"reference_index":72,"source":"arxiv_source","source_observed_at":"2026-07-08T15:03:14.483228Z"},"links":{"cited_paper":"/paper/2308.09687","citing_paper":"/paper/2607.06157"},"observation_digest":"sha256:e9ce7fa5e53bcee64aa13c8021a377e4acfc8621b5cdbc0027cae27efda92510","observation_id":"a19b2633-5039-49fd-bacf-6eef02d90e79","resolution":{"observed_at":"2026-07-08T15:05:03.493354Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2308.09687","last_updated":"2024-02-06T18:00:18Z","snapshot_observed_at":"2026-08-06T03:16:16.175894Z","submitted_at":"2023-08-18T17:29:23Z","title":"Graph of Thoughts: Solving Elaborate Problems with Large Language Models","version":4},"cited_work":{"arxiv_id":"2308.09687","doi":null,"metadata_source":"pith","pith_arxiv_id":"2308.09687","snapshot_observed_at":"2026-07-10T13:57:06.971993Z","title":"Besta, N","venue":"cs.CL","work_id":"34ed66c5-13ac-4799-b958-8e57d3de4705","year":2023},"citing_paper":{"arxiv_id":"2607.08009","last_updated":"2026-07-09T00:27:07Z","snapshot_observed_at":"2026-08-03T01:18:12.663488Z","submitted_at":"2026-07-09T00:27:07Z","title":"From Execution to Education: A Bloom-Aligned Framework for Measuring Educational Control in LLMs","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-07-10T13:49:17.343893Z"},"links":{"cited_paper":"/paper/2308.09687","citing_paper":"/paper/2607.08009"},"observation_digest":"sha256:78812bdeb8fb987f69e9972a093e93719c3e25321a3fdc3c7c0816bff5e3875f","observation_id":"23bb6eaa-c2ca-44f4-8ae1-d6ef19cbab6b","resolution":{"observed_at":"2026-07-10T13:57:06.973304Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2308.09687","last_updated":"2024-02-06T18:00:18Z","snapshot_observed_at":"2026-08-06T03:16:16.175894Z","submitted_at":"2023-08-18T17:29:23Z","title":"Graph of Thoughts: Solving Elaborate Problems with Large Language Models","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2308.09687","snapshot_observed_at":"2026-08-02T11:32:12.474420Z","title":"2024 , booktitle =","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.22602","last_updated":"2026-06-12T16:51:29Z","snapshot_observed_at":"2026-08-10T22:26:31.336585Z","submitted_at":"2026-06-12T16:51:29Z","title":"DeepLook: Deeper Thinking with Lookahead","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-02T11:32:12.474420Z"},"links":{"cited_paper":"/paper/2308.09687","citing_paper":"/paper/2607.22602"},"observation_digest":"sha256:a2f7d621f4005ca303853dde433bb840ce5ef88e742d3c572b93e2c8b3af2dbf","observation_id":"071b8b69-acdc-4d68-a519-21b9c30adce2","resolution":{"observed_at":"2026-08-02T11:32:12.474420Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2308.09687","last_updated":"2024-02-06T18:00:18Z","snapshot_observed_at":"2026-08-06T03:16:16.175894Z","submitted_at":"2023-08-18T17:29:23Z","title":"Graph of Thoughts: Solving Elaborate Problems with Large Language Models","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2308.09687","snapshot_observed_at":"2026-07-30T16:10:43.843784Z","title":"arXiv preprint arXiv:2308.09687 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.23678","last_updated":"2026-07-26T14:23:33Z","snapshot_observed_at":"2026-08-10T17:40:23.693195Z","submitted_at":"2026-07-26T14:23:33Z","title":"Focus Is All You Need: Adaptive Goal-aware Attention Orchestration for Multi-Agent Graph Systems","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-07-30T16:10:43.843784Z"},"links":{"cited_paper":"/paper/2308.09687","citing_paper":"/paper/2607.23678"},"observation_digest":"sha256:38e0d7cde0c313f31a41c83a032abe108bd2537307500d0257786a074158f3e9","observation_id":"1683effa-31d5-4bbe-a368-d1906df8d9b9","resolution":{"observed_at":"2026-07-30T16:10:43.843784Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2308.09687","last_updated":"2024-02-06T18:00:18Z","snapshot_observed_at":"2026-08-06T03:16:16.175894Z","submitted_at":"2023-08-18T17:29:23Z","title":"Graph of Thoughts: Solving Elaborate Problems with Large Language Models","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2308.09687","snapshot_observed_at":"2026-07-31T03:18:59.572680Z","title":"Graph of thoughts: Solving elaborate problems with large language models","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.28576","last_updated":"2026-07-30T17:38:23Z","snapshot_observed_at":"2026-08-03T07:46:35.369681Z","submitted_at":"2026-07-30T17:38:23Z","title":"Sample More, Reflect Less: Self-Refine and Reflexion Lose to Repeated Sampling at Equal Token Cost, from 1.5B to 7B","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-07-31T03:18:59.572680Z"},"links":{"cited_paper":"/paper/2308.09687","citing_paper":"/paper/2607.28576"},"observation_digest":"sha256:ae017d6cb16f905d2adb0abd33a02bcf8ed640a756234e8b71441aec8aefdf55","observation_id":"ce7f7f41-d48b-4e80-8c9d-4f2eacf33c24","resolution":{"observed_at":"2026-07-31T03:18:59.572680Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2308.09687/citation-record","integrity":"/paper/2308.09687/integrity","json":"/paper/2308.09687/citation-record.json","paper":"/paper/2308.09687"},"outbound":[],"paper":{"arxiv_id":"2308.09687","last_updated":"2024-02-06T18:00:18Z","latest_version":4,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-06T03:16:16.175894Z","submitted_at":"2023-08-18T17:29:23Z","title":"Graph of Thoughts: Solving Elaborate Problems with Large Language Models"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 36 inbound Pith citation observations for arXiv:2308.09687."}