{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001164554,0.0001079073,0.0002109039,0.000375419,0.0003078548,0.00006845991,0.0009946122,0.0000352417,0.0001598056],"category_scores_gemma":[0.0001836104,0.0001013251,0.0001169724,0.0007806236,0.00003097042,0.0005692263,0.0002646956,0.0004154293,0.0000151795],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001665992,"about_ca_system_score_gemma":0.0001464602,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001125972,"about_ca_topic_score_gemma":1.879604e-8,"domain_scores_codex":[0.9978876,0.0003646647,0.0003832744,0.0001619566,0.0009806515,0.0002218517],"domain_scores_gemma":[0.9986746,0.0002075757,0.000389871,0.0002790663,0.0003384135,0.0001105264],"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.0002577529,0.0003692103,0.00001705906,0.000002267793,0.00003171548,0.00005999838,0.000206941,0.9311558,0.0004339083,0.06388645,0.001174927,0.002403985],"study_design_scores_gemma":[0.00291905,0.003216052,0.00004232444,0.00001616341,0.00001176271,0.0001113357,0.00003547027,0.9391928,0.001500579,0.04374202,0.008987339,0.0002250979],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005276366,0.0001144389,0.9806909,0.002042576,0.01007117,0.0002961768,0.000006324831,0.00008988936,0.001412172],"genre_scores_gemma":[0.1890634,0.00007022415,0.8076482,0.0004658352,0.001312877,0.00002834506,0.00001384674,0.00007440968,0.001322848],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.183787,"threshold_uncertainty_score":0.4131916,"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."}}