DGLAP evolution at N${}^3$LO with the $\mathtt{\text{Candia}}$ algorithm

We present a generalization of the $x$-space $\mathtt{\text{Candia}}$ algorithm to next-to-next-to-next-to-leading order (N${}^3$LO) accuracy in Quantum Chromodynamics (QCD) for solving the DGLAP evolution equations for unpolarized parton densities in the nucleon. The algorithm is based on logarithmic expansions of the solution and can be extended to all orders in QCD. An expansion equivalent to the exact solution of the DGLAP equation at N${}^3$LO is presented in the non-singlet sector. Results for approximate N${}^3$LO PDFs, evolved using the most recent approximations to the N${}^3$LO DGLAP splitting functions, are provided for benchmarking. The new version of the code, $\mathtt{\text{Candia-v2}}$, is publicly available at https://github.com/champso1/candia-v2.