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 "almost disjunct matrices from codes and designs"):
  Abstract: In group testing, simple binary-output tests are designed to identify a small number $t$ of defective items that are present in a large population of $N$ items. Each test takes as input a group of items and produces a binary output indicating whether the group is free of the defective items or contains one or more of them. #R##N#In this paper we study a relaxation of the combinatorial group testing problem. A matrix is called $(t,\epsilon)$-disjunct if it gives rise to a nonadaptive group testing scheme with the property of identifying a uniformly random $t$-set of defective subjects out of a population of size $N$ with false positive probability of an item at most $\epsilon$. We establish a new connection between $(t,\epsilon)$-disjunct matrices and error correcting codes based on the dual distance of the codes and derive estimates of the parameters of codes that give rise to such schemes. Our methods rely on the moments of the distance distribution of codes and inequalities for moments of sums of independent random variables. We also outline a new connection between group testing schemes and combinatorial designs.

Includes members:
  Member "nonadaptive group testing with random set of defectives via constant weight codes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "nearly optimal sparse group testing")
  Member "bounds on the rate of disjunctive codes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "optimal multistage group testing algorithm for 3 defectives")
  Member "semiquantitative group testing":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "group testing with runlength constraints for topological molecular storage")
  Member "on almost disjunct matrices for group testing":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "cross sender bit mixing coding")
  Member "non adaptive group testing explicit bounds and novel algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "serial quantization for sparse time sequences")
  Member "semi quantitative group testing":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "poisson group testing a probabilistic model for boolean compressed sensing")
  Member "explicit non adaptive combinatorial group testing schemes":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "group testing with runlength constraints for topological molecular storage")

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)