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 "group testing with runlength constraints for topological molecular storage"):
  Abstract: Motivated by applications in topological DNA-based data storage, we introduce and study a novel setting of Non-Adaptive Group Testing (NAGT) with runlength constraints on the columns of the test matrix, in the sense that any two 1's must be separated by a run of at least d 0's. We describe and analyze a probabilistic construction of a runlength-constrained scheme in the zero-error and vanishing error settings, and show that the number of tests required by this construction is optimal up to logarithmic factors in the runlength constraint d and the number of defectives k in both cases. Surprisingly, our results show that runlength-constrained NAGT is not more demanding than unconstrained NAGT when d=O(k), and that for almost all choices of d and k it is not more demanding than NAGT with a column Hamming weight constraint only. Towards obtaining runlength-constrained Quantitative NAGT (QNAGT) schemes with good parameters, we also provide lower bounds for this setting and a nearly optimal probabilistic construction of a QNAGT scheme with a column Hamming weight constraint.

Includes members:
  Member "quantitative group testing in the sublinear regime":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "group testing an information theory perspective")
  Member "non adaptive quantitative group testing using irregular sparse graph codes":
    also connected through other hyperedges:
      (none)
  Member "group testing an information theory perspective":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on the all or nothing behavior of bernoulli group testing")
  Member "performance of group testing algorithms with near constant tests per item":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on the all or nothing behavior of bernoulli group testing")
  Member "the capacity of bernoulli nonadaptive 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 "sparse combinatorial group testing":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "massive access for future wireless communication systems")
  Member "decoding from pooled data phase transitions of message passing":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "quantitative group testing in the sublinear regime")
  Member "nearly optimal sparse group testing":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "group testing an information theory perspective")

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)