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: "secure compute and forward in a bidirectional relay"
  Abstract: We consider the basic bidirectional relaying problem, in which two users in a wireless network wish to exchange messages through an intermediate relay node. In the compute-and-forward strategy, the relay computes a function of the two messages using the naturally occurring sum of symbols simultaneously transmitted by user nodes in a Gaussian multiple-access channel (MAC), and the computed function value is forwarded to the user nodes in an ensuing broadcast phase. In this paper, we study the problem under an additional security constraint, which requires that each user’s message be kept secure from the relay. We consider two types of security constraints: 1) perfect secrecy, in which the MAC channel output seen by the relay is independent of each user’s message and 2) strong secrecy, which is a form of asymptotic independence. We propose a coding scheme based on nested lattices, the main feature of which is that given a pair of nested lattices that satisfy certain goodness properties, we can explicitly specify probability distributions for randomization at the encoders to achieve the desired security criteria. In particular, our coding scheme guarantees perfect or strong secrecy even in the absence of channel noise. The noise in the channel only affects reliability of computation at the relay, and for Gaussian noise, we derive achievable rates for reliable and secure computation. We also present an application of our methods to the multihop line network in which a source needs to transmit messages to a destination through a series of intermediate relays.

Connected through hyperedge HE-1 (induced by source paper "towards an algebraic network information theory simultaneous joint typicality decoding"):
  with members:
    - "homologous codes for multiple access channels"
    - "gaussian multiple access via compute and forward"
    - "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"
    - "distributed decode forward for relay networks"
    - "secure degrees of freedom of one hop wireless networks"

Connected through hyperedge HE-2 (induced by source paper "secure modulo sum via multiple access channel"):
  with members:
    - "secure computation and forward with linear codes"
    - "secure physical layer network coding versus secure network coding"
    - "physical layer network coding a random coding error exponent perspective"
    - "secure multiplex coding with dependent and non uniform multiple messages"
    - "on secure computation over the binary modulo 2 adder multiple access wiretap channel"
    - "expanding the compute and forward framework unequal powers signal levels and multiple linear combinations"
    - "adaptive compute and forward with lattice codes over algebraic integers"
    - "lattices over eisenstein integers for compute and forward"

Connected through hyperedge HE-3 (induced by source paper "secure physical layer network coding versus secure network coding"):
  with members:
    - "secure computation and forward with linear codes"
    - "secure modulo sum via multiple access channel"
    - "physical layer network coding a random coding error exponent perspective"
    - "expanding the compute and forward framework unequal powers signal levels and multiple linear combinations"
    - "strong secrecy and reliable byzantine detection in the presence of an untrusted relay"
    - "compute and forward harnessing interference through structured codes"

Connected through hyperedge HE-4 (induced by source paper "secure computation and forward with linear codes"):
  with members:
    - "physical layer network coding a random coding error exponent perspective"
    - "spatially coupled ensembles universally achieve capacity under belief propagation"
    - "exponential decreasing rate of leaked information in universal random privacy amplification"
    - "strong secrecy and reliable byzantine detection in the presence of an untrusted relay"

Connected through hyperedge HE-5 (induced by source paper "some goodness properties of lda lattices"):
  with members:
    - "lda lattices without dithering achieve capacity on the gaussian channel"
    - "semantically secure lattice codes for the gaussian wiretap channel"
    - "a simple proof for the existence of good pairs of nested lattices"
    - "the approximate capacity of the many to one and one to many gaussian interference channels"
    - "strong secrecy and reliable byzantine detection in the presence of an untrusted relay"
    - "secrecy gain a wiretap lattice code design"
    - "compute and forward harnessing interference through structured codes"
    - "generalized degrees of freedom of the symmetric gaussian k user interference channel"

Connected through hyperedge HE-6 (induced by source paper "expanding the compute and forward framework unequal powers signal levels and multiple linear combinations"):
  with members:
    - "an achievable rate region for the three user interference channel based on coset codes"
    - "a joint typicality approach to algebraic network information theory"
    - "secure degrees of freedom of one hop wireless networks"
    - "real interference alignment exploiting the potential of single antenna systems"
    - "multiple access via compute and forward"
    - "lattices over eisenstein integers for compute and forward"
    - "uplink downlink duality for integer forcing"
    - "successive integer forcing and its sum rate optimality"

Connected through hyperedge HE-7 (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"
    - "asymmetric compute and forward with csit"
    - "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-8 (induced by source paper "a capacity achieving coding scheme for the awgn channel with polynomial encoding and decoding complexity"):
  with members:
    - "a lattice coding scheme for secret key generation from gaussian markov tree sources"
    - "unified scaling of polar codes error exponent scaling exponent moderate deviations and error floors"
    - "construction of capacity achieving lattice codes polar lattices"
    - "semantically secure lattice codes for the gaussian wiretap channel"
    - "physical layer network coding tutorial survey and beyond"
    - "integer forcing linear receivers"
    - "compute and forward harnessing interference through structured codes"
    - "low density lattice codes"

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)