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 "equivalence of additive combinatorial linear inequalities for shannon entropy and differential entropy"):
  Abstract: This paper addresses the correspondence between linear inequalities of Shannon entropy and differential entropy for sums of independent group-valued random variables. We show that any balanced (with the sum of coefficients being zero) linear inequality of Shannon entropy holds if and only if its differential entropy counterpart also holds; moreover, any linear inequality for differential entropy must be balanced. In particular, our result shows that recently proved differential entropy inequalities by Kontoyiannis and Madiman \cite{KM14} can be deduced from their discrete counterparts due to Tao \cite{Tao10} in a unified manner. Generalizations to certain abelian groups are also obtained. #R##N#Our proof of extending inequalities of Shannon entropy to differential entropy relies on a result of R\'enyi \cite{Renyi59} which relates the Shannon entropy of a finely discretized random variable to its differential entropy and also helps in establishing the entropy of the sum of quantized random variables is asymptotically equal to that of the quantized sum; the converse uses the asymptotics of the differential entropy of convolutions with weak additive noise.

Includes members:
  Member "on additive combinatorial affine inequalities for shannon entropy and differential entropy":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "demystifying fixed k nearest neighbor information estimators")
  Member "entropy bounds on abelian groups and the ruzsa divergence":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "countably infinite multilevel source polarization for non stationary erasure distributions")
  Member "dissipation of information in channels with input constraints":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "broadcasting on random directed acyclic graphs")
  Member "sumset and inverse sumset inequalities for differential entropy and mutual information":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "countably infinite multilevel source polarization for non stationary erasure distributions")
  Member "entropy and set cardinality inequalities for partition determined functions":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "countably infinite multilevel source polarization for non stationary erasure distributions")

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)