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: "integer valued betting strategies and turing degrees"
  Abstract: Betting strategies are often expressed formally as martingales. A martingale is called integer-valued if each bet must be an integer value. Integer-valued strategies correspond to the fact that in most betting situations, there is a minimum amount that a player can bet. According to a well known paradigm, algorithmic randomness can be founded on the notion of betting strategies. A real X is called integer-valued random if no effective integer-valued martingale succeeds on X. It turns out that this notion of randomness has interesting interactions with genericity and the computably enumerable degrees. We investigate the computational power of the integer-valued random reals in terms of standard notions from computability theory.

Connected through hyperedge HE-1 (induced by source paper "granularity of wagers in games and the im possibility of savings"):
  with members:
    - "lower bounds on the redundancy in computations from random oracles via betting strategies with restricted wagers"
    - "how powerful are integer valued martingales"

Connected through hyperedge HE-2 (induced by source paper "lower bounds on the redundancy in computations from random oracles via betting strategies with restricted wagers"):
  with members:
    - "optimal redundancy in computations from random oracles"
    - "how to gamble against all odds"
    - "how powerful are integer valued martingales"
    - "every sequence is decompressible from a random one"

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)