human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "diversity gain of one shot communication over molecular timing channels"
  Abstract: We study diversity in one-shot communication over molecular timing channels. In the considered channel model the transmitter simultaneously releases a large number of information particles, where the information is encoded in the time of release. The receiver decodes the information based on the random time of arrival of the information particles. We characterize the asymptotic exponential decrease rate of the probability of error as a function of the number of released particles. We denote this quantity as the system diversity gain, as it depends both on the number of particles transmitted as well as the receiver detection method. Three types of detectors are considered: the maximumlikelihood (ML) detector, a linear detector, and a detector that is based on the first arrival (FA) among all the transmitted particles. We show that for random propagation characterized by right-sided unimodal densities with zero mode, the FA detector is equivalent to the ML detector, and significantly outperforms the linear detector. Moreover, even for densities with positive mode, the diversity gain achieved by the FA detector is very close to that achieved by the ML detector and much higher than the gain achieved by the linear detector.

Connected through hyperedge HE-1 (induced by source paper "transmitter and receiver architectures for molecular communications a survey on physical design with modulation coding and detection techniques"):
  with members:
    - "magnetic nanoparticle based molecular communication in microfluidic environments"
    - "diffusion based molecular communication with limited molecule production rate"
    - "stochastic channel modeling for diffusive mobile molecular communication systems"
    - "exploiting diversity in molecular timing channels via order statistics"
    - "experimental molecular communication testbed based on magnetic nanoparticles in duct flow"
    - "a novel experimental platform for in vessel multi chemical molecular communications"
    - "on the design of matched filters for molecule counting receivers"
    - "optimal detection for diffusion based molecular timing channels"

Connected through hyperedge HE-2 (induced by source paper "a novel time based modulation scheme in time asynchronous channels for molecular communications"):
  with members:
    - "spatial modulation for molecular communication"
    - "exploiting diversity in molecular timing channels via order statistics"
    - "channel modeling for diffusive molecular communication a tutorial review"
    - "optimal detection for diffusion based molecular timing channels"
    - "on the capacity of diffusion based molecular timing channels"
    - "on the impact of time synchronization in molecular timing channels"
    - "a molecular communications model for drug delivery"
    - "tcp like molecular communications"

Connected through hyperedge HE-3 (induced by source paper "exploiting diversity in molecular timing channels via order statistics"):
  with members:
    - "bits through queues with feedback"
    - "inscribed matter communication part ii"
    - "on the impact of time synchronization in molecular timing channels"
    - "capacity limits of diffusion based molecular timing channels"
    - "covert bits through queues"
    - "a comprehensive survey of recent advancements in molecular communication"
    - "molecular communications channel model and physical layer techniques"
    - "a novel molecular communication system using acids bases and hydrogen ions"

Question: Please tell me which class the center node 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)