{"id":"W4295008616","doi":"10.1007/s10878-022-00900-y","title":"Linear time algorithms on mirror trees","year":2022,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal; Université du Québec à Chicoutimi","funders":"Agence Nationale de la Recherche","keywords":"Theory of computation; Time complexity; Algorithm; Mathematics; Linear programming; Running time; Isomorphism (crystallography); Graph algorithms; Graph; Combinatorics; Computer science; Discrete 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.001567903,0.0008761287,0.001688369,0.001003636,0.001475032,0.003378999,0.003304669,0.001626699,0.0150515],"category_scores_gemma":[0.01253907,0.001084194,0.001204228,0.002030666,0.001347192,0.008962139,0.00340566,0.002601938,0.00226027],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002433554,"about_ca_system_score_gemma":0.002295517,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002796208,"about_ca_topic_score_gemma":0.00527716,"domain_scores_codex":[0.9981202,0.0006096236,0.0001224016,0.0003741532,0.0004206454,0.0003529422],"domain_scores_gemma":[0.9923087,0.005014511,0.0004629101,0.001429229,0.0004638868,0.0003206937],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.002033861,0.0009867181,0.002382698,0.000590174,0.0001525644,0.0002208454,0.0005670703,0.1092549,0.01014287,0.5668984,0.03985877,0.2669111],"study_design_scores_gemma":[0.000325022,0.000149539,0.0004192906,0.00003719422,0.00006292417,0.0001263008,0.0001193717,0.4202559,0.003025308,0.5707977,0.004659505,0.00002191143],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2290895,0.00132512,0.706709,0.004595675,0.0003093721,0.0005772026,0.001211099,0.004478497,0.05170448],"genre_scores_gemma":[0.596525,0.000677099,0.3720415,0.001044725,0.0002586307,0.0005643635,0.001502488,0.0009048355,0.02648149],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0150515,"threshold_uncertainty_score":0.05035222,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01539163754627393,"score_gpt":0.2813810696624643,"score_spread":0.2659894321161904,"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."}}