{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004461039,0.0005842673,0.0005894312,0.0003095337,0.0003992489,0.0006439467,0.001097211,0.0003113811,0.0005927836],"category_scores_gemma":[0.000008925759,0.0004401797,0.0001405183,0.00006082635,0.0002050033,0.00116153,0.0008440849,0.0003218993,0.00008678318],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005192658,"about_ca_system_score_gemma":0.0001147598,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001332219,"about_ca_topic_score_gemma":0.000005377951,"domain_scores_codex":[0.997448,0.00007296389,0.000516069,0.001034324,0.0004448565,0.0004838367],"domain_scores_gemma":[0.9978837,0.0002185427,0.0003740711,0.001051319,0.0001087495,0.0003635678],"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.00001180882,0.00003187804,0.000005678174,0.00003906394,0.00006258236,0.0004860725,0.0001906555,0.00001022744,0.0002328414,0.3098429,0.000176667,0.6889096],"study_design_scores_gemma":[0.002885703,0.0007595603,0.00002247642,0.003049854,0.0002197026,0.001902787,0.00004571865,0.4759079,0.0009763472,0.3680588,0.1419384,0.004232805],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0003949444,0.0006216121,0.6812121,0.00008963167,0.001718672,0.0003252507,0.00003428509,0.0004601834,0.3151433],"genre_scores_gemma":[0.004171342,0.0002065193,0.6081448,0.0006639687,0.001933821,0.000008497376,0.00001222494,0.0001492801,0.3847096],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6846768,"threshold_uncertainty_score":0.999805,"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."}}