{"id":"W2487852097","doi":"10.1007/978-3-319-30379-6_39","title":"Determining Sparse Jacobian Matrices Using Two-Sided Compression: An Algorithm and Lower Bounds","year":2016,"lang":"en","type":"book-chapter","venue":"","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Jacobian matrix and determinant; Matrix (chemical analysis); Sparse matrix; Compression (physics); Algorithm; Set (abstract data type); Mathematics; Computer science; Applied mathematics","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.001701552,0.003416469,0.002323834,0.002509766,0.001193037,0.003827706,0.002954629,0.002618198,0.01597119],"category_scores_gemma":[0.01559527,0.001182419,0.001457321,0.003512603,0.001924902,0.006689042,0.005012488,0.004977823,0.009979748],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001090574,"about_ca_system_score_gemma":0.002409985,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002607469,"about_ca_topic_score_gemma":0.005183041,"domain_scores_codex":[0.997169,0.0003757555,0.0001498859,0.0004460053,0.001632536,0.0002268599],"domain_scores_gemma":[0.9910874,0.005351725,0.0003411097,0.00164047,0.001350729,0.0002285784],"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.0003146463,0.0002890655,0.0009825878,0.0006385559,0.0001011236,0.0003421465,0.0002422938,0.06780332,0.01540051,0.09323949,0.03398519,0.786661],"study_design_scores_gemma":[0.00008771155,0.0001794846,0.000676228,0.0001539293,0.00008420332,0.00110557,0.0001554394,0.813657,0.02269162,0.1457149,0.01539402,0.0001000141],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004747006,0.001193312,0.9831056,0.0004124107,0.0002301259,0.0001268602,0.0002226285,0.001228479,0.008733603],"genre_scores_gemma":[0.05322515,0.001695773,0.9291219,0.0002818744,0.0006353403,0.0003278645,0.001196182,0.0006008368,0.01291517],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01597119,"threshold_uncertainty_score":0.05342895,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03092113384688914,"score_gpt":0.2730949152945301,"score_spread":0.2421737814476409,"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."}}