What is the cited by count where the contributor of the 'Evolving MPI+X Toward Exascale' article is affiliated?
453002
David A. Bader and Guojing Cong: Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs. (2004) authored by David A. Bader. Oded Green et al.: Scalable data parallel algorithms for texture synthesis using Gibbs random fields. (1995) authored by David A. Bader. David A. Bader and Joseph F. JáJá: Parallel Algorithms for Image Histogramming and Connected Components with an Experimental Study. (1996) authored by David A. Bader. Guojing Cong and David A. Bader: Designing irregular parallel algorithms with mutual exclusion and lock-free protocols. (2006) authored by David A. Bader. David A. Bader et al.: A Linear-Time Algorithm for Computing Inversion Distance between Signed Permutations with an Experimental Study. (2001) authored by David A. Bader. Zhihui Du et al.: On accelerating iterative algorithms with CUDA: A case study on Conditional Random Fields training algorithm for biological sequence alignment. (2022) authored by David A. Bader. David A. Bader et al.: A scalable multicore code for RNA secondary structure prediction. (2001) authored by David A. Bader. Luca Cappelletti et al.: Parallel Triangles and Squares Count for Multigraphs Using Vertex Covers. (1983) authored by David A. Bader. Yunpeng Chai et al.: Efficient Data Migration to Conserve Energy in Streaming Media. (1998) authored by David A David A. Bader is the author of Seunghwa Kang and Guojing Cong: A Fast, Parallel spanning tree algorithm for symmetric multiprocessors (SMPs). (2019) authored by David A. Bader. Federico Busato et al.: Hornet: An Efficient Data Structure for Dynamic Sparse Graphs and Matrices on GPUs. The book "Yang You et al.: Designing and implementing a heuristic cross-architecture combination for graph traversal" was authored by David A. Bader. He graduated from Liberty High School in Bethlehem, Pennsylvania in 1987. He led the development of "RoadRunner," the first Linux supercomputer for open use by the national science and engineering community via the National Technology Grid. In 1998, while at the University of New Mexico, Bader led the technical design of "LosL
[INST]
Utilize the provided context information, to generate answers to the following question: 
- Generate the answer to the question based on the provided context.
- Avoid including any explanations or apologies in your responses.
- Only respond to questions that ask for the answer to the target question without any additional information.
- Strictly provide the answer without any additional text.
Question: What is the cited by count where the contributor of the 'Evolving MPI+X Toward Exascale' article is affiliated?
Context: David A. Bader and Guojing Cong: Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs. (2004) authored by David A. Bader. Oded Green et al.: Scalable data parallel algorithms for texture synthesis using Gibbs random fields. (1995) authored by David A. Bader. David A. Bader and Joseph F. JáJá: Parallel Algorithms for Image Histogramming and Connected Components with an Experimental Study. (1996) authored by David A. Bader. Guojing Cong and David A. Bader: Designing irregular parallel algorithms with mutual exclusion and lock-free protocols. (2006) authored by David A. Bader. David A. Bader et al.: A Linear-Time Algorithm for Computing Inversion Distance between Signed Permutations with an Experimental Study. (2001) authored by David A. Bader. Zhihui Du et al.: On accelerating iterative algorithms with CUDA: A case study on Conditional Random Fields training algorithm for biological sequence alignment. (2022) authored by David A. Bader. David A. Bader et al.: A scalable multicore code for RNA secondary structure prediction. (2001) authored by David A. Bader. Luca Cappelletti et al.: Parallel Triangles and Squares Count for Multigraphs Using Vertex Covers. (1983) authored by David A. Bader. Yunpeng Chai et al.: Efficient Data Migration to Conserve Energy in Streaming Media. (1998) authored by David A David A. Bader is the author of Seunghwa Kang and Guojing Cong: A Fast, Parallel spanning tree algorithm for symmetric multiprocessors (SMPs). (2019) authored by David A. Bader. Federico Busato et al.: Hornet: An Efficient Data Structure for Dynamic Sparse Graphs and Matrices on GPUs. The book "Yang You et al.: Designing and implementing a heuristic cross-architecture combination for graph traversal" was authored by David A. Bader. He graduated from Liberty High School in Bethlehem, Pennsylvania in 1987. He led the development of "RoadRunner," the first Linux supercomputer for open use by the national science and engineering community via the National Technology Grid. In 1998, while at the University of New Mexico, Bader led the technical design of "LosL
[/INST] Answer:
