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 "optimal detection for diffusion based molecular timing channels"):
  Abstract: This work studies optimal detection for communication over diffusion-based molecular timing (DBMT) channels. The transmitter simultaneously releases multiple information particles, where the information is encoded in the time of release. The receiver decodes the transmitted information based on the random time of arrival of the information particles, which is modeled as an additive noise channel. For a DBMT channel without flow, this noise follows the L\'evy distribution. Under this channel model, the maximum-likelihood (ML) detector is derived and shown to have high computational complexity. It is also shown that under ML detection, releasing multiple particles improves performance, while for any additive channel with $\alpha$-stable noise where $\alpha<1$ (such as the DBMT channel), under linear processing at the receiver, releasing multiple particles degrades performance relative to releasing a single particle. Hence, a new low-complexity detector, which is based on the first arrival (FA) among all the transmitted particles, is proposed. It is shown that for a small number of released particles, the performance of the FA detector is very close to that of the ML detector. On the other hand, error exponent analysis shows that the performance of the two detectors differ when the number of released particles is large.

Includes members:
  Member "inscribed matter communication part ii":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "channel modeling for diffusive molecular communication a tutorial review")
  Member "capacity limits of diffusion based molecular timing channels":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "exploiting diversity in molecular timing channels via order statistics")
  Member "molecular mimo from theory to prototype":
    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 "a comprehensive survey of recent advancements in molecular communication":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "transmitter and receiver architectures for molecular communications a survey on physical design with modulation coding and detection techniques")
  Member "molecular mimo communication link":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "index modulation for molecular communication via diffusion systems")
  Member "stable distributions as noise models for molecular communication":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "abnormality detection inside blood vessels with mobile nanomachines")
  Member "design and optimizing of on chip kinesin substrates for molecular communication":
    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")
  Member "how to achieve the capacity of asymmetric channels":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "explicit codes for the wiretap channel a unified design framework")

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)