{"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":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00535779,0.0002188534,0.0002316523,0.0007413229,0.00133029,0.0004262523,0.002184507,0.00009842341,0.00003378297],"category_scores_gemma":[0.001830095,0.0001608767,0.0001153191,0.003778659,0.000290928,0.0006547344,0.0007715036,0.0006201653,0.0005276243],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001787429,"about_ca_system_score_gemma":0.0009661351,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009129807,"about_ca_topic_score_gemma":0.0002033208,"domain_scores_codex":[0.9958022,0.0004780539,0.0003808113,0.0007836787,0.001481267,0.001073998],"domain_scores_gemma":[0.99458,0.0008711854,0.00002243041,0.001443517,0.00254618,0.0005366761],"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.0005049071,0.001076728,0.0001124015,0.00008751159,0.0001585212,0.00003823735,0.007873802,0.3940598,0.02549926,0.4648137,0.02434019,0.08143496],"study_design_scores_gemma":[0.001011938,0.0007404975,0.00002153226,0.00002753018,0.000003039928,0.000004034307,0.0001950437,0.9463333,0.007949246,0.006662325,0.03682243,0.0002291155],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004371875,0.00006243015,0.9797603,0.01152904,0.0001173035,0.002872639,0.00003549029,0.0002035808,0.001047335],"genre_scores_gemma":[0.0233619,0.00000769843,0.9664972,0.0004081258,0.0002879348,0.002404433,0.00006480308,0.00007447229,0.006893386],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5522735,"threshold_uncertainty_score":0.9999698,"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."}}