{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:LGLWHP5Z5NUCWDUB6OVNLT3DFE","short_pith_number":"pith:LGLWHP5Z","schema_version":"1.0","canonical_sha256":"599763bfb9eb682b0e81f3aad5cf63290bb28fb9bbb54e15f5750ac61239850c","source":{"kind":"arxiv","id":"2412.14212","version":1},"attestation_state":"computed","paper":{"title":"Tree-of-Code: A Hybrid Approach for Robust Complex Task Planning and Execution","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.SE","authors_text":"Daxiang Dong, Yifan Li, Ziyi Ni","submitted_at":"2024-12-18T08:47:17Z","abstract_excerpt":"The exceptional capabilities of large language models (LLMs) have substantially accelerated the rapid rise and widespread adoption of agents. Recent studies have demonstrated that generating Python code to consolidate LLM-based agents' actions into a unified action space (CodeAct) is a promising approach for developing real-world LLM agents. However, this step-by-step code generation approach often lacks consistency and robustness, leading to instability in agent applications, particularly for complex reasoning and out-of-domain tasks. In this paper, we propose a novel approach called Tree-of-"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2412.14212","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2024-12-18T08:47:17Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"2582b8031fb1da297c7012a4351c1869aed5c3d99d2dbe34feca2136d1238602","abstract_canon_sha256":"6769961d8a4fe1b94eaae561eea50565513412e3ca5914d1ce20014374d1e3a2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:51:41.924404Z","signature_b64":"WbxHg5nHGrQkwn2TKhg7uk01qKQMal5ko6cYyX8gBILlKiLltWdg9lTN8u6PcV6Th/7mdLRHNBpUc1hOp2nzCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"599763bfb9eb682b0e81f3aad5cf63290bb28fb9bbb54e15f5750ac61239850c","last_reissued_at":"2026-07-05T09:51:41.923996Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:51:41.923996Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tree-of-Code: A Hybrid Approach for Robust Complex Task Planning and Execution","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.SE","authors_text":"Daxiang Dong, Yifan Li, Ziyi Ni","submitted_at":"2024-12-18T08:47:17Z","abstract_excerpt":"The exceptional capabilities of large language models (LLMs) have substantially accelerated the rapid rise and widespread adoption of agents. Recent studies have demonstrated that generating Python code to consolidate LLM-based agents' actions into a unified action space (CodeAct) is a promising approach for developing real-world LLM agents. However, this step-by-step code generation approach often lacks consistency and robustness, leading to instability in agent applications, particularly for complex reasoning and out-of-domain tasks. In this paper, we propose a novel approach called Tree-of-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.14212","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2412.14212/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2412.14212","created_at":"2026-07-05T09:51:41.924051+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.14212v1","created_at":"2026-07-05T09:51:41.924051+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.14212","created_at":"2026-07-05T09:51:41.924051+00:00"},{"alias_kind":"pith_short_12","alias_value":"LGLWHP5Z5NUC","created_at":"2026-07-05T09:51:41.924051+00:00"},{"alias_kind":"pith_short_16","alias_value":"LGLWHP5Z5NUCWDUB","created_at":"2026-07-05T09:51:41.924051+00:00"},{"alias_kind":"pith_short_8","alias_value":"LGLWHP5Z","created_at":"2026-07-05T09:51:41.924051+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2511.20857","citing_title":"Evo-Memory: Benchmarking LLM Agent Test-time Learning with Self-Evolving Memory","ref_index":219,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LGLWHP5Z5NUCWDUB6OVNLT3DFE","json":"https://pith.science/pith/LGLWHP5Z5NUCWDUB6OVNLT3DFE.json","graph_json":"https://pith.science/api/pith-number/LGLWHP5Z5NUCWDUB6OVNLT3DFE/graph.json","events_json":"https://pith.science/api/pith-number/LGLWHP5Z5NUCWDUB6OVNLT3DFE/events.json","paper":"https://pith.science/paper/LGLWHP5Z"},"agent_actions":{"view_html":"https://pith.science/pith/LGLWHP5Z5NUCWDUB6OVNLT3DFE","download_json":"https://pith.science/pith/LGLWHP5Z5NUCWDUB6OVNLT3DFE.json","view_paper":"https://pith.science/paper/LGLWHP5Z","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.14212&json=true","fetch_graph":"https://pith.science/api/pith-number/LGLWHP5Z5NUCWDUB6OVNLT3DFE/graph.json","fetch_events":"https://pith.science/api/pith-number/LGLWHP5Z5NUCWDUB6OVNLT3DFE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LGLWHP5Z5NUCWDUB6OVNLT3DFE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LGLWHP5Z5NUCWDUB6OVNLT3DFE/action/storage_attestation","attest_author":"https://pith.science/pith/LGLWHP5Z5NUCWDUB6OVNLT3DFE/action/author_attestation","sign_citation":"https://pith.science/pith/LGLWHP5Z5NUCWDUB6OVNLT3DFE/action/citation_signature","submit_replication":"https://pith.science/pith/LGLWHP5Z5NUCWDUB6OVNLT3DFE/action/replication_record"}},"created_at":"2026-07-05T09:51:41.924051+00:00","updated_at":"2026-07-05T09:51:41.924051+00:00"}