{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:RBMC2FGVCVBM3UHJCRARAP5EOT","short_pith_number":"pith:RBMC2FGV","schema_version":"1.0","canonical_sha256":"88582d14d51542cdd0e91441103fa474e01827d8eada259b14559a688a93ae1f","source":{"kind":"arxiv","id":"2410.06153","version":3},"attestation_state":"computed","paper":{"title":"AgentSquare: Automatic LLM Agent Search in Modular Design Space","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Fengli Xu, Jiahe Liu, Keyu Zhao, Likai Ma, Yong Li, Yu Li, Yu Shang","submitted_at":"2024-10-08T15:52:42Z","abstract_excerpt":"Recent advancements in Large Language Models (LLMs) have led to a rapid growth of agentic systems capable of handling a wide range of complex tasks. However, current research largely relies on manual, task-specific design, limiting their adaptability to novel tasks. In this paper, we introduce a new research problem: Modularized LLM Agent Search (MoLAS). We propose a modular design space that abstracts existing LLM agent designs into four fundamental modules with uniform IO interface: Planning, Reasoning, Tool Use, and Memory. Building on this design space, we present a novel LLM agent search "},"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":"2410.06153","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2024-10-08T15:52:42Z","cross_cats_sorted":[],"title_canon_sha256":"f1f08762c7bd0b2928051ec6620563f834ddab42b3c479521341086d8134308e","abstract_canon_sha256":"31f1cc3b5a96a9a89365c613a96414e877b0f267aee9f228bc2d0d7a789bb0cd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:21:04.775306Z","signature_b64":"RfEtKXruIE1f+q+69Sz0pU7IRDu22wwTBmFBXLXxpkO8STCdMPRxAQ1H/VvfMvQtYmlcxD7nzUHPer42X+cLDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"88582d14d51542cdd0e91441103fa474e01827d8eada259b14559a688a93ae1f","last_reissued_at":"2026-07-05T10:21:04.774767Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:21:04.774767Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"AgentSquare: Automatic LLM Agent Search in Modular Design Space","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Fengli Xu, Jiahe Liu, Keyu Zhao, Likai Ma, Yong Li, Yu Li, Yu Shang","submitted_at":"2024-10-08T15:52:42Z","abstract_excerpt":"Recent advancements in Large Language Models (LLMs) have led to a rapid growth of agentic systems capable of handling a wide range of complex tasks. However, current research largely relies on manual, task-specific design, limiting their adaptability to novel tasks. In this paper, we introduce a new research problem: Modularized LLM Agent Search (MoLAS). We propose a modular design space that abstracts existing LLM agent designs into four fundamental modules with uniform IO interface: Planning, Reasoning, Tool Use, and Memory. Building on this design space, we present a novel LLM agent search "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.06153","kind":"arxiv","version":3},"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/2410.06153/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":"2410.06153","created_at":"2026-07-05T10:21:04.774828+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.06153v3","created_at":"2026-07-05T10:21:04.774828+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.06153","created_at":"2026-07-05T10:21:04.774828+00:00"},{"alias_kind":"pith_short_12","alias_value":"RBMC2FGVCVBM","created_at":"2026-07-05T10:21:04.774828+00:00"},{"alias_kind":"pith_short_16","alias_value":"RBMC2FGVCVBM3UHJ","created_at":"2026-07-05T10:21:04.774828+00:00"},{"alias_kind":"pith_short_8","alias_value":"RBMC2FGV","created_at":"2026-07-05T10:21:04.774828+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":12,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.26669","citing_title":"SKILL-DISCO: Distilling and Compiling Agent Traces into Reusable Procedural Skills","ref_index":53,"is_internal_anchor":false},{"citing_arxiv_id":"2605.21516","citing_title":"Harnesses for Inference-Time Alignment over Execution Trajectories","ref_index":36,"is_internal_anchor":false},{"citing_arxiv_id":"2510.07799","citing_title":"Dynamic Generation of Multi-LLM Agents Communication Topologies with Graph Diffusion Models","ref_index":23,"is_internal_anchor":false},{"citing_arxiv_id":"2605.20425","citing_title":"AgentCo-op: Retrieval-Based Synthesis of Interoperable Multi-Agent Workflows","ref_index":19,"is_internal_anchor":false},{"citing_arxiv_id":"2512.12634","citing_title":"MobiBench: Multi-Branch, Modular Benchmark for Mobile GUI Agents","ref_index":26,"is_internal_anchor":false},{"citing_arxiv_id":"2501.09686","citing_title":"Towards Large Reasoning Models: A Survey of Reinforced Reasoning with Large Language Models","ref_index":127,"is_internal_anchor":false},{"citing_arxiv_id":"2604.14655","citing_title":"AgentGA: Evolving Code Solutions in Agent-Seed Space","ref_index":21,"is_internal_anchor":false},{"citing_arxiv_id":"2605.09539","citing_title":"TacoMAS: Test-Time Co-Evolution of Topology and Capability in LLM-based Multi-Agent Systems","ref_index":8,"is_internal_anchor":false},{"citing_arxiv_id":"2605.07339","citing_title":"Tools as Continuous Flow for Evolving Agentic Reasoning","ref_index":36,"is_internal_anchor":false},{"citing_arxiv_id":"2604.05550","citing_title":"AutoSOTA: An End-to-End Automated Research System for State-of-the-Art AI Model Discovery","ref_index":16,"is_internal_anchor":false},{"citing_arxiv_id":"2604.18131","citing_title":"Training LLM Agents for Spontaneous, Reward-Free Self-Evolution via World Knowledge Exploration","ref_index":11,"is_internal_anchor":false},{"citing_arxiv_id":"2604.14655","citing_title":"AgentGA: Evolving Code Solutions in Agent-Seed Space","ref_index":21,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RBMC2FGVCVBM3UHJCRARAP5EOT","json":"https://pith.science/pith/RBMC2FGVCVBM3UHJCRARAP5EOT.json","graph_json":"https://pith.science/api/pith-number/RBMC2FGVCVBM3UHJCRARAP5EOT/graph.json","events_json":"https://pith.science/api/pith-number/RBMC2FGVCVBM3UHJCRARAP5EOT/events.json","paper":"https://pith.science/paper/RBMC2FGV"},"agent_actions":{"view_html":"https://pith.science/pith/RBMC2FGVCVBM3UHJCRARAP5EOT","download_json":"https://pith.science/pith/RBMC2FGVCVBM3UHJCRARAP5EOT.json","view_paper":"https://pith.science/paper/RBMC2FGV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.06153&json=true","fetch_graph":"https://pith.science/api/pith-number/RBMC2FGVCVBM3UHJCRARAP5EOT/graph.json","fetch_events":"https://pith.science/api/pith-number/RBMC2FGVCVBM3UHJCRARAP5EOT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RBMC2FGVCVBM3UHJCRARAP5EOT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RBMC2FGVCVBM3UHJCRARAP5EOT/action/storage_attestation","attest_author":"https://pith.science/pith/RBMC2FGVCVBM3UHJCRARAP5EOT/action/author_attestation","sign_citation":"https://pith.science/pith/RBMC2FGVCVBM3UHJCRARAP5EOT/action/citation_signature","submit_replication":"https://pith.science/pith/RBMC2FGVCVBM3UHJCRARAP5EOT/action/replication_record"}},"created_at":"2026-07-05T10:21:04.774828+00:00","updated_at":"2026-07-05T10:21:04.774828+00:00"}