<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.4 20241031//EN" "JATS-journalpublishing1-4.dtd">
<article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" article-type="research-article" dtd-version="1.4" xml:lang="en">
  <front>
    <journal-meta>
      <journal-id journal-id-type="publisher-id">jsea</journal-id>
      <journal-title-group>
        <journal-title>Journal of Software Engineering and Applications</journal-title>
      </journal-title-group>
      <issn pub-type="epub">1945-3124</issn>
      <issn pub-type="ppub">1945-3116</issn>
      <publisher>
        <publisher-name>Scientific Research Publishing</publisher-name>
      </publisher>
    </journal-meta>
    <article-meta>
      <article-id pub-id-type="doi">10.4236/jsea.2025.1812030</article-id>
      <article-id pub-id-type="publisher-id">jsea-148134</article-id>
      <article-categories>
        <subj-group>
          <subject>Article</subject>
        </subj-group>
        <subj-group>
          <subject>Computer Science</subject>
          <subject>Communications</subject>
        </subj-group>
      </article-categories>
      <title-group>
        <article-title>A Mixture-of-Agents System for Fact-Based Comprehensive Search</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <name name-style="western">
            <surname>Bakar</surname>
            <given-names>Muhammad Abu</given-names>
          </name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <name name-style="western">
            <surname>Madisetti</surname>
            <given-names>Vijay</given-names>
          </name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
      </contrib-group>
      <aff id="aff1"><label>1</label> Georgia Institute of Technology, Atlanta, USA </aff>
      <author-notes>
        <fn fn-type="conflict" id="fn-conflict">
          <p>The authors declare no conflicts of interest regarding the publication of this paper.</p>
        </fn>
      </author-notes>
      <pub-date pub-type="epub">
        <day>16</day>
        <month>12</month>
        <year>2025</year>
      </pub-date>
      <pub-date pub-type="collection">
        <month>12</month>
        <year>2025</year>
      </pub-date>
      <volume>18</volume>
      <issue>12</issue>
      <fpage>507</fpage>
      <lpage>541</lpage>
      <history>
        <date date-type="received">
          <day>15</day>
          <month>09</month>
          <year>2025</year>
        </date>
        <date date-type="accepted">
          <day>19</day>
          <month>12</month>
          <year>2025</year>
        </date>
        <date date-type="published">
          <day>22</day>
          <month>12</month>
          <year>2025</year>
        </date>
      </history>
      <permissions>
        <copyright-statement>© 2025 by the authors and Scientific Research Publishing Inc.</copyright-statement>
        <copyright-year>2025</copyright-year>
        <license license-type="open-access">
          <license-p> This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license ( <ext-link ext-link-type="uri" xlink:href="https://creativecommons.org/licenses/by/4.0/">https://creativecommons.org/licenses/by/4.0/</ext-link> ). </license-p>
        </license>
      </permissions>
      <self-uri content-type="doi" xlink:href="https://doi.org/10.4236/jsea.2025.1812030">https://doi.org/10.4236/jsea.2025.1812030</self-uri>
      <abstract>
        <p>Large Language Models (LLMs) exhibit remarkable capabilities; however, they possess inherent limitations due to static training, which leads to outdated information and hallucinations. Furthermore, most existing multi-agent frameworks depend on predefined and rigid agent roles that lack adaptability across a range of tasks. We introduce AMASS (Autonomous Multi-Agent System for Fact-Based Comprehensive Search), a dynamic and self-organizing framework that addresses these limitations through two primary innovations: autonomous agent generation and a Mixture of Agents (MoA) strategy. In contrast to traditional systems, AMASS spontaneously generates specialized agents tailored to the unique requirements of each task. Each agent autonomously selects the most appropriate LLM, based on the complexity of the task, thereby utilizing lightweight models for straightforward queries and more powerful models for intricate reasoning tasks. A centralized Critic Agent supervises the system to eliminate redundancy, ensure coherent collaboration, and continuously optimize the alignment of agents to tasks. Our cascaded search mechanism further enhances the accuracy of results by enabling an iterative and context-sensitive refinement process. Evaluated across the GPQA, Bamboogle, MuSiQue, and TriviaQA datasets, AMASS significantly outperforms state-of-the-art frameworks in accuracy, efficiency, and factual reliability, thus performing better for autonomous multi-agent reasoning systems.</p>
      </abstract>
      <kwd-group kwd-group-type="author-generated" xml:lang="en">
        <kwd>Multi-Agent Systems</kwd>
        <kwd>Cascaded Search</kwd>
        <kwd>Mixture Of Agents (MOA)</kwd>
        <kwd>Autogen</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec1">
      <title>1. Introduction</title>
      <p>Large Language Models (LLMs) have revolutionized natural language processing and decision-making tasks. However, they suffer from fundamental limitations such as knowledge obsolescence, hallucinations, and inefficiencies in adapting to diverse tasks. The static nature of LLM training results in outdated responses, making them unreliable for real-time applications. Additionally, existing multi-agent frameworks attempt to mitigate these challenges but largely rely on predefined agent architectures with fixed roles. This restricts their ability to adapt dynamically to new tasks and efficiently allocate computational resources.</p>
      <p>To address these shortcomings, we introduce AMASS (Autonomous Multi-Agent System for Fact-Based Comprehensive Search), a novel framework that leverages <italic>autonomous agent generation and optimization</italic>. Unlike conventional agentic architectures, AMASS dynamically <italic>creates, evaluates, and refines</italic> specialized agents at runtime, ensuring optimal task execution. A key innovation of AMASS is its ability to <italic>incorporate a mixture of experts dynamically</italic>, selecting the most suitable LLM for each agent based on task complexity. Simple tasks are handled by lightweight models, while complex reasoning tasks utilize more powerful LLMs, optimizing both accuracy and computational efficiency.</p>
      <p>Furthermore, AMASS advances multi-agent reasoning beyond conventional architectures by incorporating a Critic Agent, which removes superfluous agents, refines task strategies, and optimizes agent-task mapping. The framework also integrates cascaded search mechanisms, allowing agents to iteratively refine queries, delve deeper into information sources, and extract high-quality knowledge. Such enhancements establish AMASS as a cutting-edge autonomous multi-agent system, proficient in effectively balancing computational cost, adaptability, and accuracy.</p>
      <p>The evaluation of AMASS is conducted utilizing the GPQA dataset, encompassing several domains such as Physics, Chemistry, and Biology. Empirical findings indicate that AMASS exhibits superior performance relative to existing agent-based frameworks, particularly with respect to response accuracy, search depth, and operational efficiency. Through the incorporation of autonomous agent formation alongside a heterogeneous ensemble of experts, AMASS introduces a novel paradigm within multi-agent architecture, enhancing its scalability, cost-effectiveness, and robustness in addressing intricate computational problems.</p>
      <p>The remainder of this paper is structured as follows: <bold>Section II</bold> discusses related work, highlighting the limitations of existing multi-agent systems. <bold>Section III</bold> presents the AMASS architecture, including autonomous agent generation, expert selection, and execution mechanisms. <bold>Section IV</bold> details our evaluation results and comparative analysis, while <bold>Section V</bold> discusses future research directions.</p>
    </sec>
    <sec id="sec2">
      <title>2. Related Work</title>
      <sec id="sec2dot1">
        <title>2.1. Static Agent Frameworks</title>
        <p>Numerous methodologies have been devised to incorporate multi-agent systems for addressing complex challenges, which are challenging for a singular LLM to resolve. Meta-GPT [<xref ref-type="bibr" rid="B1">1</xref>] endeavors to address such intricate challenges by emulating the software development lifecycle. The various departments within a software firm have been transformed into distinct agent roles, each specializing in specific tasks. However, a limitation of the Meta-GPT approach lies in the fact that these agents are defined by human intervention, relying on fixed system prompts and descriptive instructions, which hinders Meta-GPT’s adaptability to novel use cases. Analogous constraints associated with predefined structures are evident in [<xref ref-type="bibr" rid="B2">2</xref>], CAMEL (Camel: Communicative Agents for “Mind” Exploration of Large Language Model Society) [<xref ref-type="bibr" rid="B3">3</xref>], AGENTVERSE: Facilitating Multi-Agent Collaboration and Exploring Emergent Behaviors [<xref ref-type="bibr" rid="B4">4</xref>], and [<xref ref-type="bibr" rid="B5">5</xref>]. CAMEL was among the initial endeavors to implement agent role-play for resolving intricate tasks. It demonstrated superior performance in numerous test environments compared to the unrefined LLM model. However, the absence of a feedback loop resulted in discussions deviating from the primary subject matter.</p>
      </sec>
      <sec id="sec2dot2">
        <title>2.2. Autogen</title>
        <p>Autogen [<xref ref-type="bibr" rid="B6">6</xref>], a multi-agent framework developed by Microsoft, was specifically designed for deployment in multi-agent environments. This framework incorporated various multi-agent principles, including the summarization of previous communications, storage of agents within a database, and simulation of human-to-human interactions in real-world contexts. Despite Autogen’s success in introducing autonomous agents, several limitations were observed. Notably, after the agents’ initial development during the planning phase, no subsequent refinement was conducted. As a result, agents often became redundant, and superfluous agents were created that did not address the necessary tasks, causing discussions to deviate into irrelevant topics.</p>
      </sec>
      <sec id="sec2dot3">
        <title>2.3. Autoagents</title>
        <p>The “Autoagents” [<xref ref-type="bibr" rid="B6">6</xref>] paper addressed some of the limitations inherent in the “autogen” paper regarding agent creation by integrating a critic agent within the planning phase. This integration facilitated the inclusion of only the necessary agents during the planning process, thereby reducing the overhead associated with excessive inter-agent communication. However, a limitation of this framework is that the backend Language Learning Model (LLM) used for tasks remains static and predefined from the outset. In some respects, this architecture could be emulated through the use of a reasoning LLM in conjunction with a critic agent or evaluator within a loop. Multi-agent collaboration is most effective when each agent is highly specialized within its domain, as observed in real-world scenarios. Although the evaluator participates in the planning stage, its role is not sufficiently effective in reducing the number of agents or optimizing system prompts such that fewer agents could manage tasks typically requiring many. Furthermore, once an agent is created, this framework cannot alter the agent’s characteristics. </p>
      </sec>
      <sec id="sec2dot4">
        <title>2.4. EvoAgent: Towards Automatic Multi-Agent Generation via Evolutionary Algorithms</title>
        <p>EvoAgents [<xref ref-type="bibr" rid="B7">7</xref>] utilized evolutionary methodologies for agent creation. The framework of evolutionary agents effectively addressed issues of redundancy among agents in the planning phase by introducing these agents. Once developed, the agents undergo an evolutionary process whereby redundant agents are eliminated, and a new collection of agents is generated with refined prompts. The research primarily concentrated on the planning phase, notably lacking an evaluator during the execution stages. This absence is problematic, as even the most optimized set of agents cannot guarantee error-free outcomes.</p>
      </sec>
      <sec id="sec2dot5">
        <title>2.5. MindSearch: Mimicking Human Minds Elicits Deep AI Searcher</title>
        <p>MindSearch [<xref ref-type="bibr" rid="B8">8</xref>] emulates human reasoning by employing a network of nodes operated by Large Language Model (LLM) agents. Upon receiving an inquiry from a user, it conducts a search and ceases further action if the result is obtained. Should the answer remain elusive, the system diverges into multiple nodes, each probing in distinct directions. In comparative evaluations, it demonstrates significant performance advantages over prominent search frameworks. However, it is limited by its inability to integrate multiple agents and lacks the capacity to modify the LLM engine’s backend to suit varying search requirements. Furthermore, it does not exhibit adaptability to programming-related tasks.</p>
      </sec>
      <sec id="sec2dot6">
        <title>2.6. Agentic Reasoning: Utilizing Reasoning LLMs with Supplementary Tools for In-Depth Research</title>
        <p>Agentic Reasoning [<xref ref-type="bibr" rid="B9">9</xref>] utilizes mind mapping and agentic reasoning models applied to the GPQA [<xref ref-type="bibr" rid="B10">10</xref>] dataset. Their findings suggest that employing basic tools, such as web browsers and Python interpreters, alongside mind maps fortified with agentic reasoning, can produce superior outcomes compared to those of human experts. The research asserts that the resolution of complex problems does not necessitate reliance on intricate agents; rather, the synergy of simple tools with reasoning models can effectively manage most tasks. Nonetheless, this methodology presents certain limitations, principally its dependence on a singular model throughout the process. By integrating an array of models, a diverse set of experts can be engaged for specific tasks. Furthermore, utilizing a variety of foundational models helps to diminish bias and reduce instances of hallucinations in the model’s outputs, as these models are developed using significantly varied datasets and hyperparameters. </p>
      </sec>
      <sec id="sec2dot7">
        <title>2.7. Feature Comparison</title>
        <p>Below is the comparison of capabilities for AMASS vs the other multi agent systems. AMASS has more diverse set of capabilities (<bold>Table 1</bold>).</p>
        <p><bold>Table 1</bold><bold>.</bold> Comparison of previous work.</p>
        <table-wrap id="tbl1">
          <label>Table 1</label>
          <table>
            <tbody>
              <tr>
                <td>System</td>
                <td>Dynamic Agents</td>
                <td>Web Search Verification</td>
                <td>Cascaded Searches</td>
                <td>Mixture Of Agents (MOA)</td>
                <td>Remove Redundant Agents</td>
              </tr>
              <tr>
                <td>Auto-Agents</td>
                <td>√</td>
                <td>√</td>
                <td>×</td>
                <td>×</td>
                <td>√</td>
              </tr>
              <tr>
                <td>Meta-GPT</td>
                <td>×</td>
                <td>×</td>
                <td>×</td>
                <td>×</td>
                <td>×</td>
              </tr>
            </tbody>
          </table>
        </table-wrap>
        <p><bold>Continued</bold></p>
        <table-wrap id="tbl2">
          <label>Table 2</label>
          <table>
            <tbody>
              <tr>
                <td>Mind-Search</td>
                <td>×</td>
                <td>×</td>
                <td>√</td>
                <td>×</td>
                <td>×</td>
              </tr>
              <tr>
                <td>Autogen</td>
                <td>√</td>
                <td>√</td>
                <td>×</td>
                <td>×</td>
                <td>×</td>
              </tr>
              <tr>
                <td>Auto-GPT</td>
                <td>√</td>
                <td>×</td>
                <td>×</td>
                <td>×</td>
                <td>×</td>
              </tr>
              <tr>
                <td>Camel</td>
                <td>×</td>
                <td>×</td>
                <td>×</td>
                <td>×</td>
                <td>×</td>
              </tr>
              <tr>
                <td>EVO-AGENT</td>
                <td>√</td>
                <td>√</td>
                <td>√</td>
                <td>×</td>
                <td>√</td>
              </tr>
              <tr>
                <td>Agent-Verse</td>
                <td>×</td>
                <td>×</td>
                <td>√</td>
                <td>×</td>
                <td>×</td>
              </tr>
              <tr>
                <td>Internet of Agents</td>
                <td>√</td>
                <td>×</td>
                <td>×</td>
                <td>×</td>
                <td>×</td>
              </tr>
              <tr>
                <td>Agentic Reasoning</td>
                <td>×</td>
                <td>√</td>
                <td>√</td>
                <td>×</td>
                <td>×</td>
              </tr>
              <tr>
                <td>AMASS</td>
                <td>√</td>
                <td>√</td>
                <td>√</td>
                <td>√</td>
                <td>√</td>
              </tr>
            </tbody>
          </table>
        </table-wrap>
      </sec>
    </sec>
    <sec id="sec3">
      <title>3. Implementation</title>
      <sec id="sec3dot1">
        <title>3.1. Overall Structure</title>
        <p>The architecture comprises four principal components<xref ref-type="fig" rid="fig1">Figure 1</xref>: the Preprocessor, the Planner, the Executor, and the Summarizer. The Preprocessor is tasked with processing images and videos while integrating the necessary context into the user’s query. The Planner is dedicated to devising a final set of optimal agents along with a comprehensive plan tailored to accomplish the user’s objective. The Executor employs these agents and the formulated plans to produce the desired outcomes, including executing code, conducting internet searches, and facilitating discussions among various agents. Lastly, the Summarizer interprets the entirety of the dialogue and, in response to the user’s question, delivers a precise answer.</p>
        <fig id="fig1">
          <label>Figure 1</label>
          <graphic xlink:href="https://html.scirp.org/file/9303450-rId15.jpeg?20260115091008" />
        </fig>
        <p><bold>Figure 1</bold><bold>.</bold> High-level overview showing all the components of the AMASS architecture.</p>
      </sec>
      <sec id="sec3dot2">
        <title>3.2. Planner</title>
        <p>The planner <xref ref-type="fig" rid="fig2">Figure 2</xref> functions as the central coordinating entity within the system. Upon receiving the user’s inquiry and the associated contextual data (including text, images, and video), the planner initially generates a set of agents with BrainStorming. These agents are subsequently introduced to the Planner Agent (Pa). The planning agent devises a comprehensive plan detailing each agent’s responsibilities and methodologies for executing those tasks. The plan, along with the agents, is then submitted to the critic agent for evaluation. The critic agent assesses the agents for redundancy and potential minimization. Autogen [<xref ref-type="bibr" rid="B11">11</xref>] currently lacks a mechanism for eliminating these redundant agents, resulting in the creation of superfluous agents where tasks may be accomplished with fewer agents. Furthermore, the critic agent evaluates the suitability of models for each specific agent. For instance, in accordance with the user’s optimization strategy, which may favor smaller models such as GPT-4o-mini for simple tasks and GPT-4o for more complex tasks, the critic agent offers feedback to the planner agent. This feedback enables the planner agent to modify the backend of the agents as necessary. This approach fosters the integration of smaller and more specialized models tailored to distinct tasks, thereby enhancing decision accuracy and potentially lowering costs while increasing the efficiency of each agent. This novel strategy of utilizing different agents is not addressed in the existing literature referenced previously and constitutes an original contribution of our research on autonomous agents. Following iterative exchanges between the Planner Agent and the critic agent, a final plan comprising the optimal set of agents is developed and advanced to the execution stage. The complete algorithm is described as 1. </p>
        <p>3.2.1. Agents Generation with Brainstorming Agent</p>
        <p>When the user submits a question, the Initial Brainstorming agent generates many different sets of specialized agents with domain-adaptive prompts. Initially, this creates numerous redundant agents. The Brainstorming agent produces as many potentially relevant specialized agents as possible, similar to how humans brainstorm before starting a plan by considering all the things they might require. However, as the number of agents increases, both the cost and the context length grow exponentially. A larger number of agents also introduces noise into the discussion with irrelevant details. For example, if we want to design an agent for planning a trip from London to New York, an agent specialized in London might not be relevant, since it could generate unnecessary suggestions related to staying in London. </p>
        <p>3.2.2. From Brainstorming to Final Agent Composition</p>
        <p>To address redundant agents, we introduce a Planner agent that leverages these agents to create a coherent plan. Alongside it, a Critic agent evaluates the quality of the Planner’s plan and determines whether some agents can be removed without reducing effectiveness. The Critic agent also provides suggestions. Through a back-and-forth process between the Planner and the Critic, a final plan is developed. This iterative planning continues until the Critic agent at the planning stage is satisfied. The final set of agents may differ significantly from the initial set, with agents sometimes inheriting features from a combination of others. By “features”, we mean the system prompt, which can be adjusted to incorporate multiple specialties.</p>
        <p>3.2.3. Critic Agents Criteria for Pruning</p>
        <p>The Critic Agent employs a multi-criteria evaluation framework to determine which agents should be pruned from the dynamically generated multi-agent system. Through a structured group chat interaction with a Planning Agent (limited to 3 rounds using round-robin speaker selection), the Critic Agent evaluates each proposed agent against several key criteria: (1) <bold>necessity and redundancy</bold>, assessing whether tasks could be accomplished with fewer agents and identifying agents that serve primarily aesthetic or descriptive purposes without concrete functional requirements; (2) <bold>role clarity</bold>, ensuring each agent has a well-defined system message and description with clear justification for its inclusion and specific task responsibilities; (3) <bold>factual verification requirements</bold>, determining whether tasks involving precise facts necessitate the inclusion of a specialized search agent for information verification; and (4) <bold>cost</bold><bold>-</bold><bold>effectiveness</bold>, optimizing model selection based on task complexity (e.g., assigning computationally expensive models like openai/o3-mini or google/gemini-2.0-flash-lite-001 only for complex reasoning tasks in physics, chemistry, or mathematics, while using lighter models like gpt-4o-mini for text-based factual tasks). The pruning decisions emerge from this collaborative deliberation, culminating in a refined agent configuration encoded in JSON format that eliminates superfluous agents while preserving those with demonstrable functional contributions to the task-solving pipeline.</p>
        <fig id="fig2">
          <label>Figure 2</label>
          <graphic xlink:href="https://html.scirp.org/file/9303450-rId16.jpeg?20260115091013" />
        </fig>
        <p><bold>Figure 2</bold><bold>.</bold> Showing Planning Stage. Planning stage consisting of three main agents: the Brainstorming Agent, the Planner Agent, and the Critic Agent.</p>
      </sec>
      <sec id="sec3dot3">
        <title>3.3. Execution Stage</title>
        <p>The execution phase, <xref ref-type="fig" rid="fig3">Figure 3</xref>, integrates all planning elements and agents transitioned from the planning stage, delivering them to the Manager Agent. The Manager Agent possesses comprehensive authority over which agent is invoked and the order of their invocation. Agents are called in accordance with a predetermined plan, and each agent executes an action based on its designated role.</p>
        <fig id="fig3">
          <label>Figure 3</label>
          <graphic xlink:href="https://html.scirp.org/file/9303450-rId17.jpeg?20260115091014" />
        </fig>
        <p>The Manager Agent also processes requests from agents; should agents request the search_engine agent or the executor_agent, the Manager Agent will summon them and instruct them to perform actions as per the agents’ requests. Additionally, the Manager Agent can invoke the critic agent, which is tasked with assessing the execution relative to the user’s specified task. In cases where discrepancies or contradictions with the search agent arise, the critic agent can provide suitable feedback. If it determines that the search outcome lacks relevance, it can prompt the Manager Agent to initiate a revised search, potentially altering the query for the search agent. For instance, when seeking the top 10 gynecologists in New York along with their contact details, the search_agent, informed by feedback from the executor agent, can engage in a cascaded search operation as depicted in the accompanying flow diagram. The search query can be dynamically adjusted based on previously obtained results.</p>
        <fig id="fig4">
          <label>Figure 4</label>
          <graphic xlink:href="https://html.scirp.org/file/9303450-rId18.jpeg?20260115091014" />
        </fig>
        <p><bold>Figure 3</bold><bold>.</bold> Showing Execution Stage, which is responsible for agents’ interaction to achieve the user’s goal.</p>
        <p>The executor stage is responsible for executing code, thereby allowing real-time testing to verify the absence of bugs and confirming that the code performs as intended by the user. This execution capability permits the agent to employ a variety of tools at runtime to refine the user’s inquiry. Moreover, the feedback mechanism, in conjunction with the manager, ensures that the discourse remains focused and that agents do not divert into secondary discussions. The comprehensive flowchart of the execution stage is presented below.</p>
      </sec>
      <sec id="sec3dot4">
        <title>3.4. Search Agent</title>
        <p>The search agent is composed of a basic search engine and a web scraper. The search engine identifies and supplies the most pertinent links, while the scraper concurrently extracts the content from these links. The extracted data is subsequently processed by a compact language model for summarization. The outcome of this summarization comprises the final output of the search agent. Consequently, by integrating a search engine with a web scraper, the system acquires the capability to retrieve information from the web. Search agent searches based on query and the review agent reviews whether all the information that user had required has been obtained through searching. If there is some more refinement needed it can suggest an alternative query for the search agent to try out. The complete cascaded algorithm is described in 2.</p>
        <fig id="fig5">
          <label>Figure 5</label>
          <graphic xlink:href="https://html.scirp.org/file/9303450-rId19.jpeg?20260115091015" />
        </fig>
      </sec>
    </sec>
    <sec id="sec4">
      <title>4. Evaluation</title>
      <p>We used various models from the Open Router platform via their APIs. For AMASS, our base models for the Brainstorming, Planning, and Critic agents were GPT-4o. For specialized agents, the planner can choose from a range of models, including Gemini-2.0, O3-mini, GPT-4o-mini, and GPT-4o. The selection criteria for these agents are adjustable to suit different industry requirements. For example, in cases where cost-saving and better accuracy are prioritized, smaller models may be preferred for simpler tasks. In more complex domains, such as medical analysis, specialized agents may be used, such as one focused on radiology and another on cancer treatment. The selection criteria are flexible to accommodate new models with advanced capabilities as they become available. The planner’s role is to specify the selection strategy in the prompts, and AMASS handles the rest of the work. The number of reasoning turns in the Planning stage is limited to 3, as we observed that most of the time, the planner and critic reach a conclusion within three turns. For the Execution stage, the reasoning turns are capped at 12, although this parameter can be adjusted depending on task complexity. If the agents reach a conclusion before their maximum turns and the critic is satisfied with the results, they output the word TERMINATE (enclosed in three backticks), signaling the AMASS framework to stop the reasoning loop. This applies to both the Planning and Execution stages. We used default hyperparameters and seeds from the providers, as we wanted to maintain consistency in results across users of these LLMs. This ensured that the outcomes were largely similar, with a standard deviation of accuracy within 2% - 3%.</p>
      <sec id="sec4dot1">
        <title>4.1. Assessment of Advanced-Level Queries in the GPQA Dataset</title>
        <p>The GPQA (Graduate-Level Google-Proof Q&amp;A) dataset comprises 448 rigorously challenging multiple-choice questions devised by subject matter experts in the disciplines of biology, physics, and chemistry. Constructed to present exceptional difficulty, even individuals who are experts or are in the process of obtaining their PhDs in these specific fields achieve a mere 65% accuracy on these questions (this figure rises to 74% when obvious errors that were later recognized are discounted). Remarkably, individuals who are highly skilled but not experts, even with unrestricted internet access and dedicating over 30 minutes per question, achieve only 34% accuracy, highlighting the “Google-proof” characteristic of the dataset.</p>
        <p>Our autonomous approach employing a mixture of agents demonstrates superior accuracy compared to the leading models currently available in the market as shown in tab:gpqa-main. The framework we propose exhibits improved results over all existing solutions. The efficacy of our solution significantly exceeds that of Agentic Reasoning, which has recently gained attention due to its innovative method of integrating reasoning models with search and coding agents. By utilizing a mixture of agents, our method achieves a notable enhancement in performance across all subject areas. Specifically, in the field of chemistry, our approach provides an approximate 40% improvement in performance over the Agentic Reasoning approach. Moreover, our method substantially reduces the occurrence of hallucinations. The integration of the MOA approach and the critic agent results in hallucinations being virtually non-existent. The principal reason this method surpasses others is attributed to the synergy of the critic agent and the mixture of agents approach. In our experiments, the Gemini 2.0 Flash performed exceptionally well on biology and chemistry questions, while O3 Mini exhibited superior performance in physics. The combination of these two diverse base models along with the critic agent constitutes an optimal strategy to address the limitations inherent in individual Large Language Model (LLM) base agents (<bold>Table</bold><bold>2</bold>).</p>
        <p><bold>Table 2</bold><bold>.</bold> Performance comparison on GPQA dataset across Physics, Chemistry, and Biology.</p>
        <table-wrap id="tbl3">
          <label>Table 3</label>
          <table>
            <tbody>
              <tr>
                <td>
                  <bold>Method</bold>
                </td>
                <td>
                  <bold>Phy</bold>
                  <bold>.</bold>
                </td>
                <td>
                  <bold>Chem.</bold>
                </td>
                <td>
                  <bold>Bio.</bold>
                </td>
              </tr>
              <tr>
                <td colspan="4">Direct Reasoning</td>
              </tr>
              <tr>
                <td>Qwen2.5-32B</td>
                <td>57.0</td>
                <td>33.3</td>
                <td>52.6</td>
              </tr>
              <tr>
                <td>Qwen2.5-Coder-32B</td>
                <td>57.0</td>
                <td>33.3</td>
                <td>52.6</td>
              </tr>
              <tr>
                <td>QwQ-32B</td>
                <td>75.6</td>
                <td>29.8</td>
                <td>66.2</td>
              </tr>
              <tr>
                <td>Qwen2.5-72B</td>
                <td>54.7</td>
                <td>31.7</td>
                <td>51.8</td>
              </tr>
              <tr>
                <td>Llama3-30B</td>
                <td>59.1</td>
                <td>40.1</td>
                <td>55.4</td>
              </tr>
              <tr>
                <td>GPT-4o</td>
                <td>59.5</td>
                <td>40.2</td>
                <td>61.9</td>
              </tr>
              <tr>
                <td>o1-preview</td>
                <td>59.9</td>
                <td>59.9</td>
                <td>65.9</td>
              </tr>
              <tr>
                <td>o3-mini</td>
                <td>79.5</td>
                <td>65.9</td>
                <td>81.6</td>
              </tr>
              <tr>
                <td>gemini-2.0</td>
                <td>76.7</td>
                <td>75.8</td>
                <td>79.1</td>
              </tr>
              <tr>
                <td colspan="4">Retrieve/Search in Reasoning</td>
              </tr>
              <tr>
                <td>RAG-Qwen2.5-32B</td>
                <td>76.7</td>
                <td>37.8</td>
                <td>58.6</td>
              </tr>
              <tr>
                <td>RAgent-Qwen2.5-32B</td>
                <td>77.0</td>
                <td>38.4</td>
                <td>59.2</td>
              </tr>
              <tr>
                <td>RAgent-QwQ-32B</td>
                <td>77.7</td>
                <td>39.9</td>
                <td>61.3</td>
              </tr>
              <tr>
                <td>Search-o1</td>
                <td>77.9</td>
                <td>47.3</td>
                <td>62.8</td>
              </tr>
              <tr>
                <td>O3-mini</td>
                <td>84.9</td>
                <td>75.3</td>
                <td>82.6</td>
              </tr>
              <tr>
                <td>gemini-2.0</td>
                <td>76.7</td>
                <td>78.2</td>
                <td>81.9</td>
              </tr>
              <tr>
                <td>GPT-4o</td>
                <td>65.1</td>
                <td>51.1</td>
                <td>71.9</td>
              </tr>
              <tr>
                <td>Agentic Reasoning</td>
                <td>88.1</td>
                <td>58.3</td>
                <td>79.6</td>
              </tr>
              <tr>
                <td colspan="4">AMASS</td>
              </tr>
              <tr>
                <td>Ours</td>
                <td>90.9</td>
                <td>73.2</td>
                <td>82.3</td>
              </tr>
            </tbody>
          </table>
        </table-wrap>
      </sec>
      <sec id="sec4dot2">
        <title>4.2. Hard QA Benchmarks for Multi-Step and Logical Reasoning Tasks</title>
        <p>To assess the logical reasoning and multi-hop capabilities of language models, we examine two benchmark datasets: <bold>Bamboogle</bold> and <bold>MuSiQue</bold>. These datasets are constructed to extend challenges for models beyond mere factual recall, emphasizing compositional reasoning, multi-step inference, and robustness against superficial pattern matching. Bamboogle comprises meticulously crafted questions that pose significant difficulty for conventional retrieval-based systems, whereas MuSiQue offers an extensive collection of multi-hop questions derived from structured combinations of single-hop facts. Both benchmarks provide critical insights into a model’s proficiency in managing complex reasoning tasks.</p>
        <p>4.2.1. Bamboogle</p>
        <p>The Bamboogle dataset constitutes a formidable benchmark specifically engineered to assess the compositional reasoning abilities of large language models. In contrast to conventional QA datasets, Bamboogle comprises 125 meticulously curated multi-hop questions that are intentionally crafted to be <italic>unanswerable by</italic><italic>standard search engines like Google</italic>. Its design renders it exceptionally appropriate for determining whether language models truly comprehend and integrate information, as opposed to depending on superficial patterns or rote memorization.</p>
        <p>4.2.2. Musique</p>
        <p>MuSiQue (Multi-hop Structured Questions) is an extensive dataset engineered to assess multi-hop question answering. It systematically generates intricate multi-hop questions by integrating simpler, single-hop questions into coherent and structured inquiries necessitating reasoning over two to four distinct facts.</p>
        <p>The dataset is built from crowdsourced QA pairs and includes two variants:</p>
        <p><bold>MuSiQue</bold><bold>-Full</bold>: Contains both answerable and unanswerable questions, enabling robust evaluation. <bold>MuSiQue</bold><bold>-Ans</bold>: Focuses solely on answerable questions for models that do not handle contrastive settings. </p>
        <p>MuSiQue guarantees that each step within the question is requisite for deriving the answer, thereby enhancing detailed multi-step reasoning. Its primary objective is to address and rectify biases and shortcuts that are prevalent in preceding QA benchmarks.</p>
        <p>4.2.3. Results</p>
        <p>We evaluated our framework, AMASS, on the Musique-Full dataset using multiple models: GPT-4o, GPT-4o Mini, Claude Haiku, and combinations thereof. The evaluation focused on multi-hop question answering, with performance measured across both Bamboogle and Musique datasets.</p>
        <p>As shown in <bold>Table 3</bold>, GPT-4o demonstrated strong performance; however, our framework (AMASS) significantly outperformed it in both datasets. Notably, AMASS using only GPT-4o Mini outperformed the full GPT-4o model, and the hybrid approach (GPT-4o Mini + Claude Haiku) further improved accuracy.</p>
        <p><bold>Table 3</bold><bold>.</bold> Model accuracy comparison across datasets.</p>
        <table-wrap id="tbl4">
          <label>Table 4</label>
          <table>
            <tbody>
              <tr>
                <td>Model</td>
                <td>Bamboogle Accuracy</td>
                <td>Musique Accuracy</td>
              </tr>
              <tr>
                <td>GPT-4o Mini</td>
                <td>65.5%</td>
                <td>52.39%</td>
              </tr>
              <tr>
                <td>GPT-4o</td>
                <td>80.3%</td>
                <td>77.86%</td>
              </tr>
              <tr>
                <td>Claude Haiku</td>
                <td>55.45%</td>
                <td>39.67%</td>
              </tr>
              <tr>
                <td>AMASS (GPT-4o Mini ONLY)</td>
                <td>93.4%</td>
                <td>81.50%</td>
              </tr>
              <tr>
                <td>AMASS (GPT-4o Mini + Claude Haiku)</td>
                <td>95.4%</td>
                <td>86.78%</td>
              </tr>
            </tbody>
          </table>
        </table-wrap>
        <p>In order to comprehensively assess the model’s capacity to address multi-hop reasoning, an analysis of accuracy across various hop types (e.g., 2-hop, 3-hop, 4-hop1, 4-hop2, and 4-hop3) was conducted. <xref ref-type="fig" rid="fig4">Figure 4</xref> provides a visual representation of this comparison. It is apparent that AMASS consistently maintains high accuracy across all hop types, even in more complex reasoning chains such as 4-hop2 and 4-hop3, where the performance of other models experiences a significant decline.</p>
        <p>The findings indicate that smaller models individually exhibit limited reasoning abilities in addressing multi-hop questions, with performance significantly declining as the number of hops increases. This suggests that their reasoning capability is largely confined to simpler queries. However, when smaller models such as Claude Haiku and GPT-4o-mini are integrated within a dialogic context, their combined performance surpasses their standalone capabilities. Specifically, in scenarios involving 4-hop-3 questions, the individual performance of GPT-4o-mini and Claude Haiku falls below 20%; nevertheless, when amalgamated with a reflexion agent utilizing the AMASS framework, their performance surges to nearly 100%, which is notably commendable given the complexity of these tasks. Remarkably, they outperform larger versions of these models. Thus, the integration of reflection and mutual dialogue substantially enhances the effectiveness of smaller models.</p>
        <p>This analysis elucidates the efficacy of AMASS in achieving both high dataset-level accuracy and proficient performance in fine-grained reasoning tasks across diverse levels of hop complexity. The integration of numerous smaller models synergistically enhances reasoning capabilities, circumventing the necessity for reliance on more cumbersome monolithic models.</p>
      </sec>
      <sec id="sec4dot3">
        <title>4.3. Evaluation on Trivia Question Dataset</title>
        <p>In order to assess model performance across diverse domains, we conducted a benchmark analysis of multiple models utilizing a comprehensive Trivia Question Answer Dataset, encompassing genres such as History, Entertainment, Science, and Language. A trivia question-answer dataset is a systematically organized collection of trivia questions paired with their correct answers, frequently employed in natural language processing tasks such as question answering and reading comprehension. Noteworthy examples include TriviaQA and OpenTriviaQA. OpenTriviaQA is a community-driven dataset licensed under the Creative Commons Attribution-ShareAlike 4.0, comprising multiple-choice trivia questions organized into a variety of categories such as animals, history, and science. This dataset is constructed to be human-editable and easily parsable, thereby facilitating contributions and adaptations. Both datasets are essential resources for researchers and developers engaged in question-answering systems, enabling the training and evaluation of models in the comprehension and generation of accurate responses to trivia questions. Employing OpenTriviaQA questions here.</p>
        <p>As shown in <xref ref-type="fig" rid="fig4">Figure 4</xref> and <xref ref-type="fig" rid="fig5">Figure 5</xref>, AMASS models, particularly the configuration combining GPT-4o Mini with Claude Haiku, consistently outperform individual models across all genres, demonstrating enhanced multi-hop reasoning and factual accuracy. Notably, AMASS achieves 100% accuracy in Science and Language categories, indicating its strong capability in handling both technical and linguistic queries. Standalone models such as GPT-4o exhibit lower and more variable performance in the Language genre whereas the ensemble-style architectures like AMASS show better performance in open-domain QA tasks.</p>
        <fig id="fig6">
          <label>Figure 6</label>
          <graphic xlink:href="https://html.scirp.org/file/9303450-rId20.jpeg?20260115091024" />
        </fig>
        <p><bold>Figure 4</bold><bold>.</bold> Accuracy comparison across different hop types. AMASS demonstrates robust multi-hop reasoning, outperforming individual models significantly.</p>
        <fig id="fig7">
          <label>Figure 7</label>
          <graphic xlink:href="https://html.scirp.org/file/9303450-rId21.jpeg?20260115091024" />
        </fig>
        <p><bold>Figure 5.</bold> Accuracy comparison across different Subjects. AMASS demonstrates superior comparison compared to other models.</p>
      </sec>
    </sec>
    <sec id="sec5">
      <title>5. Ablation Studies</title>
      <sec id="sec5dot1">
        <title>5.1. Effect of Removing Critic Agent</title>
        <p>We tried to gauge the impact of different components of AMASS. </p>
        <p>Our study aimed to evaluate the impact of the execution critic agent and the Mixture of Agents, with a particular focus on their effectiveness. We conducted our experiments using Community trivia questions, and observed a marginal decline in accuracy across all genres upon the removal of the critic agent as shown in <xref ref-type="fig" rid="fig6">Figure 6</xref>. Therefore, the critic agent is instrumental in enhancing the model’s performance.</p>
        <fig id="fig8">
          <label>Figure 8</label>
          <graphic xlink:href="https://html.scirp.org/file/9303450-rId22.jpeg?20260115091027" />
        </fig>
        <p><bold>Figure 6.</bold> Accuracy comparison between AMASS and AMASS without critic agent. Accuracy decline is seen across all genres except Language.</p>
      </sec>
      <sec id="sec5dot2">
        <title>5.2. Effect of Using a Single Agent with the Same Base Model (Without Mixture of Agents)</title>
        <p>The utilization of AMASS without integrating a mixture of agents results in a modest decline in performance within the History and Entertainment genres, while a substantial decline is observed in the Science and Language genres as shown in <xref ref-type="fig" rid="fig7">Figure 7</xref>. This diminution in accuracy for Science and Language may be attributed to the increased complexity inherent in these genres compared to History and Entertainment, suggesting that mere memorization may be inadequate for accurately responding to questions in these areas. Thus, this proves that a mixture of agents produces the best results and makes the most contribution in our AMASS framework.</p>
        <fig id="fig9">
          <label>Figure 9</label>
          <graphic xlink:href="https://html.scirp.org/file/9303450-rId23.jpeg?20260115091028" />
        </fig>
        <p><bold>Figure 7</bold><bold>.</bold> Accuracy comparison between AMASS and AMASS without Mixture of Agents Approach. Accuracy decline is seen across all genres.</p>
      </sec>
    </sec>
    <sec id="sec6">
      <title>6. Case Studies</title>
      <sec id="sec6dot1">
        <title>6.1. PHD Level Physics Question from GPQA Dataset</title>
        <p>6.1.1. User Question </p>
        <p>Which of the following stars or stellar systems will appear the brightest in <italic>V</italic> magnitude when observed from Earth? Assume there is no extinction.</p>
        <p>A star with an apparent <italic>V</italic> magnitude of 7 mag at a distance of 50 parsecs. A star with an apparent <italic>V</italic> magnitude of 7 mag at a distance of 20 parsecs. A two-star system with individual apparent magnitudes of <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> V </mml:mi><mml:mrow><mml:mi> m </mml:mi><mml:mi> a </mml:mi><mml:mi> g </mml:mi><mml:mo> , </mml:mo><mml:mn> 1 </mml:mn></mml:mrow></mml:msub><mml:mo> = </mml:mo><mml:mn> 7 </mml:mn></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> V </mml:mi><mml:mrow><mml:mi> m </mml:mi><mml:mi> a </mml:mi><mml:mi> g </mml:mi><mml:mo> , </mml:mo><mml:mn> 2 </mml:mn></mml:mrow></mml:msub><mml:mo> = </mml:mo><mml:mn> 8 </mml:mn></mml:mrow></mml:math></inline-formula> mag, both at distances of 5 parsecs. A star with an absolute magnitude of <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> V </mml:mi><mml:mrow><mml:mi> m </mml:mi><mml:mi> a </mml:mi><mml:mi> g </mml:mi></mml:mrow></mml:msub><mml:mo> = </mml:mo><mml:mn> 7 </mml:mn></mml:mrow></mml:math></inline-formula> mag at a distance of 10 parsecs. A two-star system with individual absolute magnitudes of <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> V </mml:mi><mml:mrow><mml:mi> m </mml:mi><mml:mi> a </mml:mi><mml:mi> g </mml:mi><mml:mo> , </mml:mo><mml:mn> 1 </mml:mn></mml:mrow></mml:msub><mml:mo> = </mml:mo><mml:mn> 7 </mml:mn></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> V </mml:mi><mml:mrow><mml:mi> m </mml:mi><mml:mi> a </mml:mi><mml:mi> g </mml:mi><mml:mo> , </mml:mo><mml:mn> 2 </mml:mn></mml:mrow></mml:msub><mml:mo> = </mml:mo><mml:mn> 8 </mml:mn></mml:mrow></mml:math></inline-formula> mag, both at distances of 10 parsecs. A two-star system with individual absolute magnitudes of <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> V </mml:mi><mml:mrow><mml:mi> m </mml:mi><mml:mi> a </mml:mi><mml:mi> g </mml:mi><mml:mo> , </mml:mo><mml:mn> 1 </mml:mn></mml:mrow></mml:msub><mml:mo> = </mml:mo><mml:mn> 7 </mml:mn></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> V </mml:mi><mml:mrow><mml:mi> m </mml:mi><mml:mi> a </mml:mi><mml:mi> g </mml:mi><mml:mo> , </mml:mo><mml:mn> 2 </mml:mn></mml:mrow></mml:msub><mml:mo> = </mml:mo><mml:mn> 7 </mml:mn></mml:mrow></mml:math></inline-formula> mag, both at distances of 10 parsecs. </p>
        <p><bold>Answer Choices:</bold></p>
        <p>A two-star system with individual apparent magnitudes of <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> V </mml:mi><mml:mrow><mml:mi> m </mml:mi><mml:mi> a </mml:mi><mml:mi> g </mml:mi><mml:mo> , </mml:mo><mml:mn> 1 </mml:mn></mml:mrow></mml:msub><mml:mo> = </mml:mo><mml:mn> 7 </mml:mn></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> V </mml:mi><mml:mrow><mml:mi> m </mml:mi><mml:mi> a </mml:mi><mml:mi> g </mml:mi><mml:mo> , </mml:mo><mml:mn> 2 </mml:mn></mml:mrow></mml:msub><mml:mo> = </mml:mo><mml:mn> 8 </mml:mn></mml:mrow></mml:math></inline-formula> mag, both at distances of 5 parsecs. A star with an absolute magnitude of <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> V </mml:mi><mml:mrow><mml:mi> m </mml:mi><mml:mi> a </mml:mi><mml:mi> g </mml:mi></mml:mrow></mml:msub><mml:mo> = </mml:mo><mml:mn> 7 </mml:mn></mml:mrow></mml:math></inline-formula> mag at a distance of 10 parsecs. A star with an apparent <italic>V</italic> magnitude of 7 mag at a distance of 20 parsecs. A two-star system with individual absolute magnitudes of <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> V </mml:mi><mml:mrow><mml:mi> m </mml:mi><mml:mi> a </mml:mi><mml:mi> g </mml:mi><mml:mo> , </mml:mo><mml:mn> 1 </mml:mn></mml:mrow></mml:msub><mml:mo> = </mml:mo><mml:mn> 7 </mml:mn></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> V </mml:mi><mml:mrow><mml:mi> m </mml:mi><mml:mi> a </mml:mi><mml:mi> g </mml:mi><mml:mo> , </mml:mo><mml:mn> 2 </mml:mn></mml:mrow></mml:msub><mml:mo> = </mml:mo><mml:mn> 7 </mml:mn></mml:mrow></mml:math></inline-formula> mag, both at distances of 10 parsecs. </p>
        <p>6.1.2. Generating Agents</p>
        <p>Agent Generation and System Message Preparation</p>
        <p>==&gt; Generating agents...</p>
        <p>Generated agents: [‘Astrophysics_Expert’, ‘Astronomy_Expert’]</p>
        <p>==&gt; Generating system message...</p>
        <p>Preparing system message for Astrophysics_Expert Completed system message for Astrophysics_Expert Preparing system message for Astronomy_Expert Completed system message for Astronomy_Expert </p>
        <p>==&gt; Generating description...</p>
        <p>Preparing description for Astrophysics_Expert Completed description for Astrophysics_Expert Preparing description for Astronomy_Expert Completed description for Astronomy_Expert </p>
        <p>6.1.3. Final Stage → Summary Agent</p>
        <p><bold>Critic Agent Planner</bold></p>
        <p>Next speaker: <bold>Critic_agent</bold></p>
        <p>Critic_agent (to chat_manager).</p>
        <p>To solve this problem optimally, let’s analyze the task and the agents available:</p>
        <p><bold>Task Overview</bold></p>
        <p>The task involves comparing the apparent brightness in V magnitude of various stars or stellar systems as observed from Earth. This requires understanding of both apparent and absolute magnitudes, handling multi-star systems, and calculating brightness based on distances. It’s a complex problem involving astrophysical concepts. </p>
        <p><bold>Agent Analysis</bold></p>
        <p>1) <bold>Astrophysics_Expert</bold>: </p>
        <p>—<bold>System Prompt</bold>: Specialized in evaluating and comparing stellar magnitudes and brightness measurements. Requires deep understanding of relationships between apparent and absolute magnitudes and their dependence on distance. </p>
        <p>—<bold>Description</bold>: Authority in astrophysics specializing in stellar astronomy and brightness measurement. </p>
        <p>2) <bold>Astronomy_Expert</bold>: </p>
        <p>—<bold>System Prompt</bold>: Adept at evaluating stellar brightness using observational astronomy, astrophysics, and photometric calculations. Suitable for systematic analysis and interpretation. </p>
        <p>—<bold>Description</bold>: Skilled in evaluating and interpreting stellar brightness from Earth. </p>
        <p>3) <bold>search_agent</bold>: </p>
        <p>—Primarily for fetching up-to-date information; not required as the task involves theoretical calculations based on provided data. </p>
        <p><bold>Optimal Plan</bold></p>
        <p><bold>Agent Selection</bold>: </p>
        <p>—Select <bold>Astrophysics_Expert</bold> and <bold>Astronomy_Expert</bold> for combined expertise in handling complex magnitude and brightness calculations. </p>
        <p>—No requirement for <bold>search_agent</bold> as the task is theoretical. </p>
        <p><bold>Model Selection</bold>: </p>
        <p>—<bold>Astrophysics_Expert</bold>: Use “google/gemini-2.0-flash-lite-001” for complex reasoning involving astrophysics. </p>
        <p>—<bold>Astronomy_Expert</bold>: Use “openai/o3-mini” for a varied approach to complex reasoning. </p>
        <p><bold>Suggestions</bold></p>
        <p>1) <bold>Astrophysics_Expert</bold>: </p>
        <p>—<bold>Model</bold>: google/gemini-2.0-flash -lite-001. </p>
        <p>—<bold>Role</bold>: Focus on detailed calculations involving magnitudes, distances, and provide framework for combining magnitudes in multi-star systems. </p>
        <p>—<bold>System Prompt</bold>: Existing prompt covering celestial brightness and astrophysical computations. </p>
        <p>2) <bold>Astronomy_Expert</bold>: </p>
        <p>—<bold>Model</bold>: openai/o3-mini. </p>
        <p>—<bold>Role</bold>: Assist in calculating and verifying results for accuracy, methodically interpreting comparisons to ensure correctness. </p>
        <p>—<bold>System Prompt</bold>: Existing prompt for calculating apparent magnitudes and interpreting results. </p>
        <p>By utilizing these two agents, we ensure a comprehensive analysis and optimal solution for comparing apparent magnitudes of given stellar scenarios while optimizing model usage for cost and efficiency.</p>
        <p>6.1.4. Final Agents after Incorporating Critic Agent Suggestion</p>
        <p><bold>Agent Planning V2</bold></p>
        <p>Next speaker: planning_agent_v2</p>
        <p>planning_agent_v2 (to chat_manager):</p>
        <p>[</p>
        <p>{</p>
        <p>“name”: “Astrophysics_Expert”, </p>
        <p>“model”: “google/gemini-2.0-flash-lite-001”, </p>
        <p>“tags”: [], </p>
        <p>“system_message”: “## Your role_Expert is a well-versed authority in the field of astrophysics, with specialized skills in stellar astronomy and brightness measurement. With extensive knowledge of celestial magnitudes, distances, and the properties of stars and stellar systems, Astrophysics_Expert excels in evaluating and comparing the apparent brightness of celestial objects as viewed from Earth. \n\n## Task and skill instructions\n- The task involves determining which of several stars or stellar systems will display the greatest brightness in V magnitude when observed from Earth, assuming no extinction effects.\n- Astrophysics_Expert uses expertise in understanding the relationship between apparent and absolute magnitudes and the impact of distance on a celestial object’s observed brightness. This includes calculating the combined magnitude of multi-star systems and applying the inverse square law of brightness.\n- (Optional) Before deriving conclusions, Astrophysics_Expert should thoroughly evaluate each scenario, considering both apparent and absolute magnitudes, and the distances involved to ensure an accurate comparison of brightness levels. The solution involves clear interpretation of data and methodical verification of calculations.”, </p>
        <p>“description”: “Astrophysics_Expert is an authority in astrophysics specializing in stellar astronomy and brightness measurement, skilled at evaluating the apparent brightness of stars and stellar systems from Earth by considering apparent and absolute magnitudes and distances.”</p>
        <p>}, </p>
        <p>{</p>
        <p>“name”: “Astronomy_Expert”, </p>
        <p>“model”: “openai/o3-mini”, </p>
        <p>“tags”: [], </p>
        <p>“system_message”: “## Your role_Expert is a seasoned professional specializing in the analysis and interpretation of stellar magnitudes and distances. With a strong background in observational astronomy and astrophysics, Astronomy_Expert is adept at evaluating the brightness of stars and stellar systems as observed from Earth.\n\n## Task and skill instructions\n- The task involves determining which of the stars or stellar systems listed will appear brightest in V magnitude when observed from Earth, assuming there is no extinction. This requires understanding and calculating the apparent magnitudes when multiple factors such as distance, apparent magnitudes of individual stars, and absolute magnitudes are provided.\n- Astronomy_Expert leverages expertise in calculating apparent magnitudes and understanding their dependence on distance. The skill set includes knowledge of the formula relating apparent and absolute magnitude, application of photometric principles, and comparison of combined magnitudes for multiple-star systems.\n- This expert utilizes systematic analysis to ensure that all potential factors are considered, confirming the calculation of combined magnitudes for two-star systems when necessary, and accurately interpreting results to determine the source listed in the task that will appear the brightest to an observer on Earth.”, </p>
        <p>“description”: “Astronomy_Expert is skilled in evaluating and interpreting stellar brightness and distances to determine which stars or stellar systems appear brightest from Earth, using expertise in observational astronomy, astrophysics, and photometric calculations.”</p>
        <p>}</p>
        <p>]</p>
        <p>6.1.5. Execution Stage Started</p>
        <p>Astronomy Expert Calculation Verification</p>
        <p>Next speaker: Astronomy_Expert</p>
        <p>Astronomy_Expert (to chat_manager):</p>
        <p>I’ll start by verifying the photometric calculations using the known formula for combining stellar fluxes. The apparent magnitude for a star is given, and for two stars with magnitudes <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> m </mml:mi><mml:mn> 1 </mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> m </mml:mi><mml:mn> 2 </mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> , their combined magnitude <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> m </mml:mi><mml:mrow><mml:mi> c </mml:mi><mml:mi> o </mml:mi><mml:mi> m </mml:mi><mml:mi> b </mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> is</p>
        <disp-formula id="FD1">
          <mml:math>
            <mml:mrow>
              <mml:msub>
                <mml:mi>m</mml:mi>
                <mml:mrow>
                  <mml:mi>c</mml:mi>
                  <mml:mi>o</mml:mi>
                  <mml:mi>m</mml:mi>
                  <mml:mi>b</mml:mi>
                </mml:mrow>
              </mml:msub>
              <mml:mo>=</mml:mo>
              <mml:mo>−</mml:mo>
              <mml:mn>2.5</mml:mn>
              <mml:msub>
                <mml:mrow>
                  <mml:mi>log</mml:mi>
                </mml:mrow>
                <mml:mrow>
                  <mml:mn>10</mml:mn>
                </mml:mrow>
              </mml:msub>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mrow>
                  <mml:msup>
                    <mml:mrow>
                      <mml:mn>10</mml:mn>
                    </mml:mrow>
                    <mml:mrow>
                      <mml:mo>−</mml:mo>
                      <mml:mn>0.4</mml:mn>
                      <mml:msub>
                        <mml:mi>m</mml:mi>
                        <mml:mn>1</mml:mn>
                      </mml:msub>
                    </mml:mrow>
                  </mml:msup>
                  <mml:mo>+</mml:mo>
                  <mml:msup>
                    <mml:mrow>
                      <mml:mn>10</mml:mn>
                    </mml:mrow>
                    <mml:mrow>
                      <mml:mo>−</mml:mo>
                      <mml:mn>0.4</mml:mn>
                      <mml:msub>
                        <mml:mi>m</mml:mi>
                        <mml:mn>2</mml:mn>
                      </mml:msub>
                    </mml:mrow>
                  </mml:msup>
                </mml:mrow>
                <mml:mo>)</mml:mo>
              </mml:mrow>
              <mml:mo>.</mml:mo>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p>Let me outline how I approach each option:</p>
        <p><bold>Option (a):</bold> Apparent <inline-formula><mml:math><mml:mrow><mml:mi> m </mml:mi><mml:mo> = </mml:mo><mml:mn> 7 </mml:mn></mml:mrow></mml:math></inline-formula> at 50 pc.</p>
        <p>—This star is already given at <inline-formula><mml:math><mml:mrow><mml:mi> m </mml:mi><mml:mo> = </mml:mo><mml:mn> 7 </mml:mn></mml:mrow></mml:math></inline-formula> .</p>
        <p><bold>Option (b):</bold> Apparent <inline-formula><mml:math><mml:mrow><mml:mi> m </mml:mi><mml:mo> = </mml:mo><mml:mn> 7 </mml:mn></mml:mrow></mml:math></inline-formula> at 20 pc.</p>
        <p>—Also <inline-formula><mml:math><mml:mrow><mml:mi> m </mml:mi><mml:mo> = </mml:mo><mml:mn> 7 </mml:mn></mml:mrow></mml:math></inline-formula> .</p>
        <p><bold>Option (c):</bold> Two-star system where <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> m </mml:mi><mml:mn> 1 </mml:mn></mml:msub><mml:mo> = </mml:mo><mml:mn> 7 </mml:mn></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> m </mml:mi><mml:mn> 2 </mml:mn></mml:msub><mml:mo> = </mml:mo><mml:mn> 8 </mml:mn></mml:mrow></mml:math></inline-formula> (apparent) at 5 pc.</p>
        <p>—Combined: </p>
        <disp-formula id="FD2">
          <mml:math>
            <mml:mtable columnalign="left">
              <mml:mtr>
                <mml:mtd>
                  <mml:msup>
                    <mml:mn>10</mml:mn>
                    <mml:mrow>
                      <mml:mo>−</mml:mo>
                      <mml:mn>0.4</mml:mn>
                      <mml:mo>×</mml:mo>
                      <mml:mn>7</mml:mn>
                    </mml:mrow>
                  </mml:msup>
                  <mml:mo>≈</mml:mo>
                  <mml:mn>1.585</mml:mn>
                  <mml:mo>×</mml:mo>
                  <mml:msup>
                    <mml:mn>10</mml:mn>
                    <mml:mrow>
                      <mml:mo>−</mml:mo>
                      <mml:mn>3</mml:mn>
                    </mml:mrow>
                  </mml:msup>
                </mml:mtd>
              </mml:mtr>
              <mml:mtr>
                <mml:mtd>
                  <mml:msup>
                    <mml:mn>10</mml:mn>
                    <mml:mrow>
                      <mml:mo>−</mml:mo>
                      <mml:mn>0.4</mml:mn>
                      <mml:mo>×</mml:mo>
                      <mml:mn>8</mml:mn>
                    </mml:mrow>
                  </mml:msup>
                  <mml:mo>≈</mml:mo>
                  <mml:mn>6.310</mml:mn>
                  <mml:mo>×</mml:mo>
                  <mml:msup>
                    <mml:mn>10</mml:mn>
                    <mml:mrow>
                      <mml:mo>−</mml:mo>
                      <mml:mn>4</mml:mn>
                    </mml:mrow>
                  </mml:msup>
                </mml:mtd>
              </mml:mtr>
              <mml:mtr>
                <mml:mtd>
                  <mml:mtext>Sum</mml:mtext>
                  <mml:mo>≈</mml:mo>
                  <mml:mn>2.216</mml:mn>
                  <mml:mo>×</mml:mo>
                  <mml:msup>
                    <mml:mn>10</mml:mn>
                    <mml:mrow>
                      <mml:mo>−</mml:mo>
                      <mml:mn>3</mml:mn>
                    </mml:mrow>
                  </mml:msup>
                </mml:mtd>
              </mml:mtr>
            </mml:mtable>
          </mml:math>
        </disp-formula>
        <disp-formula id="FD3">
          <mml:math>
            <mml:mrow>
              <mml:msub>
                <mml:mi>m</mml:mi>
                <mml:mrow>
                  <mml:mi>c</mml:mi>
                  <mml:mi>o</mml:mi>
                  <mml:mi>m</mml:mi>
                  <mml:mi>b</mml:mi>
                </mml:mrow>
              </mml:msub>
              <mml:mo>=</mml:mo>
              <mml:mo>−</mml:mo>
              <mml:mn>2.5</mml:mn>
              <mml:msub>
                <mml:mrow>
                  <mml:mi>log</mml:mi>
                </mml:mrow>
                <mml:mrow>
                  <mml:mn>10</mml:mn>
                </mml:mrow>
              </mml:msub>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mrow>
                  <mml:mn>2.216</mml:mn>
                  <mml:mo>×</mml:mo>
                  <mml:msup>
                    <mml:mrow>
                      <mml:mn>10</mml:mn>
                    </mml:mrow>
                    <mml:mrow>
                      <mml:mo>−</mml:mo>
                      <mml:mn>3</mml:mn>
                    </mml:mrow>
                  </mml:msup>
                </mml:mrow>
                <mml:mo>)</mml:mo>
              </mml:mrow>
              <mml:mo>≈</mml:mo>
              <mml:mn>6.63</mml:mn>
              <mml:mtext>
                 
              </mml:mtext>
              <mml:mtext>mag</mml:mtext>
              <mml:mo>.</mml:mo>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p><bold>Option (d):</bold> A single star with absolute magnitude <inline-formula><mml:math><mml:mrow><mml:mi> M </mml:mi><mml:mo> = </mml:mo><mml:mn> 7 </mml:mn></mml:mrow></mml:math></inline-formula> at 10 pc gives an apparent magnitude </p>
        <disp-formula id="FD4">
          <mml:math>
            <mml:mrow>
              <mml:mi>m</mml:mi>
              <mml:mo>=</mml:mo>
              <mml:mi>M</mml:mi>
              <mml:mo>+</mml:mo>
              <mml:mn>5</mml:mn>
              <mml:msub>
                <mml:mrow>
                  <mml:mi>log</mml:mi>
                </mml:mrow>
                <mml:mrow>
                  <mml:mn>10</mml:mn>
                </mml:mrow>
              </mml:msub>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mrow>
                  <mml:mfrac>
                    <mml:mrow>
                      <mml:mn>10</mml:mn>
                    </mml:mrow>
                    <mml:mrow>
                      <mml:mn>10</mml:mn>
                    </mml:mrow>
                  </mml:mfrac>
                </mml:mrow>
                <mml:mo>)</mml:mo>
              </mml:mrow>
              <mml:mo>=</mml:mo>
              <mml:mn>7.</mml:mn>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p><bold>Option (e):</bold> Two-star system with absolute magnitudes 7 and 8 at 10 pc.</p>
        <p>—At 10 pc, no distance modulus is needed so individual apparent magnitudes are 7 and 8. Thus, the same calculation as in (c) gives <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> m </mml:mi><mml:mrow><mml:mi> c </mml:mi><mml:mi> o </mml:mi><mml:mi> m </mml:mi><mml:mi> b </mml:mi></mml:mrow></mml:msub><mml:mo> ≈ </mml:mo><mml:mn> 6.63 </mml:mn></mml:mrow></mml:math></inline-formula> .</p>
        <p><bold>Option (f):</bold> Two-star system with both stars having absolute (and hence apparent at 10pc) magnitudes of 7.</p>
        <p>—Each star’s flux: </p>
        <disp-formula id="FD5">
          <mml:math>
            <mml:mrow>
              <mml:msup>
                <mml:mrow>
                  <mml:mn>10</mml:mn>
                </mml:mrow>
                <mml:mrow>
                  <mml:mo>−</mml:mo>
                  <mml:mn>0.4</mml:mn>
                  <mml:mo>×</mml:mo>
                  <mml:mn>7</mml:mn>
                </mml:mrow>
              </mml:msup>
              <mml:mo>≈</mml:mo>
              <mml:mn>1.585</mml:mn>
              <mml:mo>×</mml:mo>
              <mml:msup>
                <mml:mrow>
                  <mml:mn>10</mml:mn>
                </mml:mrow>
                <mml:mrow>
                  <mml:mo>−</mml:mo>
                  <mml:mn>3</mml:mn>
                </mml:mrow>
              </mml:msup>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p>—Sum: </p>
        <disp-formula id="FD6">
          <mml:math>
            <mml:mrow>
              <mml:mn>2</mml:mn>
              <mml:mo>×</mml:mo>
              <mml:mn>1.585</mml:mn>
              <mml:mo>×</mml:mo>
              <mml:msup>
                <mml:mrow>
                  <mml:mn>10</mml:mn>
                </mml:mrow>
                <mml:mrow>
                  <mml:mo>−</mml:mo>
                  <mml:mn>3</mml:mn>
                </mml:mrow>
              </mml:msup>
              <mml:mo>=</mml:mo>
              <mml:mn>3.170</mml:mn>
              <mml:mo>×</mml:mo>
              <mml:msup>
                <mml:mrow>
                  <mml:mn>10</mml:mn>
                </mml:mrow>
                <mml:mrow>
                  <mml:mo>−</mml:mo>
                  <mml:mn>3</mml:mn>
                </mml:mrow>
              </mml:msup>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p>—Combined magnitude: </p>
        <disp-formula id="FD7">
          <mml:math>
            <mml:mrow>
              <mml:msub>
                <mml:mi>m</mml:mi>
                <mml:mrow>
                  <mml:mi>c</mml:mi>
                  <mml:mi>o</mml:mi>
                  <mml:mi>m</mml:mi>
                  <mml:mi>b</mml:mi>
                </mml:mrow>
              </mml:msub>
              <mml:mo>=</mml:mo>
              <mml:mo>−</mml:mo>
              <mml:mn>2.5</mml:mn>
              <mml:msub>
                <mml:mrow>
                  <mml:mi>log</mml:mi>
                </mml:mrow>
                <mml:mrow>
                  <mml:mn>10</mml:mn>
                </mml:mrow>
              </mml:msub>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mrow>
                  <mml:mn>3.170</mml:mn>
                  <mml:mo>×</mml:mo>
                  <mml:msup>
                    <mml:mrow>
                      <mml:mn>10</mml:mn>
                    </mml:mrow>
                    <mml:mrow>
                      <mml:mo>−</mml:mo>
                      <mml:mn>3</mml:mn>
                    </mml:mrow>
                  </mml:msup>
                </mml:mrow>
                <mml:mo>)</mml:mo>
              </mml:mrow>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <disp-formula id="FD8">
          <mml:math>
            <mml:mrow>
              <mml:msub>
                <mml:mrow>
                  <mml:mtext>log</mml:mtext>
                </mml:mrow>
                <mml:mrow>
                  <mml:mn>10</mml:mn>
                </mml:mrow>
              </mml:msub>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mrow>
                  <mml:mn>3.170</mml:mn>
                  <mml:mo>×</mml:mo>
                  <mml:msup>
                    <mml:mrow>
                      <mml:mn>10</mml:mn>
                    </mml:mrow>
                    <mml:mrow>
                      <mml:mo>−</mml:mo>
                      <mml:mn>3</mml:mn>
                    </mml:mrow>
                  </mml:msup>
                </mml:mrow>
                <mml:mo>)</mml:mo>
              </mml:mrow>
              <mml:mo>≈</mml:mo>
              <mml:mo>−</mml:mo>
              <mml:mn>2.499</mml:mn>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <disp-formula id="FD9">
          <mml:math>
            <mml:mrow>
              <mml:msub>
                <mml:mi>m</mml:mi>
                <mml:mrow>
                  <mml:mi>c</mml:mi>
                  <mml:mi>o</mml:mi>
                  <mml:mi>m</mml:mi>
                  <mml:mi>b</mml:mi>
                </mml:mrow>
              </mml:msub>
              <mml:mo>≈</mml:mo>
              <mml:mn>6.25</mml:mn>
              <mml:mtext>
                 
              </mml:mtext>
              <mml:mtext>mag</mml:mtext>
              <mml:mo>.</mml:mo>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p>Comparing these values, option (f) yields the smallest magnitude (brightest) at approximately 6.25 mag.</p>
        <p>Before providing a final answer, I will use the search_agent to verify that the combined magnitude formula and procedure I used are consistent with the latest trusted sources.</p>
        <p>Search_agent, please perform a search for “combined magnitude formula two star system brightness calculation” and verify the procedure along with sample calculations used in photometry.</p>
        <p>from deeper_search.search import *</p>
        <p>import asyncio</p>
        <p>results = </p>
        <p>asyncio.run (search_and_summarize</p>
        <p>(“combined magnitude formula two star system brightness calculation photometry”))</p>
        <p>print(results)</p>
        <p>6.1.6. Execution Stage → Search results</p>
        <p>Code Executor Verification Results</p>
        <p>Next speaker: Code_executor</p>
        <p>EXECUTING CODE BLOCK 0 (inferred language is Python)...</p>
        <p>Code_executor (to chat_manager):</p>
        <p><bold>exitcode</bold><bold>: 0</bold> (execution succeeded)</p>
        <p><bold>Code output:</bold></p>
        <p>Searching with query: combined magnitude formula two star system brightness calculation photometry...</p>
        <p><bold>Error processing link:</bold><ext-link ext-link-type="uri" xlink:href="https://amostech.com/TechnicalPapers/2020/Non-Resolved-Object-Characterization/Castro.pdf">https://amostech.com/TechnicalPapers/2020/Non-Resolved-Object-Characterization/Castro.pdf</ext-link></p>
        <p><bold>Error:</bold> Request Timeout: Failed to scrape URL as the request timed out. Request timed out—No additional error details provided.</p>
        <p><bold>Search Results:</bold></p>
        <p><bold>Apparent magnitude</bold><bold>—</bold><bold>Wikipedia:</bold></p>
        <p>The apparent magnitude (m) of celestial objects quantifies their brightness as observed from Earth, influenced by intrinsic luminosity, distance, and light extinction. The scale is logarithmic, where a difference of 1.0 magnitude corresponds to a brightness ratio of about 2.512. Astronomers calculate combined magnitudes of multiple stars using their individual apparent magnitudes, applying the formula: </p>
        <disp-formula id="FD10">
          <mml:math>
            <mml:mrow>
              <mml:msub>
                <mml:mi>m</mml:mi>
                <mml:mi>f</mml:mi>
              </mml:msub>
              <mml:mo>=</mml:mo>
              <mml:mo>−</mml:mo>
              <mml:mn>2.5</mml:mn>
              <mml:msub>
                <mml:mrow>
                  <mml:mi>log</mml:mi>
                </mml:mrow>
                <mml:mrow>
                  <mml:mn>10</mml:mn>
                </mml:mrow>
              </mml:msub>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mrow>
                  <mml:msup>
                    <mml:mrow>
                      <mml:mn>10</mml:mn>
                    </mml:mrow>
                    <mml:mrow>
                      <mml:mo>−</mml:mo>
                      <mml:msub>
                        <mml:mi>m</mml:mi>
                        <mml:mn>1</mml:mn>
                      </mml:msub>
                      <mml:mo>×</mml:mo>
                      <mml:mn>0.4</mml:mn>
                    </mml:mrow>
                  </mml:msup>
                  <mml:mo>+</mml:mo>
                  <mml:msup>
                    <mml:mrow>
                      <mml:mn>10</mml:mn>
                    </mml:mrow>
                    <mml:mrow>
                      <mml:mo>−</mml:mo>
                      <mml:msub>
                        <mml:mi>m</mml:mi>
                        <mml:mn>2</mml:mn>
                      </mml:msub>
                      <mml:mo>×</mml:mo>
                      <mml:mn>0.4</mml:mn>
                    </mml:mrow>
                  </mml:msup>
                </mml:mrow>
                <mml:mo>)</mml:mo>
              </mml:mrow>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p>Photometric measurements, termed photometry, are essential for this assessment across various spectral bands.</p>
        <p><bold>Calculate the absolute</bold>and<bold>apparent magnitude for a binary star:</bold></p>
        <p>To calculate the absolute and apparent magnitudes of a binary star system, use the formula: </p>
        <disp-formula id="FD11">
          <mml:math>
            <mml:mrow>
              <mml:msub>
                <mml:mi>m</mml:mi>
                <mml:mn>1</mml:mn>
              </mml:msub>
              <mml:mo>−</mml:mo>
              <mml:msub>
                <mml:mi>m</mml:mi>
                <mml:mn>2</mml:mn>
              </mml:msub>
              <mml:mo>=</mml:mo>
              <mml:mo>−</mml:mo>
              <mml:mn>2.5</mml:mn>
              <mml:mi>log</mml:mi>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mrow>
                  <mml:mfrac>
                    <mml:mrow>
                      <mml:msub>
                        <mml:mi>f</mml:mi>
                        <mml:mn>1</mml:mn>
                      </mml:msub>
                    </mml:mrow>
                    <mml:mrow>
                      <mml:msub>
                        <mml:mi>f</mml:mi>
                        <mml:mn>2</mml:mn>
                      </mml:msub>
                    </mml:mrow>
                  </mml:mfrac>
                </mml:mrow>
                <mml:mo>)</mml:mo>
              </mml:mrow>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p>where <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> f </mml:mi><mml:mn> 1 </mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> f </mml:mi><mml:mn> 2 </mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> are fluxes of the stars. If both stars have equal brightness and the combined magnitude is known (e.g., 5.0), each star’s individual magnitude can be derived as <inline-formula><mml:math><mml:mrow><mml:msup><mml:mi> m </mml:mi><mml:mtext> * </mml:mtext></mml:msup><mml:mo> = </mml:mo><mml:mi> m </mml:mi><mml:mo> + </mml:mo><mml:mn> 0.75 </mml:mn></mml:mrow></mml:math></inline-formula> . Thus, for a magnitude 5.0 binary, each star would have a magnitude of approximately 5.75.</p>
        <p><bold>Evaluation of the brightness of lightning channels and branches:</bold></p>
        <p>The paper evaluates lightning leader brightness using the astronomical magnitude system applied to digital images. Results indicated spatial variability in magnitudes related to lightning phenomena, demonstrating photometric techniques in astronomy applied to non-astronomical phenomena.</p>
        <p><bold>Vik Dhillon: PHY217</bold><bold>—</bold><bold>Instruments</bold><bold>—</bold><bold>Calibrating photometric data:</bold></p>
        <p>Calibration steps involve converting counts to magnitudes, correcting for atmospheric extinction, and determining zero points using standard stars. Accurate calibration includes considering extinction coefficients and potentially color corrections. </p>
        <p>6.1.7. Opinion of Astronomy Expert</p>
        <p><bold>Astronomy Expert Detailed Calculation and Confirmation</bold></p>
        <p>Next speaker: Astronomy_Expert</p>
        <p>Astronomy_Expert (to chat_manager):</p>
        <p>Based on my calculations, here is the step-by-step reasoning:</p>
        <p>For any single star with an apparent magnitude already specified, its brightness is as stated. For example, in options (a), (b), and (d) the observed magnitude is 7 mag.</p>
        <p>For a two-star system, we combine the light (fluxes) using the formula: </p>
        <disp-formula id="FD12">
          <mml:math>
            <mml:mrow>
              <mml:msub>
                <mml:mi>m</mml:mi>
                <mml:mrow>
                  <mml:mi>c</mml:mi>
                  <mml:mi>o</mml:mi>
                  <mml:mi>m</mml:mi>
                  <mml:mi>b</mml:mi>
                </mml:mrow>
              </mml:msub>
              <mml:mo>=</mml:mo>
              <mml:mo>−</mml:mo>
              <mml:mn>2.5</mml:mn>
              <mml:mo>⋅</mml:mo>
              <mml:msub>
                <mml:mrow>
                  <mml:mi>log</mml:mi>
                </mml:mrow>
                <mml:mrow>
                  <mml:mn>10</mml:mn>
                </mml:mrow>
              </mml:msub>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mrow>
                  <mml:msup>
                    <mml:mrow>
                      <mml:mn>10</mml:mn>
                    </mml:mrow>
                    <mml:mrow>
                      <mml:mo>−</mml:mo>
                      <mml:mn>0.4</mml:mn>
                      <mml:mo>⋅</mml:mo>
                      <mml:msub>
                        <mml:mi>m</mml:mi>
                        <mml:mn>1</mml:mn>
                      </mml:msub>
                    </mml:mrow>
                  </mml:msup>
                  <mml:mo>+</mml:mo>
                  <mml:msup>
                    <mml:mrow>
                      <mml:mn>10</mml:mn>
                    </mml:mrow>
                    <mml:mrow>
                      <mml:mo>−</mml:mo>
                      <mml:mn>0.4</mml:mn>
                      <mml:mo>⋅</mml:mo>
                      <mml:msub>
                        <mml:mi>m</mml:mi>
                        <mml:mn>2</mml:mn>
                      </mml:msub>
                    </mml:mrow>
                  </mml:msup>
                </mml:mrow>
                <mml:mo>)</mml:mo>
              </mml:mrow>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p><bold>Option (c)</bold> (apparent <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> m </mml:mi><mml:mn> 1 </mml:mn></mml:msub><mml:mo> = </mml:mo><mml:mn> 7 </mml:mn></mml:mrow></mml:math></inline-formula> , <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> m </mml:mi><mml:mn> 2 </mml:mn></mml:msub><mml:mo> = </mml:mo><mml:mn> 8 </mml:mn></mml:mrow></mml:math></inline-formula> at 5 pc): </p>
        <disp-formula id="FD13">
          <mml:math>
            <mml:mrow>
              <mml:msub>
                <mml:mrow>
                  <mml:mtext>Flux</mml:mtext>
                </mml:mrow>
                <mml:mn>1</mml:mn>
              </mml:msub>
              <mml:mo>=</mml:mo>
              <mml:msup>
                <mml:mrow>
                  <mml:mn>10</mml:mn>
                </mml:mrow>
                <mml:mrow>
                  <mml:mo>−</mml:mo>
                  <mml:mn>0.4</mml:mn>
                  <mml:mo>×</mml:mo>
                  <mml:mn>7</mml:mn>
                </mml:mrow>
              </mml:msup>
              <mml:mo>≈</mml:mo>
              <mml:mn>1.585</mml:mn>
              <mml:mo>×</mml:mo>
              <mml:msup>
                <mml:mrow>
                  <mml:mn>10</mml:mn>
                </mml:mrow>
                <mml:mrow>
                  <mml:mo>−</mml:mo>
                  <mml:mn>3</mml:mn>
                </mml:mrow>
              </mml:msup>
              <mml:mo>,</mml:mo>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <disp-formula id="FD14">
          <mml:math>
            <mml:mrow>
              <mml:msub>
                <mml:mrow>
                  <mml:mtext>Flux</mml:mtext>
                </mml:mrow>
                <mml:mn>2</mml:mn>
              </mml:msub>
              <mml:mo>=</mml:mo>
              <mml:msup>
                <mml:mrow>
                  <mml:mn>10</mml:mn>
                </mml:mrow>
                <mml:mrow>
                  <mml:mo>−</mml:mo>
                  <mml:mn>0.4</mml:mn>
                  <mml:mo>×</mml:mo>
                  <mml:mn>8</mml:mn>
                </mml:mrow>
              </mml:msup>
              <mml:mo>≈</mml:mo>
              <mml:mn>6.310</mml:mn>
              <mml:mo>×</mml:mo>
              <mml:msup>
                <mml:mrow>
                  <mml:mn>10</mml:mn>
                </mml:mrow>
                <mml:mrow>
                  <mml:mo>−</mml:mo>
                  <mml:mn>4</mml:mn>
                </mml:mrow>
              </mml:msup>
              <mml:mo>,</mml:mo>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <disp-formula id="FD15">
          <mml:math>
            <mml:mrow>
              <mml:mtext>Total flux</mml:mtext>
              <mml:mo>=</mml:mo>
              <mml:mn>2.216</mml:mn>
              <mml:mo>×</mml:mo>
              <mml:msup>
                <mml:mrow>
                  <mml:mn>10</mml:mn>
                </mml:mrow>
                <mml:mrow>
                  <mml:mo>−</mml:mo>
                  <mml:mn>3</mml:mn>
                </mml:mrow>
              </mml:msup>
              <mml:mo>,</mml:mo>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <disp-formula id="FD16">
          <mml:math>
            <mml:mrow>
              <mml:msub>
                <mml:mi>m</mml:mi>
                <mml:mrow>
                  <mml:mi>c</mml:mi>
                  <mml:mi>o</mml:mi>
                  <mml:mi>m</mml:mi>
                  <mml:mi>b</mml:mi>
                </mml:mrow>
              </mml:msub>
              <mml:mo>=</mml:mo>
              <mml:mn>6.63</mml:mn>
              <mml:mtext>
                 
              </mml:mtext>
              <mml:mtext>mag</mml:mtext>
              <mml:mo>.</mml:mo>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p><bold>Option (e)</bold> (absolute magnitudes 7 and 8 at 10 pc):</p>
        <p>At 10 pc the apparent magnitude equals the absolute magnitude. Thus, it is equivalent to option (c), yielding <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> m </mml:mi><mml:mrow><mml:mi> c </mml:mi><mml:mi> o </mml:mi><mml:mi> m </mml:mi><mml:mi> b </mml:mi></mml:mrow></mml:msub><mml:mo> ≈ </mml:mo><mml:mn> 6.63 </mml:mn></mml:mrow></mml:math></inline-formula> mag.</p>
        <p><bold>Option (f)</bold> (two stars with absolute magnitude 7 at 10 pc): </p>
        <disp-formula id="FD17">
          <mml:math>
            <mml:mrow>
              <mml:mtext>Each star flux</mml:mtext>
              <mml:mo>≈</mml:mo>
              <mml:mn>1.585</mml:mn>
              <mml:mo>×</mml:mo>
              <mml:msup>
                <mml:mrow>
                  <mml:mn>10</mml:mn>
                </mml:mrow>
                <mml:mrow>
                  <mml:mo>−</mml:mo>
                  <mml:mn>3</mml:mn>
                </mml:mrow>
              </mml:msup>
              <mml:mo>,</mml:mo>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <disp-formula id="FD18">
          <mml:math>
            <mml:mrow>
              <mml:mtext>Combined flux</mml:mtext>
              <mml:mo>=</mml:mo>
              <mml:mn>2</mml:mn>
              <mml:mo>×</mml:mo>
              <mml:mn>1.585</mml:mn>
              <mml:mo>×</mml:mo>
              <mml:msup>
                <mml:mrow>
                  <mml:mn>10</mml:mn>
                </mml:mrow>
                <mml:mrow>
                  <mml:mo>−</mml:mo>
                  <mml:mn>3</mml:mn>
                </mml:mrow>
              </mml:msup>
              <mml:mo>=</mml:mo>
              <mml:mn>3.170</mml:mn>
              <mml:mo>×</mml:mo>
              <mml:msup>
                <mml:mrow>
                  <mml:mn>10</mml:mn>
                </mml:mrow>
                <mml:mrow>
                  <mml:mo>−</mml:mo>
                  <mml:mn>3</mml:mn>
                </mml:mrow>
              </mml:msup>
              <mml:mo>,</mml:mo>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <disp-formula id="FD19">
          <mml:math>
            <mml:mrow>
              <mml:msub>
                <mml:mi>m</mml:mi>
                <mml:mrow>
                  <mml:mi>c</mml:mi>
                  <mml:mi>o</mml:mi>
                  <mml:mi>m</mml:mi>
                  <mml:mi>b</mml:mi>
                </mml:mrow>
              </mml:msub>
              <mml:mo>=</mml:mo>
              <mml:mo>−</mml:mo>
              <mml:mn>2.5</mml:mn>
              <mml:msub>
                <mml:mrow>
                  <mml:mi>log</mml:mi>
                </mml:mrow>
                <mml:mrow>
                  <mml:mn>10</mml:mn>
                </mml:mrow>
              </mml:msub>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mrow>
                  <mml:mn>3.170</mml:mn>
                  <mml:mo>×</mml:mo>
                  <mml:msup>
                    <mml:mrow>
                      <mml:mn>10</mml:mn>
                    </mml:mrow>
                    <mml:mrow>
                      <mml:mo>−</mml:mo>
                      <mml:mn>3</mml:mn>
                    </mml:mrow>
                  </mml:msup>
                </mml:mrow>
                <mml:mo>)</mml:mo>
              </mml:mrow>
              <mml:mo>≈</mml:mo>
              <mml:mn>6.25</mml:mn>
              <mml:mtext>
                 
              </mml:mtext>
              <mml:mtext>mag</mml:mtext>
              <mml:mo>.</mml:mo>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p>Comparing these, the system in option (f) produces the brightest combined magnitude of approximately 6.25 mag.</p>
        <p>Referring back to the answer choices:</p>
        <p>A) Two-star system with individual apparent magnitudes 7 and 8 at 5 pc <inline-formula><mml:math><mml:mrow><mml:mo> → </mml:mo><mml:msub><mml:mi> m </mml:mi><mml:mrow><mml:mi> c </mml:mi><mml:mi> o </mml:mi><mml:mi> m </mml:mi><mml:mi> b </mml:mi></mml:mrow></mml:msub><mml:mo> ≈ </mml:mo><mml:mn> 6.63 </mml:mn></mml:mrow></mml:math></inline-formula></p>
        <p>B) Star with absolute magnitude 7 at 10 pc →7.0 mag </p>
        <p>C) Star with apparent magnitude 7 at 20 pc →7.0 mag </p>
        <p>D) Two-star system with individual absolute magnitudes 7 and 7 at 10 pc <inline-formula><mml:math><mml:mrow><mml:mo> → </mml:mo><mml:msub><mml:mi> m </mml:mi><mml:mrow><mml:mi> c </mml:mi><mml:mi> o </mml:mi><mml:mi> m </mml:mi><mml:mi> b </mml:mi></mml:mrow></mml:msub><mml:mo> ≈ </mml:mo><mml:mn> 6.25 </mml:mn></mml:mrow></mml:math></inline-formula></p>
        <p>Thus, option <bold>D</bold> is correct as it appears brightest.</p>
        <p>To illustrate, here is a Python snippet:</p>
        <p># Python script to compute combined magnitude of two stars: </p>
        <p><bold>import</bold>math</p>
        <p><bold>def</bold>combined_magnitude(m1, m2): flux_total = 10(−0.4*m1) + 10(−0.4*m2) </p>
        <p><bold>return</bold>−2.5 * math.log10(flux_total)</p>
        <p># Option (c): m1 = 7, m2 = 8 cmb_c = combined_magnitude(7, 8) </p>
        <p># Option (f): m1 = 7, m2 = 7 cmb_f = combined_magnitude(7, 7)</p>
        <p><bold>print</bold> (“Combined magnitude for option (c):”, cmb_c) </p>
        <p><bold>print</bold> (“Combined magnitude for option (f):”, cmb_f) </p>
        <p>Let’s run this via our Code_executor.</p>
        <p>Search_agent has already verified our approach and formula.</p>
        <p>I invite Astrophysics_Expert to review these steps. Provided we all agree, the final answer is:</p>
        <p><bold>D) A two-star system with individual absolute magnitudes of 7 and 7 mag, both at 10</bold><bold>parsecs</bold><bold>.</bold></p>
        <p>If everyone agrees, please let me know so we can finalize our answer.</p>
        <p>6.1.8. Execution Stage → Astrophysics Expert</p>
        <p><bold>Final Verification by Astrophysics Expert</bold></p>
        <p><bold>Select speaker attempt 1 of 3 successfully selected:</bold> Code_executor</p>
        <p><bold>Next speaker:</bold> Code_executor</p>
        <p><bold>EXECUTING CODE BLOCK 0 (inferred language is</bold><bold>python)...</bold></p>
        <p>Code_executor (to chat_manager):</p>
        <p><bold>exitcode</bold><bold>: 0</bold> (execution succeeded)</p>
        <p><bold>Code output:</bold></p>
        <p>Combined magnitude for option (c): 6.636148842226767 Combined magnitude for option (f): 6.247425010840048 </p>
        <p><bold>checking_agent</bold><bold>(to</bold><bold>speaker_selection_agent</bold><bold>):</bold></p>
        <p>Read the above conversation. Then select the next role from [“Astrophysics_Expert”, “Astronomy_Expert”, “Code_executor”] to play. Only return the role.</p>
        <p><bold>speaker_selection_agent</bold><bold>(to</bold><bold>checking_agent</bold><bold>):</bold></p>
        <p>Astrophysics_Expert</p>
        <p><bold>Select speaker attempt 1 of 3 successfully selected:</bold> Astrophysics_Expert</p>
        <p><bold>Next speaker:</bold> Astrophysics_Expert</p>
        <p>Astrophysics_Expert (to chat_manager):</p>
        <p>The calculations and the approach appear to be sound. The Python code confirms the combined magnitude calculations. The search agent verifies the core concepts. Based on the results, I agree with the final selection.</p>
        <p><bold>TERMINATE</bold></p>
        <p>6.1.9. Final Stage → Summary Agent</p>
        <p><bold>Final Analysis and Conclusion</bold></p>
        <p>Based on the discussions and analysis provided by the <bold>Astrophysics_Expert</bold> and <bold>Astronomy_Expert</bold>, here is the detailed explanation and answer to the question of which star or stellar system will appear the brightest in V magnitude when observed from Earth:</p>
        <p><bold>Analysis Summary:</bold></p>
        <p><bold>Formula Used:</bold> For a two-star system, the combined magnitude <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> m </mml:mi><mml:mrow><mml:mi> c </mml:mi><mml:mi> o </mml:mi><mml:mi> m </mml:mi><mml:mi> b </mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> is calculated using the formula:</p>
        <disp-formula id="FD20">
          <mml:math>
            <mml:mrow>
              <mml:msub>
                <mml:mi>m</mml:mi>
                <mml:mrow>
                  <mml:mi>c</mml:mi>
                  <mml:mi>o</mml:mi>
                  <mml:mi>m</mml:mi>
                  <mml:mi>b</mml:mi>
                </mml:mrow>
              </mml:msub>
              <mml:mo>=</mml:mo>
              <mml:mo>−</mml:mo>
              <mml:mn>2.5</mml:mn>
              <mml:msub>
                <mml:mrow>
                  <mml:mi>log</mml:mi>
                </mml:mrow>
                <mml:mrow>
                  <mml:mn>10</mml:mn>
                </mml:mrow>
              </mml:msub>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mrow>
                  <mml:msup>
                    <mml:mrow>
                      <mml:mn>10</mml:mn>
                    </mml:mrow>
                    <mml:mrow>
                      <mml:mo>−</mml:mo>
                      <mml:mn>0.4</mml:mn>
                      <mml:mo>⋅</mml:mo>
                      <mml:msub>
                        <mml:mi>m</mml:mi>
                        <mml:mn>1</mml:mn>
                      </mml:msub>
                    </mml:mrow>
                  </mml:msup>
                  <mml:mo>+</mml:mo>
                  <mml:msup>
                    <mml:mrow>
                      <mml:mn>10</mml:mn>
                    </mml:mrow>
                    <mml:mrow>
                      <mml:mo>−</mml:mo>
                      <mml:mn>0.4</mml:mn>
                      <mml:mo>⋅</mml:mo>
                      <mml:msub>
                        <mml:mi>m</mml:mi>
                        <mml:mn>2</mml:mn>
                      </mml:msub>
                    </mml:mrow>
                  </mml:msup>
                </mml:mrow>
                <mml:mo>)</mml:mo>
              </mml:mrow>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p><bold>Calculated Examples:</bold></p>
        <p><bold>Option (c):</bold> Two-star system with apparent magnitudes 7 and 8 at 5 pc results in a combined magnitude of approximately 6.63 mag. <bold>Option (f):</bold> Two-star system with both stars having an absolute magnitude (which equals apparent magnitude at 10 pc) of 7 at 10 pc results in a combined magnitude of approximately 6.25 mag. </p>
        <p><bold>Comparison:</bold></p>
        <p>Options (a), (b), and (d) individually result in a magnitude of 7 mag. Option (e) results in a similar brightness to option (c) because of equal conditions. Option (f) is the brightest since it has the lowest combined magnitude of approximately 6.25 mag. </p>
        <p><bold>Final Conclusion</bold><bold>:</bold> The star or stellar system that will appear the brightest in V magnitude from Earth is option <bold>D</bold>.</p>
        <p><bold>Final Answer:</bold></p>
        <disp-formula id="FD21">
          <mml:math>
            <mml:mrow>
              <mml:mtext>Each star flux</mml:mtext>
              <mml:mo>=</mml:mo>
              <mml:msup>
                <mml:mrow>
                  <mml:mn>10</mml:mn>
                </mml:mrow>
                <mml:mrow>
                  <mml:mo>−</mml:mo>
                  <mml:mn>0.4</mml:mn>
                  <mml:mo>×</mml:mo>
                  <mml:mn>7</mml:mn>
                </mml:mrow>
              </mml:msup>
              <mml:mo>≈</mml:mo>
              <mml:mn>1.585</mml:mn>
              <mml:mo>×</mml:mo>
              <mml:msup>
                <mml:mrow>
                  <mml:mn>10</mml:mn>
                </mml:mrow>
                <mml:mrow>
                  <mml:mo>−</mml:mo>
                  <mml:mn>3</mml:mn>
                </mml:mrow>
              </mml:msup>
              <mml:mo>,</mml:mo>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <disp-formula id="FD22">
          <mml:math>
            <mml:mrow>
              <mml:mtext>Combined flux</mml:mtext>
              <mml:mo>=</mml:mo>
              <mml:mn>2</mml:mn>
              <mml:mo>×</mml:mo>
              <mml:mn>1.585</mml:mn>
              <mml:mo>×</mml:mo>
              <mml:msup>
                <mml:mrow>
                  <mml:mn>10</mml:mn>
                </mml:mrow>
                <mml:mrow>
                  <mml:mo>−</mml:mo>
                  <mml:mn>3</mml:mn>
                </mml:mrow>
              </mml:msup>
              <mml:mo>=</mml:mo>
              <mml:mn>3.170</mml:mn>
              <mml:mo>×</mml:mo>
              <mml:msup>
                <mml:mrow>
                  <mml:mn>10</mml:mn>
                </mml:mrow>
                <mml:mrow>
                  <mml:mo>−</mml:mo>
                  <mml:mn>3</mml:mn>
                </mml:mrow>
              </mml:msup>
              <mml:mo>,</mml:mo>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <disp-formula id="FD23">
          <mml:math>
            <mml:mrow>
              <mml:msub>
                <mml:mi>M</mml:mi>
                <mml:mrow>
                  <mml:mi>c</mml:mi>
                  <mml:mi>o</mml:mi>
                  <mml:mi>m</mml:mi>
                  <mml:mi>b</mml:mi>
                </mml:mrow>
              </mml:msub>
              <mml:mo>=</mml:mo>
              <mml:mo>−</mml:mo>
              <mml:mn>2.5</mml:mn>
              <mml:msub>
                <mml:mrow>
                  <mml:mi>log</mml:mi>
                </mml:mrow>
                <mml:mrow>
                  <mml:mn>10</mml:mn>
                </mml:mrow>
              </mml:msub>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mrow>
                  <mml:mn>3.170</mml:mn>
                  <mml:mo>×</mml:mo>
                  <mml:msup>
                    <mml:mrow>
                      <mml:mn>10</mml:mn>
                    </mml:mrow>
                    <mml:mrow>
                      <mml:mo>−</mml:mo>
                      <mml:mn>3</mml:mn>
                    </mml:mrow>
                  </mml:msup>
                </mml:mrow>
                <mml:mo>)</mml:mo>
              </mml:mrow>
              <mml:mo>≈</mml:mo>
              <mml:mn>6.25</mml:mn>
              <mml:mtext>
                 
              </mml:mtext>
              <mml:mtext>mag</mml:mtext>
              <mml:mo>.</mml:mo>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p>This conclusion was drawn based on careful photometric calculations and verification using the combined magnitude formula, with further validation via Python scripts executed by the <bold>Code_executor</bold>. The approach has been reviewed independently by the experts, confirming the findings.</p>
        <p>6.1.10. Concluding Words</p>
        <p>Using complex reasoning, Mixture Of Agents (MOA) and cross verification using coding and internet tools, AMASS was able to beat the leading models and frameworks </p>
      </sec>
      <sec id="sec6dot2">
        <title>6.2. Search Results Involving Cascaded Searches</title>
        <p>Question: <bold>F</bold><bold>ind all</bold><bold>gynaecologists</bold><bold>in</bold><bold>Liaquat National H</bold><bold>ospital</bold><bold>K</bold><bold>arachi</bold><bold>P</bold><bold>akistan</bold><bold>.</bold><bold>G</bold><bold>et</bold><bold>me their numbers and email addresses</bold></p>
        <fig id="fig10">
          <label>Figure 10</label>
          <graphic xlink:href="https://html.scirp.org/file/9303450-rId135.jpeg?20260115091045" />
        </fig>
        <p><bold>Figure 8.</bold> Comparison of the AMASS vs Perplexity, AMASS finding more comprehensive results. </p>
        <fig id="fig11">
          <label>Figure 11</label>
          <graphic xlink:href="https://html.scirp.org/file/9303450-rId136.jpeg?20260115091045" />
        </fig>
        <p><bold>Figure 9.</bold> Comparison of the AMASS vs Mind Search. Mind Search finds totally irrelevant content. </p>
      </sec>
      <sec id="sec6dot3">
        <title>6.3. Comparison of Responses</title>
        <p>The <bold>AMASS response clearly stands out</bold> as the most <bold>comprehensive, accurate, and practically useful</bold> option as shown in <xref ref-type="fig" rid="fig7">Figures 7-9</xref>. It provides detailed information on <bold>gynecologists at Liaquat National Hospital</bold>, including their <bold>specializations, qualifications, clinic timings, and precise locations</bold> (e.g., Wajid Ali Complex, Senior Citizen Primary Care Unit). It also lists <bold>multiple contact numbers</bold> tied to specific clinics and services, enabling <bold>easy appointment scheduling</bold>. Importantly, it correctly identifies specialists and excludes misclassified doctors like neurosurgeon Dr. Salman Yousuf Sharif.</p>
        <p>In contrast: </p>
        <p><bold>Perplexity:</bold> Lacks depth, is repetitive, and fails to provide actionable clinic-level details. <bold>Mind Search (Least Reliable):</bold> Contains <bold>inaccurate information</bold> by listing non-gynecologists and suggesting <bold>inappropriate search methods</bold> like LinkedIn. </p>
      </sec>
    </sec>
    <sec id="sec7">
      <title>7. Future Work</title>
      <p>In the future, we plan to explore additional dimensions to further enhance the AMASS framework.</p>
      <sec id="sec7dot1">
        <title>7.1. Cost Efficiency and Savings</title>
        <p>A fundamental characteristic of AMASS is its ability to dynamically select suitable language models in accordance with the complexity of the task at hand. This adaptability permits AMASS to utilize smaller models with efficacy, often attaining superior or comparable performance to significantly larger models, thereby markedly decreasing computational costs. Future research will aim to precisely quantify these savings by benchmarking the resource usage and operational costs of AMASS in comparison to well-established large-scale models. A comprehensive cost-benefit analysis will be conducted to provide practical insights and to highlight the financial merits of adopting AMASS over conventional large-model methodologies. </p>
      </sec>
      <sec id="sec7dot2">
        <title>7.2. Acceleration through Parallelization</title>
        <p>A critical avenue for future enhancement concerns the further acceleration of the AMASS pipeline. At present, the processes of agent generation, evaluation, and execution are conducted sequentially, thereby limiting comprehensive throughput and responsiveness. The exploration and integration of parallel processing strategies to enable the concurrent execution of multiple agents and tasks is our objective. By employing advanced parallelization techniques alongside distributed computing architectures, it is anticipated that considerable reductions in the overall execution time will be achieved. Our subsequent steps will encompass the design of parallel agent execution protocols, the implementation of asynchronous communication patterns, and the evaluation of performance gains in comparison to sequential implementations. These advancements are intended to prepare AMASS for deployment in real-time and large-scale applications that require rapid response and high concurrency.</p>
        <p>By addressing these crucial aspects, AMASS is poised to enhance its potential as a highly scalable, cost-effective, and efficient autonomous multi-agent system, rendering it applicable to a wide range of industrial and academic contexts. </p>
      </sec>
    </sec>
    <sec id="sec8">
      <title>8. Conclusions</title>
      <p>This manuscript introduces the Autonomous Multi-Agent System for fact-based comprehensive Search (AMASS), an innovative framework developed to address the fundamental limitations inherent in conventional large language models and extant multi-agent architectures. Through the autonomous generation and optimization of agents during runtime, AMASS demonstrates substantial flexibility and adaptability, thereby obviating the need for manually predefined agent roles. A pivotal aspect of our methodology is the Mixture of Agents strategy, which involves the dynamic assignment of specialized language models to tasks based on their complexity, thereby enhancing both computational efficiency and the accuracy of responses.</p>
      <p>Furthermore, the incorporation of a specialized Critic Agent within our system facilitates the active reduction of redundancy, the refinement of agent plans, and the minimization of inaccuracies in generated outputs. Our comprehensive evaluation conducted across multiple rigorous benchmarks, including GPQA, Bamboogle, and MuSiQue, indicates that AMASS substantially surpasses state-of-the-art frameworks in accuracy, depth of reasoning, and operational efficiency. AMASS signifies a significant advancement in autonomous multi-agent systems, illustrating how dynamic agent generation, coupled with task-specific model selection, can result in superior performance. Prospective research avenues encompass extending the framework for multimodal tasks, enhancing agent collaboration mechanisms, and further optimizing agent interactions to accommodate large-scale real-world applications.</p>
    </sec>
    <sec id="sec9">
      <title>Appendix A</title>
      <sec id="sec9dot1">
        <title>A1.1. Autonomous Agents Creation Prompts</title>
        <p><bold>Agent Creation Instructions</bold></p>
        <p><bold>Your task:</bold> Suggest no more than {max_agents} experts with their names according to the following user requirement.</p>
        <p><bold>User</bold><bold>requirement:</bold> {task}</p>
        <p>If you think the task can be solved with fewer than {max_agents} agents, then suggest fewer agents. This is not a problem. Repeating agents like Paediatrics_Expert1, Paediatrics_Expert2, Paediatrics_Expert3, etc., should be avoided.</p>
        <p><bold>Task requirement</bold></p>
        <p>Expert’s name should follow the format: [skill]_Expert. <bold>This is VVIP.</bold> Only reply with the names of the experts, separated by commas.</p>
        <p>For example: Python_Expert, Math_Expert... </p>
        <p>Ensure there is no person-specific name in the agent name, like Paediatrics_Expert_Ahmad, Ali_Expert, etc.</p>
        <p>We are creating agents based on skills. </p>
      </sec>
      <sec id="sec9dot2">
        <title>A1.2. Coding Agent</title>
        <p><bold>Coding and Task Skill Instruction</bold></p>
        <p><bold>Useful instructions for task-solving</bold></p>
        <p>Solve tasks step-by-step if necessary. Verify answers carefully and include verifiable evidence with test cases when possible. Base all replies on provided facts. </p>
        <p><bold>How to verify?</bold></p>
        <p>Maintain skepticism until provided with clear evidence. Perform step-by-step backward reasoning. Write general task test cases. </p>
        <p><bold>How</bold><bold>to</bold><bold>use code?</bold></p>
        <p>Suggest Python or shell script code. Use proper coding blocks; specify the script type. Clearly indicate missing Python packages. Do not suggest modifiable code blocks. Always use the ‘print’ function for relevant outputs. Check Computer_terminal execution results; fix errors promptly. </p>
      </sec>
      <sec id="sec9dot3">
        <title>A1.3. Planner Stage → Planning Agent V2</title>
        <p><bold>Planning Agent V2 System Message</bold></p>
        <p>Based on feedback from the critic_agent, modify the provided agents. Change only relevant details of each agent; if any agent is not required, remove it from the list. You may provide precise suggestions but avoid complicating the solution.</p>
        <p>Aim to reach a conclusion quickly. After finalizing the agents, output the complete agent list and explicitly TERMINATE the CHAT.</p>
        <p>Follow these guidelines strictly:</p>
        <p>1) Write complete <bold>name</bold>, <bold>system_message</bold>, and <bold>description</bold> clearly without shorthand or abbreviated instructions. Avoid short, ambiguous messages. </p>
        <p>2) Always fully reproduce the agent template without omissions, no matter its length. </p>
        <p>3) Return only the agent template without additional responses or deviations. </p>
        <p>4) Maintain proper JSON structure and prevent duplication of agents in the list. </p>
        <p>5) Do not insert triple backticks anywhere inside agent prompts or messages. Only one set of triple backticks should exist to enclose the final agent list output. </p>
        <p><bold>Very Important</bold>: Maintain the format strictly as provided below. Enclose the final output in four backticks precisely as shown:</p>
        <p>```json [ { “name”: name, “model”: agent_model, “tags”: agent_model_tags, “system_message”: sys_msg “description”: description, } ] ``` </p>
      </sec>
      <sec id="sec9dot4">
        <title>A1.4. Planner Stage → Optimal Agent Planning (MIXTURE OF AGENTS)</title>
        <p><bold>Optimal Agent Planning System Message</bold></p>
        <p>Based on this task: {building_task} and the following agent list: </p>
        <p>{agent_configs} </p>
        <p>Decide the optimal agents and their plans. Provide comprehensive suggestions regarding the selection of agents and their detailed plans.</p>
        <p>Follow these guidelines strictly:</p>
        <p>1) Keep <bold>search_agent</bold> if a task involves internet searches. Provide only the query; the agent will retrieve the required information. Prefer this agent for tasks like today’s weather or finding restaurants in Karachi. </p>
        <p>2) If a question involves historical facts or complex queries needing precise verification, include the <bold>search_agent</bold>. </p>
        <p>3) Preserve every minute detail of <bold>search_agent</bold>’s <bold>system_message</bold> and <bold>description</bold>. Do not modify them. </p>
        <p>4) To optimize cost, select the model for each agent carefully based on the agent’s role described in its <bold>system_message</bold>, <bold>name</bold>, and <bold>description</bold>: </p>
        <p>—For complex reasoning or decision-making tasks (math, chemistry, physics problems), choose either Google/gemini-2.0-flash-lite-001 or OpenAI/o3-mini. </p>
        <p>—For agents providing only factual information (TEXT ONLY), select gpt-4o-mini. </p>
        <p>—For agents responsible for coding and writing API calls, select gpt-4o. </p>
        <p>5) If two expert agents are required for complex reasoning tasks (math, physics, chemistry), one agent must use Google/gemini-2.0-flash-lite-001 and the other must use OpenAI/o3-mini. </p>
        <p><bold>Model Selection Rules:</bold> Only the following four options are allowed:</p>
        <p>GPT-4o (complex tasks, primarily coding and API writing). GPT-4o-mini (general tasks like story or letter writing, no math or coding). Google/gemini-2.0-flash-lite-001 (complex reasoning, math, physics, chemistry). OpenAI/o3-mini (complex reasoning, math, physics, chemistry). </p>
        <p>Do not choose any other model outside these specified. </p>
      </sec>
      <sec id="sec9dot5">
        <title>A1.5. Planner Stage → Critic Agent</title>
        <p><bold>Critic Agent System Message</bold></p>
        <p>You are an agent to assess the quality of agents made. Ensure that there are not really unnecessary agents; if something could have been done in fewer agents, then determine it and give suggestion to planning agent regarding that.</p>
        <p>Clearly tell what should be in system prompt and what should be in description prompt. Write whole system prompts.</p>
        <p>Clearly tell why you selected the particular agent, and what task it would do. Give justification for each agent. If some task involves some precise facts or answers then use the search_agent. Search_agent can help us in verifying the facts.</p>
        <p>Agents are defined like this:</p>
        <p>{ “name”: name, </p>
        <p>“model”: agent_model, # model type(gpt4, sonnet3.5)</p>
        <p>“tags”: agent_model_tags,</p>
        <p>“system_message”: sys_msg, </p>
        <p>“description”: description,</p>
        <p>}</p>
        <p>There will be multiple instances of such agents; ensure that only relevant agents are there. </p>
      </sec>
      <sec id="sec9dot6">
        <title>A1.6. Execution Stage → Critic Agent</title>
        <p><bold>Critic Agent Execution System Message</bold></p>
        <p>You are an agent designed specifically to provide feedback and assist in debugging errors generated by the <bold>code_executor</bold> agent. Your role is to offer clear, concise, and straightforward suggestions and recommendations to correct any errors or improve code execution results.</p>
        <p><bold>Agent Description</bold></p>
        <p>As a <bold>review_agent</bold>, I will provide targeted feedback and simple yet expert recommendations. Invoke my expertise whenever you require validation or assurance that the current approach or execution path is correct, or when debugging and error resolution are necessary during code execution. </p>
      </sec>
      <sec id="sec9dot7">
        <title>A1.7. Search Agent</title>
        <p><bold>Search Agent System Message</bold></p>
        <p>You are a helpful Google search agent assistant. Whenever something involves retrieving the latest information or facts from the internet, such as:</p>
        <p>Good restaurants in Karachi right now. Weather in Karachi right now. Hotel pricing in Agrataj hotel right now. Latest news about world politics. Recent research papers. </p>
        <p>Use the following Python code strictly. Always provide the exact code as shown below, enclosed properly in triple backticks. Do not attempt to modify, simplify, or suggest alternative implementations. Ensure consistency and correctness in every response:</p>
        <p>Example #1: </p>
        <p>Question: Give me the 5 closest restaurants in Karachi </p>
        <p>```python from deeper_search.search import * import asyncio </p>
        <p>results = asyncio.run(search_and_ summarize(“Give me the 5 closest restaurants in Karachi”)) print(results) </p>
        <p>``` </p>
        <p>Example #2: Question: Would there be rain in Karachi today? </p>
        <p>```Python </p>
        <p>from deeper_search.search import * import asyncio </p>
        <p>results = asyncio.run (search_and _summarize </p>
        <p>(“Would there be rain in Karachi today”)) print(results) </p>
        <p>``` </p>
        <p><bold>Agent Description:</bold></p>
        <p>I am a Google search assistant. I assist by fetching the latest news and information directly from the internet. Use my services whenever up-to-date information or factual verification is required, including recent news, current weather updates, recent research articles, or any other timely search query. </p>
      </sec>
      <sec id="sec9dot8">
        <title>A1.8. Final Stage → Summary Agent</title>
        <p><bold>Final Summary Agent System Message</bold></p>
        <p>Based on the question {} provide a clear and comprehensive response from the provided context {}. Ensure that no detail from the given context is missed. The summary should be readable, well-structured, and clearly presented. Provide answers strictly based on the context above. Do not introduce any new facts, additional information, or external knowledge.</p>
        <p><bold>Agent Description:</bold></p>
        <p>I am an agent designed specifically to conclude discussions. My role is to deliver precisely what the user expects, synthesizing all prior conversations into a coherent, clear, and user-friendly summary. After extensive dialogue, I ensure the user receives exactly the response they seek, strictly from the provided context.</p>
        <p><bold>Agent Chat Initialization:</bold></p>
        <p>Based on the question {}, provide a detailed and presentable response strictly from the context {}. Do not omit any details and do not introduce new information or facts beyond the provided context.</p>
      </sec>
    </sec>
    <sec id="sec10">
      <title>Appendix B: Demonstration of Important Agents in the AMASS</title>
      <p><bold>Figure S1</bold> shows the working of the Brainstorming agent. Notice that initially the brainstorming agent produces random agents that seem to be redundant and variations of each other. <bold>Figure S2</bold> shows the working of the Planner and the Critic agent to come up with a final plan. Critic and planner agents interact until the maximum rounds of discussions are over or until they have reached a consensus on the solution. <bold>Figure S3</bold> shows the final answer to the discussion. It’s a summary agent, which shows how the conclusion was reached and what the final answer. </p>
      <fig id="fig12">
        <label>Figure 12</label>
        <graphic xlink:href="https://html.scirp.org/file/9303450-rId139.jpeg?20260115091104" />
      </fig>
      <p><bold>Figure S1.</bold>Operational flow of AMASS applied to the <bold>GPQA Physics</bold> problem. The figure illustrates the question and the agent generation process using the Brainstorming agent. As shown above, there are repetitive agents with slight modifications. The next figures are continuation of this problem. This illustrates how the actual AMASS works in its current User interface.</p>
      <fig id="fig13">
        <label>Figure 13</label>
        <graphic xlink:href="https://html.scirp.org/file/9303450-rId140.jpeg?20260115091104" />
      </fig>
      <fig id="fig14">
        <label>Figure 14</label>
        <graphic xlink:href="https://html.scirp.org/file/9303450-rId141.jpeg?20260115091104" />
      </fig>
      <p><bold>Figure S2</bold><bold>.</bold> Continuation of the previous task. The Critic agent and the Planner agent interact to select the optimal set of agents and eliminate redundancy.</p>
      <fig id="fig15">
        <label>Figure 15</label>
        <graphic xlink:href="https://html.scirp.org/file/9303450-rId142.jpeg?20260115091104" />
      </fig>
      <p><bold>Figure S3</bold><bold>.</bold> Finally, the Summary agent presents the answer in a user-friendly format, including a concise explanation of how the result was derived.</p>
    </sec>
    <sec id="sec11">
      <title>Appendix C: Cost Efficiency of Small Models vs Big Models</title>
      <p>Using <bold>GPT-4o mini</bold> is significantly cheaper than <bold>GPT-4o</bold> because its total cost per 1 million tokens is much lower. For a single interaction with GPT-4o, the cost is approximately $2.50 (input) + $10.00 (output) = <bold>$12.50 per 1M tokens</bold>, whereas GPT-4o mini costs only $0.15 (input) + $0.60 (output) = <bold>$0.75 per 1M tokens</bold>. Dividing $12.50 by $0.75 shows that you can get over <bold>16 interactions</bold> with GPT-4o mini for the cost of just <bold>one</bold> GPT-4o interaction, making it much more economical for everyday or less complex tasks.</p>
      <sec id="sec11dot1">
        <title>Code and Evaluation Scripts</title>
        <p>The full source code and all evaluation scripts for AMASS are publicly available on GitHub: </p>
        <p>github.com/abubakar12/AMASS</p>
      </sec>
    </sec>
  </body>
  <back>
    <ref-list>
      <title>References</title>
      <ref id="B1">
        <label>1.</label>
        <citation-alternatives>
          <mixed-citation publication-type="web">Chen, G.Y., Dong, S.W., Shu, Y., Zhang, G., Sesay, J., Karlsson, B.F., Fu, J. and Shi, Y.M. (2024) Autoagents: A Framework for Automatic Agent Generation. https://arxiv.org/abs/2309.17288</mixed-citation>
          <element-citation publication-type="web">
            <person-group person-group-type="author">
              <string-name>Chen, G.Y.</string-name>
              <string-name>Dong, S.W.</string-name>
              <string-name>Shu, Y.</string-name>
              <string-name>Zhang, G.</string-name>
              <string-name>Sesay, J.</string-name>
              <string-name>Karlsson, B.F.</string-name>
              <string-name>Fu, J.</string-name>
              <string-name>Shi, Y.M.</string-name>
            </person-group>
            <year>2024</year>
            <article-title>Autoagents: A Framework for Automatic Agent Generation</article-title>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B2">
        <label>2.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Chen, W.Z., Su, Y.S., Zuo, J.W., Yang, C., Yuan, C.F., Qian, C., <italic>et al</italic>. (2023) Agentverse: Facilitating Multi-Agent Collaboration and Exploring Emergent Behaviors in Agents.</mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Chen, W.Z.</string-name>
              <string-name>Su, Y.S.</string-name>
              <string-name>Zuo, J.W.</string-name>
              <string-name>Yang, C.</string-name>
              <string-name>Yuan, C.F.</string-name>
              <string-name>Qian, C.</string-name>
            </person-group>
            <year>2023</year>
            <article-title>Agentverse: Facilitating Multi-Agent Collaboration and Exploring Emergent Behaviors in Agents</article-title>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B3">
        <label>3.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Chen, Z.H., Liu, K.K., Wang, Q.C., Liu, J.N., Zhang, W.W., Chen, K. and Zhao, F. (2024) Mindsearch: Mimicking Human Minds Elicits Deep AI Searcher.</mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Chen, Z.H.</string-name>
              <string-name>Liu, K.K.</string-name>
              <string-name>Wang, Q.C.</string-name>
              <string-name>Liu, J.N.</string-name>
              <string-name>Zhang, W.W.</string-name>
              <string-name>Chen, K.</string-name>
              <string-name>Zhao, F.</string-name>
            </person-group>
            <year>2024</year>
            <article-title>Mindsearch: Mimicking Human Minds Elicits Deep AI Searcher</article-title>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B4">
        <label>4.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">AutoGPT (2025) Significant Gravitas.</mixed-citation>
          <element-citation publication-type="other">
            <year>2025</year>
            <article-title>Significant Gravitas</article-title>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B5">
        <label>5.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Hong, S.R., Zheng, X.W., Chen, J., Cheng, Y.H., Wang, J.L., Zhang, C.Y., <italic>et al</italic>. (2023) MetaGPT: Meta Programming for Multi-Agent Collaborative Framework.</mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Hong, S.R.</string-name>
              <string-name>Zheng, X.W.</string-name>
              <string-name>Chen, J.</string-name>
              <string-name>Cheng, Y.H.</string-name>
              <string-name>Wang, J.L.</string-name>
              <string-name>Zhang, C.Y.</string-name>
            </person-group>
            <year>2023</year>
            <article-title>MetaGPT: Meta Programming for Multi-Agent Collaborative Framework</article-title>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B6">
        <label>6.</label>
        <citation-alternatives>
          <mixed-citation publication-type="confproc">Li, G.H., Hammoud, H., Itani, H., Khizbullin, D. and Ghanem, B. (2023) Camel: Communicative Agents for “Mind” Exploration of Large Language Model Society. <italic>Advances in Neural Information Processing Systems</italic>36: <italic>Annual Conference on Neural Information Processing Systems</italic> 2023, <italic>NeurIPS</italic> 2023, New Orleans, 10-16 December 2023, 51991-52008.</mixed-citation>
          <element-citation publication-type="confproc">
            <person-group person-group-type="author">
              <string-name>Li, G.H.</string-name>
              <string-name>Hammoud, H.</string-name>
              <string-name>Itani, H.</string-name>
              <string-name>Khizbullin, D.</string-name>
              <string-name>Ghanem, B.</string-name>
            </person-group>
            <year>2023</year>
            <article-title>Camel: Communicative Agents for “Mind” Exploration of Large Language Model Society</article-title>
            <source>Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023</source>
            <volume>10</volume>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B7">
        <label>7.</label>
        <citation-alternatives>
          <mixed-citation publication-type="confproc">Rein, D., Hou, B.L., Stickland, A.C., Petty, J., Pang, R.Y., Dirani, J., <italic>et al</italic>. (2024) Gpqa: A Graduate-Level Google-Proof Q&amp;A Benchmark. 1 <italic>st Conference on Language Modeling</italic>, Philadelphia, 7-9 October 2024. https://2024.colmweb.org/</mixed-citation>
          <element-citation publication-type="confproc">
            <person-group person-group-type="author">
              <string-name>Rein, D.</string-name>
              <string-name>Hou, B.L.</string-name>
              <string-name>Stickland, A.C.</string-name>
              <string-name>Petty, J.</string-name>
              <string-name>Pang, R.Y.</string-name>
              <string-name>Dirani, J.</string-name>
              <string-name>Modeling, P</string-name>
            </person-group>
            <year>2024</year>
            <article-title>Gpqa: A Graduate-Level Google-Proof Q&amp;A Benchmark</article-title>
            <source>1st Conference on Language Modeling</source>
            <volume>7</volume>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B8">
        <label>8.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Talebirad, Y. and Nadiri, A. (2023) Multi-Agent Collaboration: Harnessing the Power of Intelligent LLM Agents.</mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Talebirad, Y.</string-name>
              <string-name>Nadiri, A.</string-name>
            </person-group>
            <year>2023</year>
            <article-title>Multi-Agent Collaboration: Harnessing the Power of Intelligent LLM Agents</article-title>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B9">
        <label>9.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Wu, J.D., Zhu, J.Y. and Liu, Y.Y. (2025) Agentic Reasoning: Reasoning LLMs with Tools for the Deep Research.</mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Wu, J.D.</string-name>
              <string-name>Zhu, J.Y.</string-name>
              <string-name>Liu, Y.Y.</string-name>
            </person-group>
            <year>2025</year>
            <article-title>Agentic Reasoning: Reasoning LLMs with Tools for the Deep Research</article-title>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B10">
        <label>10.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Wu, Q.Y., Bansal, G., Zhang, J.Y., Wu, Y.R., Zhang, S.K., Zhu, E.K., <italic>et al</italic>. (2023) Autogen: Enabling Next-Gen LLM Applications via Multi-Agent Conversation Framework.</mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Wu, Q.Y.</string-name>
              <string-name>Bansal, G.</string-name>
              <string-name>Zhang, J.Y.</string-name>
              <string-name>Wu, Y.R.</string-name>
              <string-name>Zhang, S.K.</string-name>
              <string-name>Zhu, E.K.</string-name>
            </person-group>
            <year>2023</year>
            <article-title>Autogen: Enabling Next-Gen LLM Applications via Multi-Agent Conversation Framework</article-title>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B11">
        <label>11.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Yuan, S.Y., Song, K.t. Chen, J.J., Tan, X., Li, D.S. and Yang, D.Q. (2024) Evoagent: Towards Automatic Multi-Agent Generation via Evolutionary Algorithms.</mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Yuan, S.Y.</string-name>
              <string-name>Song, K.</string-name>
              <string-name>Chen, J.J.</string-name>
              <string-name>Tan, X.</string-name>
              <string-name>Li, D.S.</string-name>
              <string-name>Yang, D.Q.</string-name>
            </person-group>
            <year>2024</year>
            <article-title>Evoagent: Towards Automatic Multi-Agent Generation via Evolutionary Algorithms</article-title>
          </element-citation>
        </citation-alternatives>
      </ref>
    </ref-list>
  </back>
</article>