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 "efficient probabilistic group testing based on traitor tracing"):
  Abstract: Inspired by recent results from collusion-resistant traitor tracing, we provide a framework for constructing efficient probabilistic group testing schemes. In the traditional group testing model, our scheme asymptotically requires T ~ 2K ln N tests to find (with high probability) the correct set of K defectives out of N items. The framework is also applied to several noisy group testing and threshold group testing models, often leading to improvements over previously known results, but we emphasize that this framework can be applied to other variants of the classical model as well, both in adaptive and in non-adaptive settings.

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 "near optimal stochastic threshold group testing":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a framework for generalized group testing with inhibitors and its potential application in neuroscience")
  Member "dynamic traitor tracing schemes revisited":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "asymptotics of fingerprinting and group testing capacity achieving log likelihood decoders")
  Member "the capacity of adaptive group testing":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "on the all or nothing behavior of bernoulli group testing")
  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 "adaptive group testing as channel coding with feedback":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "secure adaptive group testing")
  Member "boolean compressed sensing and noisy group testing":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "serial quantization for sparse time sequences")

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)