{"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":"codex-gemma-dda1882f352a","candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0009219897,0.00007447045,0.00006816836,0.000127423,0.002596144,0.001386666,0.0005520699,0.00003756728,0.00006870712],"category_scores_gemma":[0.0002107885,0.00005116964,0.00004274062,0.0001097133,0.0002228737,0.0004525475,0.0002088033,0.0001862037,0.00003170977],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003592889,"about_ca_system_score_gemma":0.00009668723,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007777078,"about_ca_topic_score_gemma":0.0004170476,"domain_scores_codex":[0.9989961,0.00007490602,0.0001315379,0.0002681328,0.0003130613,0.0002162644],"domain_scores_gemma":[0.9988081,0.000166886,0.00001763825,0.0006538358,0.0002906768,0.000062886],"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.00006366579,0.0002142809,0.001427535,0.00002836893,0.0000803636,0.000002813579,0.002363076,0.008645203,0.0007654604,0.6700945,0.01161669,0.3046981],"study_design_scores_gemma":[0.0009314272,0.0004405486,0.01633718,0.00004561476,0.000006161575,0.000005811657,0.0001690387,0.9247791,0.0006031711,0.002277035,0.05422541,0.000179555],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02118418,0.00006550426,0.906833,0.06347553,0.0005343378,0.00177175,0.00001638108,0.00007166486,0.006047654],"genre_scores_gemma":[0.959936,0.000106485,0.03491904,0.0002861926,0.0001036106,0.0003416927,0.000005906327,0.000009798707,0.004291285],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9387518,"threshold_uncertainty_score":0.99965,"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."}}