{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:BWAHI7VJH5IOJJ4RIVMG6TBSFX","short_pith_number":"pith:BWAHI7VJ","schema_version":"1.0","canonical_sha256":"0d80747ea93f50e4a79145586f4c322df5f80faebf54ca2d0c9dfb18eba9afa8","source":{"kind":"arxiv","id":"2402.10178","version":2},"attestation_state":"computed","paper":{"title":"TDAG: A Multi-Agent Framework based on Dynamic Task Decomposition and Agent Generation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Jinsong Su, Junfeng Yao, Yaoxiang Wang, Zhiyong Wu","submitted_at":"2024-02-15T18:27:37Z","abstract_excerpt":"The emergence of Large Language Models (LLMs) like ChatGPT has inspired the development of LLM-based agents capable of addressing complex, real-world tasks. However, these agents often struggle during task execution due to methodological constraints, such as error propagation and limited adaptability. To address this issue, we propose a multi-agent framework based on dynamic Task Decomposition and Agent Generation (TDAG). This framework dynamically decomposes complex tasks into smaller subtasks and assigns each to a specifically generated subagent, thereby enhancing adaptability in diverse and"},"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":"2402.10178","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2024-02-15T18:27:37Z","cross_cats_sorted":[],"title_canon_sha256":"5b59f84b53697cff62b1d0cd0d948d4cadd98804d612cfd65532f469d40abba8","abstract_canon_sha256":"3f631a46b3289a11c5858cfe55ed832a3a7a40f704d592e456b1f3da7e7580ad"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:03:23.976547Z","signature_b64":"9J4wrq6htbpsl3d5qad8OOZlWQ5i88SqRVQkYtp/wGdXaMoeIjJ9ZVMU5yCIAyM8UA+cL+BxxDLIiPMsmlrrBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0d80747ea93f50e4a79145586f4c322df5f80faebf54ca2d0c9dfb18eba9afa8","last_reissued_at":"2026-07-05T10:03:23.976116Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:03:23.976116Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"TDAG: A Multi-Agent Framework based on Dynamic Task Decomposition and Agent Generation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Jinsong Su, Junfeng Yao, Yaoxiang Wang, Zhiyong Wu","submitted_at":"2024-02-15T18:27:37Z","abstract_excerpt":"The emergence of Large Language Models (LLMs) like ChatGPT has inspired the development of LLM-based agents capable of addressing complex, real-world tasks. However, these agents often struggle during task execution due to methodological constraints, such as error propagation and limited adaptability. To address this issue, we propose a multi-agent framework based on dynamic Task Decomposition and Agent Generation (TDAG). This framework dynamically decomposes complex tasks into smaller subtasks and assigns each to a specifically generated subagent, thereby enhancing adaptability in diverse and"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.10178","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/2402.10178/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":"2402.10178","created_at":"2026-07-05T10:03:23.976171+00:00"},{"alias_kind":"arxiv_version","alias_value":"2402.10178v2","created_at":"2026-07-05T10:03:23.976171+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.10178","created_at":"2026-07-05T10:03:23.976171+00:00"},{"alias_kind":"pith_short_12","alias_value":"BWAHI7VJH5IO","created_at":"2026-07-05T10:03:23.976171+00:00"},{"alias_kind":"pith_short_16","alias_value":"BWAHI7VJH5IOJJ4R","created_at":"2026-07-05T10:03:23.976171+00:00"},{"alias_kind":"pith_short_8","alias_value":"BWAHI7VJ","created_at":"2026-07-05T10:03:23.976171+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2404.08144","citing_title":"LLM Agents can Autonomously Exploit One-day Vulnerabilities","ref_index":18,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BWAHI7VJH5IOJJ4RIVMG6TBSFX","json":"https://pith.science/pith/BWAHI7VJH5IOJJ4RIVMG6TBSFX.json","graph_json":"https://pith.science/api/pith-number/BWAHI7VJH5IOJJ4RIVMG6TBSFX/graph.json","events_json":"https://pith.science/api/pith-number/BWAHI7VJH5IOJJ4RIVMG6TBSFX/events.json","paper":"https://pith.science/paper/BWAHI7VJ"},"agent_actions":{"view_html":"https://pith.science/pith/BWAHI7VJH5IOJJ4RIVMG6TBSFX","download_json":"https://pith.science/pith/BWAHI7VJH5IOJJ4RIVMG6TBSFX.json","view_paper":"https://pith.science/paper/BWAHI7VJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2402.10178&json=true","fetch_graph":"https://pith.science/api/pith-number/BWAHI7VJH5IOJJ4RIVMG6TBSFX/graph.json","fetch_events":"https://pith.science/api/pith-number/BWAHI7VJH5IOJJ4RIVMG6TBSFX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BWAHI7VJH5IOJJ4RIVMG6TBSFX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BWAHI7VJH5IOJJ4RIVMG6TBSFX/action/storage_attestation","attest_author":"https://pith.science/pith/BWAHI7VJH5IOJJ4RIVMG6TBSFX/action/author_attestation","sign_citation":"https://pith.science/pith/BWAHI7VJH5IOJJ4RIVMG6TBSFX/action/citation_signature","submit_replication":"https://pith.science/pith/BWAHI7VJH5IOJJ4RIVMG6TBSFX/action/replication_record"}},"created_at":"2026-07-05T10:03:23.976171+00:00","updated_at":"2026-07-05T10:03:23.976171+00:00"}