{"id":"W2396107515","doi":"","title":"Graph Models and their Efficient Implementation for Sparse Jacobian Matrix Determination.","year":2010,"lang":"en","type":"article","venue":"Cologne Twente Workshop on Graphs and Combinatorial Optimization","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Sparse matrix; Computer science; Jacobian matrix and determinant; Theoretical computer science; Algorithm; Graph; Matrix (chemical analysis); Adjacency matrix; Mathematics; 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":[],"consensus_categories":[],"category_scores_codex":[0.0005337748,0.0002414983,0.000223926,0.0003158841,0.0004971313,0.0002862466,0.0002900313,0.0001575286,0.000007994498],"category_scores_gemma":[0.00003633233,0.0002145381,0.00008929953,0.0005023472,0.0001178801,0.0003778323,0.0001098691,0.000189336,4.744922e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001330964,"about_ca_system_score_gemma":0.00002822463,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000291176,"about_ca_topic_score_gemma":0.000006271502,"domain_scores_codex":[0.9986451,0.00008275382,0.0003064385,0.0005128243,0.000153072,0.0002998383],"domain_scores_gemma":[0.998932,0.0002674092,0.0001836474,0.0002926957,0.0001844476,0.0001397925],"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.00008345642,0.0001818816,0.00006315533,0.00001416124,0.00002111374,0.000001202014,0.0005952482,0.0334302,0.0002825193,0.9306818,0.0000924971,0.03455272],"study_design_scores_gemma":[0.002019816,0.0003053145,0.0001155012,0.00001690997,0.00001982192,0.000006144967,0.000186265,0.7389553,0.0004330598,0.2575665,0.0001252804,0.0002501699],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1786145,0.00009328746,0.8163972,0.0003834126,0.003368862,0.0008921557,0.00001674442,0.0001430505,0.00009080519],"genre_scores_gemma":[0.9737185,0.0001130717,0.02574651,0.0001239116,0.00006150304,0.0001514622,0.00004210164,0.00001810223,0.00002482193],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.795104,"threshold_uncertainty_score":0.874861,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01216361064185912,"score_gpt":0.264977386962902,"score_spread":0.2528137763210428,"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."}}