{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008385993,0.0008759742,0.00058679,0.001015166,0.0006332434,0.001449565,0.001801288,0.001183586,0.008437816],"category_scores_gemma":[0.00658115,0.0004702669,0.0009050347,0.001495042,0.0009886506,0.002979772,0.001535509,0.00202724,0.002514883],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008750111,"about_ca_system_score_gemma":0.001171833,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003681124,"about_ca_topic_score_gemma":0.006498415,"domain_scores_codex":[0.9993581,0.000249166,0.0000278199,0.0001010388,0.0002134816,0.00005033265],"domain_scores_gemma":[0.9980489,0.001037225,0.0001571673,0.0004518472,0.0002381165,0.00006674153],"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.00007203983,0.0001022511,0.0006840152,0.0002117204,0.00004003659,0.0001771794,0.000178194,0.3862429,0.002886127,0.4908298,0.01264091,0.1059349],"study_design_scores_gemma":[0.00001877246,0.00002625655,0.0001011547,0.00001548348,0.000007989519,0.00006623118,0.00004128211,0.7255789,0.0007542315,0.2671816,0.006197256,0.00001081579],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005566469,0.0001890792,0.9881108,0.0003641563,0.00005736673,0.00006911253,0.0002131872,0.0007081485,0.004721703],"genre_scores_gemma":[0.1686119,0.0007135748,0.8221218,0.0002692586,0.00009045564,0.0004811543,0.001041413,0.0004434373,0.006227001],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008437816,"threshold_uncertainty_score":0.02822727,"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."}}