{"as_of":"2026-08-11T16:26:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d0319b723fdad969ca9a053d4cac49c8dded2366611972beff479651404fefc3","coverage":[{"denominator":40,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":40,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T12:59:41.679914Z","state":"measured"},{"denominator":42,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":42,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T23:01:35.525639Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-14T23:13:15.565466Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2412.14212","last_updated":"2024-12-18T08:47:17Z","snapshot_observed_at":"2026-08-11T12:55:18.702505Z","submitted_at":"2024-12-18T08:47:17Z","title":"Tree-of-Code: A Hybrid Approach for Robust Complex Task Planning and Execution","version":1},"cited_work":{"arxiv_id":"2412.14212","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2412.14212","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2412.14212 , year=","venue":null,"work_id":"f95695e2-748f-44fb-8baa-6ead33656354","year":null},"citing_paper":{"arxiv_id":"2511.20857","last_updated":"2026-05-18T16:18:02Z","snapshot_observed_at":"2026-08-11T09:44:01.811561Z","submitted_at":"2025-11-25T21:08:07Z","title":"Evo-Memory: Benchmarking LLM Agent Test-time Learning with Self-Evolving Memory","version":1},"reference_index":219,"source":"arxiv_source","source_observed_at":"2026-05-14T23:13:15.016486Z"},"links":{"cited_paper":"/paper/2412.14212","citing_paper":"/paper/2511.20857"},"observation_digest":"sha256:e8331de77bffabd195d10eda1b99d2e83428437ac455002b68c223c7574b73f0","observation_id":"54b1d34a-a5ed-4a4e-bb13-cafa3ee0119a","resolution":{"observed_at":"2026-05-14T23:13:15.569850Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2412.14212","last_updated":"2024-12-18T08:47:17Z","snapshot_observed_at":"2026-08-11T12:55:18.702505Z","submitted_at":"2024-12-18T08:47:17Z","title":"Tree-of-Code: A Hybrid Approach for Robust Complex Task Planning and Execution","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.14212","snapshot_observed_at":"2026-08-10T23:01:35.525639Z","title":"Tree-of-code: A hybrid approach for robust complex task planning and execution, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.06663","last_updated":"2026-08-07T00:19:48Z","snapshot_observed_at":"2026-08-11T16:10:23.017200Z","submitted_at":"2026-08-07T00:19:48Z","title":"The Horizon Gap: Planning, Memory, Execution, Training, and Evaluation for Long-Horizon LLM Agents","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-10T23:01:35.525639Z"},"links":{"cited_paper":"/paper/2412.14212","citing_paper":"/paper/2608.06663"},"observation_digest":"sha256:fa8c33fdc089f8149118de8c6237729720b97a20b00b16b0e7b132c07be6ba32","observation_id":"1debe8c0-46e5-41b1-90a9-54954f4e4cb5","resolution":{"observed_at":"2026-08-10T23:01:35.525639Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2412.14212/citation-record","integrity":"/paper/2412.14212/integrity","json":"/paper/2412.14212/citation-record.json","paper":"/paper/2412.14212"},"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-11T12:59:41.446504Z","title":"Gpt-4 technical report","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.14212","last_updated":"2024-12-18T08:47:17Z","snapshot_observed_at":"2026-08-11T12:55:18.702505Z","submitted_at":"2024-12-18T08:47:17Z","title":"Tree-of-Code: A Hybrid Approach for Robust Complex Task Planning and Execution","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-11T12:59:41.446504Z"},"links":{"cited_paper":"/paper/2303.08774","citing_paper":"/paper/2412.14212"},"observation_digest":"sha256:3fcf72358170f43bfb78c94604cd96dda99ece8a0d7332380a16c7c701b16684","observation_id":"2e304b65-ea18-4eba-99c7-2aff4c118a3b","resolution":{"observed_at":"2026-08-11T12:59:41.446504Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T12:59:42.214026Z","title":"Claude 3.5, 2023","venue":null,"work_id":"89564b94-0507-4c94-8ed1-5ca87b6e6b7d","year":2023},"citing_paper":{"arxiv_id":"2412.14212","last_updated":"2024-12-18T08:47:17Z","snapshot_observed_at":"2026-08-11T12:55:18.702505Z","submitted_at":"2024-12-18T08:47:17Z","title":"Tree-of-Code: A Hybrid Approach for Robust Complex Task Planning and Execution","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-11T12:59:41.450903Z"},"links":{"citing_paper":"/paper/2412.14212"},"observation_digest":"sha256:f4d7a2d2272badac9a438a13c896dac602e409dd35bf5c9acb072fc22532fa32","observation_id":"3cd981b3-6c7e-4967-99d2-3454563bb89a","resolution":{"observed_at":"2026-08-11T12:59:42.217769Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T12:59:41.456837Z","title":"Graph of thoughts: Solving elaborate problems with large language models","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.14212","last_updated":"2024-12-18T08:47:17Z","snapshot_observed_at":"2026-08-11T12:55:18.702505Z","submitted_at":"2024-12-18T08:47:17Z","title":"Tree-of-Code: A Hybrid Approach for Robust Complex Task Planning and Execution","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-11T12:59:41.456837Z"},"links":{"citing_paper":"/paper/2412.14212"},"observation_digest":"sha256:14ded33d46e4ab2afd51423c1356428b40d2d3c42dff37e140991a964438b09b","observation_id":"ff5f2899-e4a2-49d9-b358-deb08ded0a9c","resolution":{"observed_at":"2026-08-11T12:59:41.456837Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.14735","last_updated":"2025-05-11T09:23:41Z","snapshot_observed_at":"2026-08-10T12:40:24.930519Z","submitted_at":"2023-10-23T09:15:18Z","title":"Unleashing the potential of prompt engineering for large language models","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.14735","snapshot_observed_at":"2026-08-11T12:59:41.461374Z","title":"Unleashing the potential of prompt engineering in large language models: a comprehensive review","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.14212","last_updated":"2024-12-18T08:47:17Z","snapshot_observed_at":"2026-08-11T12:55:18.702505Z","submitted_at":"2024-12-18T08:47:17Z","title":"Tree-of-Code: A Hybrid Approach for Robust Complex Task Planning and Execution","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-11T12:59:41.461374Z"},"links":{"cited_paper":"/paper/2310.14735","citing_paper":"/paper/2412.14212"},"observation_digest":"sha256:908748d8ef652e7ca40f881a984ea79cdef1f07c359ee231bcd3a0eabe718ff6","observation_id":"c0be290e-e21a-46a9-9519-541172a321cd","resolution":{"observed_at":"2026-08-11T12:59:41.461374Z","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-11T12:59:41.466933Z","title":"Scaling instruction-finetuned language models","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.14212","last_updated":"2024-12-18T08:47:17Z","snapshot_observed_at":"2026-08-11T12:55:18.702505Z","submitted_at":"2024-12-18T08:47:17Z","title":"Tree-of-Code: A Hybrid Approach for Robust Complex Task Planning and Execution","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-11T12:59:41.466933Z"},"links":{"citing_paper":"/paper/2412.14212"},"observation_digest":"sha256:04f23c9cf691e8291494eb41b0cfe65405f4f44b4fdbfb84bb48a05cc7019ace","observation_id":"a024fe8b-ca56-4c8a-b1d2-f4a85639225a","resolution":{"observed_at":"2026-08-11T12:59:41.466933Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.12793","last_updated":"2024-07-30T03:58:11Z","snapshot_observed_at":"2026-08-07T13:56:34.167869Z","submitted_at":"2024-06-18T16:58:21Z","title":"ChatGLM: A Family of Large Language Models from GLM-130B to GLM-4 All Tools","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.12793","snapshot_observed_at":"2026-08-11T12:59:41.471801Z","title":"Chatglm: A family of large language models from glm-130b to glm-4 all tools","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.14212","last_updated":"2024-12-18T08:47:17Z","snapshot_observed_at":"2026-08-11T12:55:18.702505Z","submitted_at":"2024-12-18T08:47:17Z","title":"Tree-of-Code: A Hybrid Approach for Robust Complex Task Planning and Execution","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-11T12:59:41.471801Z"},"links":{"cited_paper":"/paper/2406.12793","citing_paper":"/paper/2412.14212"},"observation_digest":"sha256:35ca1f27513feec060005c89f895aa6cf973dbef11e290cace15180d9bea5adc","observation_id":"444a0cb1-3a43-484b-86ec-c6e11f5f0610","resolution":{"observed_at":"2026-08-11T12:59:41.471801Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.14196","last_updated":"2024-01-26T09:23:11Z","snapshot_observed_at":"2026-08-06T22:40:28.707813Z","submitted_at":"2024-01-25T14:17:53Z","title":"DeepSeek-Coder: When the Large Language Model Meets Programming -- The Rise of Code Intelligence","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.14196","snapshot_observed_at":"2026-08-11T12:59:41.480548Z","title":"Deepseek-coder: When the large language model meets programming–the rise of code intelligence","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.14212","last_updated":"2024-12-18T08:47:17Z","snapshot_observed_at":"2026-08-11T12:55:18.702505Z","submitted_at":"2024-12-18T08:47:17Z","title":"Tree-of-Code: A Hybrid Approach for Robust Complex Task Planning and Execution","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-11T12:59:41.480548Z"},"links":{"cited_paper":"/paper/2401.14196","citing_paper":"/paper/2412.14212"},"observation_digest":"sha256:aa4c87ccb7691627403a92552be9df395e12a35fb9b7090e4ae6ba6b6668def9","observation_id":"bd095715-684d-4aa4-aaab-d091f8c7fbd0","resolution":{"observed_at":"2026-08-11T12:59:41.480548Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2012.15283","last_updated":"2021-09-16T18:18:13Z","snapshot_observed_at":"2026-07-06T10:28:50.574910Z","submitted_at":"2020-12-30T18:57:16Z","title":"ECONET: Effective Continual Pretraining of Language Models for Event Temporal Reasoning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2012.15283","snapshot_observed_at":"2026-08-11T12:59:41.484759Z","title":"Econet: Effective continual pretraining of language models for event temporal reasoning","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2412.14212","last_updated":"2024-12-18T08:47:17Z","snapshot_observed_at":"2026-08-11T12:55:18.702505Z","submitted_at":"2024-12-18T08:47:17Z","title":"Tree-of-Code: A Hybrid Approach for Robust Complex Task Planning and Execution","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-11T12:59:41.484759Z"},"links":{"cited_paper":"/paper/2012.15283","citing_paper":"/paper/2412.14212"},"observation_digest":"sha256:95407865e236bdf60f8584d146953b89992eb1263390d9fcee5edcefdc1a678a","observation_id":"daf9ad9a-2a0d-49e7-b6b3-3a982c3a6eef","resolution":{"observed_at":"2026-08-11T12:59:41.484759Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T12:59:42.189278Z","title":"L2mac: Large language model automatic com- puter for extensive code generation","venue":null,"work_id":"de042265-c23a-459b-81f0-6840ecc55f16","year":2024},"citing_paper":{"arxiv_id":"2412.14212","last_updated":"2024-12-18T08:47:17Z","snapshot_observed_at":"2026-08-11T12:55:18.702505Z","submitted_at":"2024-12-18T08:47:17Z","title":"Tree-of-Code: A Hybrid Approach for Robust Complex Task Planning and Execution","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-11T12:59:41.490609Z"},"links":{"citing_paper":"/paper/2412.14212"},"observation_digest":"sha256:b718e70e90e3723935694d90afc002869cfdb5673f6a16739999410f4d61cca3","observation_id":"7576e78c-02ab-44c0-8553-74d9bd1a26e0","resolution":{"observed_at":"2026-08-11T12:59:42.193044Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2405.11403","last_updated":"2024-05-18T22:10:15Z","snapshot_observed_at":"2026-08-10T14:07:14.608098Z","submitted_at":"2024-05-18T22:10:15Z","title":"MapCoder: Multi-Agent Code Generation for Competitive Problem Solving","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.11403","snapshot_observed_at":"2026-08-11T12:59:41.494693Z","title":"Mapcoder: Multi-agent code generation for competitive problem solving","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.14212","last_updated":"2024-12-18T08:47:17Z","snapshot_observed_at":"2026-08-11T12:55:18.702505Z","submitted_at":"2024-12-18T08:47:17Z","title":"Tree-of-Code: A Hybrid Approach for Robust Complex Task Planning and Execution","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-11T12:59:41.494693Z"},"links":{"cited_paper":"/paper/2405.11403","citing_paper":"/paper/2412.14212"},"observation_digest":"sha256:226da92d2b86491827bfd8591c4878a9fc8173c95edb407739e5b8511bf06da2","observation_id":"6df3e750-c868-437e-ad15-e8482128e944","resolution":{"observed_at":"2026-08-11T12:59:41.494693Z","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-11T12:59:41.499873Z","title":"Survey of hallucination in natural language generation","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.14212","last_updated":"2024-12-18T08:47:17Z","snapshot_observed_at":"2026-08-11T12:55:18.702505Z","submitted_at":"2024-12-18T08:47:17Z","title":"Tree-of-Code: A Hybrid Approach for Robust Complex Task Planning and Execution","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-11T12:59:41.499873Z"},"links":{"citing_paper":"/paper/2412.14212"},"observation_digest":"sha256:9c6c4608b6a2b86b5dbb09c58921ef8450ad2728530c7780330c82666e1f3019","observation_id":"eeaef3b8-5c98-4354-812c-d216a69cb93c","resolution":{"observed_at":"2026-08-11T12:59:41.499873Z","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-11T12:59:41.503378Z","title":"Chatdev: Communicative agents for software development","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.14212","last_updated":"2024-12-18T08:47:17Z","snapshot_observed_at":"2026-08-11T12:55:18.702505Z","submitted_at":"2024-12-18T08:47:17Z","title":"Tree-of-Code: A Hybrid Approach for Robust Complex Task Planning and Execution","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-11T12:59:41.503378Z"},"links":{"citing_paper":"/paper/2412.14212"},"observation_digest":"sha256:a0a713d5bf895430e0fb54f82647827278a645bffef020c4c1fed1b9fdf40fe7","observation_id":"9b65132c-bf99-45da-9aa3-efd24e33e02a","resolution":{"observed_at":"2026-08-11T12:59:41.503378Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T12:59:42.163738Z","title":"Evaluation on agi/gpt based on the dikwp for ernie bot","venue":null,"work_id":"e76a818c-6c60-4964-a742-5684bf7e02f2","year":2023},"citing_paper":{"arxiv_id":"2412.14212","last_updated":"2024-12-18T08:47:17Z","snapshot_observed_at":"2026-08-11T12:55:18.702505Z","submitted_at":"2024-12-18T08:47:17Z","title":"Tree-of-Code: A Hybrid Approach for Robust Complex Task Planning and Execution","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-11T12:59:41.507371Z"},"links":{"citing_paper":"/paper/2412.14212"},"observation_digest":"sha256:e33e9717c9c88489510e0deffede9705358fe74ffdee48dc22e745d759e4f22d","observation_id":"fe938619-4181-464e-8669-ffa953482809","resolution":{"observed_at":"2026-08-11T12:59:42.168068Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2308.10379","last_updated":"2024-06-02T16:01:35Z","snapshot_observed_at":"2026-08-09T23:24:23.740381Z","submitted_at":"2023-08-20T22:36:23Z","title":"Algorithm of Thoughts: Enhancing Exploration of Ideas in Large Language Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2308.10379","snapshot_observed_at":"2026-08-11T12:59:41.511099Z","title":"Algorithm of thoughts: Enhancing exploration of ideas in large language models","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.14212","last_updated":"2024-12-18T08:47:17Z","snapshot_observed_at":"2026-08-11T12:55:18.702505Z","submitted_at":"2024-12-18T08:47:17Z","title":"Tree-of-Code: A Hybrid Approach for Robust Complex Task Planning and Execution","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-11T12:59:41.511099Z"},"links":{"cited_paper":"/paper/2308.10379","citing_paper":"/paper/2412.14212"},"observation_digest":"sha256:3b2dcb340c9a7d2059170933eb6014ae7344ccf25415b3c0410de979594b7fbd","observation_id":"42bae3eb-003b-4fad-99a7-1748f3f63655","resolution":{"observed_at":"2026-08-11T12:59:41.511099Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.03314","last_updated":"2024-08-06T17:35:05Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-08-06T17:35:05Z","title":"Scaling LLM Test-Time Compute Optimally can be More Effective than Scaling Model Parameters","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.03314","snapshot_observed_at":"2026-08-11T12:59:41.515933Z","title":"Scaling llm test-time compute optimally can be more effective than scaling model parameters","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.14212","last_updated":"2024-12-18T08:47:17Z","snapshot_observed_at":"2026-08-11T12:55:18.702505Z","submitted_at":"2024-12-18T08:47:17Z","title":"Tree-of-Code: A Hybrid Approach for Robust Complex Task Planning and Execution","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-11T12:59:41.515933Z"},"links":{"cited_paper":"/paper/2408.03314","citing_paper":"/paper/2412.14212"},"observation_digest":"sha256:ebf1956836605358bf64de28d06026847c2d75213476d894a59d54518c0b63ca","observation_id":"31f33305-3906-4891-b7e4-1131728588ed","resolution":{"observed_at":"2026-08-11T12:59:41.515933Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T12:59:42.132124Z","title":"Reasoning about edits to feature models","venue":null,"work_id":"516b55cf-1499-453e-a5ab-2a6a917d6b14","year":2009},"citing_paper":{"arxiv_id":"2412.14212","last_updated":"2024-12-18T08:47:17Z","snapshot_observed_at":"2026-08-11T12:55:18.702505Z","submitted_at":"2024-12-18T08:47:17Z","title":"Tree-of-Code: A Hybrid Approach for Robust Complex Task Planning and Execution","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-11T12:59:41.520488Z"},"links":{"citing_paper":"/paper/2412.14212"},"observation_digest":"sha256:d5e009abab344b9930e558155487f6488fdba718b197c8cb03a5635cb65ecc8f","observation_id":"340ad2c4-804a-43e2-8035-a2f5907fa561","resolution":{"observed_at":"2026-08-11T12:59:42.154750Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2305.10314","last_updated":"2024-03-19T11:53:15Z","snapshot_observed_at":"2026-07-06T15:28:44.711559Z","submitted_at":"2023-05-17T15:53:31Z","title":"LeTI: Learning to Generate from Textual Interactions","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.10314","snapshot_observed_at":"2026-08-11T12:59:41.525419Z","title":"Leti: Learning to generate from textual interactions","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.14212","last_updated":"2024-12-18T08:47:17Z","snapshot_observed_at":"2026-08-11T12:55:18.702505Z","submitted_at":"2024-12-18T08:47:17Z","title":"Tree-of-Code: A Hybrid Approach for Robust Complex Task Planning and Execution","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-11T12:59:41.525419Z"},"links":{"cited_paper":"/paper/2305.10314","citing_paper":"/paper/2412.14212"},"observation_digest":"sha256:976e73ea0c650390be5d003d41fee805ad334d9288c8f5713b0feb0558c0d067","observation_id":"9aaf8417-2fde-4ced-9082-e3aff705c2ac","resolution":{"observed_at":"2026-08-11T12:59:41.525419Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.01030","last_updated":"2024-06-07T01:53:07Z","snapshot_observed_at":"2026-08-08T05:33:26.232678Z","submitted_at":"2024-02-01T21:38:58Z","title":"Executable Code Actions Elicit Better LLM Agents","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.01030","snapshot_observed_at":"2026-08-11T12:59:41.529404Z","title":"Executable code actions elicit better llm agents","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.14212","last_updated":"2024-12-18T08:47:17Z","snapshot_observed_at":"2026-08-11T12:55:18.702505Z","submitted_at":"2024-12-18T08:47:17Z","title":"Tree-of-Code: A Hybrid Approach for Robust Complex Task Planning and Execution","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-11T12:59:41.529404Z"},"links":{"cited_paper":"/paper/2402.01030","citing_paper":"/paper/2412.14212"},"observation_digest":"sha256:38e275cc4e54e9d1e335dad9aee6f4e21d9a5d46acceda3d632c187a7299a7dc","observation_id":"efdd5d74-11fd-4d12-9def-6257acf6e965","resolution":{"observed_at":"2026-08-11T12:59:41.529404Z","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-11T12:59:41.533802Z","title":"Chain-of-thought prompting elicits reasoning in large language models","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2412.14212","last_updated":"2024-12-18T08:47:17Z","snapshot_observed_at":"2026-08-11T12:55:18.702505Z","submitted_at":"2024-12-18T08:47:17Z","title":"Tree-of-Code: A Hybrid Approach for Robust Complex Task Planning and Execution","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-11T12:59:41.533802Z"},"links":{"citing_paper":"/paper/2412.14212"},"observation_digest":"sha256:87d27355e9ccab575109c4eba6c6c3bd1be00dca0df0829639d3f0926a5c776d","observation_id":"b5e5dda0-6d99-4dee-83fe-0c4535c4ef5b","resolution":{"observed_at":"2026-08-11T12:59:41.533802Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T12:59:42.081804Z","title":"Learning task decomposition to assist humans in competitive programming","venue":null,"work_id":"1d6cd52a-a35b-4352-a951-10aa3bd30541","year":2024},"citing_paper":{"arxiv_id":"2412.14212","last_updated":"2024-12-18T08:47:17Z","snapshot_observed_at":"2026-08-11T12:55:18.702505Z","submitted_at":"2024-12-18T08:47:17Z","title":"Tree-of-Code: A Hybrid Approach for Robust Complex Task Planning and Execution","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-11T12:59:41.537434Z"},"links":{"citing_paper":"/paper/2412.14212"},"observation_digest":"sha256:b045b2a32ad7bb05311fba6ef7b6ddf4cae48cd431af062f009dbdc2a41ca76e","observation_id":"2c918f6b-dcdc-4930-9155-4078a4f5f7d6","resolution":{"observed_at":"2026-08-11T12:59:42.097975Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.04604","last_updated":"2025-03-01T20:47:54Z","snapshot_observed_at":"2026-07-06T18:26:54.963211Z","submitted_at":"2024-06-07T03:27:51Z","title":"Learning Task Decomposition to Assist Humans in Competitive Programming","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.04604","snapshot_observed_at":"2026-08-11T12:59:41.541593Z","title":"Learning task decomposition to assist humans in competitive programming","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.14212","last_updated":"2024-12-18T08:47:17Z","snapshot_observed_at":"2026-08-11T12:55:18.702505Z","submitted_at":"2024-12-18T08:47:17Z","title":"Tree-of-Code: A Hybrid Approach for Robust Complex Task Planning and Execution","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-11T12:59:41.541593Z"},"links":{"cited_paper":"/paper/2406.04604","citing_paper":"/paper/2412.14212"},"observation_digest":"sha256:5d715a645f23f55087ad127ff39d8fa1001fadcde3371ff43dd615afcf0d0cd0","observation_id":"53e7dec8-f442-4880-9cd8-44dd889acd74","resolution":{"observed_at":"2026-08-11T12:59:41.541593Z","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-11T12:59:41.545303Z","title":"Wizardlm: Empowering large pre-trained language models to follow complex instructions","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.14212","last_updated":"2024-12-18T08:47:17Z","snapshot_observed_at":"2026-08-11T12:55:18.702505Z","submitted_at":"2024-12-18T08:47:17Z","title":"Tree-of-Code: A Hybrid Approach for Robust Complex Task Planning and Execution","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-11T12:59:41.545303Z"},"links":{"citing_paper":"/paper/2412.14212"},"observation_digest":"sha256:9a8300173072f50fecc00306b75af3cdc568e143ac6252050434202d3332fb66","observation_id":"d3fe8d02-16fc-4957-b514-40497a493981","resolution":{"observed_at":"2026-08-11T12:59:41.545303Z","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-11T12:59:41.553545Z","title":"Tree of thoughts: Deliberate problem solving with large language models","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.14212","last_updated":"2024-12-18T08:47:17Z","snapshot_observed_at":"2026-08-11T12:55:18.702505Z","submitted_at":"2024-12-18T08:47:17Z","title":"Tree-of-Code: A Hybrid Approach for Robust Complex Task Planning and Execution","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-11T12:59:41.553545Z"},"links":{"citing_paper":"/paper/2412.14212"},"observation_digest":"sha256:251fc5f9907c4f1fc343b48221f9d6d9ce60555b72d74d1282fd6ef579399185","observation_id":"e0db899c-83c4-4a0d-adf6-b7565b1b5a89","resolution":{"observed_at":"2026-08-11T12:59:41.553545Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.09629","last_updated":"2024-03-18T07:56:48Z","snapshot_observed_at":"2026-07-31T09:25:34.205362Z","submitted_at":"2024-03-14T17:58:16Z","title":"Quiet-STaR: Language Models Can Teach Themselves to Think Before Speaking","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.09629","snapshot_observed_at":"2026-08-11T12:59:41.560832Z","title":"Quiet-star: Language models can teach themselves to think before speaking","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.14212","last_updated":"2024-12-18T08:47:17Z","snapshot_observed_at":"2026-08-11T12:55:18.702505Z","submitted_at":"2024-12-18T08:47:17Z","title":"Tree-of-Code: A Hybrid Approach for Robust Complex Task Planning and Execution","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-11T12:59:41.560832Z"},"links":{"cited_paper":"/paper/2403.09629","citing_paper":"/paper/2412.14212"},"observation_digest":"sha256:058c10897f021752bb6b3b2d22151236aa7a8bb2864ee82a58db30cda3daa961","observation_id":"2dc889ed-5dcc-4263-b8e9-d83d6a081123","resolution":{"observed_at":"2026-08-11T12:59:41.560832Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.11931","last_updated":"2024-06-17T13:51:35Z","snapshot_observed_at":"2026-08-07T06:30:25.302107Z","submitted_at":"2024-06-17T13:51:35Z","title":"DeepSeek-Coder-V2: Breaking the Barrier of Closed-Source Models in Code Intelligence","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.11931","snapshot_observed_at":"2026-08-11T12:59:41.575964Z","title":"[Yes] \" is generally preferable to","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.14212","last_updated":"2024-12-18T08:47:17Z","snapshot_observed_at":"2026-08-11T12:55:18.702505Z","submitted_at":"2024-12-18T08:47:17Z","title":"Tree-of-Code: A Hybrid Approach for Robust Complex Task Planning and Execution","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-11T12:59:41.575964Z"},"links":{"cited_paper":"/paper/2406.11931","citing_paper":"/paper/2412.14212"},"observation_digest":"sha256:038ec232f49c34a9d75be14c361c8d519ea4a3c1dd468364e69dd31731d592dc","observation_id":"9759a5a4-d100-41b3-8419-44b68164e695","resolution":{"observed_at":"2026-08-11T12:59:41.575964Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T12:59:42.039294Z","title":"Guidelines: • The answer NA means that the abstract and introduction do not include the claims made in the paper","venue":null,"work_id":"3685ae31-0a31-4f7d-a823-753bc7226a8d","year":null},"citing_paper":{"arxiv_id":"2412.14212","last_updated":"2024-12-18T08:47:17Z","snapshot_observed_at":"2026-08-11T12:55:18.702505Z","submitted_at":"2024-12-18T08:47:17Z","title":"Tree-of-Code: A Hybrid Approach for Robust Complex Task Planning and Execution","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-11T12:59:41.592973Z"},"links":{"citing_paper":"/paper/2412.14212"},"observation_digest":"sha256:da55eec88d79eac3a6a4457a50ae08e5082c861c194c2bec951902e41606e991","observation_id":"db64c994-1d1b-46a9-a8a9-c7a543a8d98b","resolution":{"observed_at":"2026-08-11T12:59:42.049844Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T12:59:42.003495Z","title":"Limitations","venue":null,"work_id":"64624b22-f073-4f4b-9838-52a79650905b","year":null},"citing_paper":{"arxiv_id":"2412.14212","last_updated":"2024-12-18T08:47:17Z","snapshot_observed_at":"2026-08-11T12:55:18.702505Z","submitted_at":"2024-12-18T08:47:17Z","title":"Tree-of-Code: A Hybrid Approach for Robust Complex Task Planning and Execution","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-11T12:59:41.612353Z"},"links":{"citing_paper":"/paper/2412.14212"},"observation_digest":"sha256:c3eb017d40dd24ffce3005fb13edbcb3c039f66fc4e27402dc543969a8810cf2","observation_id":"04e15dc4-a391-4b7f-b313-a5cd65f87bbd","resolution":{"observed_at":"2026-08-11T12:59:42.021375Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T12:59:41.992620Z","title":"Guidelines: • The answer NA means that the paper does not include theoretical results","venue":null,"work_id":"52514992-3807-4a11-9b09-fcad7cb1935c","year":null},"citing_paper":{"arxiv_id":"2412.14212","last_updated":"2024-12-18T08:47:17Z","snapshot_observed_at":"2026-08-11T12:55:18.702505Z","submitted_at":"2024-12-18T08:47:17Z","title":"Tree-of-Code: A Hybrid Approach for Robust Complex Task Planning and Execution","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-11T12:59:41.632558Z"},"links":{"citing_paper":"/paper/2412.14212"},"observation_digest":"sha256:354fe2d4c7a2e28d020b786b3761f642be720d12673cbf4a4c05c151b62cffa1","observation_id":"e07178ec-52d5-4c9f-8267-8c61dcb0863b","resolution":{"observed_at":"2026-08-11T12:59:41.996261Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T12:59:41.982148Z","title":"Guidelines: • The answer NA means that the paper does not include experiments","venue":null,"work_id":"4de97b54-d3af-4de2-956a-0544c30e957f","year":null},"citing_paper":{"arxiv_id":"2412.14212","last_updated":"2024-12-18T08:47:17Z","snapshot_observed_at":"2026-08-11T12:55:18.702505Z","submitted_at":"2024-12-18T08:47:17Z","title":"Tree-of-Code: A Hybrid Approach for Robust Complex Task Planning and Execution","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-11T12:59:41.636246Z"},"links":{"citing_paper":"/paper/2412.14212"},"observation_digest":"sha256:e8d58d549794b05736e545c28862301f2737f5285212ba58bc830b4505f738e8","observation_id":"51ce2515-0ff6-43d3-adbd-88c43eb8c61b","resolution":{"observed_at":"2026-08-11T12:59:41.986041Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T12:59:41.970908Z","title":"Guidelines: • The answer NA means that paper does not include experiments requiring code","venue":null,"work_id":"f786b0a3-52d0-47b8-9af7-34687a69e826","year":null},"citing_paper":{"arxiv_id":"2412.14212","last_updated":"2024-12-18T08:47:17Z","snapshot_observed_at":"2026-08-11T12:55:18.702505Z","submitted_at":"2024-12-18T08:47:17Z","title":"Tree-of-Code: A Hybrid Approach for Robust Complex Task Planning and Execution","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-11T12:59:41.640160Z"},"links":{"citing_paper":"/paper/2412.14212"},"observation_digest":"sha256:32c5c2200778c7eb8d540b2b6525e04661214a5fe00dd2502606f1cc0d90c1fe","observation_id":"1f3c3776-c9c9-4713-990c-c93a56ae6f77","resolution":{"observed_at":"2026-08-11T12:59:41.975513Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T12:59:41.958905Z","title":"Guidelines: • The answer NA means that the paper does not include experiments","venue":null,"work_id":"4b9d86be-7e9c-4abc-a924-2870e735298f","year":null},"citing_paper":{"arxiv_id":"2412.14212","last_updated":"2024-12-18T08:47:17Z","snapshot_observed_at":"2026-08-11T12:55:18.702505Z","submitted_at":"2024-12-18T08:47:17Z","title":"Tree-of-Code: A Hybrid Approach for Robust Complex Task Planning and Execution","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-11T12:59:41.644172Z"},"links":{"citing_paper":"/paper/2412.14212"},"observation_digest":"sha256:bf16935574cb247cd91dc56bf46a3b866b7113253ac39e4c13719343991e563c","observation_id":"ce349841-4729-4fb0-8b20-76167cc24bf7","resolution":{"observed_at":"2026-08-11T12:59:41.963908Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T12:59:41.947545Z","title":"Guidelines: • The answer NA means that the paper does not include experiments","venue":null,"work_id":"01748682-4100-4fed-9719-866323bface2","year":null},"citing_paper":{"arxiv_id":"2412.14212","last_updated":"2024-12-18T08:47:17Z","snapshot_observed_at":"2026-08-11T12:55:18.702505Z","submitted_at":"2024-12-18T08:47:17Z","title":"Tree-of-Code: A Hybrid Approach for Robust Complex Task Planning and Execution","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-11T12:59:41.649626Z"},"links":{"citing_paper":"/paper/2412.14212"},"observation_digest":"sha256:bb7a7fb0ff730632bbe8ceb04b6a421d1f091624d35bfe6bcd6cd69167a45517","observation_id":"f842543d-96cd-4bba-a2e1-a741db250553","resolution":{"observed_at":"2026-08-11T12:59:41.951808Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T12:59:41.934508Z","title":"Guidelines: • The answer NA means that the paper does not include experiments","venue":null,"work_id":"522d6497-1941-4f01-9eaf-803a096c4d06","year":null},"citing_paper":{"arxiv_id":"2412.14212","last_updated":"2024-12-18T08:47:17Z","snapshot_observed_at":"2026-08-11T12:55:18.702505Z","submitted_at":"2024-12-18T08:47:17Z","title":"Tree-of-Code: A Hybrid Approach for Robust Complex Task Planning and Execution","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-11T12:59:41.653760Z"},"links":{"citing_paper":"/paper/2412.14212"},"observation_digest":"sha256:e79893c568cf8d96d1c9ca7569ba0fa41e9721f22b2aff4a513d7943468c35f7","observation_id":"72ad4ed1-edee-47a1-97b8-5f8e241bf013","resolution":{"observed_at":"2026-08-11T12:59:41.939289Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T12:59:41.922577Z","title":"Guidelines: • The answer NA means that the authors have not reviewed the NeurIPS Code of Ethics","venue":null,"work_id":"b5f0a350-fc64-4c17-9f1b-231b528f7590","year":null},"citing_paper":{"arxiv_id":"2412.14212","last_updated":"2024-12-18T08:47:17Z","snapshot_observed_at":"2026-08-11T12:55:18.702505Z","submitted_at":"2024-12-18T08:47:17Z","title":"Tree-of-Code: A Hybrid Approach for Robust Complex Task Planning and Execution","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-11T12:59:41.657304Z"},"links":{"citing_paper":"/paper/2412.14212"},"observation_digest":"sha256:c4d600a05bd2d4b38fd337f4194de503da4cb3b8bdb739c213019bfe96b9230e","observation_id":"30323f8c-27db-4b98-a16d-0353595183e0","resolution":{"observed_at":"2026-08-11T12:59:41.926703Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T12:59:41.910914Z","title":"Guidelines: • The answer NA means that there is no societal impact of the work performed","venue":null,"work_id":"a141ea44-cd04-4be5-bb2b-c5dc58fe3156","year":null},"citing_paper":{"arxiv_id":"2412.14212","last_updated":"2024-12-18T08:47:17Z","snapshot_observed_at":"2026-08-11T12:55:18.702505Z","submitted_at":"2024-12-18T08:47:17Z","title":"Tree-of-Code: A Hybrid Approach for Robust Complex Task Planning and Execution","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-11T12:59:41.661236Z"},"links":{"citing_paper":"/paper/2412.14212"},"observation_digest":"sha256:92731b0aeeaccdb363e9d43edf6c068689466067665ce49573eeb6337bc143f6","observation_id":"2adb4b22-6e15-4059-8f01-f96e991cfa2f","resolution":{"observed_at":"2026-08-11T12:59:41.915394Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T12:59:41.899340Z","title":"These models commonly have safeguards in their own license description","venue":null,"work_id":"6544b90c-4633-40c0-890a-21cf65bfaacb","year":null},"citing_paper":{"arxiv_id":"2412.14212","last_updated":"2024-12-18T08:47:17Z","snapshot_observed_at":"2026-08-11T12:55:18.702505Z","submitted_at":"2024-12-18T08:47:17Z","title":"Tree-of-Code: A Hybrid Approach for Robust Complex Task Planning and Execution","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-11T12:59:41.664720Z"},"links":{"citing_paper":"/paper/2412.14212"},"observation_digest":"sha256:01c0b2b97f39a6dd29c1b128591200a1e5e648c007f87981cf6264560d974eaa","observation_id":"48e65aa8-c177-41cc-bd60-af4e9a5b57f1","resolution":{"observed_at":"2026-08-11T12:59:41.903577Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T12:59:41.881253Z","title":"Guidelines: • The answer NA means that the paper does not use existing assets","venue":null,"work_id":"dea0c4bb-c240-4f67-a549-5684de645863","year":null},"citing_paper":{"arxiv_id":"2412.14212","last_updated":"2024-12-18T08:47:17Z","snapshot_observed_at":"2026-08-11T12:55:18.702505Z","submitted_at":"2024-12-18T08:47:17Z","title":"Tree-of-Code: A Hybrid Approach for Robust Complex Task Planning and Execution","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-11T12:59:41.668820Z"},"links":{"citing_paper":"/paper/2412.14212"},"observation_digest":"sha256:be6ee1bc0edcbe6b33be6eda8020ea364dd30df09e9c868a133515919327695f","observation_id":"194d9305-4e9b-435b-a193-ca0c8a2816ec","resolution":{"observed_at":"2026-08-11T12:59:41.888361Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T12:59:41.870253Z","title":"Guidelines: • The answer NA means that the paper does not release new assets","venue":null,"work_id":"5e8247eb-22a6-45fc-9deb-84692f6d4392","year":null},"citing_paper":{"arxiv_id":"2412.14212","last_updated":"2024-12-18T08:47:17Z","snapshot_observed_at":"2026-08-11T12:55:18.702505Z","submitted_at":"2024-12-18T08:47:17Z","title":"Tree-of-Code: A Hybrid Approach for Robust Complex Task Planning and Execution","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-11T12:59:41.672494Z"},"links":{"citing_paper":"/paper/2412.14212"},"observation_digest":"sha256:7a512e0d249904a33be43788e4359a1f914a9aa448949166c1fe4a07c718af0d","observation_id":"f158e7e1-6f93-49b5-a51c-9125a9fae267","resolution":{"observed_at":"2026-08-11T12:59:41.873949Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T12:59:41.848809Z","title":"Guidelines: • The answer NA means that the paper does not involve crowdsourcing nor research with human subjects","venue":null,"work_id":"0a9cc63c-2cfc-48f6-a75d-50c89ae4f901","year":null},"citing_paper":{"arxiv_id":"2412.14212","last_updated":"2024-12-18T08:47:17Z","snapshot_observed_at":"2026-08-11T12:55:18.702505Z","submitted_at":"2024-12-18T08:47:17Z","title":"Tree-of-Code: A Hybrid Approach for Robust Complex Task Planning and Execution","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-11T12:59:41.676184Z"},"links":{"citing_paper":"/paper/2412.14212"},"observation_digest":"sha256:218af20660bec8813d9940e8a2643cc90081068d812e130e3d7512e295eb833b","observation_id":"e4b35de9-9dae-4a45-9c44-71169dbd0bf5","resolution":{"observed_at":"2026-08-11T12:59:41.863727Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T12:59:41.835582Z","title":"Guidelines: • The answer NA means that the paper does not involve crowdsourcing nor research with human subjects","venue":null,"work_id":"320d5227-1b63-40e7-9287-f608cc286485","year":null},"citing_paper":{"arxiv_id":"2412.14212","last_updated":"2024-12-18T08:47:17Z","snapshot_observed_at":"2026-08-11T12:55:18.702505Z","submitted_at":"2024-12-18T08:47:17Z","title":"Tree-of-Code: A Hybrid Approach for Robust Complex Task Planning and Execution","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-11T12:59:41.679914Z"},"links":{"citing_paper":"/paper/2412.14212"},"observation_digest":"sha256:8c05ad118185dc339e18f9ae6d5c6288c08e79ead672b0e37044e40993431e7c","observation_id":"ad35357f-41de-4840-b226-ad2adb38a4b8","resolution":{"observed_at":"2026-08-11T12:59:41.841251Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2412.14212","last_updated":"2024-12-18T08:47:17Z","latest_version":1,"primary_category":"cs.SE","snapshot_observed_at":"2026-08-11T12:55:18.702505Z","submitted_at":"2024-12-18T08:47:17Z","title":"Tree-of-Code: A Hybrid Approach for Robust Complex Task Planning and Execution"},"reference_resolution":{"displayed":40,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":20,"verified_exact":0,"verified_fuzzy":20},"total_outbound_references":40},"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-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 40 of 40 outbound references and 2 inbound Pith citation observations for arXiv:2412.14212."}