Classification of virtual links by arc shift move

In this paper, we establish that the arc shift operation on a $n$-component virtual link diagram acts as an unknotting operation when the virtual link is $n$-homogeneous proper, aiding in the classification of \( n \)-component virtual links up to arc shift equivalence. We explore the connection between the arc shift number and the odd writhe of virtual links which are homogeneous proper. Additionally, we identify sequences of virtual link diagrams \( L_n \) for which the upper bound of the arc shift number is exactly \( n \).