{"id":"W2308641315","doi":"10.1051/ro/2015024","title":"Linear time algorithms to solve the linear ordering problem for oriented tree based graphs","year":2015,"lang":"en","type":"article","venue":"RAIRO - Operations Research","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université du Québec à Chicoutimi","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Algorithm; Time complexity; Computer science; Tree (set theory); Mathematics; Combinatorics","routes":{"ca_aff":true,"ca_fund":true,"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.0006794432,0.001596843,0.0008672746,0.0009773392,0.0008476094,0.001600252,0.001860552,0.001091164,0.01349604],"category_scores_gemma":[0.00437622,0.0005053339,0.0007167079,0.002386371,0.0007007605,0.002961311,0.001153673,0.002194473,0.002588887],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001257705,"about_ca_system_score_gemma":0.002131897,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003510129,"about_ca_topic_score_gemma":0.007282532,"domain_scores_codex":[0.9989838,0.0002394586,0.00005546591,0.0001982586,0.0002795311,0.0002434593],"domain_scores_gemma":[0.9973124,0.001795067,0.0002330464,0.0002937372,0.0002604935,0.0001052956],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0006140052,0.0007813131,0.0009572333,0.001029798,0.0001276607,0.0001259019,0.0003020673,0.1797445,0.01420395,0.08961438,0.03454264,0.6779566],"study_design_scores_gemma":[0.0004551409,0.0003126558,0.0006172258,0.00005462321,0.0001037014,0.000222172,0.0003110107,0.7825714,0.01112218,0.1869453,0.01723836,0.00004634561],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01558901,0.0005817622,0.9729431,0.0004820125,0.0001232398,0.000218129,0.0003146475,0.002505847,0.007242254],"genre_scores_gemma":[0.09696099,0.000621002,0.8948133,0.0001929667,0.0001104357,0.0003015967,0.00127704,0.0003787649,0.005343938],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01349604,"threshold_uncertainty_score":0.04514873,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1094574019749217,"score_gpt":0.4049995213879207,"score_spread":0.295542119412999,"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."}}