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: "near optimal modulo and forward scheme for the untrusted relay channel"
  Abstract: This paper studies an untrusted relay channel, in which the destination sends artificial noise simultaneously with the source sending a message to the relay, in order to protect the source's confidential message. The traditional amplify-and-forward (AF) scheme shows poor performance in this situation because of the interference power dilemma: providing better security by using stronger artificial noise will decrease the confidential message power from the relay to the destination. To solve this problem, a modulo-and-forward (MF) operation at the relay with nested lattice encoding at the source is proposed. For this system with full channel state information at the transmitter (CSIT), theoretical analysis shows that the proposed MF scheme approaches the secrecy capacity within 1/2 bit for any channel realization, and hence achieves full generalized security degrees of freedom (G-SDoF). In contrast, the AF scheme can only achieve a small fraction of the G-SDoF. For this system without any CSIT, the total outage event, defined as either connection outage or secrecy outage, is introduced. Based on this total outage definition, analysis shows that the proposed MF scheme achieves the full generalized secure diversity gain (G-SDG) of order one. On the other hand, the AF scheme can only achieve a G-SDG of 1/2 at most.

Connected through hyperedge HE-1 (induced by source paper "secrecy optimized resource allocation for device to device communication underlaying heterogeneous networks"):
  with members:
    - "contract based interference coordination in heterogeneous cloud radio access networks"
    - "energy efficient resource assignment and power allocation in heterogeneous cloud radio access networks"
    - "fronthaul constrained cloud radio access networks insights and challenges"
    - "system architecture and key technologies for 5g heterogeneous cloud radio access networks"
    - "sparse beamforming and user centric clustering for downlink cloud radio access network"
    - "joint resource partitioning and offloading in heterogeneous cellular networks"
    - "pricing based distributed downlink beamforming in multi cell ofdma networks"
    - "interference assisted secret communication"

Connected through hyperedge HE-2 (induced by source paper "secure compute and forward transmission with artificial noise and full duplex devices"):
  with members:
    - "multi antenna relay aided wireless physical layer security"
    - "secure transmission on the two hop relay channel with scaled compute and forward"
    - "asymmetric compute and forward with csit"
    - "improving physical layer secrecy using full duplex jamming receivers"
    - "joint relay and jammer selection for secure two way relay networks"
    - "cooperative jamming for secure communications in mimo relay networks"

Connected through hyperedge HE-3 (induced by source paper "secure transmission on the two hop relay channel with scaled compute and forward"):
  with members:
    - "gaussian multiple access via compute and forward"
    - "secure compute and forward in a bidirectional relay"
    - "nested lattice codes for secure bidirectional relaying with asymmetric channel gains"
    - "asymmetric compute and forward with csit"
    - "reliable physical layer network coding"
    - "strong secrecy and reliable byzantine detection in the presence of an untrusted relay"
    - "compute and forward harnessing interference through structured codes"
    - "two hop secure communication using an untrusted relay"

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)