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: "the h index can be easily manipulated"
  Abstract: We prove two complexity results about the H-index concerned with the Google scholar merge operation on one's scientific articles. The results show that, although it is hard to merge one's articles in an optimal way, it is easy to merge them in such a way that one's H-index increases. This suggests the need for an alternative scientific performance measure that is resistant to this type of manipulation.

Connected through hyperedge HE-1 (induced by source paper "a simple centrality index for scientific social recognition"):
  with members:
    - "are the authors of highly cited articles also the most productive ones"
    - "lobby index as a network centrality measure"
    - "the inconsistency of the h index"

Connected through hyperedge HE-2 (induced by source paper "h index manipulation by undoing merges"):
  with members:
    - "h index manipulation by merging articles"
    - "google scholar makes it hard the complexity of organizing one s publications"
    - "the google scholar experiment how to index false papers and manipulate bibliometric indicators"

Connected through hyperedge HE-3 (induced by source paper "h index manipulation by merging articles"):
  with members:
    - "h index manipulation by undoing merges"
    - "google scholar makes it hard the complexity of organizing one s publications"
    - "the google scholar experiment how to index false papers and manipulate bibliometric indicators"

Connected through hyperedge HE-4 (induced by source paper "on google scholar h index manipulation by merging articles"):
  with members:
    - "google scholar makes it hard the complexity of organizing one s publications"
    - "the google scholar experiment how to index false papers and manipulate bibliometric indicators"

Connected through hyperedge HE-5 (induced by source paper "google scholar makes it hard the complexity of organizing one s publications"):
  with members:
    - "h index manipulation by merging articles"

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)