diff --git a/metadata/entries/Berlekamp_Zassenhaus.toml b/metadata/entries/Berlekamp_Zassenhaus.toml
--- a/metadata/entries/Berlekamp_Zassenhaus.toml
+++ b/metadata/entries/Berlekamp_Zassenhaus.toml
@@ -1,56 +1,57 @@
 title = "The Factorization Algorithm of Berlekamp and Zassenhaus"
 date = 2016-10-14
 topics = [
   "Mathematics/Algebra",
 ]
 abstract = """
 <p>We formalize the Berlekamp-Zassenhaus algorithm for factoring
 square-free integer polynomials in Isabelle/HOL. We further adapt an
 existing formalization of Yun’s square-free factorization algorithm to
 integer polynomials, and thus provide an efficient and certified
 factorization algorithm for arbitrary univariate polynomials.
 </p>
 <p>The algorithm first performs a factorization in the prime field GF(p) and
 then performs computations in the integer ring modulo p^k, where both
 p and k are determined at runtime. Since a natural modeling of these
 structures via dependent types is not possible in Isabelle/HOL, we
 formalize the whole algorithm using Isabelle’s recent addition of
 local type definitions.
 </p>
 <p>Through experiments we verify that our algorithm factors polynomials of degree
 100 within seconds.
 </p>"""
 license = "bsd"
 note = ""
 
 [authors]
 
 [authors.divason]
 homepage = "divason_homepage"
 
 [authors.joosten]
 email = "joosten_email"
 
 [authors.thiemann]
 email = "thiemann_email"
 
 [authors.yamada]
 email = "yamada_email"
 
 [contributors]
 
 [notify]
 thiemann = "thiemann_email"
 
 [history]
+2024-04-12 = "Added interface to simplify usage of generated code.<br>"
 
 [extra]
 
 [related]
 dois = [
   "10.1007/s10817-019-09526-y",
   "10.1017/CBO9781139856065"
 ]
 pubs = [
   "<a href=\"https://en.wikipedia.org/wiki/Berlekamp%E2%80%93Zassenhaus_algorithm\">Wikipedia</a>"
 ]
diff --git a/metadata/entries/Polynomial_Factorization.toml b/metadata/entries/Polynomial_Factorization.toml
--- a/metadata/entries/Polynomial_Factorization.toml
+++ b/metadata/entries/Polynomial_Factorization.toml
@@ -1,42 +1,43 @@
 title = "Polynomial Factorization"
 date = 2016-01-29
 topics = [
   "Mathematics/Algebra",
 ]
 abstract = """
 Based on existing libraries for polynomial interpolation and matrices,
 we formalized several factorization algorithms for polynomials, including
 Kronecker's algorithm for integer polynomials,
 Yun's square-free factorization algorithm for field polynomials, and
 Berlekamp's algorithm for polynomials over finite fields.
 By combining the last one with Hensel's lifting,
 we derive an efficient factorization algorithm for the integer polynomials,
 which is then lifted for rational polynomials by mechanizing Gauss' lemma.
 Finally, we assembled a combined factorization algorithm for rational polynomials,
 which combines all the mentioned algorithms and additionally uses the explicit formula for roots
 of quadratic polynomials and a rational root test.
 <p>
 As side products, we developed division algorithms for polynomials over integral domains,
 as well as primality-testing and prime-factorization algorithms for integers."""
 license = "bsd"
 note = ""
 
 [authors]
 
 [authors.thiemann]
 email = "thiemann_email"
 
 [authors.yamada]
 email = "yamada_email"
 
 [contributors]
 
 [notify]
 thiemann = "thiemann_email"
 yamada = "yamada_email1"
 
 [history]
+2024-04-12 = "changed definition of square-free-factorization.<br>"
 
 [extra]
 
 [related]