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 sum capacity of a class of cyclically symmetric deterministic interference channels"
  Abstract: Certain deterministic interference channels have been shown to accurately model Gaussian interference channels in the asymptotic low-noise regime. Motivated by this correspondence, we investigate a K user-pair, cyclically symmetric, deterministic interference channel in which each receiver experiences interference only from its neighboring transmitters (Wyner model). We establish the sum capacity for a large set of channel parameters, thus generalizing previous results for the 2-pair case.

Connected through hyperedge HE-1 (induced by source paper "sum capacity of interference channels with a local view impact of distributed decisions"):
  with members:
    - "wireless network information flow a deterministic approach"
    - "the approximate capacity of the many to one and one to many gaussian interference channels"
    - "gaussian belief propagation theory and application"
    - "the two user gaussian interference channel a deterministic view"
    - "generalized degrees of freedom of the symmetric gaussian k user interference channel"
    - "gaussian interference channel capacity to within one bit"

Connected through hyperedge HE-2 (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"

Connected through hyperedge HE-3 (induced by source paper "k user interference channels general outer bound and sum capacity for certain gaussian channels"):
  with members:
    - "a new sum rate outer bound for interference channels with three source destination pairs"
    - "interference channels with source cooperation"
    - "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"
    - "new inner and outer bounds for the discrete memoryless cognitive interference channel and some capacity results"
    - "the capacity region of the 3 user gaussian interference channel with mixed strong very strong interference"
    - "on the degrees of freedom of the k user gaussian interference channel"

Connected through hyperedge HE-4 (induced by source paper "interference decoding for deterministic channels"):
  with members:
    - "real interference alignment exploiting the potential of single antenna systems"
    - "the approximate capacity of the many to one and one to many gaussian interference channels"
    - "lecture notes on network information theory"
    - "on the degrees of freedom of the k user gaussian interference channel"
    - "capacity of a class of symmetric simo gaussian interference channels within o 1"
    - "compute and forward harnessing interference through structured codes"
    - "the two user gaussian interference channel a deterministic view"
    - "generalized degrees of freedom of the symmetric gaussian k user interference channel"

Connected through hyperedge HE-5 (induced by source paper "the generalized degrees of freedom of the mimo interference channel"):
  with members:
    - "the generalized degrees of freedom region of the mimo interference channel"
    - "the capacity region of the mimo interference channel and its reciprocity to within a constant gap"
    - "capacity of a class of symmetric simo gaussian interference channels within o 1"
    - "generalized degrees of freedom of the symmetric gaussian k user interference channel"
    - "on the capacity and generalized degrees of freedom of the x channel"
    - "gaussian interference channel capacity to within one bit"

Connected through hyperedge HE-6 (induced by source paper "aligned interference neutralization and the degrees of freedom of the 2x2x2 interference channel"):
  with members:
    - "distributed data storage with minimum storage regenerating codes exact and functional repair are asymptotically equally efficient"
    - "exploiting channel correlations simple interference alignment schemes with no csit"
    - "sum capacity and the unique separability of the parallel gaussian mac z bc network"
    - "error exponents for the gaussian channel with active noisy feedback"
    - "capacity bounds for two hop interference networks"
    - "real interference alignment with real numbers"
    - "on the degrees of freedom of the k user gaussian interference channel"
    - "ergodic interference alignment"

Connected through hyperedge HE-7 (induced by source paper "the capacity region of the 3 user gaussian interference channel with mixed strong very strong interference"):
  with members:
    - "rate region frontiers for n user interference channel with interference as noise"
    - "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"
    - "a layered lattice coding scheme for a class of three user gaussian interference channels"
    - "capacity of symmetric k user gaussian very strong interference channels"
    - "the two user gaussian interference channel a deterministic view"
    - "generalized degrees of freedom of the symmetric gaussian k user interference channel"

Connected through hyperedge HE-8 (induced by source paper "on achievable rates for non linear deterministic interference channels"):
  with members:
    - "real interference alignment with real numbers"
    - "on the degrees of freedom of the k user gaussian interference channel"
    - "interference alignment on the deterministic channel and application to fully connected awgn interference networks"
    - "gaussian interference channel capacity to within one bit"
    - "interference alignment and the degrees of freedom for the k user interference channel"

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)