We focus on L(A), the filter of supersets of A in the structure of the computably enumerable sets under the inclusion relation, where A is an atomless r-maximal set. We answer a long-standing question by showing that there are infinitely many pairwise non-isomorphic filters of this type.