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 computation and forward with linear codes"
  Abstract: We discuss secure transmission via an untrusted relay when we have a multiple access phase from two nodes to the relay and broadcast phase from the relay to the two nodes. To realize the security, we construct a code that securely transmits the modulo sum of the messages of two nodes via a multiple access channel. In this code, the relay cannot obtain any information for the message of each node, and can decode only the messages of the two nodes. Our code is constructed by simple combination of an existing liner code and universal2 hash function.

Connected through hyperedge HE-1 (induced by source paper "asymptotic analysis on ldpc bicm scheme for compute and forward relaying"):
  with members:
    - "asymptotic analysis of spatial coupling coding for compute and forward relaying"
    - "an algebraic approach to physical layer network coding"
    - "universal codes for the gaussian mac via spatial coupling"
    - "channel coding and decoding in a relay system operated with physical layer network coding"
    - "can iterative decoding for erasure correlated sources be universal"
    - "compute and forward harnessing interference through structured codes"
    - "density evolution for asymmetric memoryless channels"

Connected through hyperedge HE-2 (induced by source paper "secure modulo sum via multiple access channel"):
  with members:
    - "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"
    - "secure compute and forward in a bidirectional relay"
    - "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 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"
    - "secure compute and forward in a bidirectional relay"
    - "strong secrecy and reliable byzantine detection in the presence of an untrusted relay"
    - "compute and forward harnessing interference through structured 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)