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 "cross sender bit mixing coding"):
  Abstract: Scheduling to avoid packet collisions is a long-standing challenge in networking, and has become even trickier in wireless networks with multiple senders and multiple receivers. In fact, researchers have proved that even perfect scheduling can only achieve $\mathbf{R} = O(\frac{1}{\ln N})$. Here $N$ is the number of nodes in the network, while $\mathbf{R}$ is the medium utilization rate. In this work, our vision is to achieve $\mathbf{R} = \Theta(1)$, and avoid all the complexities in scheduling. To this end, this paper proposes cross-sender bit-mixing coding (or BMC in short), which does not rely on scheduling. Instead, users transmit simultaneously on suitably-chosen slots, and the amount of overlap in different user's slots is controlled via coding. We prove that in all possible network topologies, using BMC enables us to achieve $\mathbf{R}=\Theta(1)$. We also prove that the space and time complexities of BMC encoding/decoding are all low-order polynomials.

Includes members:
  Member "non adaptive group testing framework based on concatenation code":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "sublinear time non adaptive group testing with o k log n tests via bit mixing coding")
  Member "group testing using left and right regular sparse graph codes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "sublinear time non adaptive group testing with o k log n tests via bit mixing coding")
  Member "nonadaptive group testing with random set of defectives":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "group testing an information theory perspective")
  Member "group testing schemes from codes and designs":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "nearly optimal sparse group testing")
  Member "saffron a fast efficient and robust framework for group testing based on sparse graph codes":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "on the all or nothing behavior of bernoulli group testing")
  Member "computing in additive networks with bounded information codes":
    also connected through other hyperedges:
      (none)
  Member "group testing algorithms bounds and simulations":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "serial quantization for sparse time sequences")
  Member "on almost disjunct matrices for group testing":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "low rank approximation and decomposition of large matrices using error correcting 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)