human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "a lower bound on the average case complexity of shellsort"
  Abstract: We prove a general lower bound on the average-case complexity of Shellsort: the average number of data-movements (and comparisons) made by a $p$-pass Shellsort for any incremental sequence is $\Omega (pn^{1 + 1/p})$ for every $p$. The proof method is an incompressibility argument based on Kolmogorov complexity. Using similar techniques, the average-case complexity of several other sorting algorithms is analyzed.

Connected through hyperedge HE-1 (induced by source paper "on the average case complexity of shellsort"):
  with members:
    - "shellsort with three increments"

Connected through hyperedge HE-2 (induced by source paper "spin the bottle sort and annealing sort oblivious sorting via round robin random comparisons"):
  with members:
    - "randomized shellsort a simple oblivious sorting algorithm"
    - "noisy sorting without resampling"

Connected through hyperedge HE-3 (induced by source paper "randomized shellsort a simple oblivious sorting algorithm"):
  with members:
    - "the mastermind attack on genomic data"
    - "noisy sorting without resampling"
    - "radix sorting with no extra space"

Connected through hyperedge HE-4 (induced by source paper "analysis of sorting algorithms by kolmogorov complexity a survey"):
  with members:
    - "shellsort with three increments"

Connected through hyperedge HE-5 (induced by source paper "the frobenius problem in a free monoid"):
  with members:
    - "an np hardness result on the monoid frobenius problem"

Question: Please tell me which class the center node belongs to. The 40 classes are: cs.NA(Numerical Analysis), cs.MM(Multimedia), cs.LO(Logic in Computer Science), cs.CY(Computers and Society), cs.CR(Cryptography and Security), cs.DC(Distributed, Parallel, and Cluster Computing), cs.HC(Human-Computer Interaction), cs.CE(Computational Engineering, Finance, and Science), cs.NI(Networking and Internet Architecture), cs.CC(Computational Complexity), cs.AI(Artificial Intelligence), cs.MA(Multiagent Systems), cs.GL(General Literature), cs.NE(Neural and Evolutionary Computing), cs.SC(Symbolic Computation), cs.AR(Hardware Architecture), cs.CV(Computer Vision and Pattern Recognition), cs.GR(Graphics), cs.ET(Emerging Technologies), cs.SY(Systems and Control), cs.CG(Computational Geometry), cs.OH(Other Computer Science), cs.PL(Programming Languages), cs.SE(Software Engineering), cs.LG(Machine Learning), cs.SD(Sound), cs.SI(Social and Information Networks), cs.RO(Robotics), cs.IT(Information Theory), cs.PF(Performance), cs.CL(Computation and Language), cs.IR(Information Retrieval), cs.MS(Mathematical Software), cs.FL(Formal Languages and Automata Theory), cs.DS(Data Structures and Algorithms), cs.OS(Operating Systems), cs.GT(Computer Science and Game Theory), cs.DB(Databases), cs.DL(Digital Libraries), cs.DM(Discrete Mathematics). Directly output the class name.

gpt: cs.CC(Computational Complexity)