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: "group characterizable entropy functions"
  Abstract: This paper studies properties of entropy functions that are induced by groups and subgroups. We showed that many information theoretic properties of those group induced entropy functions also have corresponding group theoretic interpretations. Then we propose an extension method to find outer bound for these group induced entropy functions.

Connected through hyperedge HE-1 (induced by source paper "bag query containment and information theory"):
  with members:
    - "size bounds and query plans for relational joins"
    - "constraint solving via fractional edge covers"
    - "what do shannon type inequalities submodular width and disjunctive datalog have to do with one another"
    - "computing join queries with functional dependencies"

Connected through hyperedge HE-2 (induced by source paper "on enumerating distributions for associated vectors in the entropy space"):
  with members:
    - "entropy region and convolution"

Connected through hyperedge HE-3 (induced by source paper "what do shannon type inequalities submodular width and disjunctive datalog have to do with one another"):
  with members:
    - "size bounds and query plans for relational joins"
    - "constraint solving via fractional edge covers"
    - "computing join queries with functional dependencies"
    - "entropy bounds for conjunctive queries with functional dependencies"
    - "faq questions asked frequently"
    - "joins via geometric resolutions worst case and beyond"
    - "aggregation and ordering in factorised databases"
    - "skew strikes back new developments in the theory of join algorithms"

Connected through hyperedge HE-4 (induced by source paper "on the ingleton violations in finite groups"):
  with members:
    - "entropy region and convolution"
    - "finite p groups entropy vectors and the ingleton inequality for nilpotent groups"
    - "non shannon information inequalities in four random variables"
    - "linear rank inequalities on five or more variables"

Connected through hyperedge HE-5 (induced by source paper "linear rank inequalities on five or more variables"):
  with members:
    - "existence of new inequalities for representable polymatroids"
    - "the minimal set of ingleton inequalities"
    - "conditionally independent random variables"

Connected through hyperedge HE-6 (induced by source paper "dualities between entropy functions and network codes"):
  with members:
    - "mission impossible computing the network coding capacity region"
    - "entropy vectors and network codes"
    - "minimum cost multicast over coded packet networks"

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)