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 "differential distributed space time coding with imperfect synchronization in frequency selective channels"):
  Abstract: Differential distributed space-time coding (D-DSTC) is a cooperative transmission technique that can improve diversity in wireless relay networks in the absence of channel information. Conventionally, it is assumed that channels are flat-fading and relays are perfectly synchronized at the symbol level. However, due to the delay spread in broadband systems and the distributed nature of relay networks, these assumptions may be violated. Hence, inter-symbol interference (ISI) may appear. This paper proposes a new differential encoding and decoding process for D-DSTC systems with multiple relays over slow frequency-selective fading channels with imperfect synchronization. The proposed method overcomes the ISI caused by frequency-selectivity and is robust against synchronization errors while not requiring any channel information at the relays and destination. Moreover, the maximum possible diversity with a decoding complexity similar to that of the conventional D-DSTC is attained. Simulation results are provided to show the performance of the proposed method in various scenarios.

Includes members:
  Member "differential distributed space time coding with imperfect synchronization":
    also connected through other hyperedges:
      (none)
  Member "asynchronous physical layer network coding":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "an analysis of two user uplink asynchronous non orthogonal multiple access systems")
  Member "optimal decoding algorithm for asynchronous physical layer network coding":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "an optimal decoding strategy for physical layer network coding over multipath fading channels")
  Member "channel coded collision resolution by exploiting symbol misalignment":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "asynchronous physical layer network coding")
  Member "distributed beamforming in wireless multiuser relay interference networks with quantized feedback":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "cooperative asynchronous non orthogonal multiple access with power minimization under qos constraints")
  Member "ofdm based distributed space time coding for asynchronous relay networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "d mg tradeoff of df and af relaying protocols over asynchronous pam cooperative networks")

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)