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: "on the impact of a single edge on the network coding capacity"
  Abstract: In this paper, we study the effect of a single link on the capacity of a network of error-free bit pipes. More precisely, we study the change in network capacity that results when we remove a single link of capacity $\delta$. In a recent result, we proved that if all the sources are directly available to a single super-source node, then removing a link of capacity $\delta$ cannot change the capacity region of the network by more than $\delta$ in each dimension. In this paper, we extend this result to the case of multi-source, multi-sink networks for some special network topologies.

Connected through hyperedge HE-1 (induced by source paper "a local perspective on the edge removal problem"):
  with members:
    - "a class of non linearly solvable networks"
    - "network coding capacity regions via entropy functions"
    - "network coding is zero error always possible"
    - "lexicographic products and the power of non linear network coding"
    - "dualities between entropy functions and network codes"

Connected through hyperedge HE-2 (induced by source paper "negligible cooperation contrasting the maximal and average error cases"):
  with members:
    - "strong converses are just edge removal properties"
    - "on the capacity advantage of a single bit"
    - "fundamental limits of communication with low probability of detection"
    - "network coding is zero error always possible"

Connected through hyperedge HE-3 (induced by source paper "can negligible cooperation increase network capacity the average error case"):
  with members:
    - "strong converses are just edge removal properties"
    - "on the capacity advantage of a single bit"
    - "network coding is zero error always possible"

Connected through hyperedge HE-4 (induced by source paper "topological interference management with decoded message passing"):
  with members:
    - "tdma is optimal for all unicast dof region of tim if and only if topology is chordal bipartite"
    - "fractional coloring orthogonal access achieves all unicast capacity dof region of index coding tim if and only if network topology is chordal"
    - "on critical index coding problems"
    - "when does an ensemble of matrices with randomly scaled rows lose rank"
    - "topological interference management with transmitter cooperation"
    - "topological interference management through index coding"
    - "cognitive wyner networks with clustered decoding"
    - "cellular interference alignment"

Connected through hyperedge HE-5 (induced by source paper "strong converses are just edge removal properties"):
  with members:
    - "on the capacity advantage of a single bit"
    - "smoothing brascamp lieb inequalities and strong converses for common randomness generation"
    - "a proof of the strong converse theorem for gaussian multiple access channels"
    - "exponent function for one helper source coding problem at rates outside the rate region"
    - "strong converse exponent for degraded broadcast channels at rates outside the capacity region"
    - "strong converse theorems for degraded broadcast channels with feedback"
    - "equivalence for networks with adversarial state"
    - "a case where interference does not affect the channel dispersion"

Connected through hyperedge HE-6 (induced by source paper "multiround private information retrieval capacity and storage overhead"):
  with members:
    - "private information retrieval from mds coded data in distributed storage systems"
    - "pir array codes with optimal virtual server rate"
    - "on private information retrieval array codes"
    - "the capacity of robust private information retrieval with colluding databases"
    - "lower bound on the redundancy of pir codes"
    - "pir array codes with optimal pir rate"
    - "pir schemes with small download complexity and low storage requirements"
    - "the capacity of symmetric private information retrieval"

Connected through hyperedge HE-7 (induced by source paper "network simplification in half duplex building on submodularity"):
  with members:
    - "on network simplification for gaussian half duplex diamond networks"
    - "cut set bound is loose for gaussian relay networks"
    - "the approximate optimality of simple schedules for half duplex multi relay networks"
    - "gaussian half duplex relay networks improved constant gap and connections with the assignment problem"
    - "wireless network simplification the gaussian n relay diamond network"

Connected through hyperedge HE-8 (induced by source paper "the unbounded benefit of encoder cooperation for the k user mac"):
  with members:
    - "the unbounded benefit of encoder cooperation for the k user mac extended version"
    - "on achievability for downlink cloud radio access networks with base station cooperation"
    - "can negligible cooperation increase network reliability"
    - "the multivariate covering lemma and its converse"

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)