In July 2025, Artyom Che developed a wrapped k-cycle generator for the cayleypy/cayleypy repository, enhancing the library’s support for advanced graph theory research. Using Python, he implemented algorithms for generating wrapped k-cycles and calculating their layer sizes, addressing the need for more flexible data generation in Cayley graph analysis. Artyom supplemented the new feature with comprehensive unit tests to ensure reliability and prevent regressions, and produced growth-data CSV outputs to facilitate further study. He also improved documentation and usage examples, making the new functionality accessible to both researchers and developers interested in permutation groups and graph analytics workflows.