{"id":"W2593872908","doi":"10.1051/ro/2017011","title":"Lower and upper bounds for the linear arrangement problem on interval graphs","year":2017,"lang":"en","type":"article","venue":"RAIRO - Operations Research","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université du Québec à Chicoutimi","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Interval graph; Intersection graph; Mathematics; Interval (graph theory); Combinatorics; Indifference graph; Graph; Intersection (aeronautics); Upper and lower bounds; Discrete mathematics; Chordal graph; 1-planar graph; Line graph; Mathematical analysis","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.005666245,0.003243553,0.002406136,0.003960003,0.002024496,0.0081731,0.006517542,0.003025908,0.02412657],"category_scores_gemma":[0.03614563,0.001395286,0.00270119,0.006913781,0.00263156,0.01549773,0.004835879,0.01081957,0.004627095],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00476296,"about_ca_system_score_gemma":0.002465015,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002991382,"about_ca_topic_score_gemma":0.003503189,"domain_scores_codex":[0.9913755,0.002125613,0.0003878238,0.001224926,0.002759758,0.002126278],"domain_scores_gemma":[0.9598809,0.03058739,0.001867972,0.003685244,0.002328009,0.001650329],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0008707133,0.0006918469,0.002118712,0.001909569,0.0002195232,0.0002882768,0.0007334383,0.3501934,0.006126584,0.4342231,0.0366012,0.1660236],"study_design_scores_gemma":[0.00007056692,0.0002410818,0.001026005,0.0004241134,0.0001275278,0.0004192721,0.0003390297,0.5744355,0.003980474,0.3937266,0.02513503,0.00007479385],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02962923,0.008839564,0.8853583,0.00535783,0.0005369792,0.0002658143,0.001925346,0.001778718,0.06630824],"genre_scores_gemma":[0.3272972,0.01007888,0.6293408,0.001926727,0.001832185,0.001180412,0.004945015,0.00212741,0.02127136],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02412657,"threshold_uncertainty_score":0.08071136,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.09050988374062498,"score_gpt":0.3953697445445166,"score_spread":0.3048598608038916,"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."}}