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: "reciprocity in linear deterministic networks under linear coding"
  Abstract: The linear deterministic model has been used recently to get a first order understanding of many wireless communication network problems. In many of these cases, it has been pointed out that the capacity regions of the network and its reciprocal (where the communication links are reversed and the roles of the sources and the destinations are swapped) are the same. In this paper, we consider a linear deterministic communication network with multiple unicast information flows. For this model and under the restriction to the class of linear coding, we show that the rate regions for a network and its reciprocal are the same. This can be viewed as a generalization of the linear reversibility of wireline networks, already known in the network coding literature.

Connected through hyperedge HE-1 (induced by source paper "upper bounds and duality relations of the linear deterministic sum capacity for cellular systems"):
  with members:
    - "the approximate capacity of the many to one and one to many gaussian interference channels"
    - "the two user gaussian interference channel a deterministic view"
    - "a deterministic approach to wireless relay networks"

Connected through hyperedge HE-2 (induced by source paper "interference channels with source cooperation"):
  with members:
    - "interference channels with destination cooperation"
    - "interference mitigation through limited transmitter cooperation"
    - "feedback capacity of the gaussian interference channel to within 2 bits"
    - "feedback capacity of the gaussian interference channel to within 1 7075 bits the symmetric case"
    - "on the symmetric gaussian interference channel with partial unidirectional cooperation"
    - "transmission techniques for relay interference networks"
    - "an achievable rate region for interference channels with conferencing"
    - "gaussian interference channel capacity to within one bit"

Connected through hyperedge HE-3 (induced by source paper "interference mitigation through limited transmitter cooperation"):
  with members:
    - "wireless network information flow a deterministic approach"
    - "interference channels with source cooperation"
    - "interference channels with destination cooperation"
    - "the approximate capacity of the many to one and one to many gaussian interference channels"
    - "lecture notes on network information theory"
    - "interference mitigation through limited receiver cooperation"
    - "on the symmetric gaussian interference channel with partial unidirectional cooperation"
    - "the two user gaussian interference channel a deterministic view"

Connected through hyperedge HE-4 (induced by source paper "approximately optimal wireless broadcasting"):
  with members:
    - "wireless network information flow a deterministic approach"
    - "a digital interface for gaussian relay and interference networks lifting codes from the discrete superposition model"
    - "algebraic network coding approach to deterministic wireless relay networks"
    - "noisy network coding"
    - "linear finite field deterministic networks with many sources and one destination"
    - "on approximating gaussian relay networks by deterministic networks"
    - "a combinatorial study of linear deterministic relay networks"
    - "cooperative relay broadcast channels"

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)