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: "finite blocklength performance of multi terminal wireless industrial networks"
  Abstract: This work focuses on the performance of multi-terminal wireless industrial networks, where the transmissions of all terminals are required to be scheduled within a tight deadline. The transmissions thus share a fixed amount of resources, i.e., symbols, while facing short blocklengths due to the low-latency requirement. We investigate two distinct relaying strategies, namely best relay selection among the participating terminals and best antenna selection at the access point of the network. In both schemes, we incorporate the cost of acquiring instantaneous Channel State Information (CSI) at the access point within the transmission deadline. An error probability model is developed under the finite blocklength regime to provide accurate performance results. As a reference, this model is compared to the corresponding infinite bocklength error model. Both analytical models are validated by simulation. We show that the average Packet Error Rate (PER) over all terminals is convex in the target error probability at each single link. Moreover, we find that: (i) The reliability behavior is different for the two strategies, while the limiting factors are both finite blocklengths and overhead of acquiring CSI. (ii) With the same order of diversity, best antenna selection is more reliable than best relay selection. (iii) The average PER is increasing in the number of participating terminals unless the terminals also act as relay candidates. In particular, if each participating terminal is a candidate for best relay selection, the PER is convex in the number of terminals.

Connected through hyperedge HE-1 (induced by source paper "ultra reliable short message relaying with wireless power transfer"):
  with members:
    - "analysis of wireless communications with finite blocklength and imperfect channel knowledge"
    - "on wirelessly powered communications with short packets"
    - "wireless networks with rf energy harvesting a contemporary survey"
    - "power allocation strategies in energy harvesting wireless cooperative networks"
    - "ultra reliable communication in 5g wireless systems"
    - "simultaneous information and power transfer for broadband wireless systems"
    - "relaying protocols for wireless energy harvesting and information processing"
    - "wireless information and power transfer in two way amplify and forward relaying channels"

Connected through hyperedge HE-2 (induced by source paper "ultra reliable short packet communications with wireless energy transfer"):
  with members:
    - "wireless powered relaying with finite block length codes"
    - "analysis of wireless communications with finite blocklength and imperfect channel knowledge"
    - "on wirelessly powered communications with short packets"
    - "energy harvesting wireless communications a review of recent advances"
    - "harvest then cooperate wireless powered cooperative communications"
    - "wireless networks with rf energy harvesting a contemporary survey"
    - "finite block length analysis of the incremental redundancy harq"
    - "ultra reliable communication in 5g wireless systems"

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)