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: "interactive communication for data exchange"
  Abstract: Two parties observing correlated data seek to exchange their data using interactive communication. How many bits must they communicate? We propose a new interactive protocol for data exchange which increases the communication size in steps until the task is done. Next, we derive a lower bound on the minimum number of bits that is based on relating the data exchange problem to the secret key agreement problem. Our single-shot analysis applies to all discrete random variables and yields upper and lower bound of a similar form. In fact, the bounds are asymptotically tight and lead to a characterization of the optimal rate of communication needed for data exchange for a general sequence such as mixture of IID random variables as well as the optimal second-order asymptotic term in the length of communication needed for data exchange for the IID random variables, when the probability of error is fixed. This gives a precise characterization of the asymptotic reduction in the length of optimal communication due to interaction; in particular, two-sided Slepian-Wolf compression is strictly suboptimal.

Connected through hyperedge HE-1 (induced by source paper "second order region for gray wyner network"):
  with members:
    - "discrete lossy gray wyner revisited second order asymptotics large and moderate deviations"
    - "second order asymptotics for the gaussian mac with degraded message sets"
    - "strong successive refinability and rate distortion complexity tradeoff"
    - "asymptotic estimates in information theory with non vanishing error probabilities"
    - "information complexity density and simulation of protocols"
    - "strong converse and second order asymptotics of channel resolvability"
    - "channels with cost constraints strong converse and dispersion"
    - "secret key agreement general capacity and second order asymptotics"

Connected through hyperedge HE-2 (induced by source paper "universal multiparty data exchange and secret key agreement"):
  with members:
    - "efficient algorithms for the data exchange problem"
    - "converses for secret key agreement and secure computing"
    - "secret key agreement general capacity and second order asymptotics"
    - "minimax rates of entropy estimation on large alphabets via best polynomial approximation"
    - "on coding for cooperative data exchange"
    - "on tightness of mutual dependence upperbound for secret key capacity of multiple terminals"

Connected through hyperedge HE-3 (induced by source paper "information complexity density and simulation of protocols"):
  with members:
    - "converses for secret key agreement and secure computing"
    - "secret key agreement general capacity and second order asymptotics"
    - "channel coding and lossy source coding using a generator of constrained random numbers"
    - "achievability proof via output statistics of random binning"
    - "channel simulation via interactive communications"
    - "information equals amortized communication"
    - "information spectrum approach to second order coding rate in channel coding"
    - "information inequalities for joint distributions with interpretations and applications"

Connected through hyperedge HE-4 (induced by source paper "converses for secret key agreement and secure computing"):
  with members:
    - "secret key capacity for multipleaccess channel with public feedback"
    - "information complexity density and simulation of protocols"
    - "secret key agreement general capacity and second order asymptotics"
    - "assisted common information with an application to secure two party sampling"
    - "a new upperbound for the oblivious transfer capacity of discrete memoryless channels"
    - "strong converse for a degraded wiretap channel via active hypothesis testing"
    - "on the efficiency of classical and quantum secure function evaluation"
    - "a tight upper bound for the third order asymptotics for most discrete memoryless channels"

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)