{"id":"W2325917071","doi":"10.1190/segam2015-5850767.1","title":"A fast rank-reduction algorithm for 3D deblending via randomized QR decomposition","year":2015,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Rank (graph theory); Algorithm; Singular value decomposition; QR decomposition; Computer science; Inversion (geology); Reduction (mathematics); Matrix decomposition; Set (abstract data type); Constraint (computer-aided design); Mathematics; Eigenvalues and eigenvectors","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.0002258365,0.0001275575,0.0002600455,0.0001003435,0.00004579291,0.00003805529,0.00005858182,0.0000668951,0.00001353962],"category_scores_gemma":[0.00001342084,0.000115262,0.00009623972,0.00007494115,0.00002270595,0.0001450868,0.00001257323,0.00006079409,0.00001266704],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006555464,"about_ca_system_score_gemma":0.000007627852,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003304362,"about_ca_topic_score_gemma":0.000001818769,"domain_scores_codex":[0.9993871,0.00003171569,0.0001896888,0.0001268802,0.00009363057,0.0001709576],"domain_scores_gemma":[0.9996422,0.00005486084,0.00002754972,0.000122734,0.00008668753,0.00006597664],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.003003131,0.00005876676,0.000002065525,0.00002456747,0.0002642822,0.000005508481,0.000513259,0.01435262,0.05963854,0.0008610061,0.02215424,0.899122],"study_design_scores_gemma":[0.01832004,0.00002506177,6.62087e-7,0.00002801897,0.00004374724,0.00004006144,0.00004115673,0.8699415,0.1075698,0.002726846,0.001107446,0.0001556656],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00372222,0.0001569845,0.9896707,0.00003773609,0.0006247382,0.0005047156,0.000002113588,0.001238692,0.004042123],"genre_scores_gemma":[0.431738,0.0000263103,0.5676337,0.000026301,0.0002760443,0.0001105296,0.0000290732,0.00003597571,0.000123988],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8989664,"threshold_uncertainty_score":0.4700248,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01768741856118086,"score_gpt":0.2640345306510104,"score_spread":0.2463471120898295,"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."}}