diff --git a/CHANGELOG.md b/CHANGELOG.md
index 5450b60889b7..d5de63262567 100644
--- a/CHANGELOG.md
+++ b/CHANGELOG.md
@@ -26,6 +26,7 @@ This release achieves 100% compliance with Python Array API specification (revis
 * Updated `dpnp.fix` to return output with the same data-type of input [#2392](https://github.com/IntelPython/dpnp/pull/2392)
 * Updated `dpnp.einsum` to add support for `order=None` [#2411](https://github.com/IntelPython/dpnp/pull/2411)
 * Updated Python Array API specification version supported to `2024.12` [#2416](https://github.com/IntelPython/dpnp/pull/2416)
+* Removed `einsum_call` keyword from `dpnp.einsum_path` signature [#2421](https://github.com/IntelPython/dpnp/pull/2421)
 
 ### Fixed
 
diff --git a/dpnp/dpnp_iface_linearalgebra.py b/dpnp/dpnp_iface_linearalgebra.py
index fa2cb6136d67..53c4da0dc37f 100644
--- a/dpnp/dpnp_iface_linearalgebra.py
+++ b/dpnp/dpnp_iface_linearalgebra.py
@@ -457,7 +457,7 @@ def einsum(
     )
 
 
-def einsum_path(*operands, optimize="greedy", einsum_call=False):
+def einsum_path(*operands, optimize="greedy"):
     """
     einsum_path(subscripts, *operands, optimize="greedy")
 
@@ -483,7 +483,7 @@ def einsum_path(*operands, optimize="greedy", einsum_call=False):
         * if a list is given that starts with ``einsum_path``, uses this as the
           contraction path
         * if ``False`` or ``None`` no optimization is taken
-        * if ``True`` defaults to the "greedy" algorithm
+        * if ``True`` defaults to the ``"greedy"`` algorithm
         * ``"optimal"`` is an algorithm that combinatorially explores all
           possible ways of contracting the listed tensors and chooses the
           least costly path. Scales exponentially with the number of terms
@@ -586,7 +586,7 @@ def einsum_path(*operands, optimize="greedy", einsum_call=False):
     return numpy.einsum_path(
         *operands,
         optimize=optimize,
-        einsum_call=einsum_call,
+        einsum_call=False,
     )