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: "gaussian multiple access via compute and forward"
  Abstract: Lattice codes used under the compute-and-forward paradigm suggest an alternative strategy for the standard Gaussian multiple-access channel (MAC): the receiver successively decodes the integer linear combinations of the messages until it can invert and recover all messages. In this paper, a multiple-access technique called compute-forward multiple access (CFMA) is proposed and analyzed. For the two-user MAC, it is shown that without time-sharing, the entire capacity region can be attained using CFMA with a single-user decoder as soon as the signal-to-noise ratios are above    $1+\sqrt {2}$   . A partial analysis is given for more than two users. Finally, the strategy is extended to the so-called dirty MAC, where two interfering signals are known non-causally to the two transmitters in a distributed fashion. Our scheme extends the previously known results and gives new achievable rate regions.

Connected through hyperedge HE-1 (induced by source paper "private information retrieval over gaussian mac"):
  with members:
    - "noisy private information retrieval on separability of channel coding and information retrieval"
    - "asymptotically optimal scheduling for compute and forward"
    - "private information retrieval from mds coded data in distributed storage systems"
    - "the capacity of private information retrieval with partially known private side information"
    - "the capacity of private information retrieval from byzantine and colluding databases"
    - "the necessity of scheduling in compute and forward"
    - "the capacity of robust private information retrieval with colluding databases"
    - "the capacity of symmetric private information retrieval"

Connected through hyperedge HE-2 (induced by source paper "performance of multi cell massive mimo systems with interference decoding"):
  with members:
    - "large scale fading decoding in cellular massive mimo systems with spatially correlated channels"
    - "massive mimo has unlimited capacity"
    - "uplink interference reduction in large scale antenna systems"
    - "joint power allocation and user association optimization for massive mimo systems"
    - "robust pilot decontamination based on joint angle and power domain discrimination"
    - "optimal achievable rates for interference networks with random codes"
    - "system architecture and key technologies for 5g heterogeneous cloud radio access networks"
    - "massive mimo for next generation wireless systems"

Connected through hyperedge HE-3 (induced by source paper "towards an algebraic network information theory simultaneous joint typicality decoding"):
  with members:
    - "homologous codes for multiple access channels"
    - "polynomially solvable instances of the shortest and closest vector problems with applications to compute and forward"
    - "an achievable rate region for the three user interference channel based on coset codes"
    - "equivalence of additive combinatorial linear inequalities for shannon entropy and differential entropy"
    - "expanding the compute and forward framework unequal powers signal levels and multiple linear combinations"
    - "secure compute and forward in a bidirectional relay"
    - "distributed decode forward for relay networks"
    - "secure degrees of freedom of one hop wireless networks"

Connected through hyperedge HE-4 (induced by source paper "efficient scheduling for the massive random access gaussian channel"):
  with members:
    - "a joint graph based coding scheme for the unsourced random access gaussian channel"
    - "a coupled compressive sensing scheme for unsourced multiple access"
    - "massive multiple access based on superposition raptor codes for cellular m2m communications"
    - "massive non orthogonal multiple access for cellular iot potentials and limitations"
    - "capacity of gaussian many access channels"
    - "sign compute resolve for tree splitting random access"
    - "code design for short blocks a survey"
    - "massive machine type communications in 5g physical and mac layer solutions"

Connected through hyperedge HE-5 (induced by source paper "compute forward multiple access cfma practical code design"):
  with members:
    - "an algebraic approach to physical layer network coding"
    - "simultaneous nonunique decoding is rate optimal"
    - "compute and forward harnessing interference through structured codes"
    - "gaussian interference channel capacity to within one bit"

Connected through hyperedge HE-6 (induced by source paper "secure transmission on the two hop relay channel with scaled compute and forward"):
  with members:
    - "secure compute and forward in a bidirectional relay"
    - "near optimal modulo and forward scheme for the untrusted relay channel"
    - "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)