{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:NFRX2MF6NV2I3BDP345ZTRJJZJ","short_pith_number":"pith:NFRX2MF6","schema_version":"1.0","canonical_sha256":"69637d30be6d748d846fdf3b99c529ca766a89f13a51c29ac5c5d901899da0e1","source":{"kind":"arxiv","id":"2411.04329","version":2},"attestation_state":"computed","paper":{"title":"CodeTree: Agent-guided Tree Search for Code Generation with Large Language Models","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Caiming Xiong, Doyen Sahoo, Hung Le, Jierui Li, Silvio Savarese, Yingbo Zhou","submitted_at":"2024-11-07T00:09:54Z","abstract_excerpt":"Pre-trained on massive amounts of code and text data, large language models (LLMs) have demonstrated remarkable achievements in performing code generation tasks. With additional execution-based feedback, these models can act as agents with capabilities to self-refine and improve generated code autonomously. However, on challenging coding tasks with extremely large search space, current agentic approaches still struggle with multi-stage planning, generating, and debugging. To address this problem, we propose CodeTree, a framework for LLM agents to efficiently explore the search space in differe"},"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":"2411.04329","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.CL","submitted_at":"2024-11-07T00:09:54Z","cross_cats_sorted":[],"title_canon_sha256":"7f3576bc3b67156dcdc583deb61b3942f72c4ea8e4411351288bf3888cff5779","abstract_canon_sha256":"e5d3c4850ae9b68fbe1789f592f74924b68e879a4411389c0ae1611d6ca22122"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:34:39.476236Z","signature_b64":"z8ZlOqeF4h6gyS7Hj9rdgYwe/9f7NMv1Fv011eDE10Y/j29w5ySPPO4HADKhRKhp//zUR+FNwMhDykspe+adCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"69637d30be6d748d846fdf3b99c529ca766a89f13a51c29ac5c5d901899da0e1","last_reissued_at":"2026-07-05T09:34:39.475732Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:34:39.475732Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"CodeTree: Agent-guided Tree Search for Code Generation with Large Language Models","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Caiming Xiong, Doyen Sahoo, Hung Le, Jierui Li, Silvio Savarese, Yingbo Zhou","submitted_at":"2024-11-07T00:09:54Z","abstract_excerpt":"Pre-trained on massive amounts of code and text data, large language models (LLMs) have demonstrated remarkable achievements in performing code generation tasks. With additional execution-based feedback, these models can act as agents with capabilities to self-refine and improve generated code autonomously. However, on challenging coding tasks with extremely large search space, current agentic approaches still struggle with multi-stage planning, generating, and debugging. To address this problem, we propose CodeTree, a framework for LLM agents to efficiently explore the search space in differe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.04329","kind":"arxiv","version":2},"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/2411.04329/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":"2411.04329","created_at":"2026-07-05T09:34:39.475794+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.04329v2","created_at":"2026-07-05T09:34:39.475794+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.04329","created_at":"2026-07-05T09:34:39.475794+00:00"},{"alias_kind":"pith_short_12","alias_value":"NFRX2MF6NV2I","created_at":"2026-07-05T09:34:39.475794+00:00"},{"alias_kind":"pith_short_16","alias_value":"NFRX2MF6NV2I3BDP","created_at":"2026-07-05T09:34:39.475794+00:00"},{"alias_kind":"pith_short_8","alias_value":"NFRX2MF6","created_at":"2026-07-05T09:34:39.475794+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2502.17419","citing_title":"From System 1 to System 2: A Survey of Reasoning Large Language Models","ref_index":128,"is_internal_anchor":false},{"citing_arxiv_id":"2604.20398","citing_title":"WebGen-R1: Incentivizing Large Language Models to Generate Functional and Aesthetic Websites with Reinforcement Learning","ref_index":23,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NFRX2MF6NV2I3BDP345ZTRJJZJ","json":"https://pith.science/pith/NFRX2MF6NV2I3BDP345ZTRJJZJ.json","graph_json":"https://pith.science/api/pith-number/NFRX2MF6NV2I3BDP345ZTRJJZJ/graph.json","events_json":"https://pith.science/api/pith-number/NFRX2MF6NV2I3BDP345ZTRJJZJ/events.json","paper":"https://pith.science/paper/NFRX2MF6"},"agent_actions":{"view_html":"https://pith.science/pith/NFRX2MF6NV2I3BDP345ZTRJJZJ","download_json":"https://pith.science/pith/NFRX2MF6NV2I3BDP345ZTRJJZJ.json","view_paper":"https://pith.science/paper/NFRX2MF6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.04329&json=true","fetch_graph":"https://pith.science/api/pith-number/NFRX2MF6NV2I3BDP345ZTRJJZJ/graph.json","fetch_events":"https://pith.science/api/pith-number/NFRX2MF6NV2I3BDP345ZTRJJZJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NFRX2MF6NV2I3BDP345ZTRJJZJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NFRX2MF6NV2I3BDP345ZTRJJZJ/action/storage_attestation","attest_author":"https://pith.science/pith/NFRX2MF6NV2I3BDP345ZTRJJZJ/action/author_attestation","sign_citation":"https://pith.science/pith/NFRX2MF6NV2I3BDP345ZTRJJZJ/action/citation_signature","submit_replication":"https://pith.science/pith/NFRX2MF6NV2I3BDP345ZTRJJZJ/action/replication_record"}},"created_at":"2026-07-05T09:34:39.475794+00:00","updated_at":"2026-07-05T09:34:39.475794+00:00"}