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: "distributed task encoding"
  Abstract: The rate region of the task-encoding problem for two correlated sources is characterized using a novel parametric family of dependence measures. The converse uses a new expression for the $\rho$-th moment of the list size, which is derived using the relative $\alpha$-entropy.

Connected through hyperedge HE-1 (induced by source paper "tight bounds on the r enyi entropy via majorization with applications to guessing and compression"):
  with members:
    - "on the conditional smooth renyi entropy and its applications in guessing and source coding"
    - "maximum entropy interval aggregations"
    - "reducing guesswork via an unreliable oracle"
    - "guessing attacks on distributed storage systems"
    - "bounds on the entropy of a function of a random variable and their applications"
    - "on the renyi divergence joint range of relative entropies and a channel coding theorem"
    - "on the smooth renyi entropy and variable length source coding allowing errors"
    - "encoding tasks and renyi entropy"

Connected through hyperedge HE-2 (induced by source paper "improved bounds on lossless source coding and guessing moments via r e nyi measures"):
  with members:
    - "reducing guesswork via an unreliable oracle"
    - "guessing attacks on distributed storage systems"
    - "sharp bounds on arimoto s conditional r e nyi entropies between two distinct orders"
    - "on empirical cumulant generating functions of code lengths for individual sequences"
    - "f divergence inequalities"
    - "on the smooth renyi entropy and variable length source coding allowing errors"
    - "encoding tasks and renyi entropy"
    - "renyi divergence and kullback leibler divergence"

Connected through hyperedge HE-3 (induced by source paper "guessing attacks on distributed storage systems"):
  with members:
    - "distributed storage for data security"
    - "on the listsize capacity with feedback"
    - "encoding tasks and renyi entropy"
    - "guesswork large deviations and shannon entropy"
    - "the shannon cipher system with a guessing wiretapper general sources"
    - "guessing revisited a large deviations approach"
    - "mds codes on the erasure erasure wiretap channel"
    - "guessing under source uncertainty"

Connected through hyperedge HE-4 (induced by source paper "two measures of dependence"):
  with members:
    - "operational interpretation of renyi information measures via composite hypothesis testing against product and markov distributions"
    - "dependence measures bounding the exploration bias for general measurements"
    - "f divergence inequalities"
    - "minimization problems based on relative alpha entropy ii reverse projection"
    - "encoding tasks and renyi entropy"
    - "minimization problems based on relative alpha entropy i forward projection"
    - "renyi divergence and kullback leibler divergence"
    - "guessing under source uncertainty"

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)