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 "asymptotics of fingerprinting and group testing tight bounds from channel capacities"):
  Abstract: In this paper, we consider the large-coalition asymptotics of various fingerprinting and group testing games, and derive explicit expressions for the capacities for each of these models. We do this both for simple (fast but suboptimal) and arbitrary, joint decoders (slow but optimal). For fingerprinting, we show that if the pirate strategy is known, the capacity often decreases linearly with the number of colluders, instead of quadratically as in the uninformed fingerprinting game. For all considered attacks, the joint capacity is shown to be strictly higher than the simple capacity, including the interleaving attack. This last result contradicts the results of Huang and Moulin regarding the joint fingerprinting capacity, which implies that finding the fingerprinting capacity without restrictions on the tracer’s capabilities remains an open problem. For group testing, we improve upon the previous work about the joint capacities, and derive new explicit asymptotics for the simple capacities of various models. These show that the existing simple group testing algorithms of Chan  et al.  are suboptimal, and that simple decoders cannot asymptotically be as efficient as joint decoders. For the traditional group testing model, we show that the gap between the simple and joint capacities is a factor    $\log _{2}(e) \approx 1.44$    for large numbers of defectives.

Includes members:
  Member "asymptotics of fingerprinting and group testing capacity achieving log likelihood decoders":
    also connected through other hyperedges:
      (none)
  Member "limits on support recovery with probabilistic models an information theoretic framework":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "group testing an information theory perspective")
  Member "capacities and capacity achieving decoders for various fingerprinting games":
    also connected through other hyperedges:
      - Hyperedge HE-2 (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-3 (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-4 (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-5 (induced by source paper "on the all or nothing behavior of bernoulli group testing")
  Member "efficient probabilistic group testing based on traitor tracing":
    also connected through other hyperedges:
      - Hyperedge HE-6 (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-7 (induced by source paper "nearest neighbor decoding for tardos fingerprinting codes")

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)