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: "coding against a limited view adversary the effect of causality and feedback"
  Abstract: We consider the problem of communication over a multi-path network in the presence of a causal adversary. The limited-view causal adversary is able to eavesdrop on a subset of links and also jam on a potentially overlapping subset of links based on the current and past information. To ensure that the communication takes place reliably and secretly, resilient network codes with necessary redundancy are needed. We study two adversarial models - additive and overwrite jamming and we optionally assume passive feedback from decoder to encoder, i.e., the encoder sees everything that the decoder sees. The problem assumes transmissions are in the large alphabet regime. For both jamming models, we find the capacity under four scenarios - reliability without feedback, reliability and secrecy without feedback, reliability with passive feedback, reliability and secrecy with passive feedback. We observe that, in comparison to the non-causal setting, the capacity with a causal adversary is strictly increased for a wide variety of parameter settings and present our intuition through several examples.

Connected through hyperedge HE-1 (induced by source paper "stealthy communication over adversarially jammed multipath networks"):
  with members:
    - "first and second order asymptotics in covert communication"
    - "embedding covert information in broadcast communications"
    - "covert communication over adversarially jammed channels"
    - "covert communication over a k user multiple access channel"
    - "quadratically constrained myopic adversarial channels"
    - "time division is optimal for covert communication over some broadcast channels"
    - "sufficiently myopic adversaries are blind"
    - "fundamental limits of communication with low probability of detection"

Connected through hyperedge HE-2 (induced by source paper "secure network code for adaptive and active attacks with no randomness in intermediate nodes"):
  with members:
    - "secrecy and robustness for active attack in secure network coding and its application to network quantum key distribution"
    - "universal secure multiplex network coding with dependent and non uniform messages"
    - "secure multi source multicast"
    - "coding across unicast sessions can increase the secure message capacity"
    - "quantum inspired secure wireless communication protocol under spatial and local gaussian noise assumptions"
    - "secure wireless communication under spatial and local gaussian noise assumptions"
    - "on secure network coding for two unicast sessions studying butterflies"
    - "relative generalized rank weight of linear codes and its applications to network coding"

Connected through hyperedge HE-3 (induced by source paper "secrecy and robustness for active attack in secure network coding and its application to network quantum key distribution"):
  with members:
    - "secure network code for adaptive and active attacks with no randomness in intermediate nodes"
    - "universal construction of cheater identifiable secret sharing against rushing cheaters without honest majority"
    - "universal secure multiplex network coding with dependent and non uniform messages"
    - "secure multi source multicast"
    - "quantum inspired secure wireless communication protocol under spatial and local gaussian noise assumptions"
    - "secure wireless communication under spatial and local gaussian noise assumptions"
    - "relative generalized rank weight of linear codes and its applications to network coding"
    - "non asymptotic and asymptotic analyses of information processing on markov chains"

Connected through hyperedge HE-4 (induced by source paper "sufficiently myopic adversaries are blind"):
  with members:
    - "a channel under simultaneous jamming and eavesdropping attack correlated random coding capacities under strong secrecy criteria"
    - "on the capacity of the binary adversarial wiretap channel"
    - "arbitrarily varying wiretap channels with type constrained states"
    - "the arbitrarily varying wiretap channel secret randomness stability and super activation"
    - "semantic security capacity for wiretap channels of type ii"
    - "the arbitrarily varying wiretap channel deterministic and correlated random coding capacities under the strong secrecy criterion"
    - "a characterization of the capacity of online causal binary channels"
    - "secrecy results for compound wiretap channels"

Connected through hyperedge HE-5 (induced by source paper "arbitrarily varying networks capacity achieving computationally efficient codes"):
  with members:
    - "connecting multiple unicast and network error correction reduction and unachievability"
    - "routing for security in networks with adversarial nodes"
    - "polytope codes against adversaries in networks"
    - "network codes resilient to jamming and eavesdropping"
    - "network error correction with unequal link capacities"
    - "adversarial models and resilient schemes for network coding"
    - "coding for errors and erasures in random network coding"

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)