{"id":"W4239711818","doi":"10.1007/978-3-319-14115-2_31","title":"Linear Arrangement Problems and Interval Graphs","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université du Québec à Chicoutimi","funders":"","keywords":"Bounding overwatch; Interval (graph theory); Indifference graph; Interval graph; Combinatorics; Mathematics; Upper and lower bounds; Chordal graph; Discrete mathematics; Pathwidth; Focus (optics); Computer science; 1-planar graph; Graph; Line graph; Physics; Mathematical analysis; Artificial intelligence","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001060268,0.0005673795,0.0005861024,0.0009192687,0.000306807,0.0005540114,0.003015729,0.0002429837,0.00002015353],"category_scores_gemma":[0.00004341717,0.0005131816,0.0001584382,0.0005377355,0.001122374,0.0003618649,0.002229749,0.0008391599,0.00002857614],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001000388,"about_ca_system_score_gemma":0.000137384,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002583801,"about_ca_topic_score_gemma":0.00008940394,"domain_scores_codex":[0.9961953,0.00004172163,0.0005332149,0.001671293,0.0008975054,0.0006609746],"domain_scores_gemma":[0.9977165,0.0003059055,0.0002460356,0.001330748,0.0001793965,0.0002214401],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000002925527,0.00002446982,0.00005118304,0.00008527209,0.00001730805,0.00003059881,0.0008261527,0.003095485,0.00003644653,0.1143181,0.00002930742,0.8814828],"study_design_scores_gemma":[0.0002725444,0.0002802204,0.00009657707,0.0004855678,0.000007831865,0.0000715877,9.809366e-8,0.4788992,0.0001782821,0.509915,0.009156105,0.000636988],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001014562,0.0006120179,0.9936817,0.0009906751,0.001761311,0.0004053937,0.000004116079,0.0001915254,0.002251783],"genre_scores_gemma":[0.08239976,0.0002240063,0.9128965,0.002997594,0.000761591,0.00002534858,0.000007571865,0.00006002251,0.0006275602],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8808458,"threshold_uncertainty_score":0.999732,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02550985014929507,"score_gpt":0.2405550038033833,"score_spread":0.2150451536540883,"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."}}