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 "optimality of orthogonal access for one dimensional convex cellular networks"):
  Abstract: It is shown that a greedy orthogonal access scheme achieves the sum degrees of freedom of all one-dimensional (all nodes placed along a straight line) convex cellular networks (where cells are convex regions) when no channel knowledge is available at the transmitters except the knowledge of the network topology. In general, optimality of orthogonal access holds neither for two-dimensional convex cellular networks nor for one-dimensional non-convex cellular networks, thus revealing a fundamental limitation that exists only when both one-dimensional and convex properties are simultaneously enforced, as is common in canonical information theoretic models for studying cellular networks. The result also establishes the capacity of the corresponding class of index coding problems.

Includes members:
  Member "topological interference management through index coding":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on the separability of parallel miso broadcast channels under partial csit a degrees of freedom region perspective")
  Member "cognitive wyner networks with clustered decoding":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "fundamental limits of dynamic interference management with flexible message assignments")
  Member "on the capacity region for index coding":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "an index coding approach to caching with uncoded cache placement")
  Member "index coding capacity how far can one go with only shannon inequalities":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "conditional disclosure of secrets a noise and signal alignment approach")
  Member "interference networks with no csit impact of topology":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "network coherence time matters aligned image sets and the degrees of freedom of interference networks with finite precision csit and perfect csir")
  Member "index coding an interference alignment perspective":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "conditional disclosure of secrets a noise and signal alignment approach")
  Member "elements of cellular blind interference alignment aligned frequency reuse wireless index coding and interference diversity":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "network coherence time matters aligned image sets and the degrees of freedom of interference networks with finite precision csit and perfect csir")
  Member "on the accuracy of the wyner model in cellular networks":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "hybrid lifi and wifi networks a survey")

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)