{"id":"W2396856145","doi":"","title":"Approximation results for the linear ordering problem on interval graphs.","year":2013,"lang":"en","type":"article","venue":"Cologne Twente Workshop on Graphs and Combinatorial Optimization","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université du Québec à Chicoutimi","funders":"","keywords":"Interval (graph theory); Mathematics; Combinatorics; Interval graph; Discrete mathematics; Chordal graph; Computer science; 1-planar graph; Graph","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.0004045586,0.0002335694,0.0002043687,0.0002288279,0.00052265,0.0003815482,0.000339234,0.0001539935,0.00001742111],"category_scores_gemma":[0.0002078429,0.0001802742,0.0001019011,0.0006598009,0.0000906532,0.0004972736,0.00009303512,0.0002146471,0.000007040894],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004524428,"about_ca_system_score_gemma":0.00003413094,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001113082,"about_ca_topic_score_gemma":0.000004430785,"domain_scores_codex":[0.9984472,0.0000973865,0.0004303436,0.0004974673,0.0002533637,0.0002742418],"domain_scores_gemma":[0.9984235,0.0005442497,0.0002621149,0.0003708093,0.0003063727,0.00009294257],"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.0003114262,0.0002187128,0.00007959137,0.0000219379,0.00005734074,5.707496e-7,0.0004218055,0.4038171,0.00002278971,0.517488,0.003626039,0.0739347],"study_design_scores_gemma":[0.002585371,0.0005177658,0.000461687,0.00007617277,0.00002113308,0.000002565872,0.00009452016,0.9746991,0.00007081915,0.02015466,0.001068891,0.0002473416],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003740962,0.00005247953,0.9835149,0.005480528,0.003310118,0.002213758,0.000006586271,0.0003115993,0.001369042],"genre_scores_gemma":[0.9047109,0.0005745836,0.09210498,0.001076344,0.0001537774,0.0008930585,0.0001152879,0.00004110836,0.0003299864],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9009699,"threshold_uncertainty_score":0.7351369,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01487048659064786,"score_gpt":0.2397716318963463,"score_spread":0.2249011453056984,"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."}}