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 "using spatial partitioning to reduce the bit error rate of diffusion based molecular communications"):
  Abstract: This work builds on our earlier work on designing demodulators for diffusion-based molecular communications using a Markovian approach. The demodulation filters take the form of an ordinary differential equation (ODE) which computes the log-posteriori probability of observing a transmission symbol given the continuous history of receptor activities. A limitation of our earlier work is that the receiver is assumed to be a small cubic volume called a voxel. In this work, we extend the maximum a-posteriori demodulation to the case where the receiver may consist of multiple voxels and derive the ODE for log-posteriori probability calculation. This extension allows us to study receiver behaviour of different volumes and shapes. In particular, it also allows us to consider spatially partitioned receivers where the chemicals in the receiver are not allowed to mix. The key result of this paper is that spatial partitioning can be used to reduce bit-error rate in diffusion-based molecular communications.

Includes members:
  Member "designing molecular circuits for approximate maximum a posteriori demodulation of concentration modulated signals":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a survey of biological building blocks for synthetic molecular communication systems")
  Member "generalized solution for the demodulation of reaction shift keying signals in molecular communication networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "designing molecular circuits for approximate maximum a posteriori demodulation of concentration modulated signals")
  Member "on the design of matched filters for molecule counting receivers":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "transmitter and receiver architectures for molecular communications a survey on physical design with modulation coding and detection techniques")
  Member "improving the capacity of molecular communication using enzymatic reaction cycles":
    also connected through other hyperedges:
      (none)
  Member "on medium chemical reaction in diffusion based molecular communication a two way relaying example":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "chemical reactions based detection mechanism for molecular communications")
  Member "convex optimization of distributed cooperative detection in multi receiver molecular communication":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "channel characterization for 1d molecular communication with two absorbing receivers")
  Member "a comprehensive survey of recent advancements in molecular communication":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "transmitter and receiver architectures for molecular communications a survey on physical design with modulation coding and detection techniques")
  Member "a markovian approach to the optimal demodulation of diffusion based molecular communication networks":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "transmitter and receiver architectures for molecular communications a survey on physical design with modulation coding and detection techniques")

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)