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: "asymmetric compute and forward with csit"
  Abstract: We present a modified compute-and-forward scheme which utilizes Channel State Information at the Transmitters (CSIT) in a natural way. The modified scheme allows different users to have different coding rates, and use CSIT to achieve larger rate region. This idea is applicable to all systems which use the compute-and-forward technique and can be arbitrarily better than the regular scheme in some settings.

Connected through hyperedge HE-1 (induced by source paper "generalized compute compress and forward"):
  with members:
    - "expanding the compute and forward framework unequal powers signal levels and multiple linear combinations"
    - "compute compress and forward exploiting asymmetry of wireless relay networks"
    - "lattice codes for many to one interference channels with and without cognitive messages"
    - "optimized backhaul compression for uplink cloud radio access network"
    - "successive integer forcing and its sum rate optimality"
    - "an algebraic approach to physical layer network coding"
    - "integer forcing mimo linear receivers based on lattice reduction"
    - "a simple proof for the existence of good pairs of nested lattices"

Connected through hyperedge HE-2 (induced by source paper "polynomially solvable instances of the shortest and closest vector problems with applications to compute and forward"):
  with members:
    - "low complexity coefficient selection algorithms for compute and forward"
    - "efficient integer coefficient search for compute and forward"
    - "a linearithmic time algorithm for a shortest vector problem in compute and forward design"
    - "a low complexity message recovery method for compute and forward relaying"
    - "an efficient algorithm for optimally solving a shortest vector problem in compute and forward protocol design"
    - "compute and forward protocol design based on improved sphere decoding"
    - "simplified compute and forward and its performance analysis"
    - "integer forcing mimo linear receivers based on lattice reduction"

Connected through hyperedge HE-3 (induced by source paper "gaussian multiple access via compute and forward"):
  with members:
    - "a joint typicality approach to algebraic network information theory"
    - "successive integer forcing and its sum rate optimality"
    - "precoded integer forcing universally achieves the mimo capacity to within a constant gap"
    - "the approximate sum capacity of the symmetric gaussian k user interference channel"
    - "nested lattice codes for gaussian relay networks with interference"
    - "integer forcing linear receivers"
    - "lattice strategies for the dirty multiple access channel"
    - "compute and forward harnessing interference through structured codes"

Connected through hyperedge HE-4 (induced by source paper "compute compress and forward exploiting asymmetry of wireless relay networks"):
  with members:
    - "mimo multiway relaying with clustered full data exchange signal space alignment and degrees of freedom"
    - "towards the asymptotic sum capacity of the mimo cellular two way relay channel"
    - "phase precoded compute and forward with partial feedback"
    - "phase precoding for the compute and forward protocol"
    - "mimo multiway relaying with pairwise data exchange a degrees of freedom perspective"
    - "multilevel coding schemes for compute and forward with flexible decoding"
    - "degrees of freedom for the mimo multi way relay channel"
    - "an algebraic approach to physical layer network coding"

Connected through hyperedge HE-5 (induced by source paper "a joint typicality approach to algebraic network information theory"):
  with members:
    - "an achievable rate region for the three user interference channel based on coset codes"
    - "secure compute and forward in a bidirectional relay"
    - "secure degrees of freedom of one hop wireless networks"
    - "real interference alignment exploiting the potential of single antenna systems"
    - "renyi divergence and kullback leibler divergence"
    - "an algebraic approach to physical layer network coding"
    - "the approximate sum capacity of the symmetric gaussian k user interference channel"
    - "compute and forward strategies for cooperative distributed antenna systems"

Connected through hyperedge HE-6 (induced by source paper "on the symmetric k user interference channels with limited feedback"):
  with members:
    - "degrees of freedom of the rank deficient interference channel with feedback"
    - "capacity of all nine models of channel output feedback for the two user interference channel"
    - "on the capacity region and the generalized degrees of freedom region for the mimo interference channel with feedback"
    - "the approximate sum capacity of the symmetric gaussian k user interference channel"
    - "wireless network information flow a deterministic approach"
    - "interference channels with rate limited feedback"
    - "feedback capacity of the gaussian interference channel to within 2 bits"
    - "on channel output feedback in deterministic interference channels"

Connected through hyperedge HE-7 (induced by source paper "secure compute and forward transmission with artificial noise and full duplex devices"):
  with members:
    - "near optimal modulo and forward scheme for the untrusted relay channel"
    - "multi antenna relay aided wireless physical layer security"
    - "secure transmission on the two hop relay channel with scaled compute and forward"
    - "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-8 (induced by source paper "lattice codes for many to one interference channels with and without cognitive messages"):
  with members:
    - "compute and forward finding the best equation"
    - "multiuser cognitive radio networks an information theoretic perspective"
    - "approximate sum capacity of k user cognitive interference channels with cumulative message sharing"
    - "is non unique decoding necessary"
    - "the approximate sum capacity of the symmetric gaussian k user interference channel"
    - "inner and outer bounds for the gaussian cognitive interference channel and new capacity results"
    - "nested lattice codes for gaussian relay networks with interference"
    - "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)