{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009384007,0.0008128304,0.0006782687,0.0005380743,0.0004061762,0.0006333735,0.0007689389,0.0006104745,0.003280419],"category_scores_gemma":[0.002635676,0.0003895129,0.0007142992,0.0006542965,0.0005546105,0.0006952801,0.001313766,0.001362948,0.001437991],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004605864,"about_ca_system_score_gemma":0.001111228,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003742125,"about_ca_topic_score_gemma":0.004668084,"domain_scores_codex":[0.9992881,0.0001804379,0.00004330857,0.0001137339,0.0003150163,0.00005940018],"domain_scores_gemma":[0.9990882,0.0003577827,0.00009589982,0.000156671,0.0002567933,0.00004476634],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003178746,0.00009965103,0.0008493083,0.0002407751,0.00007425491,0.0001635753,0.0002438395,0.4603941,0.05278409,0.04204379,0.006879476,0.4359092],"study_design_scores_gemma":[0.0000199975,0.00004186368,0.000119964,0.000007457925,0.000004156538,0.00004481875,0.00001973074,0.9887674,0.005346288,0.003713441,0.001900214,0.0000146311],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002356351,0.00003595928,0.9969563,0.00004617369,0.0000119504,0.00002323653,0.00002898531,0.0002205213,0.0003204989],"genre_scores_gemma":[0.0365226,0.00005531736,0.9622492,0.00003704875,0.00001396488,0.00006998581,0.000143981,0.00007019114,0.0008377651],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003742125,"threshold_uncertainty_score":0.01097411,"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."}}