{"id":"W2342101233","doi":"10.1007/s10846-016-0367-7","title":"Efficient Cholesky Factor Recovery for Column Reordering in Simultaneous Localisation and Mapping","year":2016,"lang":"en","type":"article","venue":"Journal of Intelligent & Robotic Systems","topic":"Robotics and Sensor-Based Localization","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Cholesky decomposition; Minimum degree algorithm; Incomplete Cholesky factorization; Computation; Computer science; Factorization; Factor (programming language); Algorithm; Graph; Factor graph; Column (typography); Sparse matrix; Theoretical computer science","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.0003792933,0.0001454096,0.0003285153,0.000270999,0.00003429717,0.00006909781,0.00008634921,0.00009321591,0.000004751005],"category_scores_gemma":[0.0003759428,0.0001104236,0.00007409984,0.0001363836,0.00001964807,0.00006556722,0.000009810979,0.00008756104,0.000003547879],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003415767,"about_ca_system_score_gemma":0.00002440967,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001469587,"about_ca_topic_score_gemma":0.000009564662,"domain_scores_codex":[0.9986004,0.00004295983,0.0008142632,0.0001200671,0.0002044848,0.0002178421],"domain_scores_gemma":[0.998792,0.0006245226,0.0002048441,0.0001054498,0.000183104,0.00009008066],"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.00002517054,0.00002109684,0.000414444,0.0002017648,0.00003733291,0.00001276676,0.0002606269,0.9845406,0.005344752,0.00008351498,0.00003217183,0.009025707],"study_design_scores_gemma":[0.0004490917,0.0001283893,0.0001668041,0.001205759,0.00001375958,0.00005431247,0.0003824851,0.9955645,0.001317297,0.00003405072,0.0005269211,0.0001565806],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2109565,0.0007846906,0.7866516,0.00004728822,0.001243719,0.0002756326,0.000003128471,0.00001953727,0.00001796445],"genre_scores_gemma":[0.9983429,0.0002605904,0.001089434,0.00001053535,0.0001997211,0.00000477608,0.000001044002,0.00003213232,0.00005886607],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7873864,"threshold_uncertainty_score":0.4502945,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01923271351544059,"score_gpt":0.2215039765602167,"score_spread":0.2022712630447761,"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."}}