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: "the capacity region of a class of discrete degraded interference channels"
  Abstract: We provide a single-letter characterization for the capacity region of a class of discrete degraded interference channels (DDICs). The class of DDICs considered includes the discrete additive degraded interference channel (DADIC) studied by Benzel. We show that for the class of DDICs studied, encoder cooperation does not increase the capacity region, and therefore, the capacity region of the class of DDICs is the same as the capacity region of the corresponding degraded broadcast channel.

Connected through hyperedge HE-1 (induced by source paper "polar coding strategies for the interference channel with partially joint decoding"):
  with members:
    - "achieving the uniform rate region of general multiple access channels by polar coding"
    - "polar coding for processes with memory"
    - "optimal achievable rates for interference networks with random codes"
    - "polar codes for broadcast channels"
    - "polar coding for the broadcast channel with confidential messages a random binning analogy"
    - "how to achieve the capacity of asymmetric channels"
    - "polar coding for interference networks"
    - "channel upgradation for non binary input alphabets and macs"

Connected through hyperedge HE-2 (induced by source paper "multicoding schemes for interference channels"):
  with members:
    - "on the capacity of the two user gaussian causal cognitive interference channel"
    - "on the achievable rate regions for state dependent gaussian interference channel"
    - "a comparison of superposition coding schemes"
    - "simultaneous nonunique decoding is rate optimal"
    - "wireless network information flow a deterministic approach"
    - "the state dependent semideterministic broadcast channel"
    - "interference channels with source cooperation"
    - "interference channels with destination cooperation"

Connected through hyperedge HE-3 (induced by source paper "analytical and numerical characterizations of shannon ordering for discrete memoryless channels"):
  with members:
    - "ordering finite state markov channels by mutual information"

Connected through hyperedge HE-4 (induced by source paper "noisy interference sum rate capacity for vector gaussian interference channels"):
  with members:
    - "capacity region of vector gaussian interference channels with generally strong interference"
    - "optimal beamforming in interference networks with perfect local channel information"
    - "capacity regions and sum rate capacities of vector gaussian interference channels"
    - "cooperative interference management with miso beamforming"
    - "a new outer bound and the noisy interference sum rate capacity for gaussian interference channels"
    - "capacity bounds for the gaussian interference channel"
    - "new outer bounds on the capacity region of gaussian interference channels"
    - "gaussian interference channel capacity to within one bit"

Connected through hyperedge HE-5 (induced by source paper "spectrum optimization in multi user multi carrier systems with iterative convex and nonconvex approximation methods"):
  with members:
    - "refim a practical interference management in heterogeneous wireless access networks"
    - "optimal spectrum management in multiuser interference channels"
    - "power control in two tier femtocell networks"
    - "a new outer bound and the noisy interference sum rate capacity for gaussian interference channels"
    - "gaussian interference channel capacity to within one bit"

Connected through hyperedge HE-6 (induced by source paper "capacity bounds and sum rate capacities of a class of discrete memoryless interference channels"):
  with members:
    - "fundamental limits of communications in interference networks part i basic structures"
    - "a new outer bound and the noisy interference sum rate capacity for gaussian interference channels"
    - "capacity bounds for the gaussian interference channel"

Connected through hyperedge HE-7 (induced by source paper "on the sum capacity of the discrete memoryless interference channel with one sided weak interference and mixed interference"):
  with members:
    - "a new outer bound and the noisy interference sum rate capacity for gaussian interference channels"
    - "gaussian interference networks sum capacity in the low interference regime and new outer bounds on the capacity region"
    - "capacity bounds for the gaussian interference channel"

Connected through hyperedge HE-8 (induced by source paper "a new sum rate outer bound for interference channels with three source destination pairs"):
  with members:
    - "on achievability of gaussian interference channel capacity to within one bit"
    - "interference channels with source cooperation"
    - "k user interference channels general outer bound and sum capacity for certain gaussian channels"
    - "the approximate capacity of the many to one and one to many gaussian interference channels"
    - "sum capacity of k user gaussian degraded interference channels"
    - "outer bounds for the interference channel with a cognitive relay"
    - "interference channel with generalized feedback a k a with source cooperation part i achievable region"
    - "lecture notes on network information theory"

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)