{"id":"W2068874164","doi":"10.1007/s10543-006-0091-y","title":"An Arnoldi-type algorithm for computing page rank","year":2006,"lang":"en","type":"article","venue":"BIT Numerical Mathematics","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":108,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"PageRank; Computation; Convergence (economics); Algorithm; Rank (graph theory); Matrix (chemical analysis); Computer science; Arnoldi iteration; Type (biology); Mathematics; Generalized minimal residual method; Mathematical optimization; Iterative method; Theoretical computer science; Combinatorics","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004783767,0.0002067942,0.0003188028,0.00006830085,0.0002053836,0.0002070361,0.0008429874,0.000083142,0.00002346157],"category_scores_gemma":[0.00005375494,0.000177471,0.0001126368,0.0004418699,0.00004517272,0.0002496857,0.0001183598,0.0001171095,0.0000850614],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002385313,"about_ca_system_score_gemma":0.00003143238,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008338767,"about_ca_topic_score_gemma":2.089412e-7,"domain_scores_codex":[0.9984846,0.0000594946,0.0004136703,0.0003661958,0.0002619326,0.0004140677],"domain_scores_gemma":[0.9986145,0.0003977142,0.0001650603,0.0005989192,0.0001060211,0.0001177141],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000005959771,0.001087413,0.00002064775,0.0001502812,0.0000297298,0.00002351458,0.0005626075,0.0005243282,0.001519858,0.6416856,0.00169709,0.3526929],"study_design_scores_gemma":[0.0003106579,0.0001640079,0.00002694056,0.000020065,0.00001075216,0.00002823542,0.00002794748,0.8524691,0.0009596049,0.141644,0.004093096,0.0002456155],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001942985,0.00006957263,0.9958491,0.0001470983,0.0003364607,0.0002906387,0.000006978064,0.0003821373,0.0009749964],"genre_scores_gemma":[0.05800691,0.000002108284,0.9411253,0.0001618886,0.0003683897,0.00001008976,0.00001000406,0.00002484873,0.0002904621],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8519447,"threshold_uncertainty_score":0.7237055,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01507716441216068,"score_gpt":0.2655212796423967,"score_spread":0.2504441152302361,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}