versionhq 1.2.3.8__py3-none-any.whl → 1.2.4.2__py3-none-any.whl

versionhq/task/structured_response.py

@@ -38,7 +38,9 @@ class StructuredObject:
             description = self.field.description if hasattr(self.field, "description") and self.field.description is not None else ""
             field_name = self.field.__name__ if hasattr(self.field, "__name__") and self.field.__name__ else self.title
             self.properties.update({ field_name : { "type": SchemaType(self.field.annotation.__args__).convert() }})
-            self.required.append(field_name)
+
+            if field_name not in self.required:
+                self.required.append(field_name)
 
             return {
                 self.title: {

versionhq/task_graph/draft.py

@@ -10,7 +10,7 @@ sys.modules['pydantic.main'].ModelMetaclass = ModelMetaclass
 
 from versionhq.agent.model import Agent
 from versionhq.task.model import ResponseField
-from versionhq.task_graph.model import TaskGraph, Task, DependencyType, Node
+from versionhq.task_graph.model import TaskGraph, Task, DependencyType, Node, ReformTriggerEvent
 from versionhq._utils.logger import Logger
 
 
@@ -33,12 +33,11 @@ def workflow(final_output: Type[BaseModel], context: Any = None, human: bool = F
 
     dep_type_prompt = ", ".join([k for k in DependencyType._member_map_.keys()])
 
-    graph_expert = Agent(
-        role="vhq-G Expert",
+    vhq_graph_expert = Agent(
+        role="vhq-Graph Expert",
         goal="design the most resource-efficient workflow graph to achieve the given goal",
         knowledge_sources=[
             "https://en.wikipedia.org/wiki/Graph_theory",
-            # "https://www.geeksforgeeks.org/graph-data-structure-and-algorithms/?ref=lbp",
             "https://www.geeksforgeeks.org/graph-and-its-representations/",
             ", ".join([k for k in DependencyType._member_map_.keys()]),
         ],
@@ -60,12 +59,16 @@ def workflow(final_output: Type[BaseModel], context: Any = None, human: bool = F
             ])
         ]
     )
-    res = task.execute(agent=graph_expert, context=[context_prompt, context])
+    res = task.execute(agent=vhq_graph_expert, context=[context_prompt, context])
 
     if not res:
         return None
 
-    task_items = res.json_dict["tasks"]
+    task_items = res.json_dict["tasks"] if "tasks" in res.json_dict else []
+
+    if not task_items:
+        return None
+
     tasks, nodes = [], []
 
     for item in task_items:
@@ -78,7 +81,8 @@ def workflow(final_output: Type[BaseModel], context: Any = None, human: bool = F
         nodes={node.identifier: node for node in nodes},
         concl_format=final_output,
         concl=None,
-        should_reform=True,
+        should_reform=human,
+        reform_trigger_event=ReformTriggerEvent.USER_INPUT if human else None,
     )
 
     for res in task_items:
@@ -92,18 +96,6 @@ def workflow(final_output: Type[BaseModel], context: Any = None, human: bool = F
                 task_graph.add_dependency(
                     source=source.identifier, target=target.identifier, dependency_type=dependency_type)
 
-
     task_graph.visualize()
 
-    if human:
-        print('Proceed? Y/n:')
-        x = input()
-
-        if x.lower() == "y":
-            print("ok. generating agent network")
-
-        else:
-            request = input("request?")
-            print('ok. regenerating the graph based on your input: ', request)
-
     return task_graph

versionhq/task_graph/model.py

@@ -15,7 +15,14 @@ from pydantic_core import PydanticCustomError
 
 from versionhq.agent.model import Agent
 from versionhq.task.model import Task, TaskOutput, Evaluation
-from versionhq._utils.logger import Logger
+from versionhq._utils import Logger
+
+
+class ReformTriggerEvent(enum.Enum):
+    USER_INPUT = 1 # ask human
+    TEST_TIME_COMPUTATION = 2 # mismatch between actual responses and expected outcome
+    ERROR_DETECTION = 3 # response error
+
 
 class ConditionType(enum.Enum):
     AND = 1
@@ -46,7 +53,6 @@ class Condition(BaseModel):
                 res = method(**args) if args else method()
                 return res
 
-
     def condition_met(self) -> bool:
         if not self.methods:
             return True
@@ -54,7 +60,6 @@ class Condition(BaseModel):
         if len(self.methods) == 1:
             for k, v in self.methods.items():
                return self._execute_method(key=k, method=v)
-
         else:
             cond_list = []
             for k, v in self.methods.items():
@@ -96,8 +101,8 @@ class Node(BaseModel):
 
     id: UUID4 = Field(default_factory=uuid.uuid4, frozen=True)
     task: InstanceOf[Task] = Field(default=None)
-    in_degree_nodes: List[Any] = Field(default_factory=list, description="list of Node objects")
-    out_degree_nodes: List[Any] = Field(default_factory=list, description="list of Node objects")
+    in_degree_nodes: List["Node"] = Field(default_factory=list, description="list of Node objects")
+    out_degree_nodes: List["Node"] = Field(default_factory=list, description="list of Node objects")
     assigned_to: InstanceOf[Agent] = Field(default=None)
     status: TaskStatus = Field(default=TaskStatus.NOT_STARTED)
 
@@ -107,29 +112,31 @@ class Node(BaseModel):
         if v:
             raise PydanticCustomError("may_not_set_field", "This field is not to be set by client.", {})
 
-
     def is_independent(self) -> bool:
         return not self.in_degree_nodes and not self.out_degree_nodes
 
     def handle_task_execution(self, agent: Agent = None, context: str = None, response_format: Type[BaseModel] = None) -> TaskOutput | None:
         """Executes the task and updates its status"""
 
-        self.status = TaskStatus.IN_PROGRESS
-
         if not self.task:
             Logger().log(level="error", message="Missing a task to execute. We'll return None.", color="red")
             self.status = TaskStatus.ERROR
             return None
 
-        agent = agent if agent else self.assigned_to
-        self.task.pydantic_output = self.task.pydantic_output if self.task.pydantic_output else response_format if type(response_format) == BaseModel else None
-        res = self.task.execute(agent=agent, context=context)
+        if self.status == TaskStatus.COMPLETED:
+            return self.task.output
 
-        if isinstance(res, Future): # activate async
-            res = res.result()
+        else:
+            self.status = TaskStatus.IN_PROGRESS
+            agent = agent if agent else self.assigned_to
+            self.task.pydantic_output = self.task.pydantic_output if self.task.pydantic_output else response_format if type(response_format) == BaseModel else None
+            res = self.task.execute(agent=agent, context=context)
 
-        self.status = TaskStatus.COMPLETED if res else TaskStatus.ERROR
-        return res
+            if isinstance(res, Future): # activate async
+                res = res.result()
+
+            self.status = TaskStatus.COMPLETED if res else TaskStatus.ERROR
+            return res
 
     @property
     def in_degrees(self) -> int:
@@ -238,7 +245,6 @@ class Edge(BaseModel):
         """
         Activates the edge to initiate task execution of the target node.
         """
-
         if not self.source or not self.target:
             Logger(verbose=True).log(level="warning", message="Cannot find source or target nodes. We'll return None.", color="yellow")
             return None
@@ -251,10 +257,11 @@ class Edge(BaseModel):
             import time
             time.sleep(self.lag)
 
-        context = self.source.task.output.raw if self.data_transfer else None
+        context = self.source.task.output._to_context_prompt() if self.data_transfer else None
         res = self.target.handle_task_execution(context=context, response_format=response_format)
         return res
 
+
     @property
     def label(self):
         """Human friendly label for visualization."""
@@ -283,6 +290,14 @@ class Graph(ABC, BaseModel):
         else:
             return None
 
+    def _format_Graph(self) -> None:
+        """Formats dxGraph using edges and nodes."""
+        edges, nodes = [k for k in self.edges.keys()], [k for k in self.nodes.keys()]
+        if self.graph:
+            self.graph.update(edges=edges, nodes=nodes)
+        else:
+            self.graph = nx.Graph(directed=self.directed, edges=edges, nodes=nodes)
+
     def add_node(self, node: Node) -> None:
         if node.identifier in self.nodes.keys():
             return
@@ -333,13 +348,14 @@ class Graph(ABC, BaseModel):
         critical_edge = max(edges, key=lambda item: item['weight']) if edges else None
         return critical_edge.target if critical_edge else None
 
-    def find_path(self, source: Optional[str] | None, target: str, weight: Optional[Any] | None) -> Any:
+    def find_path(self, target: str, source: Optional[str] = None, weight: Optional[Any] = None) -> Any:
         try:
+            self._format_Graph()
             return nx.shortest_path(self.graph, source=source, target=target, weight=weight)
-        except nx.NetworkXNoPath:
+        except:
             return None
 
-    def find_all_paths(self,  source: str, target: str) -> List[Any]:
+    def find_all_paths(self, source: str, target: str) -> List[Any]:
         return list(nx.all_simple_paths(self.graph, source=source, target=target))
 
     def find_critical_path(self) -> tuple[List[Any], int, Dict[str, int]]:
@@ -378,7 +394,8 @@ class Graph(ABC, BaseModel):
 
 class TaskGraph(Graph):
     id: UUID4 = Field(default_factory=uuid.uuid4, frozen=True)
-    should_reform: bool = Field(default=False)
+    should_reform: bool = False
+    reform_trigger_event: Optional[ReformTriggerEvent] = None
     outputs: Dict[str, TaskOutput] = Field(default_factory=dict, description="stores node identifier and TaskOutput")
     concl_template: Optional[Dict[str, Any] | Type[BaseModel]] = Field(default=None, description="stores final response format in Pydantic class or JSON dict")
     concl: Optional[TaskOutput] = Field(default=None, description="stores the final or latest conclusion of the entire task graph")
@@ -432,10 +449,8 @@ class TaskGraph(Graph):
         """
         Add an edge that connect task 1 (source) and task 2 (target) using task_node.name as an identifier
         """
-
-        if not edge_attributes:
-            Logger().log(level="error", message="Edge attributes are missing.", color="red")
-
+        # if not edge_attributes:
+        #     Logger().log(level="error", message="Edge attributes are missing.", color="red")
         edge = Edge()
         for k in Edge.model_fields.keys():
             v = edge_attributes.get(k, None)
@@ -443,7 +458,6 @@ class TaskGraph(Graph):
                 setattr(edge, k, v)
             else:
                 pass
-
         self.add_edge(source, target, edge)
 
 
@@ -554,15 +568,10 @@ class TaskGraph(Graph):
 
             # find a shortest path to each in-degree node of the node and see if dependency met.
             node = self._return_node_object(target)
-            sources = node.in_degrees
-            edge_status = []
+            edges = [v for k, v in self.edges.items() if v.target.identifier == node.identifier]
             res = None
 
-            for item in sources:
-                edge = self.find_path(source=item, target=target)
-                edge_status.append(dict(edge=edge if edge else None, dep_met=edge.dependency_met() if edge else False))
-
-            if len([item for item in edge_status if item["dep_met"] == True]) == len(sources):
+            if not edges or len([item for item in edges if item.dependency_met()]) == len(edges):
                 res = node.handle_task_execution()
                 self.outputs.update({ target: res })
 
@@ -598,7 +607,7 @@ class TaskGraph(Graph):
                                     res = node.handle_task_execution()
                                     self.outputs.update({ node.identifier: res })
                 else:
-                    for k, edge in self.edges.items():
+                    for edge in self.edges.values():
                         res = edge.activate()
                         node_identifier = edge.target.identifier
                         self.outputs.update({ node_identifier: res })
@@ -614,6 +623,15 @@ class TaskGraph(Graph):
                     node_identifier = edge.target.identifier
                     self.outputs.update({ node_identifier: res })
 
+
+            if self.should_reform:
+                target = [k for k in self.outputs.keys()][-1] if self.outputs else self.find_start_nodes()[0].identifier if self.find_start_nodes() else None
+
+                if not target:
+                    pass
+                else:
+                    res, _ = self.handle_reform(target=target)
+
             self.concl = res
             self.concl_template = self.concl_template if self.concl_template else res.pydantic.__class__ if res.pydantic else None
              # last_task_output = [v for v in self.outputs.values()][len([v for v in self.outputs.values()]) - 1] if [v for v in self.outputs.values()] else None
@@ -639,6 +657,44 @@ class TaskGraph(Graph):
         return eval
 
 
+    def _handle_human_input(self) -> str | None:
+        """Handles input from human."""
+        request = None
+
+        print('Proceed? Y/n:')
+        x = input()
+
+        if x.lower() == "y":
+            Logger().log(message="Ok, proceeding to the next graph execution.", level="info", color="blue")
+
+        else:
+            request = input("Request?")
+
+            if request:
+                Logger().log(message=f"Ok. regenerating the graph based on your input: ', {request}", level="info", color="blue")
+            else:
+                Logger().log(message="Cannot recognize your request.", level="error", color="red")
+
+        return request
+
+
+    def handle_reform(self, target: str = None) -> Self:
+        task_description = "Improve the given output: "
+        if target:
+            output = self.outputs[target].raw if self.outputs and target in self.outputs else None
+            if output:
+                task_description += str(output)
+
+        if self.reform_trigger_event == ReformTriggerEvent.USER_INPUT:
+            request = self._handle_human_input()
+            task_description += f"You MUST follow the instruction: {request}"
+
+        new_node = Node(task=Task(description=task_description))
+        self.add_node(node=new_node)
+        self.add_dependency(source=target, target=new_node.identifier)
+        return self.activate(target=new_node.identifier)
+
+
     @property
     def usage(self) -> Tuple[int, float]:
         """Returns aggregate number of consumed tokens and job latency in ms during the activation"""

{versionhq-1.2.3.8.dist-info → versionhq-1.2.4.2.dist-info}/METADATA

@@ -1,7 +1,7 @@
 Metadata-Version: 2.2
 Name: versionhq
-Version: 1.2.3.8
-Summary: An agentic orchestration framework for building agent networks that handle task automation.
+Version: 1.2.4.2
+Summary: Autonomous agent networks for task automation with multi-step reasoning.
 Author-email: Kuriko Iwai <kuriko@versi0n.io>
 License: MIT License
         
@@ -29,7 +29,7 @@ Project-URL: Homepage, https://versi0n.io
 Project-URL: Documentation, https://docs.versi0n.io
 Project-URL: Repository, https://github.com/versionHQ/multi-agent-system
 Project-URL: Issues, https://github.com/versionHQ/multi-agent-system/issues
-Keywords: orchestration framework,orchestration,ai agent,multi-agent system,RAG,agent,agentic orchestration,llm
+Keywords: autonomic agent networks,deep agent,agentic orchestration framework
 Classifier: Programming Language :: Python
 Classifier: Programming Language :: Python :: 3
 Classifier: Programming Language :: Python :: 3.11
@@ -47,12 +47,9 @@ License-File: LICENSE
 Requires-Dist: regex==2024.11.6
 Requires-Dist: requests>=2.32.3
 Requires-Dist: pydantic>=2.10.6
-Requires-Dist: werkzeug>=3.1.3
 Requires-Dist: typing>=0.0.0
 Requires-Dist: json-repair>=0.0.0
 Requires-Dist: litellm>=1.55.8
-Requires-Dist: openai>=1.64.0
-Requires-Dist: composio-openai>=0.6.9
 Requires-Dist: composio>=0.1.0
 Requires-Dist: setuptools>=75.6.0
 Requires-Dist: wheel>=0.45.1
@@ -60,10 +57,8 @@ Requires-Dist: python-dotenv>=1.0.0
 Requires-Dist: appdirs>=1.4.4
 Requires-Dist: langchain>=0.3.14
 Requires-Dist: langchain-openai>=0.2.14
-Requires-Dist: composio-langchain>=0.6.12
 Requires-Dist: chromadb>=0.6.3
 Requires-Dist: wheel>=0.45.1
-Requires-Dist: envoy>=0.0.3
 Requires-Dist: composio-core==0.7.0
 Requires-Dist: networkx>=3.4.2
 Requires-Dist: matplotlib>=3.10.0
@@ -88,15 +83,15 @@ Requires-Dist: torchvision>=0.21.0; extra == "torch"
 
 # Overview
 
-[![DL](https://img.shields.io/badge/Download-20K+-red)](https://clickpy.clickhouse.com/dashboard/versionhq)
+[![DL](https://img.shields.io/badge/Download-30K+-red)](https://clickpy.clickhouse.com/dashboard/versionhq)
 ![MIT license](https://img.shields.io/badge/License-MIT-green)
 [![Publisher](https://github.com/versionHQ/multi-agent-system/actions/workflows/publish.yml/badge.svg)](https://github.com/versionHQ/multi-agent-system/actions/workflows/publish.yml)
-![PyPI](https://img.shields.io/badge/PyPI-v1.2.2+-blue)
+![PyPI](https://img.shields.io/badge/PythonSDK-v1.2.4+-blue)
 ![python ver](https://img.shields.io/badge/Python-3.11|3.12|3.13-purple)
 ![pyenv ver](https://img.shields.io/badge/pyenv-2.5.0-orange)
 
 
-Agentic orchestration framework for multi-agent networks and task graphs for complex task automation.
+A Python framework for autonomous agent networks that handle task automation with multi-step reasoning.
 
 **Visit:**
 
@@ -154,11 +149,11 @@ Agents adapt their formation based on task complexity.
 You can specify a desired formation or allow the agents to determine it autonomously (default).
 
 
-|  | **Solo Agent** | **Supervising** | **Squad** | **Random** |
-| :--- | :--- | :--- | :--- | :--- |
-| **Formation** | <img src="https://res.cloudinary.com/dfeirxlea/image/upload/v1738818211/pj_m_agents/rbgxttfoeqqis1ettlfz.png" alt="solo" width="200"> | <img src="https://res.cloudinary.com/dfeirxlea/image/upload/v1738818211/pj_m_agents/zhungor3elxzer5dum10.png" alt="solo" width="200"> | <img src="https://res.cloudinary.com/dfeirxlea/image/upload/v1738818211/pj_m_agents/dnusl7iy7kiwkxwlpmg8.png" alt="solo" width="200"> | <img src="https://res.cloudinary.com/dfeirxlea/image/upload/v1738818211/pj_m_agents/sndpczatfzbrosxz9ama.png" alt="solo" width="200"> |
-| **Usage** | <ul><li>A single agent with tools, knowledge, and memory.</li><li>When self-learning mode is on - it will turn into **Random** formation.</li></ul> | <ul><li>Leader agent gives directions, while sharing its knowledge and memory.</li><li>Subordinates can be solo agents or networks.</li></ul> | <ul><li>Share tasks, knowledge, and memory among network members.</li></ul> | <ul><li>A single agent handles tasks, asking help from other agents without sharing its memory or knowledge.</li></ul> |
-| **Use case** | An email agent drafts promo message for the given audience. | The leader agent strategizes an outbound campaign plan and assigns components such as media mix or message creation to subordinate agents. | An email agent and social media agent share the product knowledge and deploy multi-channel outbound campaign. | 1. An email agent drafts promo message for the given audience, asking insights on tones from other email agents which oversee other clusters. 2. An agent calls the external agent to deploy the campaign. |
+|                 | **Solo Agent**  | **Supervising**  | **Squad**         | **Random**      |
+| :---            | :---            | :---             | :---              | :---            |
+| **Formation**   | <img src="https://res.cloudinary.com/dfeirxlea/image/upload/v1738818211/pj_m_agents/rbgxttfoeqqis1ettlfz.png" alt="solo" width="200"> | <img src="https://res.cloudinary.com/dfeirxlea/image/upload/v1738818211/pj_m_agents/zhungor3elxzer5dum10.png" alt="solo" width="200"> | <img src="https://res.cloudinary.com/dfeirxlea/image/upload/v1738818211/pj_m_agents/dnusl7iy7kiwkxwlpmg8.png" alt="solo" width="200"> | <img src="https://res.cloudinary.com/dfeirxlea/image/upload/v1738818211/pj_m_agents/sndpczatfzbrosxz9ama.png" alt="solo" width="200"> |
+| **Usage**       | <ul><li>A single agent with tools, knowledge, and memory.</li><li>When self-learning mode is on - it will turn into **Random** formation.</li></ul> | <ul><li>Leader agent gives directions, while sharing its knowledge and memory.</li><li>Subordinates can be solo agents or networks.</li></ul> | <ul><li>Share tasks, knowledge, and memory among network members.</li></ul> | <ul><li>A single agent handles tasks, asking help from other agents without sharing its memory or knowledge.</li></ul> |
+| **Use case**    | An email agent drafts promo message for the given audience. | The leader agent strategizes an outbound campaign plan and assigns components such as media mix or message creation to subordinate agents. | An email agent and social media agent share the product knowledge and deploy multi-channel outbound campaign. | 1. An email agent drafts promo message for the given audience, asking insights on tones from other email agents which oversee other clusters. 2. An agent calls the external agent to deploy the campaign. |
 
 <hr />
 

{versionhq-1.2.3.8.dist-info → versionhq-1.2.4.2.dist-info}/RECORD

@@ -1,6 +1,10 @@
-versionhq/__init__.py,sha256=-XmzMUZrIz4XrCUOjV4K8kAbNGaSeptDjYOyWfMUYOc,2980
-versionhq/_utils/__init__.py,sha256=d-vYVcORZKG-kkLe_fzE8VbViDpAk9DDOKe2fVK25ew,178
+versionhq/__init__.py,sha256=m36KgpiM94kUCZJm-JA7gPWjb7gNgMHHXUAbxzKlIOs,3026
+versionhq/_prompt/auto_feedback.py,sha256=iIa3ReiFqs-JA2Q4Y_VnLV-DbXPelEVSMHTw3tICVTE,3892
+versionhq/_prompt/constants.py,sha256=DOwUFnVVObEFqgnaMCDnW8fnw1oPMgS8JAqOiTuqleI,932
+versionhq/_prompt/model.py,sha256=GQPaC_Vj1wQ69ZHlzXWdtdif8UeF6WK1jN3JrFEcCt0,8662
+versionhq/_utils/__init__.py,sha256=llXOcGFlR9YF5iMI5uFb4twvM9wo-vmoMw8y1KzQVVc,233
 versionhq/_utils/i18n.py,sha256=TwA_PnYfDLA6VqlUDPuybdV9lgi3Frh_ASsb_X8jJo8,1483
+versionhq/_utils/is_valid_url.py,sha256=m8Mswvb-90FJtx1Heq6hPFDbwGgrv_R3wSbZQmEPM9Q,379
 versionhq/_utils/llm_as_a_judge.py,sha256=RM0oYfoeanuUyUL3Ewl6_8Xn1F5Axd285UMH46kxG1I,2378
 versionhq/_utils/logger.py,sha256=iHxGjm3BvUo5dHKLU88_pc0Z45wzSHOjyJGQkb7OADk,3255
 versionhq/_utils/process_config.py,sha256=YTGY_erW335RfceQfzS18YAqq-AAb-iSvKSjN7noD2E,782
@@ -8,14 +12,14 @@ versionhq/_utils/usage_metrics.py,sha256=xgYGRW3OTuK9EJyi3QYJeYcJl7dL27olcWaLo_7
 versionhq/_utils/vars.py,sha256=bZ5Dx_bFKlt3hi4-NNGXqdk7B23If_WaTIju2fiTyPQ,57
 versionhq/agent/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
 versionhq/agent/inhouse_agents.py,sha256=BPkvEyMH8VnZWsMeCwsGplDT_kLwlIejeRcr-6ItGqQ,2637
-versionhq/agent/model.py,sha256=xKfg20EdL11HiFbG7V7ErHlFSDpvh5lopnHDfWULJM4,25996
+versionhq/agent/model.py,sha256=Zom5G0ubq4TWGWF6PK631-6puCjcdHYKj0R355GS9T8,24480
 versionhq/agent/parser.py,sha256=riG0dkdQCxH7uJ0AbdVdg7WvL0BXhUgJht0VtQvxJBc,4082
 versionhq/agent/rpm_controller.py,sha256=grezIxyBci_lDlwAlgWFRyR5KOocXeOhYkgN02dNFNE,2360
 versionhq/agent/TEMPLATES/Backstory.py,sha256=dkfuATUQ2g2WoUKkmgAIch-RB--bektGoQaUlsDOn0g,529
 versionhq/agent/TEMPLATES/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
 versionhq/agent_network/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
-versionhq/agent_network/formation.py,sha256=CYKNUeKC392wW3leIDIAaGiKADSsumC_vTe0VOnNwRs,7901
-versionhq/agent_network/model.py,sha256=aSGZf-ZLi4I2Da9-RW8CfZ32hk9MN_RIT9Cl4xvHlE8,16050
+versionhq/agent_network/formation.py,sha256=WkAbmE2-Oqw8KWDcqqHU_s98QzGJWNQ_YCAls6ZuQbg,8260
+versionhq/agent_network/model.py,sha256=-vLBqPCtfLxTf17toJkE7Gkxg1SwlrA-Frf2Pc_uB50,16021
 versionhq/cli/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
 versionhq/clients/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
 versionhq/clients/customer/__init__.py,sha256=-YXh1FQfvpfLacK8SUC7bD7Wx_eIEi4yrkCC_cUasFg,217
@@ -29,11 +33,11 @@ versionhq/knowledge/_utils.py,sha256=YWRF8U533cfZes_gZqUvdj-K24MD2ri1R0gjc_aPYyc
 versionhq/knowledge/embedding.py,sha256=KfHc__1THxb5jrg1EMrF-v944RDuIr2hE0l-MtM3Bp0,6826
 versionhq/knowledge/model.py,sha256=ixH8n5kLtJEp1nPAFYA0piYm-n0nnFDtWFp0r9YEVAs,1787
 versionhq/knowledge/source.py,sha256=-hEUPtJUHHMx4rUKtiHl19J8xAMw-WVBw34zwa2jZ08,13630
-versionhq/knowledge/source_docling.py,sha256=dcu1ITqPXwWZ_lK-6tykEKhhC82eNRTMoWRpxK9Kzls,5441
+versionhq/knowledge/source_docling.py,sha256=XpavmLvh4dLcuTikj8MCE9KG52oQMafy7_wBneliMK0,4994
 versionhq/knowledge/storage.py,sha256=Kd-4r6aWM5EDaoXrzKXbgi1hY6tysSQARPGXM95qMmU,8266
 versionhq/llm/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
 versionhq/llm/llm_vars.py,sha256=qSG-_pYeWksdMmwASXpjQqf97fMovsY4lNTSCHQF88k,5694
-versionhq/llm/model.py,sha256=W9zcrC18zEz8BKKG2HJ2rO-8rdphif7sdiAHNc9oJbU,17400
+versionhq/llm/model.py,sha256=P4J6ZU0vY5HU7XHLelz7oznPmeEElHPFsAo-2Vd8DQ0,17255
 versionhq/memory/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
 versionhq/memory/contextual_memory.py,sha256=QEMVvHuEXxY7M6-12S8HhyFKf108KfX8Zzt7paPW048,3882
 versionhq/memory/model.py,sha256=VQR1229t7GQPMItlGAHLtJrb6LrZfSoRA1DRW4z0SOU,8234
@@ -45,15 +49,15 @@ versionhq/storage/rag_storage.py,sha256=bS2eE874obarYl-4hT6ZWYWTRsqtfuGpKgKzERmM
 versionhq/storage/task_output_storage.py,sha256=M8vInLJ5idGAq17w1juHKXtyPyF-B-rK_P8UcqD-Px8,5357
 versionhq/storage/utils.py,sha256=r5ghA_ktdR2IuzlzKqZYCjsNxztEMzyhWLneA4cFuWY,748
 versionhq/task/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
-versionhq/task/evaluation.py,sha256=yKnqj3UwdNAMaFEBZmWWf0Hc09-M9hM8VETnaovlFco,3817
+versionhq/task/evaluation.py,sha256=qQSA5ZWTWA3he54ystsYpTKXJWv68gBL6DCq8ZW1bl8,3813
 versionhq/task/formatter.py,sha256=N8Kmk9vtrMtBdgJ8J7RmlKNMdZWSmV8O1bDexmCWgU0,643
-versionhq/task/model.py,sha256=8HQLzzAfM03gHL5M_7oL7UW-mZvI7rPCJ2Jxsv49VtI,29122
-versionhq/task/structured_response.py,sha256=4q-hQPu7oMMHHXEzh9YW4SJ7N5eCZ7OfZ65juyl_jCI,5000
+versionhq/task/model.py,sha256=YsuxbohcXLwE1qB8-lPnl_sFWQJ7CPqKDbYbf8CeZww,28879
+versionhq/task/structured_response.py,sha256=tqOHpch8CVmMj0aZXjdDWtPNcVmBW8DVZnBvPBwS4PM,5053
 versionhq/task/TEMPLATES/Description.py,sha256=hKhpbz0ztbkUMXz9KiL-P40fis9OB5ICOdL9jCtgAhU,864
 versionhq/task_graph/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
 versionhq/task_graph/colors.py,sha256=naJCx4Vho4iuJtbW8USUXb-M5uYvd5ds2p8qbjUfRus,669
-versionhq/task_graph/draft.py,sha256=l18XacRsbDhAv6CvKMnUMI26IDuizA1UNWHbL1q5gn4,5099
-versionhq/task_graph/model.py,sha256=3DzZXP4SSJP3xdgZfkJDgFXUjQ05CSYFoisShfmSdcs,26582
+versionhq/task_graph/draft.py,sha256=0zDRx1-PXIwuB_RkdKQTHgqjm-5VrJHhljBIlYRX6EM,4919
+versionhq/task_graph/model.py,sha256=T7-Rj05q9gKIXPNwPdr1cOjnxNQdNicEFg2WIApO9Og,28877
 versionhq/tool/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
 versionhq/tool/cache_handler.py,sha256=iL8FH7X0G-cdT0uhJwzuhLDaadTXOdfybZcDy151-es,1085
 versionhq/tool/composio_tool.py,sha256=IATfsEnF_1RPJyGtPBmAtEJh5XPcgDHpyG3SUR461Og,8572
@@ -62,8 +66,8 @@ versionhq/tool/decorator.py,sha256=C4ZM7Xi2gwtEMaSeRo-geo_g_MAkY77WkSLkAuY0AyI,1
 versionhq/tool/model.py,sha256=ve9C4WyiRjQigOU0hRWVxtSUWAQNntlmeW-_DL0_lJY,12328
 versionhq/tool/rag_tool.py,sha256=dW5o-83V4bMFFJEj3PUm7XjblwrYJGmZVBlCpPj6CeM,3852
 versionhq/tool/tool_handler.py,sha256=2m41K8qo5bGCCbwMFferEjT-XZ-mE9F0mDUOBkgivOI,1416
-versionhq-1.2.3.8.dist-info/LICENSE,sha256=cRoGGdM73IiDs6nDWKqPlgSv7aR4n-qBXYnJlCMHCeE,1082
-versionhq-1.2.3.8.dist-info/METADATA,sha256=c-aVXe5FBs_a_YPXQN4HBxfAJZv7ZxR0c1f_5cAsuKg,21262
-versionhq-1.2.3.8.dist-info/WHEEL,sha256=jB7zZ3N9hIM9adW7qlTAyycLYW9npaWKLRzaoVcLKcM,91
-versionhq-1.2.3.8.dist-info/top_level.txt,sha256=DClQwxDWqIUGeRJkA8vBlgeNsYZs4_nJWMonzFt5Wj0,10
-versionhq-1.2.3.8.dist-info/RECORD,,
+versionhq-1.2.4.2.dist-info/LICENSE,sha256=cRoGGdM73IiDs6nDWKqPlgSv7aR4n-qBXYnJlCMHCeE,1082
+versionhq-1.2.4.2.dist-info/METADATA,sha256=qQ2-yJwPEuN62-SfvREXpqf3dDJc3xkwMrACWx5JYm8,21146
+versionhq-1.2.4.2.dist-info/WHEEL,sha256=52BFRY2Up02UkjOa29eZOS2VxUrpPORXg1pkohGGUS8,91
+versionhq-1.2.4.2.dist-info/top_level.txt,sha256=DClQwxDWqIUGeRJkA8vBlgeNsYZs4_nJWMonzFt5Wj0,10
+versionhq-1.2.4.2.dist-info/RECORD,,

{versionhq-1.2.3.8.dist-info → versionhq-1.2.4.2.dist-info}/WHEEL

@@ -1,5 +1,5 @@
 Wheel-Version: 1.0
-Generator: setuptools (75.8.2)
+Generator: setuptools (76.0.0)
 Root-Is-Purelib: true
 Tag: py3-none-any