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: "energy efficient communication in the presence of synchronization errors"
  Abstract: Communication systems are traditionally designed to have tight transmitter-receiver synchronization. This requirement has negligible overhead in the high-SNR regime. However, in many applications, such as wireless sensor networks, communication needs to happen primarily in the energy-efficient regime of low SNR, where requiring tight synchronization can be highly suboptimal. #R##N#In this paper, we model the noisy channel with synchronization errors as an insertion/deletion/substitution channel. For this channel, we propose a new communication scheme that requires only loose transmitter-receiver synchronization. We show that the proposed scheme is asymptotically optimal for the Gaussian channel with synchronization errors in terms of energy efficiency as measured by the rate per unit energy. In the process, we also establish that the lack of synchronization causes negligible loss in energy efficiency. We further show that, for a general discrete memoryless channel with synchronization errors and a general input cost function admitting a zero-cost symbol, the rate per unit cost achieved by the proposed scheme is within a factor two of the information-theoretic optimum.

Connected through hyperedge HE-1 (induced by source paper "energy efficient communication over the unsynchronized gaussian diamond network"):
  with members:
    - "using superposition codebooks and partial decode and forward in low snr parallel relay networks"
    - "achievable rates for channels with deletions and insertions"
    - "modeling and information rates for synchronization error channels"
    - "the approximate capacity of the gaussian n relay diamond network"
    - "asynchronous capacity per unit cost"
    - "on the deletion channel with small deletion probability"

Connected through hyperedge HE-2 (induced by source paper "energy and sampling constrained asynchronous communication"):
  with members:
    - "asynchronous communication capacity bounds and suboptimality of training"
    - "asynchronous capacity per unit cost"
    - "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)