{"as_of":"2026-08-09T14:56:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:45297b4833b0005fa83622b53cc673615c57ac9ba76098bfc0fb82adfcb0bcb8","coverage":[{"denominator":30,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":30,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-01T17:18:42.149205Z","state":"measured"},{"denominator":30,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":30,"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/2607.17710/citation-record","integrity":"/paper/2607.17710/integrity","json":"/paper/2607.17710/citation-record.json","paper":"/paper/2607.17710"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2303.08774","last_updated":"2024-03-04T06:01:33Z","snapshot_observed_at":"2026-08-07T07:30:12.213965Z","submitted_at":"2023-03-15T17:15:04Z","title":"GPT-4 Technical Report","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.08774","snapshot_observed_at":"2026-08-01T17:18:38.398497Z","title":"Gpt-4 technical report.arXiv preprint arXiv:2303.08774,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17710","last_updated":"2026-07-20T09:06:15Z","snapshot_observed_at":"2026-08-08T02:21:49.723727Z","submitted_at":"2026-07-20T09:06:15Z","title":"Planning with Transformers: Chain of Computation and Structured Context Windows","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-01T17:18:38.398497Z"},"links":{"cited_paper":"/paper/2303.08774","citing_paper":"/paper/2607.17710"},"observation_digest":"sha256:783176b72c26c85b55254ea41dfd4f55f91927d307ac484144827e59ae5630ca","observation_id":"c0f6a350-3e51-4f62-96a2-ea255f04d776","resolution":{"observed_at":"2026-08-01T17:18:38.398497Z","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-01T17:18:42.149205Z","title":"Thestepvariable indicates the order of execution from initialization to termination","venue":null,"work_id":null,"year":1969},"citing_paper":{"arxiv_id":"2607.17710","last_updated":"2026-07-20T09:06:15Z","snapshot_observed_at":"2026-08-08T02:21:49.723727Z","submitted_at":"2026-07-20T09:06:15Z","title":"Planning with Transformers: Chain of Computation and Structured Context Windows","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-01T17:18:42.149205Z"},"links":{"citing_paper":"/paper/2607.17710"},"observation_digest":"sha256:989d98cbddaf2c5b0a7d75553cfdd3d6067583a654e2488e6402973b24bb7d02","observation_id":"e76e1cba-590f-4b6e-91c9-524fe72df38f","resolution":{"observed_at":"2026-08-01T17:18:42.149205Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2107.03374","last_updated":"2021-07-14T17:16:02Z","snapshot_observed_at":"2026-08-08T11:58:24.516369Z","submitted_at":"2021-07-07T17:41:24Z","title":"Evaluating Large Language Models Trained on Code","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2107.03374","snapshot_observed_at":"2026-08-01T17:18:38.859742Z","title":"Evaluating large language models trained on code.arXiv preprint arXiv:2107.03374,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17710","last_updated":"2026-07-20T09:06:15Z","snapshot_observed_at":"2026-08-08T02:21:49.723727Z","submitted_at":"2026-07-20T09:06:15Z","title":"Planning with Transformers: Chain of Computation and Structured Context Windows","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-01T17:18:38.859742Z"},"links":{"cited_paper":"/paper/2107.03374","citing_paper":"/paper/2607.17710"},"observation_digest":"sha256:c1e59737816f2ed22a827cfc0c54e597b508745b9a633adac566f14222c97826","observation_id":"7a88cd51-cf8b-431e-86a8-247ef7c5bc72","resolution":{"observed_at":"2026-08-01T17:18:38.859742Z","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-01T17:18:39.240563Z","title":"Looped transformers for length generalization","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.17710","last_updated":"2026-07-20T09:06:15Z","snapshot_observed_at":"2026-08-08T02:21:49.723727Z","submitted_at":"2026-07-20T09:06:15Z","title":"Planning with Transformers: Chain of Computation and Structured Context Windows","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-01T17:18:39.240563Z"},"links":{"citing_paper":"/paper/2607.17710"},"observation_digest":"sha256:219a95c19484c11e48e9c5dd490c19f593610bd8e7200bb2eb4a51a8615f87e2","observation_id":"59ea056b-2976-4d64-95b0-82d5dde0a648","resolution":{"observed_at":"2026-08-01T17:18:39.240563Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.03683","last_updated":"2024-04-01T06:50:52Z","snapshot_observed_at":"2026-08-06T11:34:00.528900Z","submitted_at":"2024-04-01T06:50:52Z","title":"Stream of Search (SoS): Learning to Search in Language","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.03683","snapshot_observed_at":"2026-08-01T17:18:39.379408Z","title":"Stream of search (sos): Learning to search in language.arXiv preprint arXiv:2404.03683,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17710","last_updated":"2026-07-20T09:06:15Z","snapshot_observed_at":"2026-08-08T02:21:49.723727Z","submitted_at":"2026-07-20T09:06:15Z","title":"Planning with Transformers: Chain of Computation and Structured Context Windows","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-01T17:18:39.379408Z"},"links":{"cited_paper":"/paper/2404.03683","citing_paper":"/paper/2607.17710"},"observation_digest":"sha256:0c99809e356ba27f3e514f556e056e28904aab38da9f3ce323f6e28b120bcb00","observation_id":"759c045a-bf7d-4669-ab8f-bdc7f946f9f5","resolution":{"observed_at":"2026-08-01T17:18:39.379408Z","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-01T17:18:39.853693Z","title":"Reasoning with language model is planning with world model","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.17710","last_updated":"2026-07-20T09:06:15Z","snapshot_observed_at":"2026-08-08T02:21:49.723727Z","submitted_at":"2026-07-20T09:06:15Z","title":"Planning with Transformers: Chain of Computation and Structured Context Windows","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-01T17:18:39.853693Z"},"links":{"citing_paper":"/paper/2607.17710"},"observation_digest":"sha256:cf650a29c0daa39cc912212860585bd207a3f1123a69e96d5a0df051b35f062b","observation_id":"b5f3c812-9822-40c6-8543-549e751525ae","resolution":{"observed_at":"2026-08-01T17:18:39.853693Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1606.08415","last_updated":"2023-06-06T01:53:32Z","snapshot_observed_at":"2026-07-06T05:01:27.910364Z","submitted_at":"2016-06-27T19:20:40Z","title":"Gaussian Error Linear Units (GELUs)","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1606.08415","snapshot_observed_at":"2026-08-01T17:18:40.003679Z","title":"Gaussian error linear units (gelus).arXiv preprint arXiv:1606.08415,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17710","last_updated":"2026-07-20T09:06:15Z","snapshot_observed_at":"2026-08-08T02:21:49.723727Z","submitted_at":"2026-07-20T09:06:15Z","title":"Planning with Transformers: Chain of Computation and Structured Context Windows","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-01T17:18:40.003679Z"},"links":{"cited_paper":"/paper/1606.08415","citing_paper":"/paper/2607.17710"},"observation_digest":"sha256:5ab6546461cd022dfdc5ccdc3cfdabe398b9090230cd29ec9818113d93c5cc49","observation_id":"df9bd8ec-48ed-4742-b9d6-7832a232a5f2","resolution":{"observed_at":"2026-08-01T17:18:40.003679Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2409.12186","last_updated":"2024-11-12T13:24:25Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-09-18T17:57:57Z","title":"Qwen2.5-Coder Technical Report","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.12186","snapshot_observed_at":"2026-08-01T17:18:40.136987Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17710","last_updated":"2026-07-20T09:06:15Z","snapshot_observed_at":"2026-08-08T02:21:49.723727Z","submitted_at":"2026-07-20T09:06:15Z","title":"Planning with Transformers: Chain of Computation and Structured Context Windows","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-01T17:18:40.136987Z"},"links":{"cited_paper":"/paper/2409.12186","citing_paper":"/paper/2607.17710"},"observation_digest":"sha256:abcdfc06a254711f66e19e7f8a58923428a14c861144b6a533e70ad0fbf71216","observation_id":"a05fb409-82b0-4c68-a7e0-9ac355bda89f","resolution":{"observed_at":"2026-08-01T17:18:40.136987Z","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-01T17:18:40.255844Z","title":"Be- yond a*: Better LLM planning via search dynamics bootstrapping","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.17710","last_updated":"2026-07-20T09:06:15Z","snapshot_observed_at":"2026-08-08T02:21:49.723727Z","submitted_at":"2026-07-20T09:06:15Z","title":"Planning with Transformers: Chain of Computation and Structured Context Windows","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-01T17:18:40.255844Z"},"links":{"citing_paper":"/paper/2607.17710"},"observation_digest":"sha256:a5b772442f3d8c1c117e7d4e03aad94268ac3f1fab9aebb3335976048e7621c9","observation_id":"b6cf2210-1138-4137-8460-ceccb9cbb8d0","resolution":{"observed_at":"2026-08-01T17:18:40.255844Z","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-01T17:18:40.434145Z","title":"Alex Lewandowski, Marlos C Machado, and Dale Schuurmans","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17710","last_updated":"2026-07-20T09:06:15Z","snapshot_observed_at":"2026-08-08T02:21:49.723727Z","submitted_at":"2026-07-20T09:06:15Z","title":"Planning with Transformers: Chain of Computation and Structured Context Windows","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-01T17:18:40.434145Z"},"links":{"citing_paper":"/paper/2607.17710"},"observation_digest":"sha256:14606656c519ee9928b9cc12a7ff56bb5ccda85839bb1a1a156cbda5c12fe965","observation_id":"26e99e1a-2151-4ad7-b33c-2573cd8993e8","resolution":{"observed_at":"2026-08-01T17:18:40.434145Z","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-01T17:18:40.555499Z","title":"Llm-a*: Large language model enhanced incremental heuristic search on path planning","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.17710","last_updated":"2026-07-20T09:06:15Z","snapshot_observed_at":"2026-08-08T02:21:49.723727Z","submitted_at":"2026-07-20T09:06:15Z","title":"Planning with Transformers: Chain of Computation and Structured Context Windows","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-01T17:18:40.555499Z"},"links":{"citing_paper":"/paper/2607.17710"},"observation_digest":"sha256:f4ca0aa7f4e20fbcba7a01ba7828cd6bb7132af27f599d12bcef7c4584652a4e","observation_id":"2fdee32c-fa3f-4a4e-b882-29a80e16a39c","resolution":{"observed_at":"2026-08-01T17:18:40.555499Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2112.00114","last_updated":"2021-11-30T21:32:46Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2021-11-30T21:32:46Z","title":"Show Your Work: Scratchpads for Intermediate Computation with Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2112.00114","snapshot_observed_at":"2026-08-01T17:18:40.678943Z","title":"Show your work: Scratchpads for intermediate computation with language models.arXiv preprint arXiv:2112.00114,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17710","last_updated":"2026-07-20T09:06:15Z","snapshot_observed_at":"2026-08-08T02:21:49.723727Z","submitted_at":"2026-07-20T09:06:15Z","title":"Planning with Transformers: Chain of Computation and Structured Context Windows","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-01T17:18:40.678943Z"},"links":{"cited_paper":"/paper/2112.00114","citing_paper":"/paper/2607.17710"},"observation_digest":"sha256:968cf21e37061c7a3176cf1946906d3bfc41d975abe9e2a19e5911fa560a80fe","observation_id":"14b8ecb1-2806-4b59-a7a6-96ae8d8ee815","resolution":{"observed_at":"2026-08-01T17:18:40.678943Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2305.16151","last_updated":"2023-05-25T15:21:09Z","snapshot_observed_at":"2026-07-06T15:33:23.984280Z","submitted_at":"2023-05-25T15:21:09Z","title":"Understanding the Capabilities of Large Language Models for Automated Planning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.16151","snapshot_observed_at":"2026-08-01T17:18:40.860933Z","title":"Understanding the capabilities of large language models for automated planning.arXiv preprint arXiv:2305.16151,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17710","last_updated":"2026-07-20T09:06:15Z","snapshot_observed_at":"2026-08-08T02:21:49.723727Z","submitted_at":"2026-07-20T09:06:15Z","title":"Planning with Transformers: Chain of Computation and Structured Context Windows","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-01T17:18:40.860933Z"},"links":{"cited_paper":"/paper/2305.16151","citing_paper":"/paper/2607.17710"},"observation_digest":"sha256:77e7b4fd09f6afde22236e373a198c20070e889bc6c726cb0b5da1f0f79a1a23","observation_id":"a6076de6-7838-4fe8-ad31-24a72e64d59e","resolution":{"observed_at":"2026-08-01T17:18:40.860933Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2301.04589","last_updated":"2023-01-10T02:37:44Z","snapshot_observed_at":"2026-07-06T14:40:24.341288Z","submitted_at":"2023-01-10T02:37:44Z","title":"Memory Augmented Large Language Models are Computationally Universal","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2301.04589","snapshot_observed_at":"2026-08-01T17:18:40.997799Z","title":"Memory augmented large language models are computationally universal.arXiv preprint arXiv:2301.04589,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17710","last_updated":"2026-07-20T09:06:15Z","snapshot_observed_at":"2026-08-08T02:21:49.723727Z","submitted_at":"2026-07-20T09:06:15Z","title":"Planning with Transformers: Chain of Computation and Structured Context Windows","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-01T17:18:40.997799Z"},"links":{"cited_paper":"/paper/2301.04589","citing_paper":"/paper/2607.17710"},"observation_digest":"sha256:6e4e5e565928bebe17f4fc7b9113fe23e60a60757bf08b95fe141b654a0b6644","observation_id":"9bd159d0-e3e5-41ef-a4e8-8f73c8b44b43","resolution":{"observed_at":"2026-08-01T17:18:40.997799Z","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-01T17:18:41.123806Z","title":"Challenging big-bench tasks and whether chain-of-thought can solve them","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.17710","last_updated":"2026-07-20T09:06:15Z","snapshot_observed_at":"2026-08-08T02:21:49.723727Z","submitted_at":"2026-07-20T09:06:15Z","title":"Planning with Transformers: Chain of Computation and Structured Context Windows","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-01T17:18:41.123806Z"},"links":{"citing_paper":"/paper/2607.17710"},"observation_digest":"sha256:b56031cadd6f08cf53a74546da795b8eb1682a1fb64752ed2ac25a340f9ea4bb","observation_id":"657ce2b3-87b2-4d9f-88b6-9d2c2019fde4","resolution":{"observed_at":"2026-08-01T17:18:41.123806Z","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-01T17:18:41.228184Z","title":"Llms as planning formalizers: A survey for leveraging large language models to construct automated planning models","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.17710","last_updated":"2026-07-20T09:06:15Z","snapshot_observed_at":"2026-08-08T02:21:49.723727Z","submitted_at":"2026-07-20T09:06:15Z","title":"Planning with Transformers: Chain of Computation and Structured Context Windows","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-01T17:18:41.228184Z"},"links":{"citing_paper":"/paper/2607.17710"},"observation_digest":"sha256:becd42ddac9647a29241b04ff3a98bb840ad87d7e5eeaa7bb5db1e0cd8f69cba","observation_id":"58b2cd81-6b5d-4086-aa5f-b8b2a56cd1ae","resolution":{"observed_at":"2026-08-01T17:18:41.228184Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2312.11805","last_updated":"2025-05-09T21:04:06Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-12-19T02:39:27Z","title":"Gemini: A Family of Highly Capable Multimodal Models","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.11805","snapshot_observed_at":"2026-08-01T17:18:41.350098Z","title":"Gemini: a family of highly capable multimodal models.arXiv preprint arXiv:2312.11805,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17710","last_updated":"2026-07-20T09:06:15Z","snapshot_observed_at":"2026-08-08T02:21:49.723727Z","submitted_at":"2026-07-20T09:06:15Z","title":"Planning with Transformers: Chain of Computation and Structured Context Windows","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-01T17:18:41.350098Z"},"links":{"cited_paper":"/paper/2312.11805","citing_paper":"/paper/2607.17710"},"observation_digest":"sha256:243e38b96624068cac2c40064524d011c66da7980e57c8b3f66b144bf497313a","observation_id":"644d953f-e63c-46ac-9622-f0479613857a","resolution":{"observed_at":"2026-08-01T17:18:41.350098Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2307.09288","last_updated":"2023-07-19T17:08:59Z","snapshot_observed_at":"2026-08-07T12:56:43.323460Z","submitted_at":"2023-07-18T14:31:57Z","title":"Llama 2: Open Foundation and Fine-Tuned Chat Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2307.09288","snapshot_observed_at":"2026-08-01T17:18:41.506160Z","title":"Llama 2: Open founda- tion and fine-tuned chat models.arXiv preprint arXiv:2307.09288,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17710","last_updated":"2026-07-20T09:06:15Z","snapshot_observed_at":"2026-08-08T02:21:49.723727Z","submitted_at":"2026-07-20T09:06:15Z","title":"Planning with Transformers: Chain of Computation and Structured Context Windows","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-01T17:18:41.506160Z"},"links":{"cited_paper":"/paper/2307.09288","citing_paper":"/paper/2607.17710"},"observation_digest":"sha256:cb2330771c32038983fcb936df9831a74b6b6503a3265c9404b52d175e3e3a82","observation_id":"8037faa6-0363-486b-bcae-abaf21e32e15","resolution":{"observed_at":"2026-08-01T17:18:41.506160Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2303.17564","last_updated":"2023-12-21T06:21:11Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-03-30T17:30:36Z","title":"BloombergGPT: A Large Language Model for Finance","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.17564","snapshot_observed_at":"2026-08-01T17:18:41.627558Z","title":"Bloomberggpt: A large language model for finance.arXiv preprint arXiv:2303.17564,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17710","last_updated":"2026-07-20T09:06:15Z","snapshot_observed_at":"2026-08-08T02:21:49.723727Z","submitted_at":"2026-07-20T09:06:15Z","title":"Planning with Transformers: Chain of Computation and Structured Context Windows","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-01T17:18:41.627558Z"},"links":{"cited_paper":"/paper/2303.17564","citing_paper":"/paper/2607.17710"},"observation_digest":"sha256:cc50f4d73f9fe1065cc237b2da70a9b0ee0530f14e8a79c58fe431373f5556d1","observation_id":"d16c0d3b-06cb-42bb-9109-5ec14bd1f4e3","resolution":{"observed_at":"2026-08-01T17:18:41.627558Z","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-01T17:18:41.767734Z","title":"Trading-r1: Financial trading with llm reasoning via reinforcement learning.arXiv preprint arXiv:2509.11420,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17710","last_updated":"2026-07-20T09:06:15Z","snapshot_observed_at":"2026-08-08T02:21:49.723727Z","submitted_at":"2026-07-20T09:06:15Z","title":"Planning with Transformers: Chain of Computation and Structured Context Windows","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-01T17:18:41.767734Z"},"links":{"citing_paper":"/paper/2607.17710"},"observation_digest":"sha256:af7c6f291a1b70387484e23b64dbe8c43f7df6c2c0ce2382f1269feb647f46e5","observation_id":"24f9c260-e793-4b9a-9459-a04171579dd1","resolution":{"observed_at":"2026-08-01T17:18:41.767734Z","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-01T17:18:41.872061Z","title":"Training language models with memory augmentation","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.17710","last_updated":"2026-07-20T09:06:15Z","snapshot_observed_at":"2026-08-08T02:21:49.723727Z","submitted_at":"2026-07-20T09:06:15Z","title":"Planning with Transformers: Chain of Computation and Structured Context Windows","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-01T17:18:41.872061Z"},"links":{"citing_paper":"/paper/2607.17710"},"observation_digest":"sha256:221e19210f696ca39faa69b0d416661ea2b23d3cc982c4aa3ccbcd9db7311754","observation_id":"766fbe35-09e1-45b9-b5aa-574bcd3f1466","resolution":{"observed_at":"2026-08-01T17:18:41.872061Z","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-01T17:18:39.517388Z","title":"doi: https://doi.org/10","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17710","last_updated":"2026-07-20T09:06:15Z","snapshot_observed_at":"2026-08-08T02:21:49.723727Z","submitted_at":"2026-07-20T09:06:15Z","title":"Planning with Transformers: Chain of Computation and Structured Context Windows","version":1},"reference_index":1979,"source":"pdf_text","source_observed_at":"2026-08-01T17:18:39.517388Z"},"links":{"citing_paper":"/paper/2607.17710"},"observation_digest":"sha256:83d657e838ede6baa5106c284f9ae214347453256d9b0b8f9791c820490d6a9c","observation_id":"1e6e579c-1af4-44bb-97cc-75c1c014453e","resolution":{"observed_at":"2026-08-01T17:18:39.517388Z","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-01T17:18:42.023796Z","title":null,"venue":null,"work_id":null,"year":2048},"citing_paper":{"arxiv_id":"2607.17710","last_updated":"2026-07-20T09:06:15Z","snapshot_observed_at":"2026-08-08T02:21:49.723727Z","submitted_at":"2026-07-20T09:06:15Z","title":"Planning with Transformers: Chain of Computation and Structured Context Windows","version":1},"reference_index":2016,"source":"pdf_text","source_observed_at":"2026-08-01T17:18:42.023796Z"},"links":{"citing_paper":"/paper/2607.17710"},"observation_digest":"sha256:21b5cef6f4d21b4d8f4d0a43038bb2c4bd6b7786ac4664734420f7708d45aa6f","observation_id":"2f0beeae-663b-4ca6-a5b7-0b02a25101da","resolution":{"observed_at":"2026-08-01T17:18:42.023796Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.13094","last_updated":"2024-11-02T11:49:49Z","snapshot_observed_at":"2026-07-06T18:33:19.806199Z","submitted_at":"2024-06-18T22:57:06Z","title":"Exploring and Benchmarking the Planning Capabilities of Large Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.13094","snapshot_observed_at":"2026-08-01T17:18:38.657377Z","title":"Exploring and benchmarking the planning capabil- ities of large language models.arXiv preprint arXiv:2406.13094,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17710","last_updated":"2026-07-20T09:06:15Z","snapshot_observed_at":"2026-08-08T02:21:49.723727Z","submitted_at":"2026-07-20T09:06:15Z","title":"Planning with Transformers: Chain of Computation and Structured Context Windows","version":1},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-01T17:18:38.657377Z"},"links":{"cited_paper":"/paper/2406.13094","citing_paper":"/paper/2607.17710"},"observation_digest":"sha256:dddb4e0b524b920e253ccda6d32aa8c6f70b34880c957b06d4d634f9bdb152aa","observation_id":"57965025-4a3e-422b-8666-115f9fbd73fd","resolution":{"observed_at":"2026-08-01T17:18:38.657377Z","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-01T17:18:38.984690Z","title":"Dast: Context-aware compression in llms via dynamic allocation of soft tokens","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.17710","last_updated":"2026-07-20T09:06:15Z","snapshot_observed_at":"2026-08-08T02:21:49.723727Z","submitted_at":"2026-07-20T09:06:15Z","title":"Planning with Transformers: Chain of Computation and Structured Context Windows","version":1},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-01T17:18:38.984690Z"},"links":{"citing_paper":"/paper/2607.17710"},"observation_digest":"sha256:8aabaea79f28ae01ef1fdfc051c5a000a89e360694c175f61cd67ebd4fe79234","observation_id":"1414f32a-f96b-4a5f-b73b-f013f5bda1a7","resolution":{"observed_at":"2026-08-01T17:18:38.984690Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.12948","last_updated":"2026-01-04T03:57:36Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-01-22T15:19:35Z","title":"DeepSeek-R1: Incentivizing Reasoning Capability in LLMs via Reinforcement Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.12948","snapshot_observed_at":"2026-08-01T17:18:39.697116Z","title":"Deepseek-r1: Incentivizing reasoning capability in llms via reinforcement learning.arXiv preprint arXiv:2501.12948,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17710","last_updated":"2026-07-20T09:06:15Z","snapshot_observed_at":"2026-08-08T02:21:49.723727Z","submitted_at":"2026-07-20T09:06:15Z","title":"Planning with Transformers: Chain of Computation and Structured Context Windows","version":1},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-01T17:18:39.697116Z"},"links":{"cited_paper":"/paper/2501.12948","citing_paper":"/paper/2607.17710"},"observation_digest":"sha256:48c9d551567ae9e8becad7c5188a0d7cdffadb4b8f2fc73ac030161c9b5579bd","observation_id":"83995dcd-5f03-48f0-bf84-dec80b22fdfb","resolution":{"observed_at":"2026-08-01T17:18:39.697116Z","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-01T17:18:38.453516Z","title":"Can large language models be good path planners? a benchmark and investigation on spatial-temporal reasoning","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.17710","last_updated":"2026-07-20T09:06:15Z","snapshot_observed_at":"2026-08-08T02:21:49.723727Z","submitted_at":"2026-07-20T09:06:15Z","title":"Planning with Transformers: Chain of Computation and Structured Context Windows","version":1},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-01T17:18:38.453516Z"},"links":{"citing_paper":"/paper/2607.17710"},"observation_digest":"sha256:4c9f2bdfc345ef491025cedac0b6b544a95dcfaaa725c4cd16dd21f05d7ec234","observation_id":"24251afb-05f7-4bf9-81a9-b4cee30c161d","resolution":{"observed_at":"2026-08-01T17:18:38.453516Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2604.02910","last_updated":"2026-04-03T09:27:16Z","snapshot_observed_at":"2026-07-06T22:52:10.923214Z","submitted_at":"2026-04-03T09:27:16Z","title":"Analysis of Optimality of Large Language Models on Planning Problems","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2604.02910","snapshot_observed_at":"2026-08-01T17:18:38.773964Z","title":"Analysis of optimality of large language models on planning problems.arXiv preprint arXiv:2604.02910,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17710","last_updated":"2026-07-20T09:06:15Z","snapshot_observed_at":"2026-08-08T02:21:49.723727Z","submitted_at":"2026-07-20T09:06:15Z","title":"Planning with Transformers: Chain of Computation and Structured Context Windows","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-01T17:18:38.773964Z"},"links":{"cited_paper":"/paper/2604.02910","citing_paper":"/paper/2607.17710"},"observation_digest":"sha256:2ec13ee0820c1dd541db7e95966bfad0c54d49507d6cffce3af37cc9bd1db409","observation_id":"181380ca-30ec-4039-a663-f2cc6942c12d","resolution":{"observed_at":"2026-08-01T17:18:38.773964Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2110.14168","last_updated":"2021-11-18T00:23:45Z","snapshot_observed_at":"2026-08-07T01:45:38.840969Z","submitted_at":"2021-10-27T04:49:45Z","title":"Training Verifiers to Solve Math Word Problems","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2110.14168","snapshot_observed_at":"2026-08-01T17:18:39.137340Z","title":"Training verifiers to solve math word problems.arXiv preprint arXiv:2110.14168,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17710","last_updated":"2026-07-20T09:06:15Z","snapshot_observed_at":"2026-08-08T02:21:49.723727Z","submitted_at":"2026-07-20T09:06:15Z","title":"Planning with Transformers: Chain of Computation and Structured Context Windows","version":1},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-01T17:18:39.137340Z"},"links":{"cited_paper":"/paper/2110.14168","citing_paper":"/paper/2607.17710"},"observation_digest":"sha256:618c4653754077e9b55166525eeeafe3c70523f0cd7fd26081daf8b1cb416aad","observation_id":"773bc3dd-48e0-4b02-8c57-bf39fd4bee62","resolution":{"observed_at":"2026-08-01T17:18:39.137340Z","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-01T17:18:38.539613Z","title":"URLhttps://ojs.aaai.org/index.php/ AAAI/article/view/42130","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17710","last_updated":"2026-07-20T09:06:15Z","snapshot_observed_at":"2026-08-08T02:21:49.723727Z","submitted_at":"2026-07-20T09:06:15Z","title":"Planning with Transformers: Chain of Computation and Structured Context Windows","version":1},"reference_index":2026,"source":"pdf_text","source_observed_at":"2026-08-01T17:18:38.539613Z"},"links":{"citing_paper":"/paper/2607.17710"},"observation_digest":"sha256:fd11425fae76dcb19ed30307dfd5dc47f198199ee405b08e7f399c629fda78b6","observation_id":"d8bc1edb-79e0-468a-adf8-afb783ba7987","resolution":{"observed_at":"2026-08-01T17:18:38.539613Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.17710","last_updated":"2026-07-20T09:06:15Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-08T02:21:49.723727Z","submitted_at":"2026-07-20T09:06:15Z","title":"Planning with Transformers: Chain of Computation and Structured Context Windows"},"reference_resolution":{"displayed":30,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":29,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":30},"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 30 of 30 outbound references and 0 inbound Pith citation observations for arXiv:2607.17710."}