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 fairer penalty shootout design in soccer"
  Abstract: The penalty shootout in soccer is known to be unfair ex-post: the team kicking first has a significant advantage as verified by theory and proved in practice. A so-called Catch-Up Rule has been suggested recently for making the shootout fairer. It is shown that this mechanism does not outperform the less complicated deterministic Alternating (ABBA) Rule already tried. We introduce the Adjusted Catch-Up Rule, which always gives the first penalty of the possible sudden death to the team kicking the second penalty in the first round. The suggested design is revealed to outperform the Catch-Up and Alternating (ABBA) Rules, while it remains straightforward to implement and is essentially strategy-proof.

Connected through hyperedge HE-1 (induced by source paper "some impossibilities of ranking in generalized tournaments"):
  with members:
    - "an impossibility theorem for paired comparisons"
    - "a graph interpretation of the least squares ranking method"
    - "an application of incomplete pairwise comparison matrices for ranking top tennis players"

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.GT(Computer Science and Game Theory)