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 "capacities and capacity achieving decoders for various fingerprinting games"):
  Abstract: Combining an information-theoretic approach to fingerprinting with a more constructive, statistical approach, we derive new results on the fingerprinting capacities for various informed settings, as well as new log-likelihood decoders with provable code lengths that asymptotically match these capacities. The simple decoder built against the interleaving attack is further shown to achieve the simple capacity for unknown attacks, and is argued to be an improved version of the recently proposed decoder of Oosterwijk et al. With this new universal decoder, cut-offs on the bias distribution function can finally be dismissed. Besides the application of these results to fingerprinting, a direct consequence of our results to group testing is that (i) a simple decoder asymptotically requires a factor 1.44 more tests to find defectives than a joint decoder, and (ii) the simple decoder presented in this paper provably achieves this bound.

Includes members:
  Member "optimal symmetric tardos traitor tracing schemes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "nearest neighbor decoding for tardos fingerprinting codes")
  Member "dynamic traitor tracing schemes revisited":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "asymptotics of fingerprinting and group testing capacity achieving log likelihood decoders")
  Member "discrete distributions in the tardos scheme revisited":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "nearest neighbor decoding for tardos fingerprinting codes")
  Member "efficient probabilistic group testing based on traitor tracing":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "on the optimality of some group testing algorithms")
  Member "dynamic tardos traitor tracing schemes":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "nearest neighbor decoding for tardos fingerprinting codes")
  Member "on the saddle point solution and the large coalition asymptotics of fingerprinting games":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "asymptotics of fingerprinting and group testing capacity achieving log likelihood decoders")
  Member "non adaptive group testing explicit bounds and novel algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "serial quantization for sparse time sequences")
  Member "dynamic traitor tracing for arbitrary alphabets divide and conquer":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "asymptotics of fingerprinting and group testing capacity achieving log likelihood decoders")

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.IT(Information Theory)