human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "entropic matroids and their representation"):
  Abstract: This paper investigates entropic matroids, that is, matroids whose rank function is given as the Shannon entropy of random variables. In particular, we consider $p$-entropic matroids, for which the random variables each have support of cardinality $p$. We draw connections between such entropic matroids and secret-sharing matroids and show that entropic matroids are linear matroids when $p = 2,3$ but not when $p = 9$. Our results leave open the possibility for $p$-entropic matroids to be linear whenever $p$ is prime, with particular cases proved here. Applications of entropic matroids to coding theory and cryptography are also discussed.

Includes members:
  Member "polar codes for the two user multiple access channel":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "polar codes simplicity random codes durability")
  Member "randomness and dependencies extraction via polarization with applications to slepian wolf coding and secrecy":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "polar codes simplicity random codes durability")
  Member "mutual information matroids and extremal dependencies":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "polar codes for q ary channels q 2 r")
  Member "polar codes for the m user mac":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "general strong polarization")
  Member "existence of new inequalities for representable polymatroids":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "linear rank inequalities on five or more variables")

Question: Please tell me which class the source paper 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)