nucliadb 6.4.0.post4146__py3-none-any.whl → 6.4.0.post4161__py3-none-any.whl

nucliadb/search/search/find_merge.py

@@ -68,6 +68,9 @@ FIND_FETCH_OPS_DISTRIBUTION = metrics.Histogram(
     buckets=[1, 5, 10, 20, 30, 40, 50, 60, 80, 100, 200],
 )
 
+# Constant score given to all graph results until we implement graph scoring
+FAKE_GRAPH_SCORE = 1.0
+
 
 @merge_observer.wrap({"type": "find_merge"})
 async def build_find_response(
@@ -103,14 +106,9 @@ async def build_find_response(
             search_response.vector.documents,
         )
     )
+    graph_results = graph_results_to_text_block_matches(search_response.graph)
 
-    merged_text_blocks: list[TextBlockMatch]
-    if len(keyword_results) == 0:
-        merged_text_blocks = semantic_results
-    elif len(semantic_results) == 0:
-        merged_text_blocks = keyword_results
-    else:
-        merged_text_blocks = rank_fusion_algorithm.fuse(keyword_results, semantic_results)
+    merged_text_blocks = rank_fusion_algorithm.fuse(keyword_results, semantic_results, graph_results)
 
     # cut
     # we assume pagination + predict reranker is forbidden and has been already
@@ -336,6 +334,43 @@ def semantic_results_to_text_block_matches(items: Iterable[DocumentScored]) -> l
     return text_blocks
 
 
+def graph_results_to_text_block_matches(item: GraphSearchResponse) -> list[TextBlockMatch]:
+    matches = []
+    for path in item.graph:
+        metadata = path.metadata
+
+        if not metadata.paragraph_id:
+            continue
+
+        paragraph_id = ParagraphId.from_string(metadata.paragraph_id)
+        matches.append(
+            TextBlockMatch(
+                paragraph_id=paragraph_id,
+                score=FAKE_GRAPH_SCORE,
+                score_type=SCORE_TYPE.RELATION_RELEVANCE,
+                order=0,  # NOTE: this will be filled later
+                text="",  # NOTE: this will be filled later too
+                position=TextPosition(
+                    page_number=0,
+                    index=0,
+                    start=paragraph_id.paragraph_start,
+                    end=paragraph_id.paragraph_end,
+                    start_seconds=[],
+                    end_seconds=[],
+                ),
+                # XXX: we should split labels
+                field_labels=[],
+                paragraph_labels=[],
+                fuzzy_search=False,  # TODO: this depends on the query, should we populate it?
+                is_a_table=False,
+                representation_file="",
+                page_with_visual=False,
+            )
+        )
+
+    return matches
+
+
 @merge_observer.wrap({"type": "hydrate_and_rerank"})
 async def hydrate_and_rerank(
     text_blocks: Iterable[TextBlockMatch],

nucliadb/search/search/query_parser/models.py

@@ -26,6 +26,7 @@ from pydantic import BaseModel, ConfigDict, Field
 
 from nucliadb.search.search.query_parser.fetcher import Fetcher
 from nucliadb_models import search as search_models
+from nucliadb_models.graph.requests import GraphPathQuery
 from nucliadb_protos import utils_pb2
 
 ### Retrieval
@@ -61,11 +62,16 @@ class RelationQuery(BaseModel):
     deleted_entities: dict[str, list[str]]
 
 
+class GraphQuery(BaseModel):
+    query: GraphPathQuery
+
+
 class Query(BaseModel):
     fulltext: Optional[FulltextQuery] = None
     keyword: Optional[KeywordQuery] = None
     semantic: Optional[SemanticQuery] = None
     relation: Optional[RelationQuery] = None
+    graph: Optional[GraphQuery] = None
 
 
 # filters
@@ -180,3 +186,7 @@ class CatalogQuery(BaseModel):
 # Right now, we don't need a more generic model for graph queries, we can
 # directly use the protobuffer directly
 GraphRetrieval = nodereader_pb2.GraphSearchRequest
+
+
+# We need this to avoid issues with pydantic and generic types defined in another module
+GraphQuery.model_rebuild()

nucliadb/search/search/query_parser/parsers/find.py

@@ -31,6 +31,7 @@ from nucliadb.search.search.query_parser.fetcher import Fetcher
 from nucliadb.search.search.query_parser.filter_expression import parse_expression
 from nucliadb.search.search.query_parser.models import (
     Filters,
+    GraphQuery,
     NoopReranker,
     ParsedQuery,
     PredictReranker,
@@ -112,7 +113,8 @@ class _FindParser:
         if search_models.FindOptions.RELATIONS in self.item.features:
             self._query.relation = await self._parse_relation_query()
 
-        # TODO: graph search
+        if search_models.FindOptions.GRAPH in self.item.features:
+            self._query.graph = await self._parse_graph_query()
 
         filters = await self._parse_filters()
 
@@ -151,6 +153,7 @@ class _FindParser:
             and (
                 search_models.FindOptions.SEMANTIC in self.item.features
                 or search_models.FindOptions.RELATIONS in self.item.features
+                or search_models.FindOptions.GRAPH in self.item.features
             )
         ):
             raise InvalidQueryError(
@@ -162,6 +165,9 @@ class _FindParser:
             if should_disable_vector_search(self.item):
                 self.item.features.remove(search_models.FindOptions.SEMANTIC)
 
+        if self.item.graph_query and search_models.FindOptions.GRAPH not in self.item.features:
+            raise InvalidQueryError("graph_query", "Using a graph query requires enabling graph feature")
+
     async def _parse_relation_query(self) -> RelationQuery:
         detected_entities = await self._get_detected_entities()
 
@@ -176,6 +182,13 @@ class _FindParser:
             deleted_entities=deleted_entities,
         )
 
+    async def _parse_graph_query(self) -> GraphQuery:
+        if self.item.graph_query is None:
+            raise InvalidQueryError(
+                "graph_query", "Graph query must be provided when using graph search"
+            )
+        return GraphQuery(query=self.item.graph_query)
+
     async def _get_detected_entities(self) -> list[utils_pb2.RelationNode]:
         """Get entities from request, either automatically detected or
         explicitly set by the user."""

nucliadb/search/search/query_parser/parsers/graph.py

@@ -33,7 +33,7 @@ from nucliadb_protos import utils_pb2
 
 async def parse_graph_search(kbid: str, item: graph_requests.GraphSearchRequest) -> GraphRetrieval:
     pb = await _parse_common(kbid, item)
-    pb.query.path.CopyFrom(_parse_path_query(item.query))
+    pb.query.path.CopyFrom(parse_path_query(item.query))
     pb.kind = nodereader_pb2.GraphSearchRequest.QueryKind.PATH
     return pb
 
@@ -111,19 +111,19 @@ def _parse_security(kbid: str, item: AnyGraphRequest) -> Optional[utils_pb2.Secu
         return None
 
 
-def _parse_path_query(expr: graph_requests.GraphPathQuery) -> nodereader_pb2.GraphQuery.PathQuery:
+def parse_path_query(expr: graph_requests.GraphPathQuery) -> nodereader_pb2.GraphQuery.PathQuery:
     pb = nodereader_pb2.GraphQuery.PathQuery()
 
     if isinstance(expr, graph_requests.And):
         for op in expr.operands:
-            pb.bool_and.operands.append(_parse_path_query(op))
+            pb.bool_and.operands.append(parse_path_query(op))
 
     elif isinstance(expr, graph_requests.Or):
         for op in expr.operands:
-            pb.bool_or.operands.append(_parse_path_query(op))
+            pb.bool_or.operands.append(parse_path_query(op))
 
     elif isinstance(expr, graph_requests.Not):
-        pb.bool_not.CopyFrom(_parse_path_query(expr.operand))
+        pb.bool_not.CopyFrom(parse_path_query(expr.operand))
 
     elif isinstance(expr, graph_requests.GraphPath):
         if expr.source is not None:

nucliadb/search/search/query_parser/parsers/unit_retrieval.py

@@ -27,6 +27,7 @@ from nucliadb.search.search.metrics import node_features, query_parser_observer
 from nucliadb.search.search.query import apply_entities_filter, get_sort_field_proto
 from nucliadb.search.search.query_parser.filter_expression import add_and_expression
 from nucliadb.search.search.query_parser.models import ParsedQuery, PredictReranker, UnitRetrieval
+from nucliadb.search.search.query_parser.parsers.graph import parse_path_query
 from nucliadb_models.labels import LABEL_HIDDEN, translate_system_to_alias_label
 from nucliadb_models.search import SortOrderMap
 from nucliadb_protos import utils_pb2
@@ -71,11 +72,12 @@ class _Converter:
         self._apply_text_queries()
         self._apply_semantic_query()
         self._apply_relation_query()
+        self._apply_graph_query()
         self._apply_filters()
         self._apply_top_k()
         return self.req
 
-    def _apply_text_queries(self):
+    def _apply_text_queries(self) -> None:
         text_query = self.retrieval.query.keyword or self.retrieval.query.fulltext
         if text_query is None:
             return
@@ -105,7 +107,7 @@ class _Converter:
             self.req.order.sort_by = sort_field
             self.req.order.type = SortOrderMap[text_query.sort]  # type: ignore
 
-    def _apply_semantic_query(self):
+    def _apply_semantic_query(self) -> None:
         if self.retrieval.query.semantic is None:
             return
 
@@ -118,7 +120,7 @@ class _Converter:
             self.req.vectorset = self.retrieval.query.semantic.vectorset
             self.req.vector.extend(query_vector)
 
-    def _apply_relation_query(self):
+    def _apply_relation_query(self) -> None:
         """Relation queries are the legacy way to query the knowledge graph.
         Given a set of entry points and some subtypes and entities to exclude
         from search, it'd find the distance 1 neighbours (BFS)."""
@@ -203,7 +205,14 @@ class _Converter:
         else:
             self.req.graph_search.query.path.bool_and.operands.extend(subqueries)
 
-    def _apply_filters(self):
+    def _apply_graph_query(self) -> None:
+        if self.retrieval.query.graph is None:
+            return
+
+        q = parse_path_query(self.retrieval.query.graph.query)
+        self.req.graph_search.query.path.CopyFrom(q)
+
+    def _apply_filters(self) -> None:
         self.req.with_duplicates = self.retrieval.filters.with_duplicates
 
         self.req.faceted.labels.extend(
@@ -239,7 +248,7 @@ class _Converter:
 
             add_and_expression(self.req.field_filter, expr)
 
-    def _apply_top_k(self):
+    def _apply_top_k(self) -> None:
         """Adjust requested page size depending on rank fusion and reranking
         algorithms.
 

nucliadb/search/search/rank_fusion.py

@@ -19,7 +19,6 @@
 #
 import logging
 from abc import ABC, abstractmethod
-from typing import Iterable
 
 from nucliadb.common.external_index_providers.base import TextBlockMatch
 from nucliadb.common.ids import ParagraphId
@@ -62,50 +61,40 @@ class RankFusionAlgorithm(ABC):
         return self._window
 
     def fuse(
-        self, keyword: Iterable[TextBlockMatch], semantic: Iterable[TextBlockMatch]
+        self,
+        keyword: list[TextBlockMatch],
+        semantic: list[TextBlockMatch],
+        graph: list[TextBlockMatch],
     ) -> list[TextBlockMatch]:
         """Fuse keyword and semantic results and return a list with the merged
         results.
 
-        """
-        merged = self._fuse(keyword, semantic)
-        return merged
-
-    @abstractmethod
-    def _fuse(
-        self, keyword: Iterable[TextBlockMatch], semantic: Iterable[TextBlockMatch]
-    ) -> list[TextBlockMatch]: ...
-
-
-class LegacyRankFusion(RankFusionAlgorithm):
-    """Legacy algorithm that given results from keyword and semantic search,
-    mixes them in the following way:
-    - 1st result from keyword search
-    - 2nd result from semantic search
-    - 2 keyword results and 1 semantic (and repeat)
-
-    """
-
-    @rank_fusion_observer.wrap({"type": "legacy"})
-    def _fuse(
-        self, keyword: Iterable[TextBlockMatch], semantic: Iterable[TextBlockMatch]
-    ) -> list[TextBlockMatch]:
-        merged: list[TextBlockMatch] = []
+        If only one retriever is provided, rank fusion will be skipped.
 
+        """
         # sort results by it's score before merging them
         keyword = [k for k in sorted(keyword, key=lambda r: r.score, reverse=True)]
         semantic = [s for s in sorted(semantic, key=lambda r: r.score, reverse=True)]
+        graph = [g for g in graph]
 
-        for k in keyword:
-            merged.append(k)
-
-        nextpos = 1
-        for s in semantic:
-            merged.insert(nextpos, s)
-            nextpos += 3
-
+        retrievals_with_results = [x for x in (keyword, semantic, graph) if len(x) > 0]
+        if len(retrievals_with_results) == 1:
+            return retrievals_with_results[0]
+        else:
+            merged = self._fuse(keyword, semantic, graph)
         return merged
 
+    @abstractmethod
+    def _fuse(
+        self,
+        keyword: list[TextBlockMatch],
+        semantic: list[TextBlockMatch],
+        graph: list[TextBlockMatch],
+    ) -> list[TextBlockMatch]:
+        """Rank fusion implementation. All arguments are assumed to be ordered
+        by decreasing score."""
+        ...
+
 
 class ReciprocalRankFusion(RankFusionAlgorithm):
     """Rank-based rank fusion algorithm. Discounts the weight of documents
@@ -132,6 +121,7 @@ class ReciprocalRankFusion(RankFusionAlgorithm):
         window: int,
         keyword_weight: float = 1.0,
         semantic_weight: float = 1.0,
+        graph_weight: float = 1.0,
     ):
         super().__init__(window)
         # Constant used in RRF, studies agree on 60 as a good default value
@@ -141,21 +131,22 @@ class ReciprocalRankFusion(RankFusionAlgorithm):
         self._k = k
         self._keyword_boost = keyword_weight
         self._semantic_boost = semantic_weight
+        self._graph_boost = graph_weight
 
     @rank_fusion_observer.wrap({"type": "reciprocal_rank_fusion"})
     def _fuse(
-        self, keyword: Iterable[TextBlockMatch], semantic: Iterable[TextBlockMatch]
+        self,
+        keyword: list[TextBlockMatch],
+        semantic: list[TextBlockMatch],
+        graph: list[TextBlockMatch],
     ) -> list[TextBlockMatch]:
         scores: dict[ParagraphId, tuple[float, SCORE_TYPE]] = {}
         match_positions: dict[ParagraphId, list[tuple[int, int]]] = {}
 
-        # sort results by it's score before merging them
-        keyword = [k for k in sorted(keyword, key=lambda r: r.score, reverse=True)]
-        semantic = [s for s in sorted(semantic, key=lambda r: r.score, reverse=True)]
-
         rankings = [
             (keyword, self._keyword_boost),
             (semantic, self._semantic_boost),
+            (graph, self._graph_boost),
         ]
         for r, (ranking, boost) in enumerate(rankings):
             for i, result in enumerate(ranking):
@@ -195,6 +186,7 @@ def get_rank_fusion(rank_fusion: parser_models.RankFusion) -> RankFusionAlgorith
             window=window,
             keyword_weight=rank_fusion.boosting.keyword,
             semantic_weight=rank_fusion.boosting.semantic,
+            graph_weight=rank_fusion.boosting.graph,
         )
 
     else:

nucliadb/writer/resource/basic.py

@@ -159,6 +159,7 @@ def parse_basic_modify(bm: BrokerMessage, item: ComingResourcePayload, toprocess
                     source=relation_node_from,
                     to=relation_node_to,
                     relation_label=relation.label or "",
+                    # XXX: we are not propagating metadata, is this intended?
                 )
             )
 

{nucliadb-6.4.0.post4146.dist-info → nucliadb-6.4.0.post4161.dist-info}/METADATA

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: nucliadb
-Version: 6.4.0.post4146
+Version: 6.4.0.post4161
 Summary: NucliaDB
 Author-email: Nuclia <nucliadb@nuclia.com>
 License: AGPL
@@ -20,11 +20,11 @@ Classifier: Programming Language :: Python :: 3.12
 Classifier: Programming Language :: Python :: 3 :: Only
 Requires-Python: <4,>=3.9
 Description-Content-Type: text/markdown
-Requires-Dist: nucliadb-telemetry[all]>=6.4.0.post4146
-Requires-Dist: nucliadb-utils[cache,fastapi,storages]>=6.4.0.post4146
-Requires-Dist: nucliadb-protos>=6.4.0.post4146
-Requires-Dist: nucliadb-models>=6.4.0.post4146
-Requires-Dist: nidx-protos>=6.4.0.post4146
+Requires-Dist: nucliadb-telemetry[all]>=6.4.0.post4161
+Requires-Dist: nucliadb-utils[cache,fastapi,storages]>=6.4.0.post4161
+Requires-Dist: nucliadb-protos>=6.4.0.post4161
+Requires-Dist: nucliadb-models>=6.4.0.post4161
+Requires-Dist: nidx-protos>=6.4.0.post4161
 Requires-Dist: nucliadb-admin-assets>=1.0.0.post1224
 Requires-Dist: nuclia-models>=0.24.2
 Requires-Dist: uvicorn[standard]

{nucliadb-6.4.0.post4146.dist-info → nucliadb-6.4.0.post4161.dist-info}/RECORD

@@ -234,7 +234,7 @@ nucliadb/search/search/exceptions.py,sha256=klGLgAGGrXcSGix_W6418ZBMqDchAIGjN77o
 nucliadb/search/search/fetch.py,sha256=eiljOKim-4OOEZn-3fyVZSYxztCH156BXYdqlIwVdN4,6181
 nucliadb/search/search/filters.py,sha256=1MkHlJjAQqoRCj7e5cEzK2HvBxGLE17I_omsjiklbtw,6476
 nucliadb/search/search/find.py,sha256=WTc_0HdbaU0Mwkmlf9s4pCmTuU0hz1jetBjIpNLXEEM,7982
-nucliadb/search/search/find_merge.py,sha256=VQ1NNuFNPxDOsKB5RZPk72cNuBPZuDIoIeQx9z4e-5k,18410
+nucliadb/search/search/find_merge.py,sha256=2NtVZlR61MnTZl7mkzqcpIOPUU8hGWPrrP7ATeubt7w,19677
 nucliadb/search/search/graph_merge.py,sha256=y5V7X-BhjHsKDXE69tzQLIIKGm4XuaFrZXw0odcHVNM,3402
 nucliadb/search/search/graph_strategy.py,sha256=JsV-i9PGhekCAzmGpqeueQIitJb7fWCihIwUf76Q3pU,32912
 nucliadb/search/search/hydrator.py,sha256=-R37gCrGxkyaiHQalnTWHNG_FCx11Zucd7qA1vQCxuw,6985
@@ -245,7 +245,7 @@ nucliadb/search/search/paragraphs.py,sha256=pNAEiYqJGGUVcEf7xf-PFMVqz0PX4Qb-WNG-
 nucliadb/search/search/pgcatalog.py,sha256=s_J98fsX_RuFXwpejpkGqG-tD9ELuzz4YQ6U3ew5h2g,9313
 nucliadb/search/search/predict_proxy.py,sha256=IFI3v_ODz2_UU1XZnyaD391fE7-2C0npSmj_HmDvzS4,3123
 nucliadb/search/search/query.py,sha256=-gvKsyGmKYpsoEVzKkq3HJUMcs_3LD3TYUueOcJsTec,11511
-nucliadb/search/search/rank_fusion.py,sha256=tRGo_KlsFsVx1CQEy1iqQ6f0T1Dq1kf0axDXHuuzvvM,6946
+nucliadb/search/search/rank_fusion.py,sha256=8Bq3AHfHgytp7UIhJQgbnXrchrjlCQbgf8PhLQkWBPY,6718
 nucliadb/search/search/rerankers.py,sha256=PvhExUb8zZYghiFHRgGotw6h6bU--Rft09wE8arvtAw,7424
 nucliadb/search/search/shards.py,sha256=mc5DK-MoCv9AFhlXlOFHbPvetcyNDzTFOJ5rimK8PC8,2636
 nucliadb/search/search/summarize.py,sha256=ksmYPubEQvAQgfPdZHfzB_rR19B2ci4IYZ6jLdHxZo8,4996
@@ -260,16 +260,16 @@ nucliadb/search/search/query_parser/__init__.py,sha256=cp15ZcFnHvpcu_5-aK2A4uUyv
 nucliadb/search/search/query_parser/exceptions.py,sha256=szAOXUZ27oNY-OSa9t2hQ5HHkQQC0EX1FZz_LluJHJE,1224
 nucliadb/search/search/query_parser/fetcher.py,sha256=SkvBRDfSKmuz-QygNKLAU4AhZhhDo1dnOZmt1zA28RA,16851
 nucliadb/search/search/query_parser/filter_expression.py,sha256=fZI8qFRF3h2sa01gwPmDlA5c16mq7ShMOBk-rDaA_fE,6575
-nucliadb/search/search/query_parser/models.py,sha256=3GzV8XjsRgH28UEyqQTM-05kDUoziwGkALnpMJHF_gc,4759
+nucliadb/search/search/query_parser/models.py,sha256=k9cCjTpndP9ynr8A9J8MBmDYmjLBKL1UM4L0GXVuJw0,5031
 nucliadb/search/search/query_parser/old_filters.py,sha256=0NKjRdzAn2bH6veG0M-xM9BNKEYwa4U6WXtZzJAWRvo,9068
 nucliadb/search/search/query_parser/parsers/__init__.py,sha256=ySCNSdbesLXGZyR88919njulA6UE10_3PhqMG_Yj1o4,1034
 nucliadb/search/search/query_parser/parsers/ask.py,sha256=eTz8wS-EJHuAagR384h6TT64itymFZRpfZJGX8r6aZM,2771
 nucliadb/search/search/query_parser/parsers/catalog.py,sha256=XdBiTweGTQkj8m_V_i2xbwp7P5pPO8K1Tud692XKhMw,7149
 nucliadb/search/search/query_parser/parsers/common.py,sha256=o3028wUnK78lOmFK0jtmpvx2Y1Jh_atBYBoO5VD-qJ4,6359
-nucliadb/search/search/query_parser/parsers/find.py,sha256=oM-imPfuXesuh8lgdnjBqpvgyTcW2ieUIbq4ZCnCwEc,12035
-nucliadb/search/search/query_parser/parsers/graph.py,sha256=8Smpd2ZE7ZMyTnUh2_zasN8GAA828do1YNblUDCGl1w,9410
+nucliadb/search/search/query_parser/parsers/find.py,sha256=Fo4lXOnCbP0AKEc1mKLNINJBv63B4DPlix0vlhyesck,12717
+nucliadb/search/search/query_parser/parsers/graph.py,sha256=lDRJO_JvOe7yytNgXZyMogyPMgB5xc8obNY2kqz3yGU,9405
 nucliadb/search/search/query_parser/parsers/search.py,sha256=yEebeMOXJza7HMK3TdIPO6UGQbe79maSDg-GgohQIMk,10517
-nucliadb/search/search/query_parser/parsers/unit_retrieval.py,sha256=OJ8jXMzwQJGXwC1c5k8ty6Uwtq1iBTLzhxWYNKfMSbM,10949
+nucliadb/search/search/query_parser/parsers/unit_retrieval.py,sha256=bcSvF2mW6IHFAs7_yA6TePw0zVtk9CmEA3j6xkhkDO8,11328
 nucliadb/standalone/__init__.py,sha256=cp15ZcFnHvpcu_5-aK2A4uUyvuZVV_MJn4bIXMa20ks,835
 nucliadb/standalone/api_router.py,sha256=hgq9FXpihzgjHkwcVGfGCSwyXy67fqXTfLFHuINzIi0,5567
 nucliadb/standalone/app.py,sha256=mAApNK_iVsQgJyd-mtwCeZq5csSimwnXmlQGH9a70pE,5586
@@ -353,7 +353,7 @@ nucliadb/writer/api/v1/upload.py,sha256=fwWXA5BuLPuGKhOcuyf0CdutWJITjJ6fAvDzV_X9
 nucliadb/writer/api/v1/vectorsets.py,sha256=F3iMViL5G95_Tns4aO2SOA0DwAzxK2_P8MXxtd_XLRE,6973
 nucliadb/writer/resource/__init__.py,sha256=cp15ZcFnHvpcu_5-aK2A4uUyvuZVV_MJn4bIXMa20ks,835
 nucliadb/writer/resource/audit.py,sha256=FvxMZPzrNHtd31HgpZEvxzwAkbxJTZRhPLqRYYJi3tA,1426
-nucliadb/writer/resource/basic.py,sha256=fjxZEsC_ftuRrpPDOQqSDfZR6JlVNSFPMckVGmjQ4lY,10426
+nucliadb/writer/resource/basic.py,sha256=44GK8M9EEVoAUfGiabdLrrpENqeFwNn7qwxF2AHhQGg,10504
 nucliadb/writer/resource/field.py,sha256=MhDbcOEw6KbOGBAnBFAKA_yxL2WrC7Ky2JrjB3iWf9c,20384
 nucliadb/writer/resource/origin.py,sha256=pvhUDdU0mlWPUcpoQi4LDUJaRtfjzVVrA8XcGVI_N8k,2021
 nucliadb/writer/tus/__init__.py,sha256=huWpKnDnjsrKlBBJk30ta5vamlA-4x0TbPs_2Up8hyM,5443
@@ -365,8 +365,8 @@ nucliadb/writer/tus/local.py,sha256=7jYa_w9b-N90jWgN2sQKkNcomqn6JMVBOVeDOVYJHto,
 nucliadb/writer/tus/s3.py,sha256=vF0NkFTXiXhXq3bCVXXVV-ED38ECVoUeeYViP8uMqcU,8357
 nucliadb/writer/tus/storage.py,sha256=ToqwjoYnjI4oIcwzkhha_MPxi-k4Jk3Lt55zRwaC1SM,2903
 nucliadb/writer/tus/utils.py,sha256=MSdVbRsRSZVdkaum69_0wku7X3p5wlZf4nr6E0GMKbw,2556
-nucliadb-6.4.0.post4146.dist-info/METADATA,sha256=0w7cL4NXQA2cjEXrTMG-_ZRbpdP3JN6h28sA3booV-U,4226
-nucliadb-6.4.0.post4146.dist-info/WHEEL,sha256=SmOxYU7pzNKBqASvQJ7DjX3XGUF92lrGhMb3R6_iiqI,91
-nucliadb-6.4.0.post4146.dist-info/entry_points.txt,sha256=XqGfgFDuY3zXQc8ewXM2TRVjTModIq851zOsgrmaXx4,1268
-nucliadb-6.4.0.post4146.dist-info/top_level.txt,sha256=hwYhTVnX7jkQ9gJCkVrbqEG1M4lT2F_iPQND1fCzF80,20
-nucliadb-6.4.0.post4146.dist-info/RECORD,,
+nucliadb-6.4.0.post4161.dist-info/METADATA,sha256=xZYY6m0tHa_k-3X9XuzMbfSy9oofa64mPUaTaCpq9GM,4226
+nucliadb-6.4.0.post4161.dist-info/WHEEL,sha256=ck4Vq1_RXyvS4Jt6SI0Vz6fyVs4GWg7AINwpsaGEgPE,91
+nucliadb-6.4.0.post4161.dist-info/entry_points.txt,sha256=XqGfgFDuY3zXQc8ewXM2TRVjTModIq851zOsgrmaXx4,1268
+nucliadb-6.4.0.post4161.dist-info/top_level.txt,sha256=hwYhTVnX7jkQ9gJCkVrbqEG1M4lT2F_iPQND1fCzF80,20
+nucliadb-6.4.0.post4161.dist-info/RECORD,,

{nucliadb-6.4.0.post4146.dist-info → nucliadb-6.4.0.post4161.dist-info}/WHEEL

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