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 "energy efficient communication over the unsynchronized gaussian diamond network"):
  Abstract: Communication networks are often designed and analyzed assuming tight synchronization among nodes. However, in applications that require communication in the energy-efficient regime of low signal-to-noise ratios, establishing tight synchronization among nodes in the network can result in a significant energy overhead. Motivated by a recent result showing that near-optimal energy efficiency can be achieved over the AWGN channel without requiring tight synchronization, we consider the question of whether the potential gains of cooperative communication can be achieved in the absence of synchronization. We focus on the symmetric Gaussian diamond network and establish that cooperative-communication gains are indeed feasible even with unsynchronized nodes. More precisely, we show that the capacity per unit energy of the unsynchronized symmetric Gaussian diamond network is within a constant factor of the capacity per unit energy of the corresponding synchronized network. To this end, we propose a distributed relaying scheme that does not require tight synchronization but nevertheless achieves most of the energy gains of coherent combining.

Includes members:
  Member "using superposition codebooks and partial decode and forward in low snr parallel relay networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "alternate distributed beamforming for decode and forward multi relay systems using buffers")
  Member "achievable rates for channels with deletions and insertions":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "an overview of capacity results for synchronization channels")
  Member "energy efficient communication in the presence of synchronization errors":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "energy and sampling constrained asynchronous communication")
  Member "modeling and information rates for synchronization error channels":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "on the capacity of channels with timing synchronization errors")
  Member "the approximate capacity of the gaussian n relay diamond network":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "generalized degrees of freedom of noncoherent diamond networks")
  Member "asynchronous capacity per unit cost":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "concurrent coding a reason to think differently about encoding against noise burst errors and jamming")
  Member "on the deletion channel with small deletion probability":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "an overview of capacity results for synchronization channels")

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)