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: "on the impact of time synchronization in molecular timing channels"
  Abstract: This work studies the impact of time- synchronization in molecular timing (MT) channels by analyzing three different modulation techniques. The first requires transmitter-receiver synchronization and is based on modulating information on the release timing of information particles. The other two are asynchronous and are based on modulating information on the relative time between two consecutive releases of information particles using indistinguishable or distinguishable particles. All modulation schemes result in a system that relate the transmitted and the received signals through an additive noise, which follows a stable distribution. As the common notion of the variance of a signal is not suitable for defining the power of stable distributed signals (due to infinite variance), we derive an expression for the geometric power of a large class of stable distributions, and then use this result to characterize the geometric signal-to-noise ratio (G-SNR) for each of the modulation techniques. In addition, for binary communication, we derive the optimal detection rules for each modulation technique. Numerical evaluations indicate that the bit error rate (BER) is constant for a given G-SNR, and the performance gain obtained by using synchronized communication is significant. Yet, it is also shown that by using two distinguishable particles per bit instead of one, the BER of the asynchronous technique can approach that of the synchronous one.

Connected through hyperedge HE-1 (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"
    - "diversity gain of one shot communication over molecular timing channels"
    - "optimal detection for diffusion based molecular timing channels"
    - "on the capacity of diffusion based molecular timing channels"
    - "a molecular communications model for drug delivery"
    - "tcp like molecular communications"

Connected through hyperedge HE-2 (induced by source paper "exploiting diversity in molecular timing channels via order statistics"):
  with members:
    - "diversity gain of one shot communication over molecular timing channels"
    - "bits through queues with feedback"
    - "inscribed matter communication part ii"
    - "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"

Connected through hyperedge HE-3 (induced by source paper "diversity gain of one shot communication over molecular timing channels"):
  with members:
    - "inscribed matter communication part ii"
    - "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"
    - "molecular communication in fluid media the additive inverse gaussian noise channel"
    - "nanoscale communication with brownian motion"

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)