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: "an efficient adaptive distributed space time coding scheme for cooperative relaying"
  Abstract: A non-regenerative dual-hop wireless system based on distributed Alamouti space-time coding is considered. It is assumed that each relay retransmits an appropriately scaled space-time coded version of its received signal. The main goal of this paper is to find a scaling function for each relay to minimize the outage probability. In the high signal-to-noise ratio (SNR) regime for the relay-destination link, it is shown that a threshold-based scaling function (i.e., the relay remains silent if its channel gain with the source is less than its predetermined threshold) is optimum from the outage probability point of view. Numerical results demonstrate a dramatic performance improvement as compared to the case that the relay stations forward their received signals with full power even for finite SNR scenarios.

Connected through hyperedge HE-1 (induced by source paper "study of buffer aided distributed space time coding for cooperative wireless networks"):
  with members:
    - "a buffer aided successive opportunistic relay selection scheme with power adaptation and inter relay interference cancellation for cooperative diversity systems"
    - "adaptive reduced rank receive processing based on minimum symbol error rate criterion for large scale multiple antenna systems"
    - "direction finding algorithms based on joint iterative subspace optimization"
    - "buffer aided relaying with adaptive link selection"
    - "buffer aided relaying with adaptive link selection fixed and mixed rate transmission"
    - "adaptive distributed space time coding based on adjustable code matrices for cooperative mimo relaying systems"
    - "a simple cooperative diversity method based on network path selection"
    - "optimal space time codes for the mimo amplify and forward cooperative channel"

Connected through hyperedge HE-2 (induced by source paper "adaptive randomized distributed space time coding in cooperative mimo relay systems"):
  with members:
    - "construction of new delay tolerant space time codes"
    - "optimal space time codes for the mimo amplify and forward cooperative channel"

Connected through hyperedge HE-3 (induced by source paper "adaptive distributed space time coding based on adjustable code matrices for cooperative mimo relaying systems"):
  with members:
    - "adaptive alternating minimization algorithms"
    - "optimal space time codes for the mimo amplify and forward cooperative channel"

Connected through hyperedge HE-4 (induced by source paper "broadcast approaches to the diamond channel"):
  with members:
    - "maximum throughput in multiple antenna systems"
    - "experiment driven characterization of full duplex wireless systems"
    - "proof of the outage probability conjecture for miso channels"
    - "pushing the limits of full duplex design and real time implementation"
    - "asymptotic analysis of amplify and forward relaying in a parallel mimo relay network"
    - "on multistage successive refinement for wyner ziv source coding with degraded side informations"
    - "broadcast cooperation strategies for two colocated users"

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)