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: "end to end performance analysis of relay cooperative communication based on parked cars"
  Abstract: Parking lots (PLs) are usually full with cars. If these cars are formed into a self-organizing vehicular network, they can be new kind of road side units (RSUs) in urban area to provide communication data forwarding between mobile terminals nearby and a base station. However cars in PLs can leave at any time, which is neglected in the existing studies. In this paper, we investigate relay cooperative communication based on parked cars in PLs. Taking the impact of the car's leaving behavior into consideration, we derive the expressions of outage probability in a two-hop cooperative communication and its link capacity. Finally, the numerical results show that the impact of a car's arriving time is greater than the impact of the duration the car has parked on outage probability.

Connected through hyperedge HE-1 (induced by source paper "permissioned blockchain for efficient and secure resource sharing in vehicular edge computing"):
  with members:
    - "a survey on consensus mechanisms and mining strategy management in blockchain networks"
    - "a survey of distributed consensus protocols for blockchain networks"
    - "hyperledger fabric a distributed operating system for permissioned blockchains"
    - "blockchain a distributed solution to automotive security and privacy"
    - "offloading in software defined network at edge with information asymmetry a contract theoretical approach"

Connected through hyperedge HE-2 (induced by source paper "effect of the error propagation on the error performance of cooperative communications with the best relay selection schemes"):
  with members:
    - "relay selection for cooperative noma"
    - "5g cellular key enabling technologies and research challenges"
    - "what will 5g be"
    - "a simple cooperative diversity method based on network path selection"

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)