{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004540382,0.002957668,0.002492699,0.003114086,0.001331469,0.004763388,0.006490096,0.002579935,0.02090918],"category_scores_gemma":[0.03395928,0.00118438,0.002284645,0.00713258,0.001675094,0.01051292,0.002628826,0.006532942,0.00323079],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004729278,"about_ca_system_score_gemma":0.003562179,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01094788,"about_ca_topic_score_gemma":0.01262723,"domain_scores_codex":[0.9960446,0.00125633,0.0001494724,0.0006189091,0.0009800071,0.0009505904],"domain_scores_gemma":[0.9723355,0.02066432,0.001312526,0.003078978,0.001326212,0.001282284],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.002327415,0.001582069,0.004876828,0.001275677,0.0004955555,0.0003640854,0.0006508117,0.4682347,0.002764598,0.2354446,0.08961281,0.1923708],"study_design_scores_gemma":[0.0001721815,0.000173523,0.0009032566,0.0001674099,0.0001898181,0.000253579,0.0002447186,0.7674652,0.001086681,0.2216523,0.007656104,0.00003515306],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07684311,0.01227259,0.836767,0.007771255,0.001115282,0.0003652399,0.003714079,0.002605895,0.05854555],"genre_scores_gemma":[0.5721142,0.008341974,0.3851728,0.001991486,0.001369918,0.000567876,0.009055022,0.001372042,0.02001478],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02090918,"threshold_uncertainty_score":0.0699482,"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."}}