human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "some impossibilities of ranking in generalized tournaments"):
  Abstract: In a generalized tournament, players may have an arbitrary number of matches against each other and the outcome of games is measured cardinally with a lower and upper bound. We apply an axiomatic approach for the problem of ranking the competitors. Self-consistency demands assigning the same rank for players with equivalent results, while a player should be ranked strictly higher if it has shown an obviously better performance than another. Order preservation says that if two players have the same pairwise ranking in two tournaments where the same players have played the same number of matches, then this should be their pairwise ranking in the aggregated tournament. It is revealed that these two properties cannot be satisfied simultaneously, consequently, order preservation cannot be expected to hold on this universal domain.

Includes members:
  Member "a fairer penalty shootout design in soccer":
    also connected through other hyperedges:
      (none)
  Member "an impossibility theorem for paired comparisons":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "journal ranking should depend on the level of aggregation")
  Member "a graph interpretation of the least squares ranking method":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "journal ranking should depend on the level of aggregation")
  Member "an application of incomplete pairwise comparison matrices for ranking top tennis players":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "axiomatizations of inconsistency indices for triads")

Question: Please tell me which class the source paper 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)