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: "dualities between entropy functions and network codes"
  Abstract: This paper provides a new duality between entropy functions and network codes. Given a function $g\geq 0$ defined on all proper subsets of $N$ random variables, we provide a construction for a network multicast problem which is solvable if and only if $g$ is entropic. The underlying network topology is fixed and the multicast problem depends on $g$ only through edge capacities and source rates. Relaxing the requirement that the domain of $g$ be subsets of random variables, we obtain a similar duality between polymatroids and the linear programming bound. These duality results provide an alternative proof of the insufficiency of linear (and abelian) network codes, and demonstrate the utility of non-Shannon inequalities to tighten outer bounds on network coding capacity regions.

Connected through hyperedge HE-1 (induced by source paper "a local perspective on the edge removal problem"):
  with members:
    - "a class of non linearly solvable networks"
    - "on the impact of a single edge on the network coding capacity"
    - "network coding capacity regions via entropy functions"
    - "network coding is zero error always possible"
    - "lexicographic products and the power of non linear network coding"

Connected through hyperedge HE-2 (induced by source paper "capacity and achievable rate regions for linear network coding over ring alphabets"):
  with members:
    - "linear network coding over rings part ii vector codes and non commutative alphabets"
    - "linear network coding over rings part i scalar codes and commutative alphabets"
    - "a class of non linearly solvable networks"
    - "on vector linear solvability of multicast networks"
    - "on achievability of an r l fractional linear network code"
    - "the two unicast problem"
    - "characteristic dependent linear rank inequalities with applications to network coding"
    - "achievable rate regions for network coding"

Connected through hyperedge HE-3 (induced by source paper "a class of non linearly solvable networks"):
  with members:
    - "on the message dimensions of vector linearly solvable networks"
    - "on vector linear solvability of multicast networks"
    - "vector network coding based on subspace codes outperforms scalar linear network coding"
    - "multicast network coding and field sizes"
    - "linear network coding linear index coding and representable discrete polymatroids"
    - "on network coding for sum networks"
    - "lexicographic products and the power of non linear network coding"
    - "path gain algebraic formulation for the scalar linear network coding problem"

Connected through hyperedge HE-4 (induced by source paper "multiround private information retrieval capacity and storage overhead"):
  with members:
    - "private information retrieval from mds coded data in distributed storage systems"
    - "pir array codes with optimal virtual server rate"
    - "on the impact of a single edge on the network coding capacity"
    - "on private information retrieval array codes"
    - "the capacity of robust private information retrieval with colluding databases"
    - "lower bound on the redundancy of pir codes"
    - "pir array codes with optimal pir rate"
    - "pir schemes with small download complexity and low storage requirements"

Connected through hyperedge HE-5 (induced by source paper "partition symmetrical entropy functions"):
  with members:
    - "conditional information inequalities for entropic and almost entropic points"
    - "on the non robustness of essentially conditional information inequalities"
    - "entropy functions and determinant inequalities"
    - "on essentially conditional information inequalities"
    - "non shannon information inequalities in four random variables"
    - "average entropy functions"
    - "information rates of minimal non matroid related access structures"
    - "a projection method for derivation of non shannon type information inequalities"

Connected through hyperedge HE-6 (induced by source paper "capacity bounds for networks with correlated sources and characterisation of distributions by entropies"):
  with members:
    - "cut set bounds on network information flow"
    - "characterising probability distributions via entropies"
    - "beyond the cut set bound uncertainty computations in network coding with correlated sources"
    - "beyond the cut set bound uncertainty computations in network coding with correlated sources"
    - "network coding capacity a functional dependence bound"
    - "network information flow with correlated sources"

Connected through hyperedge HE-7 (induced by source paper "cut set bounds on network information flow"):
  with members:
    - "beyond the cut set bound uncertainty computations in network coding with correlated sources"
    - "beyond the cut set bound uncertainty computations in network coding with correlated sources"
    - "network coding capacity a functional dependence bound"
    - "the minimal set of ingleton inequalities"
    - "network information flow with correlated sources"

Connected through hyperedge HE-8 (induced by source paper "on multi source networks enumeration rate region computation and hierarchy"):
  with members:
    - "explicit polyhedral bounds on network coding rate regions via entropy function region algorithms symmetry and computation"
    - "constrained linear representability of polymatroids and algorithms for computing achievability proofs in network coding"
    - "characterizing the rate region of the 4 3 3 exact repair regenerating codes"
    - "multilevel diversity coding systems rate regions codes computation forbidden minors"
    - "index coding capacity how far can one go with only shannon inequalities"
    - "linear rank inequalities on five or more variables"
    - "mission impossible computing the network coding capacity region"
    - "entropy vectors and network codes"

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)