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: "fractional coloring orthogonal access achieves all unicast capacity dof region of index coding tim if and only if network topology is chordal"
  Abstract: The main result of this work is that fractional coloring (orthogonal access) achieves the all-unicast capacity (degrees of freedom (DoF)) region of the index coding (topological interference management (TIM)) problem if and only if the bipartite network topology graph (with sources on one side and destinations on the other, and edges identifying presence of nontrivial channels whose communication capacity is not zero or infinity) is chordal, i.e., every cycle that can contain a chord, does contain a chord. The all-unicast capacity (DoF) region includes the capacity (DoF) region for any arbitrary choice of a unicast message set, so e.g., the results of Maleki and Jafar on the optimality of orthogonal access for the sum-capacity (DoF) of one-dimensional convex networks are recovered as a special case.

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 "the optimality of partial clique covering for index coding"):
  with members:
    - "interlinked cycles for index coding generalizing cycles and cliques"
    - "local partial clique covers for index coding"
    - "approximate capacity of index coding for some classes of graphs"
    - "the single uniprior index coding problem the single sender case and the multi sender extension"
    - "tdma is optimal for all unicast dof region of tim if and only if topology is chordal bipartite"
    - "structural properties of index coding capacity using fractional graph theory"
    - "storage capacity of repairable networks"
    - "a matrix completion approach to linear index coding problem"

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"
    - "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"
    - "cellular interference alignment"

Connected through hyperedge HE-4 (induced by source paper "structural properties of index coding capacity"):
  with members:
    - "three stories on a two sided coin index coding locally recoverable distributed storage and guessing games on graphs"
    - "on approximating the sum rate for multiple unicasts"
    - "on a duality between recoverable distributed storage and index coding"
    - "a rate distortion approach to index coding"
    - "topological interference management through index coding"
    - "fundamental limits of caching in wireless d2d networks"
    - "bounding multiple unicasts through index coding and locally repairable codes"
    - "critical graphs in index coding"

Connected through hyperedge HE-5 (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"
    - "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"
    - "optimality of orthogonal access for one dimensional convex cellular networks"

Connected through hyperedge HE-6 (induced by source paper "approximate capacity of index coding for some classes of graphs"):
  with members:
    - "graph theory versus minimum rank for index coding"
    - "a rate distortion approach to index coding"
    - "linear codes are optimal for index coding instances with five or fewer receivers"
    - "on the capacity region for index coding"
    - "the multi sender multicast index coding"
    - "index coding an interference alignment perspective"

Connected through hyperedge HE-7 (induced by source paper "three stories on a two sided coin index coding locally recoverable distributed storage and guessing games on graphs"):
  with members:
    - "structural properties of index coding capacity using fractional graph theory"
    - "index coding and network coding via rank minimization"
    - "on a duality between recoverable distributed storage and index coding"
    - "a rate distortion approach to index coding"
    - "topological interference management through index coding"
    - "bounding multiple unicasts through index coding and locally repairable codes"
    - "critical graphs in index coding"
    - "on the capacity region for index coding"

Connected through hyperedge HE-8 (induced by source paper "when does an ensemble of matrices with randomly scaled rows lose rank"):
  with members:
    - "tdma is optimal for all unicast dof region of tim if and only if topology is chordal bipartite"
    - "topological interference management with just retransmission what are the best topologies"
    - "topological interference management through index coding"
    - "local graph coloring and index coding"
    - "on the index coding problem and its relation to network coding and matroid theory"

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)