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: "graph theoretical constructions for graph entropy and network coding based communications"
  Abstract: The guessing number of a directed graph (digraph), equivalent to the entropy of that digraph, was introduced as a direct criterion on the solvability of a network coding instance. This paper makes two contributions on the guessing number. First, we introduce an undirected graph on all possible configurations of the digraph, referred to as the guessing graph, which encapsulates the essence of dependence amongst configurations. We prove that the guessing number of a digraph is equal to the logarithm of the independence number of its guessing graph. Therefore, network coding solvability is no more a problem on the operations made by each node, but is simplified into a problem on the messages that can transit through the network. By studying the guessing graph of a given digraph, and how to combine digraphs or alphabets, we are thus able to derive bounds on the guessing number of digraphs. Second, we construct specific digraphs with high guessing numbers, yielding network coding instances where a large amount of information can transit. We first propose a construction of digraphs with finite parameters based on cyclic codes, with guessing number equal to the degree of the generator polynomial. We then construct an infinite class of digraphs with arbitrary girth for which the ratio between the linear guessing number and the number of vertices tends to one, despite these digraphs being arbitrarily sparse. These constructions yield solvable network coding instances with a relatively small number of intermediate nodes for which the node operations are known and linear, although these instances are sparse and the sources are arbitrarily far from their corresponding sinks.

Connected through hyperedge HE-1 (induced by source paper "characteristic dependent linear rank inequalities via complementary vector spaces"):
  with members:
    - "characteristic dependent linear rank inequalities with applications to network coding"
    - "achievable rate regions for network coding"
    - "lexicographic products and the power of non linear network coding"
    - "linear rank inequalities on five or more variables"
    - "broadcasting with side information"

Connected through hyperedge HE-2 (induced by source paper "expansive automata networks"):
  with members:
    - "simple dynamics on graphs"

Connected through hyperedge HE-3 (induced by source paper "on the influence of the interaction graph on a finite dynamical system"):
  with members:
    - "guessing numbers of odd cycles"
    - "simple dynamics on graphs"
    - "on the possible values of the entropy of undirected graphs"
    - "complete simulation of automata networks"
    - "fixed points of boolean networks guessing graphs and coding theory"
    - "reduction and fixed points of boolean networks and linear network coding solvability"
    - "a simple necessary and sufficient condition for the double unicast problem"

Connected through hyperedge HE-4 (induced by source paper "structural properties of index coding capacity"):
  with members:
    - "fractional coloring orthogonal access achieves all unicast capacity dof region of index coding tim if and only if network topology is chordal"
    - "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"

Connected through hyperedge HE-5 (induced by source paper "generalized lexicographic products and the index coding capacity"):
  with members:
    - "approximate capacity of index coding for some classes of graphs"
    - "tdma is optimal for all unicast dof region of tim if and only if topology is chordal bipartite"
    - "three stories on a two sided coin index coding locally recoverable distributed storage and guessing games on graphs"
    - "structural properties of index coding capacity using fractional graph theory"
    - "on approximating the sum rate for multiple unicasts"
    - "on a duality between recoverable distributed storage and index coding"
    - "topological interference management through index coding"
    - "fundamental limits of caching in wireless d2d networks"

Connected through hyperedge HE-6 (induced by source paper "distributed index coding"):
  with members:
    - "the single uniprior index coding problem the single sender case and the multi sender extension"
    - "structural properties of index coding capacity using fractional graph theory"
    - "critical graphs in index coding"
    - "on the capacity region for index coding"

Connected through hyperedge HE-7 (induced by source paper "guessing numbers of odd cycles"):
  with members:
    - "graph guessing games and non shannon information inequalities"
    - "broadcasting with side information"

Connected through hyperedge HE-8 (induced by source paper "the information flow problem on clock networks"):
  with members:
    - "broadcasting with side information"

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)