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: "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.

Connected through hyperedge HE-1 (induced by source paper "optimality of simple layered superposition coding in the 3 user miso bc with finite precision csit"):
  with members:
    - "towards an extremal network theory robust gdof gain of transmitter cooperation over tin"
    - "k user symmetric m times n mimo interference channel under finite precision csit a gdof perspective"
    - "sum set inequalities from aligned image sets instruments for robust gdof bounds"
    - "aligned image sets and the generalized degrees of freedom of symmetric mimo interference channel with partial csit"
    - "network coherence time matters aligned image sets and the degrees of freedom of interference networks with finite precision csit and perfect csir"
    - "achievable dof regions of mimo networks with imperfect csit"
    - "gdof of the k user symmetric miso bc bridging the gap between finite precision and perfect csit"
    - "generalized degrees of freedom of the symmetric k user interference channel under finite precision csit"

Connected through hyperedge HE-2 (induced by source paper "fundamental limits of dynamic interference management with flexible message assignments"):
  with members:
    - "the role of transmitter cooperation in linear interference networks with block erasures"
    - "cognitive wyner networks with clustered decoding"
    - "flexible backhaul design and degrees of freedom for linear interference networks"
    - "dynamic interference management"
    - "degrees of freedom dof of locally connected interference channels with coordinated multi point comp transmission"
    - "approaching the capacity of wireless networks through distributed interference alignment"

Connected through hyperedge HE-3 (induced by source paper "topological interference management with decoded message passing"):
  with members:
    - "on the impact of a single edge on the network coding capacity"
    - "tdma is optimal for all unicast dof region of tim if and only if topology is chordal bipartite"
    - "fractional coloring orthogonal access achieves all unicast capacity dof region of index coding tim if and only if network topology is chordal"
    - "on critical index coding problems"
    - "when does an ensemble of matrices with randomly scaled rows lose rank"
    - "topological interference management with transmitter cooperation"
    - "topological interference management through index coding"
    - "cognitive wyner networks with clustered decoding"

Connected through hyperedge HE-4 (induced by source paper "on tdma optimality in locally connected networks with no csit"):
  with members:
    - "network mimo transmitters with no csi can still be very useful"
    - "fractional coloring orthogonal access achieves all unicast capacity dof region of index coding tim if and only if network topology is chordal"
    - "cloud radio access network virtualizing wireless access for dense heterogeneous systems"
    - "performance of cloud radio networks"
    - "when does an ensemble of matrices with randomly scaled rows lose rank"
    - "topological interference management with transmitter cooperation"
    - "topological interference management through index coding"
    - "aligned image sets under channel uncertainty settling a conjecture by lapidoth shamai and wigger on the collapse of degrees of freedom under finite precision csit"

Connected through hyperedge HE-5 (induced by source paper "tdma is optimal for all unicast dof region of tim if and only if topology is chordal bipartite"):
  with members:
    - "topological interference management with decoded message passing"
    - "the single uniprior index coding problem the single sender case and the multi sender extension"
    - "topological interference management with reconfigurable antennas"
    - "storage capacity of repairable networks"
    - "topological interference management with transmitter cooperation"
    - "a rate distortion approach to index coding"
    - "topological interference management through index coding"
    - "bounding multiple unicasts through index coding and locally repairable codes"

Connected through hyperedge HE-6 (induced by source paper "topological interference management through index coding"):
  with members:
    - "cognitive wyner networks with clustered decoding"
    - "degrees of freedom of time correlated miso broadcast channel with delayed csit"
    - "fundamental limits of caching"
    - "an equivalence between network coding and index coding"
    - "optimal use of current and outdated channel state information degrees of freedom of the miso bc with mixed csit"
    - "degrees of freedom of mimo x networks spatial scale invariance one sided decomposability and linear feasibility"
    - "degrees of freedom of interference channels with comp transmission and reception"
    - "fundamental limits of cooperation"

Connected through hyperedge HE-7 (induced by source paper "topological interference management with transmitter cooperation"):
  with members:
    - "fractional coloring orthogonal access achieves all unicast capacity dof region of index coding tim if and only if network topology is chordal"
    - "topological interference management through index coding"
    - "the degrees of freedom region of temporally correlated mimo networks with delayed csit"
    - "on the capacity region for index coding"
    - "multilevel topological interference management"
    - "topological interference management with alternating connectivity"
    - "topological interference management with alternating connectivity the wyner type three user interference channel"
    - "index coding capacity how far can one go with only shannon inequalities"

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)