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: "mutual information matroids and extremal dependencies"
  Abstract: In this paper, it is shown that the rank function of a matroid can be represented by a "mutual information function" if and only if the matroid is binary. The mutual information function considered is the one measuring the amount of information between the inputs (binary uniform) and the output of a multiple access channel (MAC). Moreover, it is shown that a MAC whose mutual information function is integer valued is "equivalent" to a linear deterministic MAC, in the sense that it essentially contains at the output no more information than some linear forms of the inputs. These notes put emphasis on the connection between mutual information functionals and rank functions in matroid theory, without assuming prior knowledge on these two subjects. The first section introduces mutual information functionals, the second section introduces basic notions of matroid theory, and the third section connects these two subjects. It is also shown that entropic matroids studied in the literature correspond to specific cases of MAC matroids.

Connected through hyperedge HE-1 (induced by source paper "entropic matroids and their representation"):
  with members:
    - "polar codes for the two user multiple access channel"
    - "randomness and dependencies extraction via polarization with applications to slepian wolf coding and secrecy"
    - "polar codes for the m user mac"
    - "existence of new inequalities for representable polymatroids"

Connected through hyperedge HE-2 (induced by source paper "polar codes for q ary channels q 2 r"):
  with members:
    - "multilevel polarization of polar codes over arbitrary discrete memoryless channels"
    - "channel polarization on q ary discrete memoryless channels by arbitrary kernels"
    - "polar codes for the m user mac"
    - "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels"
    - "polar codes characterization of exponent bounds and constructions"
    - "polarization for arbitrary discrete memoryless channels"
    - "on the rate of channel polarization"
    - "bounds on ordered codes and orthogonal arrays"

Connected through hyperedge HE-3 (induced by source paper "randomness and dependencies extraction via polarization with applications to slepian wolf coding and secrecy"):
  with members:
    - "polar coding for secret key generation"
    - "polar codes for the two user multiple access channel"
    - "achieving the secrecy capacity of wiretap channels using polar codes"
    - "polar coding for secure transmission and key agreement"
    - "nested polar codes for wiretap and relay channels"
    - "polar codes for the m user mac"
    - "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels"
    - "on the rate of channel polarization"

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)