. For-i-=-1, n do in parallel 4: Set s i = Ap[i] and e i = Ap

W. E. Arnoldi, The principle of minimized iterations in the solution of the matrix eigenvalue problem, Quarterly of Applied Mathematics, vol.9, issue.1, pp.17-29, 1951.
DOI : 10.1090/qam/42792

D. Arthur and S. Vassilvitskii, K-Means++: the Advantages of Careful Seeding, Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms, pp.1027-1025, 2007.

B. O. Auer, GPU Acceleration of Graph Matching, Clustering and Partitioning, 2013.

D. A. Bader, H. Meyerhenke, P. Sanders, and D. Wagner, Graph Partitioning and Graph Clustering, Contemporary Mathematics, vol.588, pp.73-82, 2013.
DOI : 10.1090/conm/588

Z. Bai and J. Demmel, ON A BLOCK IMPLEMENTATION OF HESSENBERG MULTISHIFT QR ITERATION, International Journal of High Speed Computing, vol.01, issue.01, pp.197-112, 1989.
DOI : 10.1142/S0129053389000068

Z. Bai, J. Demmel, J. Dongarra, A. Ruhe, and H. Van-der-vorst, Templates for the Solution of Algebraic Eigenvalue Problems: A Practical Guide, SIAM, issue.11, p.316, 2000.
DOI : 10.1137/1.9780898719581

A. Barabási and R. Albert, Emergence of scaling in random networks, Science, issue.5439, p.28611, 1999.

S. T. Barnard and H. D. Simon, Fast multilevel implementation of recursive spectral bisection for partitioning unstructured problems, Concurrency: Practice and Experience, vol.38, issue.2, pp.101-117, 1994.
DOI : 10.1002/j.1538-7305.1970.tb01770.x

M. Bastian, S. Heymann, and M. Jacomy, Gephi: An Open Source Software for Exploring and Manipulating Networks, Third International AAAI Conference on Weblogs and Social Media, pp.361-362, 2009.

V. Batagelj and U. Brandes, Efficient generation of large random networks, Physical Review E, vol.6, issue.3, pp.1-5, 2005.
DOI : 10.1002/rsa.1009

N. Bell and M. Garland, Efficient Sparse Matrix-Vector Multiplication on CUDA, 2008.

R. Berkhin and P. , A Survey on PageRank Computing, Internet Mathematics, vol.2, issue.1, pp.73-120, 2005.
DOI : 10.1080/15427951.2005.10129098

V. D. Blondel, J. Guillaume, R. Lambiotte, and E. Lefebvre, Fast unfolding of communities in large networks, Journal of Statistical Mechanics: Theory and Experiment, vol.2008, issue.10, p.100086, 2008.
DOI : 10.1088/1742-5468/2008/10/P10008
URL : https://hal.archives-ouvertes.fr/hal-01146070

U. Brandes, D. Delling, M. Gaertler, R. Gorke, M. Hoefer et al., On Modularity Clustering, IEEE Transactions on Knowledge and Data Engineering, vol.20, issue.2, pp.172-188, 2008.
DOI : 10.1109/TKDE.2007.190689

C. Brezinski, M. Redivo-zaglia, and S. Serra-capizzano, Extrapolation methods for PageRank computations, Comptes Rendus Mathematique, vol.340, issue.5, pp.393-397, 2005.
DOI : 10.1016/j.crma.2005.01.015
URL : https://hal.archives-ouvertes.fr/hal-00018524

A. Brody, The Second Eigenvalue of the Leontief Matrix, Economic Systems Research, vol.9, issue.3, pp.253-258, 1997.
DOI : 10.1080/09535319700000018

K. Bryan and T. Leise, The $25,000,000,000 Eigenvector: The Linear Algebra behind Google, SIAM Review, vol.48, issue.3, pp.569-581, 2006.
DOI : 10.1137/050623280

D. Calvetti, L. Reichel, and D. C. Sorensen, An implicitly restarted Lanczos method for large symmetric eigenvalue problems, Electronic Transactions on Numerical Analysis, vol.2, pp.1-21, 1994.

D. Chakrabarti, Y. Zhan, F. , and C. , R-MAT: A Recursive Model for Graph Mining, Proceedings of the 2004 SIAM International Conference on Data Mining, pp.442-446, 2004.
DOI : 10.1137/1.9781611972740.43

M. Chen, K. Kuzmin, and B. K. Szymanski, Community Detection via Maximization of Modularity and Its Variants, IEEE Transactions on Computational Social Systems, vol.1, issue.1, pp.46-65, 2014.
DOI : 10.1109/TCSS.2014.2307458

F. R. Chung, Spectral Graph Theory, 1997.
DOI : 10.1090/cbms/092

A. Clauset, M. E. Newman, M. , and C. , Finding community structure in very large networks, Physical Review E, vol.23, issue.6, p.0408187066111, 2004.
DOI : 10.1140/epjb/e2004-00125-x

T. Davis and Y. Hu, The university of Florida sparse matrix collection, ACM Transactions on Mathematical Software, vol.38, issue.1, pp.1-25, 2011.
DOI : 10.1145/2049662.2049663

N. Deo, A. Jain, and M. Medidi, An optimal parallel algorithm for merging using multiselection, Information Processing Letters, vol.50, issue.2, pp.81-87, 1994.
DOI : 10.1016/0020-0190(94)00009-3

I. Dhillon, Y. Guan, and B. Kulis, A fast kernel-based multilevel algorithm for graph clustering, Proceeding of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining , KDD '05, p.629, 2005.
DOI : 10.1145/1081870.1081948

L. R. Dice, Measures of the Amount of Ecologic Association Between Species, Ecology, vol.26, issue.3, pp.297-302, 1945.
DOI : 10.2307/1932409

J. Dubois, C. Calvin, and S. Petiton, Accelerating the Explicitly Restarted Arnoldi Method with GPUs Using an Autotuned Matrix Vector Product, SIAM Journal on Scientific Computing, vol.33, issue.5, pp.3010-3019, 2011.
DOI : 10.1137/10079906X

N. Emad and S. Petiton, Unite and conquer approach for high scale numerical computing, Journal of Computational Science, vol.14, pp.1-10, 2016.
DOI : 10.1016/j.jocs.2016.01.007
URL : https://hal.archives-ouvertes.fr/hal-01609342

N. Emad, S. Petiton, and G. Edjlali, Multiple Explicitly Restarted Arnoldi Method for Solving Large Eigenproblems, SIAM Journal on Scientific Computing, vol.27, issue.1, pp.253-277, 2005.
DOI : 10.1137/S1064827500366082

N. Emad, S. A. Shahzadeh-fazeli, and J. Dongarra, An asynchronous algorithm on the NetSolve global computing system, Future Generation Computer Systems, vol.22, issue.3, pp.279-290, 2006.
DOI : 10.1016/j.future.2005.10.003

Y. H. Eom, K. M. Frahm, A. Benczúr, and D. L. Shepelyansky, Time evolution of Wikipedia network ranking, The European Physical Journal B, vol.486, issue.12, 2013.
DOI : 10.1016/j.physrep.2009.11.002
URL : https://hal.archives-ouvertes.fr/hal-00817818

L. Ermann, A. D. Chepelianskii, and D. L. Shepelyansky, Toward twodimensional search engines, Journal of Physics A: Mathematical and Theoretical, issue.27, p.45275101, 2012.

L. Ermann, K. M. Frahm, and D. L. Shepelyansky, Spectral properties of Google matrix of Wikipedia and other networks, The European Physical Journal B, vol.80, issue.5, 2013.
DOI : 10.1103/RevModPhys.80.1355
URL : https://hal.archives-ouvertes.fr/hal-00761760

L. Ermann, K. M. Frahm, and D. L. Shepelyansky, Google matrix analysis of directed networks, Reviews of Modern Physics, vol.46, issue.4, pp.1261-1310, 2015.
DOI : 10.1088/0305-4470/36/12/333
URL : https://hal.archives-ouvertes.fr/hal-01059923

A. Fender, Scalable platforms for graph analytics on GPU. M.sc thesis, 2014.

M. Fiedler, Algebraic Connectivity of Graphs, Czechoslovak Mathematical Journal, vol.23, issue.2, pp.298-305, 1973.

M. J. Flynn, Some Computer Organizations and Their Effectiveness, IEEE Transactions on Computers, vol.21, issue.9, pp.948-960, 1972.
DOI : 10.1109/TC.1972.5009071

S. Fortunato, Community detection in graphs, Physics Reports, vol.486, issue.3-5, pp.75-174, 2010.
DOI : 10.1016/j.physrep.2009.11.002

J. Gantz and D. Reinsel, THE DIGITAL UNIVERSE IN 2020: Big Data, Bigger Digi tal Shadows, and Biggest Growth in the Far East, Idc, pp.1-16, 2007.

M. Girvan and M. E. Newman, Community structure in social and biological networks, Proceedings of the National Academy of Sciences, vol.139, issue.21, pp.997821-7826, 2002.
DOI : 10.1086/285382

G. H. Golub and C. Greif, An Arnoldi-type algorithm for computing page rank, BIT Numerical Mathematics, vol.27, issue.4, pp.759-771, 2006.
DOI : 10.1080/15427951.2004.10129091

G. H. Golub and H. A. Van-der-vorst, Eigenvalue computation in the 20th century, Journal of Computational and Applied Mathematics, vol.123, issue.1-2, pp.35-65, 2000.
DOI : 10.1016/S0377-0427(00)00413-1

J. L. Greathouse and M. Daga, Efficient Sparse Matrix-Vector Multiplication on GPUs Using the CSR Storage Format, SC14: International Conference for High Performance Computing, Networking, Storage and Analysis, pp.2015-769, 2014.
DOI : 10.1109/SC.2014.68

O. Green and D. A. Bader, cuSTINGER: Supporting dynamic graph algorithms for GPUs, 2016 IEEE High Performance Extreme Computing Conference (HPEC), pp.1-6, 2016.
DOI : 10.1109/HPEC.2016.7761622

L. Hardouin, B. Cottenceau, S. Lagrange, C. , and E. L. , Performance analysis of linear systems over semiring with additive inputs, 2008 9th International Workshop on Discrete Event Systems, pp.43-48, 2008.
DOI : 10.1109/WODES.2008.4605920
URL : https://hal.archives-ouvertes.fr/hal-00859167

M. Hilbert and P. Lopez, The World's Technological Capacity to Store, Communicate, and Compute Information, Science, vol.18, issue.12, pp.33260-65, 2011.
DOI : 10.1093/bioinformatics/18.12.1696

R. Horn and C. R. Johnson, Matrix Analysis, 1986.

P. Jaccard, Lois de distribution florale dans la zone alpine, Bulletin de la Société Vaudoise des Sciences Naturelles, vol.38, pp.67-130, 1902.

J. Jaja, Introduction to Parallel Algorithms, 1992.

T. Kanungo-;, An efficient k-means clutering algorithm: analysis and implementation, Proceedings of the 16th ACM symposium on Computational Geometry, pp.881-892, 2000.

G. Karypis and V. Kumar, A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs, SIAM Journal on Scientific Computing, vol.20, issue.1, pp.359-392, 1998.
DOI : 10.1137/S1064827595287997

J. Kepner, Graph Algorithms in the Language of Linear Algebra, SIAM, vol.67, 2011.
DOI : 10.1137/1.9780898719918

A. V. Knyazev, Toward the Optimal Preconditioned Eigensolver: Locally Optimal Block Preconditioned Conjugate Gradient Method, SIAM Journal on Scientific Computing, vol.23, issue.2, pp.517-541, 2001.
DOI : 10.1137/S1064827500366124

W. Krieger, On the uniqueness of the equilibrium state, Mathematical Systems Theory, vol.76, issue.2, pp.97-104, 1974.
DOI : 10.1007/BF01762180

J. Kunegis, Handbook of Network Analysis KONECT ? the Koblenz Network Collection, Proceedings of the 22Nd International Conference on World Wide Web Companion, pp.1-56, 2015.

H. Kwak, C. Lee, H. Park, M. , and S. , What is Twitter, a social network or a news media?, Proceedings of the 19th international conference on World wide web, WWW '10, pp.591-600, 2010.
DOI : 10.1145/1772690.1772751

C. Lanczos, An iteration method for the solution of the eigenvalue problem of linear differential and integral operators, Journal of Research of the National Bureau of Standards, vol.45, issue.4, p.255, 1950.
DOI : 10.6028/jres.045.026

A. Langville and C. Meyer, Deeper Inside PageRank, Internet Mathematics, vol.1, issue.3, 2003.
DOI : 10.1080/15427951.2004.10129091

A. N. Langville and C. D. Meyer, Updating Markov Chains with an Eye on Google's PageRank, SIAM Journal on Matrix Analysis and Applications, vol.27, issue.4, pp.968-987, 2006.
DOI : 10.1137/040619028

D. Lasalle and G. Karypis, Multi-threaded modularity based graph clustering using the multilevel paradigm, Journal of Parallel and Distributed Computing, vol.76, pp.66-80, 2015.
DOI : 10.1016/j.jpdc.2014.09.012

C. Lee, W. W. Ro, and J. Gaudiot, Boosting CUDA Applications with CPU???GPU Hybrid Computing, International Journal of Parallel Programming, vol.30, issue.2, pp.384-404, 2014.
DOI : 10.1007/978-3-540-89740-8_2

R. B. Lehoucq, Analysis and Implementation of an Implicitly Restarted Arnoldi Iteration, 1995.

J. Leskovec, D. Chakrabarti, J. Kleinberg, C. Faloutsos, and Z. Ghahramani, Kronecker graphs: An approach to modeling networks, Journal of Machine Learning Research, vol.11, pp.985-1042, 2010.

J. Leskovec and A. Krevl, SNAP Datasets, 2014.

M. Levandowsky and D. Winter, Distance between Sets, Nature, vol.38, issue.5323, pp.34-35, 1971.
DOI : 10.1038/234034a0

E. Lindholm, J. Nickolls, S. Oberman, and J. Montrym, NVIDIA Tesla: A Unified Graphics and Computing Architecture, IEEE Micro, vol.28, issue.2, pp.39-55, 2008.
DOI : 10.1109/MM.2008.31

Z. Liu, N. Emad, S. B. Amor, and M. Lamure, A Parallel IRAM Algorithm to Compute PageRank for Modeling Epidemic Spread, 2013 25th International Symposium on Computer Architecture and High Performance Computing, pp.120-127, 2013.
DOI : 10.1109/SBAC-PAD.2013.2

O. E. Livne and A. Brandt, Lean Algebraic Multigrid (LAMG): Fast Graph Laplacian Linear Solver, SIAM Journal on Scientific Computing, vol.34, issue.4, pp.499-522, 2012.
DOI : 10.1137/110843563
URL : http://www.wisdom.weizmann.ac.il/~achi/LOP168.pdf

S. P. Lloyd, Least squares quantization in PCM, IEEE Transactions on Information Theory, vol.28, issue.2, pp.129-137, 1982.
DOI : 10.1109/TIT.1982.1056489

K. J. Maschhoff and D. C. Sorensen, P_ARPACK: An efficient portable large scale eigenvalue package for distributed memory parallel architectures, PARA '96 Proceedings of the Third International Workshop on Applied Parallel Computing, Industrial Computation and Optimization, pp.478-486, 1996.
DOI : 10.1007/3-540-62095-8_51

K. K. Matam and K. Kothapalli, GPU Accelerated Lanczos Algorithm with Applications, 2011 IEEE Workshops of International Conference on Advanced Information Networking and Applications, pp.71-76, 2011.
DOI : 10.1109/WAINA.2011.70

T. Mattson, D. Bader, J. Berry, A. Buluc, J. Dongarra et al., Standards for graph algorithm primitives, 2013 IEEE High Performance Extreme Computing Conference (HPEC), pp.1-2, 2013.
DOI : 10.1109/HPEC.2013.6670338

D. Merrill and M. Garland, Merge-based sparse matrix-vector multiplication (SpMV) using the CSR storage format, Proceedings of the 21st ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming -PPoPP '16, pp.1-2, 2016.

M. Mohri, Semiring Frameworks and Algorithms for Shortest-Distance Problems, Journal of Automata, Languages and Combinatorics, vol.7, issue.3, pp.321-350, 2002.

G. Moore, Cramming More Components Onto Integrated Circuits, Proceedings of the IEEE, vol.86, issue.1, pp.82-85, 1965.
DOI : 10.1109/JPROC.1998.658762

R. B. Morgan, On restarting the Arnoldi method for large nonsymmetric eigenvalue problems, Mathematics of Computation, vol.65, issue.215, pp.1213-1231, 1996.
DOI : 10.1090/S0025-5718-96-00745-4

H. Nagasaka, N. Maruyama, A. Nukada, T. Endo, and S. Matsuoka, Statistical power modeling of GPU kernels using performance counters, International Conference on Green Computing, pp.115-122, 2010.
DOI : 10.1109/GREENCOMP.2010.5598315

M. Naumov and T. Moon, Parallel Spectral Graph Partitioning, 2016.

M. E. Newman, Assortative Mixing in Networks, Physical Review Letters, vol.365, issue.20, p.208701, 2002.
DOI : 10.1103/PhysRevE.65.036104

M. E. Newman, The Structure and Function of Complex Networks, SIAM Review, vol.45, issue.2, pp.167-256, 2003.
DOI : 10.1137/S003614450342480

M. E. Newman, Modularity and community structure in networks, Proceedings of the National Academy of Sciences, vol.68, issue.6804, pp.8577-8582, 2006.
DOI : 10.1073/pnas.021544898
URL : http://www.pnas.org/content/103/23/8577.full.pdf

M. E. Newman, Networks: an introduction, 2010.
DOI : 10.1093/acprof:oso/9780199206650.001.0001

M. E. Newman and M. Girvan, Finding and evaluating community structure in networks, Physical Review E, vol.65, issue.2, pp.1-16, 2004.
DOI : 10.1103/PhysRevE.68.065103

A. Y. Ng, M. I. Jordan, and Y. Weiss, On Spectral Clustering: Analysis and an algorithm, Advances in Neural Information Processing Systems, pp.849-856, 2001.

D. Nguyen, A. Lenharth, and K. Pingali, A lightweight infrastructure for graph analytics, Proceedings of the Twenty-Fourth ACM Symposium on Operating Systems Principles, SOSP '13, pp.456-471, 2013.
DOI : 10.1145/2517349.2522739
URL : http://iss.ices.utexas.edu/Publications/Papers/nguyen13.pdf

S. Odeh, O. Green, Z. Mwassi, O. Shmueli, and Y. Birk, Merge Path - Parallel Merging Made Simple, 2012 IEEE 26th International Parallel and Distributed Processing Symposium Workshops & PhD Forum, pp.1611-1618, 2012.
DOI : 10.1109/IPDPSW.2012.202

J. D. Owens, D. Luebke, N. Govindaraju, M. Harris, J. Krüger et al., A Survey of General-Purpose Computation on Graphics Hardware, Computer Graphics Forum, vol.7, issue.4, pp.80-113, 2007.
DOI : 10.1080/10867651.2002.10487576

L. Page, S. Brin, R. Motwani, and T. Winograd, The PageRank Citation Ranking: Bringing Order to the Web, 1998.

C. Palmer and J. Steffan, Generating network topologies that obey power laws, Globecom '00, IEEE. Global Telecommunications Conference. Conference Record (Cat. No.00CH37137), pp.434-438, 2000.
DOI : 10.1109/GLOCOM.2000.892042
URL : http://www.cs.cmu.edu/~crpalmer/pubs.html/globecom2000.ps

D. Pelleg, D. Pelleg, A. Moore, M. , and A. , X-means: Extending K-means with efficient estimation of the number of clusters, Proceedings of the Seventeenth International Conference on Machine Learning table of contents, pp.727-734, 2000.

S. G. Petiton and N. Emad, A data parallel scientific computing introduction. Proceeding of The Data Parallel Programming Model: Foundations, HPF Realization, and Scientific Applications, pp.45-64, 1996.
DOI : 10.1007/3-540-61736-1_42

R. J. Radke, A Matlab Implementation of the Implicitly Restarted Arnoldi Method for Solving Large-Scale Eigenvalue Problems Master of Arts A Matlab Implementation of the Implicitly Restarted Arnoldi Method for Solving Large-Scale Eigenvalue Problems, 1996.

D. J. Rogers and T. T. Tanimoto, A Computer Program for Classifying Plants, Science, vol.132, issue.3434, p.132, 1960.
DOI : 10.1126/science.132.3434.1115

S. M. Ross, Introduction to Probability Models, 2007.

Y. Saad, Variations on Arnoldi's method for computing eigenelements of large unsymmetric matrices, Linear Algebra and its Applications, vol.34, issue.C, pp.269-295, 1980.
DOI : 10.1016/0024-3795(80)90169-X

Y. Saad, Numerical Methods for Large Eigenvalue Problems, Numerical Methods for Large Eigenvalue Problems, pp.1-27, 1992.
DOI : 10.1137/1.9781611970739

J. Santisteban, T. Carcamo, and J. L. , Unilateral Jaccard similarity coefficient, CEUR Workshop Proceedings, pp.23-27, 2015.

S. E. Schaeffer, Graph clustering, Computer Science Review, vol.1, issue.1, pp.27-64, 2007.
DOI : 10.1016/j.cosrev.2007.05.001

C. Seshadhri, A. Pinar, and T. G. Kolda, An In-depth Study of Stochastic Kronecker Graphs, 2011 IEEE 11th International Conference on Data Mining, pp.587-596, 2011.
DOI : 10.1109/ICDM.2011.23

S. Fazeli, S. A. Emad, N. Liu, and Z. , A key to choose subspace size in implicitly restarted Arnoldi method, Numerical Algorithms, vol.23, issue.4, pp.407-426, 2015.
DOI : 10.1137/S0895479899358595
URL : https://hal.archives-ouvertes.fr/hal-01609325

S. Smyth and S. White, A spectral clustering approach to finding communities in graphs, Proceedings of the 5th SIAM International Conference on Data Mining, pp.76-84, 2005.

D. C. Sorensen, Implicitly Restarted Arnoldi/Lanczos Methods for Large Scale Eigenvalue Calculations, Parallel Numerical Algorithms, pp.119-165, 1997.
DOI : 10.1007/978-94-011-5412-3_5

D. C. Sorensen, Deflation for Implictly Restarted Arnoldi Methods, SIAM Journal on Matrix Analysis and Applications, 1998.
DOI : 10.1201/9781420010572.ch44

T. J. Sørensen, A method of establishing groups of equal amplitude in plant sociology based on similarity of species and its application to analyses of the vegetation on Danish commons, Biol. Skr, vol.5, 1948.

K. Stüben, A review of algebraic multigrid, Journal of Computational and Applied Mathematics, vol.128, issue.1-2, pp.281-309, 2001.
DOI : 10.1016/S0377-0427(00)00516-1

N. Sundaram, N. R. Satish, M. M. Patwary, S. R. Dulloor, S. G. Vadlamudi et al., GraphMat, Proceedings of the VLDB Endowment, pp.1214-1225, 2015.
DOI : 10.14778/2809974.2809983

H. Sutter, The free lunch is over: A fundamental turn toward concurrency in software, Dr. Dobb's Journal, pp.1-9, 2005.

J. C. Tremblay and T. Carrington, A refined unsymmetric Lanczos eigensolver for computing accurate eigentriplets of a real unsymmetric matrix, Electronic Transactions on Numerical Analysis, vol.28, pp.95-113, 2007.

A. Tversky, Features of Similarity, Readings in Cognitive Science, pp.290-302, 1977.

D. Vanderstraeten, A Stable and Efficient Parallel Block Gram-Schmidt Algorithm, Euro-Par'99 Parallel Processing, pp.1128-1135, 1999.
DOI : 10.1007/3-540-48311-X_158

V. Luxburg and U. , A tutorial on spectral clustering, Statistics and Computing, vol.21, issue.1, pp.395-416, 2007.
DOI : 10.1017/CBO9780511810633

Y. Wang, A. Davidson, Y. Pan, Y. Wu, A. Riffel et al., Gunrock, Proceedings of the 21st ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming -PPoPP '16, pp.1-12, 2016.
DOI : 10.1145/3016078.2851145

D. J. Watts and S. H. Strogatz, Collective dynamics of 'small-world' networks, Nature, pp.393440-442, 1998.
DOI : 10.1515/9781400841356.301

W. W. Zachary, An Information Flow Model for Conflict and Fission in Small Groups, Journal of Anthropological Research, vol.33, issue.4, pp.452-473, 1977.
DOI : 10.1086/jar.33.4.3629752
URL : http://arxiv.org/pdf/1707.03587