human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "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.

Includes members:
  Member "ergodic fading interference channels sum capacity and separability":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "interference regime enforcing rate maximization for non orthogonal multiple access noma")
  Member "capacity regions and sum rate capacities of vector gaussian interference channels":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "signal processing and optimal resource allocation for the interference channel")
  Member "on the degrees of freedom of finite state compound wireless networks settling a conjecture by weingarten et al":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "mimo broadcast channel with an unknown eavesdropper secrecy degrees of freedom")
  Member "asymptotic equipartition property of output when rate is above capacity":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "half duplex active eavesdropping in fast fading channels a block markov wyner secrecy encoding scheme")
  Member "a new outer bound and the noisy interference sum rate capacity for gaussian interference channels":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "vector gaussian successive refinement with degraded side information")
  Member "interference alignment with asymmetric complex signaling settling the host madsen nosratinia conjecture":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "two user simo interference channel with tin improper signaling versus time sharing")
  Member "capacity of a class of symmetric simo gaussian interference channels within o 1":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "on the performance of optimized dense device to device wireless networks")
  Member "gaussian interference networks sum capacity in the low interference regime and new outer bounds on the capacity region":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "extended generalized dof optimality regime of treating interference as noise in the x channel")

Question: Please tell me which class the source paper 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)