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 "efficient signal time coding design and its application in wireless gaussian relay networks"):
  Abstract: Signal-time coding, which combines the traditional encoding/modulation mode in the signal domain with signal pulse phase modulation in the time domain, was proposed to improve the information flow rate in relay networks. In this paper, we mainly focus on the efficient signal-time coding design. We first derive an explicit iterative algorithm to estimate the maximum number of available codes given the code length of signal-time coding, and then present an iterative construction method of codebooks. It is shown that compared with conventional computer search, the proposed iterative construction method can reduce the complexity greatly. Numerical results will also indicate that the new constructed codebook is optimal in terms of coding rate. To minimize the buffer size needed to store the codebook while keeping a relatively high efficiency, we shall propose a combinatorial construction method. We will then consider applications in wireless Gaussian relay networks. It will be shown that in the three node network model, the mixed transmission by using two-hop and direct transmissions is not always a good option.

Includes members:
  Member "physical layer network coding":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "implementation of uplink network coded modulation for two hop networks")
  Member "wireless network information flow":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "perfect output feedback in the two user decentralized interference channel")

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)