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: "interference alignment and a noisy interference regime for many to one interference channels"
  Abstract: We study the capacity of discrete memoryless many-to-one interference channels, i.e., K user interference channels where only one receiver faces interference. For a class of many-to-one interference channels, we identify a noisy interference regime, i.e., a regime where random coding and treating interference as noise achieves sum-capacity. Specializing our results to the Gaussian MIMO many-to-one interference channel, which is a special case of the class of channels considered, we obtain new capacity results. Firstly, we extend the noisy interference regime, previously studied for (many-to-one) interference channels with average power constraints on the inputs, to a more general class of inputs. This more general class includes the practical scenario of inputs being restricted to fixed finite-size constellations such as PSK or QAM. Secondly, we extend noisy interference results previously studied in SISO interference channels with full channel state information (CSI) at all nodes, to MIMO and parallel Gaussian many-to-one interference channels, and to fading Gaussian many-to-one interference channels without CSI at the transmitters. While the many-to-one interference channel requires interference alignment, which in turn requires structured codes in general, we argue that in the noisy interference regime, interference is implicitly aligned by random coding irrespective of the input distribution. As a byproduct of our study, we identify a second class of many-to-one interference channels (albeit deterministic) where random coding is optimal (though interference is not treated as noise). The optimality of random coding in this second class of channels is due to an interference resolvability condition which precludes interference alignment and hence obviates the need of structured codes.

Connected through hyperedge HE-1 (induced by source paper "on the sum capacity of many to one and one to many gaussian interference channels"):
  with members:
    - "on the gaussian many to one x channel"
    - "lattice codes for many to one interference channels with and without cognitive messages"
    - "capacity bounds for the k user gaussian interference channel"
    - "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"
    - "on the capacity of the k user cyclic gaussian interference channel"
    - "capacity bounds for the gaussian interference channel"
    - "new outer bounds on the capacity region of gaussian interference channels"

Connected through hyperedge HE-2 (induced by source paper "an achievable rate region for the three user interference channel based on coset codes"):
  with members:
    - "on interference networks over finite fields"
    - "on the capacity of the finite field counterparts of wireless interference networks"
    - "is non unique decoding necessary"
    - "abelian group codes for source coding and channel coding"
    - "achievable rate region based on coset codes for multiple access channel with states"
    - "the approximate sum capacity of the symmetric gaussian k user interference channel"
    - "interference alignment from degrees of freedom to constant gap capacity approximations"
    - "interference decoding for deterministic channels"

Connected through hyperedge HE-3 (induced by source paper "on the gaussian many to one x channel"):
  with members:
    - "on the optimality of treating interference as noise general message sets"
    - "interference alignment from degrees of freedom to constant gap capacity approximations"
    - "the approximate capacity of the many to one and one to many gaussian interference channels"
    - "on the capacity of multiple access z interference channels"
    - "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-4 (induced by source paper "achievable rate region for three user discrete broadcast channel based on coset codes"):
  with members:
    - "an achievable rate region for the three user interference channel based on coset codes"
    - "on interference networks over finite fields"
    - "on the capacity of the finite field counterparts of wireless interference networks"
    - "achievable rate region based on coset codes for multiple access channel with states"
    - "evaluation of marton s inner bound for the general broadcast channel"
    - "on the capacity of abelian group codes over discrete memoryless channels"
    - "the approximate capacity of the many to one and one to many gaussian interference channels"
    - "on broadcast channels with binary inputs and symmetric outputs"

Connected through hyperedge HE-5 (induced by source paper "achievable and crystallized rate regions of the interference channel with interference as noise"):
  with members:
    - "rate region frontiers for n user interference channel with interference as noise"
    - "crystallized rates region of the interference channel via correlated equilibrium with interference as noise"
    - "a new outer bound and the noisy interference sum rate capacity for gaussian interference channels"
    - "capacity bounds for the gaussian interference channel"
    - "sum capacity of the gaussian interference channel in the low interference regime"
    - "gaussian interference channel capacity to within one bit"

Connected through hyperedge HE-6 (induced by source paper "degrees of freedom region for an interference network with general message demands"):
  with members:
    - "real interference alignment exploiting the potential of single antenna systems"
    - "degrees of freedom regions of two user mimo z and full interference channels the benefit of reconfigurable antennas"
    - "interference alignment for the k user mimo interference channel"
    - "the approximate capacity of the many to one and one to many gaussian interference channels"
    - "aiming perfectly in the dark blind interference alignment through staggered antenna switching"
    - "capacity regions and sum rate capacities of vector gaussian interference channels"
    - "on feasibility of interference alignment in mimo interference networks"
    - "on the degrees of freedom regions of two user mimo z and full interference channels with reconfigurable antennas"

Connected through hyperedge HE-7 (induced by source paper "on the capacity of the k user cyclic gaussian interference channel"):
  with members:
    - "the approximate sum capacity of the symmetric gaussian k user interference channel"
    - "on the symmetric feedback capacity of the k user cyclic interference channel"
    - "a new sum rate outer bound for interference channels with three source destination pairs"
    - "the approximate capacity of the many to one and one to many gaussian interference channels"
    - "the capacity region of the 3 user gaussian interference channel with mixed strong very strong interference"
    - "a new outer bound and the noisy interference sum rate capacity for gaussian interference channels"
    - "capacity bounds for the gaussian interference channel"
    - "generalized degrees of freedom of the symmetric gaussian k user interference channel"

Connected through hyperedge HE-8 (induced by source paper "sum capacity and the unique separability of the parallel gaussian mac z bc network"):
  with members:
    - "ergodic interference alignment"
    - "degrees of freedom region for the mimo x 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)