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: "how many queries will resolve common randomness"
  Abstract: A set of m terminals, observing correlated signals, communicate interactively to generate common randomness for a given subset of them. Knowing only the communication, how many direct queries of the value of the common randomness will resolve it? A general upper bound, valid for arbitrary signal alphabets, is developed for the number of such queries by using a query strategy that applies to all common randomness and associated communication. When the underlying signals are independent and identically distributed repetitions of m correlated random variables, the number of queries can be exponential in signal length. For this case, the mentioned upper bound is tight and leads to a single-letter formula for the largest query exponent, which coincides with the secret key capacity of a corresponding multiterminal source model. In fact, the upper bound constitutes a strong converse for the optimum query exponent, and implies also a new strong converse for secret key capacity. A key tool, estimating the size of a large probability set in terms of Renyi entropy, is interpreted separately, too, as a lossless block coding result for general sources. As a particularization, it yields the classic result for a discrete memoryless source.

Connected through hyperedge HE-1 (induced by source paper "secret key capacity for multipleaccess channel with public feedback"):
  with members:
    - "information inequalities for joint distributions with interpretations and applications"

Connected through hyperedge HE-2 (induced by source paper "finite blocklength bounds for wiretap channels"):
  with members:
    - "security analysis of varepsilon almost dual universal 2 hash functions smoothing of min entropy versus smoothing of renyi entropy of order 2"
    - "e_ gamma resolvability"
    - "asymptotic estimates in information theory with non vanishing error probabilities"
    - "the third order term in the normal approximation for the awgn channel"
    - "on the secrecy exponent of the wire tap channel"
    - "converses for secret key agreement and secure computing"
    - "information spectrum approach to strong converse theorems for degraded wiretap channels"
    - "strong converse for a degraded wiretap channel via active hypothesis testing"

Connected through hyperedge HE-3 (induced by source paper "smoothing brascamp lieb inequalities and strong converses for common randomness generation"):
  with members:
    - "brascamp lieb inequality and its reverse an information theoretic view"
    - "e_ gamma resolvability"
    - "secret key generation with one communicator and a one shot converse via hypercontractivity"
    - "one shot mutual covering lemma and marton s inner bound with a common message"
    - "on maximal correlation hypercontractivity and the data processing inequality studied by erkip and cover"
    - "fixed length lossy compression in the finite blocklength regime"
    - "information spectrum approach to second order coding rate in channel coding"

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"
    - "interactive communication for data exchange"
    - "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"

Connected through hyperedge HE-5 (induced by source paper "information spectrum approach to strong converse theorems for degraded wiretap channels"):
  with members:
    - "converses for secret key agreement and secure computing"
    - "strong converse and second order asymptotics of channel resolvability"
    - "secret key agreement general capacity and second order asymptotics"
    - "second order coding rates for channels with state"
    - "strong converse for a degraded wiretap channel via active hypothesis testing"
    - "fixed error asymptotics for erasure and list decoding"
    - "a tight upper bound for the third order asymptotics for most discrete memoryless channels"
    - "reliability and secrecy functions of the wiretap channel under cost constraint"

Connected through hyperedge HE-6 (induced by source paper "secret key agreement general capacity and second order asymptotics"):
  with members:
    - "converses for secret key agreement and secure computing"
    - "information spectrum approach to second order coding rate in channel coding"
    - "fuzzy extractors how to generate strong keys from biometrics and other noisy data"
    - "second order asymptotics in fixed length source coding and intrinsic randomness"

Connected through hyperedge HE-7 (induced by source paper "strong converse for a degraded wiretap channel via active hypothesis testing"):
  with members:
    - "converses for secret key agreement and secure computing"
    - "information spectrum approach to strong converse theorems for degraded wiretap 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)