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: "on the secrecy rate of interference networks using structured codes"
  Abstract: This paper shows that structured transmission schemes are a good choice for secret communication over interference networks with an eavesdropper. Structured transmission is shown to exploit channel asymmetries and thus perform better than randomly generated codebooks for such channels. For a class of interference channels, we show that an equivocation sumrate that is within two bits of the maximum possible legitimate communication sum-rate is achievable using lattice codes.

Connected through hyperedge HE-1 (induced by source paper "secrecy transmit beamforming for heterogeneous networks"):
  with members:
    - "joint power control in wiretap interference channels"
    - "base station activation and linear transceiver design for optimal resource management in heterogeneous networks"
    - "spectral and energy spectral efficiency optimization of joint transmit and receive beamforming based multi relay mimo ofdma cellular networks"
    - "five disruptive technology directions for 5g"
    - "achieving maximum energy efficiency in multi relay ofdma cellular networks a fractional programming approach"
    - "modeling heterogeneous network interference using poisson point processes"
    - "improving macrocell small cell coexistence through adaptive interference draining"
    - "enhanced intercell interference coordination challenges in heterogeneous networks"

Connected through hyperedge HE-2 (induced by source paper "secure compute and forward in a bidirectional relay"):
  with members:
    - "semantically secure lattice codes for the gaussian wiretap channel"
    - "secure computation in a bidirectional relay"
    - "reliable physical layer network coding"
    - "lattice codes for the gaussian wiretap channel"
    - "strong secrecy and reliable byzantine detection in the presence of an untrusted relay"
    - "secrecy gain a wiretap lattice code design"
    - "channel coding and decoding in a relay system operated with physical layer network coding"
    - "providing secrecy with lattice codes"

Connected through hyperedge HE-3 (induced by source paper "joint power control in wiretap interference channels"):
  with members:
    - "secure degrees of freedom of one hop wireless networks"
    - "secrecy in the 2 user symmetric deterministic interference channel with transmitter cooperation"
    - "outage constrained robust secure transmission for miso wiretap channels"
    - "spectrum leasing via cooperation for enhanced physical layer secrecy"
    - "interference assisted secret communication"
    - "the gaussian many to one interference channel with confidential messages"
    - "cooperative secret communication with artificial noise in symmetric interference channel"
    - "on the relationship between the multi antenna secrecy communications and cognitive radio communications"

Connected through hyperedge HE-4 (induced by source paper "cooperative compute and forward"):
  with members:
    - "real interference alignment exploiting the potential of single antenna systems"
    - "phase precoding for the compute and forward protocol"
    - "structured lattice codes for some two user gaussian networks with cognition coordination and two hops"
    - "the approximate sum capacity of the symmetric gaussian k user interference channel"
    - "asynchronous physical layer network coding"
    - "compute and forward strategies for cooperative distributed antenna systems"
    - "a secure communication game with a relay helping the eavesdropper"
    - "wireless network information flow a deterministic approach"

Connected through hyperedge HE-5 (induced by source paper "on modulo sum computation over an erasure multiple access channel"):
  with members:
    - "anti structure problems"
    - "on the capacity of abelian group codes over discrete memoryless channels"
    - "multilevel coding schemes for compute and forward"
    - "providing secrecy with structured codes tools and applications to two user gaussian channels"
    - "lattice strategies for the dirty multiple access channel"
    - "compute and forward harnessing interference through structured codes"
    - "joint physical layer coding and network coding for bi directional relaying"
    - "lattices for distributed source coding jointly gaussian sources and reconstruction of a linear function"

Connected through hyperedge HE-6 (induced by source paper "ergodic interference alignment"):
  with members:
    - "real interference alignment exploiting the potential of single antenna systems"
    - "the approximate sum capacity of the symmetric gaussian k user interference channel"
    - "on the degrees of freedom achievable through interference alignment in a mimo interference channel"
    - "delay rate tradeoff in ergodic interference alignment"
    - "the ergodic capacity of phase fading interference networks"
    - "settling the feasibility of interference alignment for the mimo interference channel the symmetric square case"
    - "interference alignment based sum capacity bounds for random dense gaussian interference networks"
    - "ergodic fading interference channels sum capacity and separability"

Connected through hyperedge HE-7 (induced by source paper "compute and forward harnessing interference through structured codes"):
  with members:
    - "real interference alignment exploiting the potential of single antenna systems"
    - "an algebraic approach to physical layer network coding"
    - "wireless network information flow a deterministic approach"
    - "reliable physical layer network coding"
    - "the degrees of freedom of compute and forward"
    - "nested lattice codes for gaussian relay networks with interference"
    - "physical layer network coding tutorial survey and beyond"
    - "integer forcing linear receivers"

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)