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: "information theoretic perspectives on brascamp lieb inequality and its reverse"
  Abstract: We introduce an inequality which may be viewed as a generalization of both the Brascamp-Lieb inequality and its reverse (Barthe's inequality), and prove its information-theoretic (i.e.\ entropic) formulation. This result leads to a unified approach to functional inequalities such as the variational formula of Renyi entropy, hypercontractivity and its reverse, strong data processing inequalities, and transportation-cost inequalities, whose utility in the proofs of various coding theorems has gained growing popularity recently. We show that our information-theoretic setting is convenient for proving properties such as data processing, tensorization, convexity (Riesz-Thorin interpolation) and Gaussian optimality. In particular, we elaborate on a "doubling trick" used by Lieb and Geng-Nair to prove several results on Gaussian optimality. Several applications are discussed, including a generalization of the Brascamp-Lieb inequality involving Gaussian random transformations, the determination of Wyner's common information of vector Gaussian sources, and the achievable rate region of certain key generation problems in the case of vector Gaussian sources.

Connected through hyperedge HE-1 (induced by source paper "second order converses via reverse hypercontractivity"):
  with members:
    - "smoothing brascamp lieb inequalities and strong converses for common randomness generation"
    - "asymptotic estimates in information theory with non vanishing error probabilities"
    - "strong converse exponent for degraded broadcast channels at rates outside the capacity region"
    - "a technique for deriving one shot achievability results in network information theory"
    - "fixed length lossy compression in the finite blocklength regime"
    - "information spectrum approach to second order coding rate in channel coding"
    - "mutual information and minimum mean square error in gaussian channels"

Connected through hyperedge HE-2 (induced by source paper "dispersion bound for the wyner ahlswede k orner network via reverse hypercontractivity on types"):
  with members:
    - "strong converse using change of measure arguments"
    - "exponential strong converse for content identification with lossy recovery"
    - "a converse bound on wyner ahlswede k orner network via gray wyner network"
    - "brascamp lieb inequality and its reverse an information theoretic view"
    - "exponent function for one helper source coding problem at rates outside the rate region"
    - "asymptotic estimates in information theory with non vanishing error probabilities"

Connected through hyperedge HE-3 (induced by source paper "algorithmic and optimization aspects of brascamp lieb inequalities via operator scaling"):
  with members:
    - "sum of square proof for brascamp lieb type inequality"
    - "polynomial time tensor decompositions with sum of squares"
    - "smoothing brascamp lieb inequalities and strong converses for common randomness generation"
    - "operator scaling theory and applications"
    - "constructive noncommutative rank computation in deterministic polynomial time over fields of arbitrary characteristics"
    - "constructive noncommutative rank computation is in deterministic polynomial time"
    - "speeding up sum of squares for tensor decomposition and planted sparse vectors"
    - "a deterministic polynomial time algorithm for non commutative rational identity testing"

Connected through hyperedge HE-4 (induced by source paper "brascamp lieb inequality and its reverse an information theoretic view"):
  with members:
    - "converses for distributed estimation via strong data processing inequalities"
    - "secret key generation with one communicator and a one shot converse via hypercontractivity"
    - "a note on the strong data processing inequalities in bayesian networks"
    - "communication lower bounds for statistical estimation problems via a distributed data processing inequality"
    - "an extremal inequality for long markov chains"
    - "information theoretic applications of the logarithmic probability comparison bound"
    - "key capacity for product sources with application to stationary gaussian processes"
    - "wyner s common information generalizations and a new lossy source coding interpretation"

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)