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: "asynchronous communication capacity bounds and suboptimality of training"
  Abstract: Several aspects of the problem of asynchronous point-to-point communication without feedback are developed when the source is highly intermittent. In the system model of interest, the codeword is transmitted at a random time within a prescribed window whose length corresponds to the level of asynchronism between the transmitter and the receiver. The decoder operates sequentially and communication rate is defined as the ratio between the message size and the elapsed time between when transmission commences and when the decoder makes a decision. #R##N#For such systems, general upper and lower bounds on capacity as a function of the level of asynchronism are established, and are shown to coincide in some nontrivial cases. From these bounds, several properties of this asynchronous capacity are derived. In addition, the performance of training-based schemes is investigated. It is shown that such schemes, which implement synchronization and information transmission on separate degrees of freedom in the encoding, cannot achieve the asynchronous capacity in general, and that the penalty is particularly significant in the high-rate regime.

Connected through hyperedge HE-1 (induced by source paper "the strongly asynchronous massive access channel"):
  with members:
    - "on the capacity of the slotted strongly asynchronous channel with a bursty user"
    - "capacity of gaussian many access channels"
    - "asymptotically optimal matching of multiple sequences to source distributions and training sequences"
    - "energy and sampling constrained asynchronous communication"
    - "optimal sequential frame synchronization"

Connected through hyperedge HE-2 (induced by source paper "second order asymptotics for communication under strong asynchronism"):
  with members:
    - "sampling constrained asynchronous communication how to sleep efficiently"
    - "channel detection in coded communication"
    - "asynchronous capacity per unit cost"
    - "communication under strong asynchronism"
    - "optimal sequential frame synchronization"

Connected through hyperedge HE-3 (induced by source paper "on the capacity of the slotted strongly asynchronous channel with a bursty user"):
  with members:
    - "energy and sampling constrained asynchronous communication"
    - "asynchronous capacity per unit cost"
    - "optimal sequential frame synchronization"

Connected through hyperedge HE-4 (induced by source paper "sampling constrained asynchronous communication how to sleep efficiently"):
  with members:
    - "energy and sampling constrained asynchronous communication"
    - "asynchronous capacity per unit cost"
    - "communication under strong asynchronism"
    - "optimal sequential frame synchronization"

Connected through hyperedge HE-5 (induced by source paper "energy and sampling constrained asynchronous communication"):
  with members:
    - "energy efficient communication in the presence of synchronization errors"
    - "asynchronous capacity per unit cost"
    - "communication under strong asynchronism"
    - "optimal sequential frame synchronization"

Connected through hyperedge HE-6 (induced by source paper "asynchronous capacity per unit cost"):
  with members:
    - "communication under strong asynchronism"
    - "optimal sequential frame synchronization"

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)