{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005681154,0.0009270002,0.0007993155,0.00096534,0.0009891975,0.002743233,0.001871135,0.001349419,0.01645267],"category_scores_gemma":[0.002389827,0.0006209991,0.0007158301,0.004118831,0.001695385,0.005116481,0.001293879,0.004298759,0.002979929],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001240037,"about_ca_system_score_gemma":0.0004369119,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007248845,"about_ca_topic_score_gemma":0.0006501814,"domain_scores_codex":[0.9994276,0.0001839585,0.0000283491,0.0001282091,0.0001670411,0.00006493067],"domain_scores_gemma":[0.9989676,0.000678307,0.00009926635,0.0001146469,0.00007969933,0.00006041497],"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.00003386106,0.00006227437,0.0001035936,0.0002849996,0.00001317037,0.00006082134,0.0001401627,0.008273075,0.0005297119,0.8921389,0.02761122,0.0707482],"study_design_scores_gemma":[0.00001273843,0.00001294051,0.00009342381,0.00004751749,0.000006768753,0.00009128742,0.00008841039,0.005312074,0.0001730061,0.9710244,0.02312874,0.000008704797],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"methods","genre_scores_codex":[0.04713678,0.03208679,0.3936531,0.006930121,0.001673894,0.0001439755,0.0008473577,0.0006331231,0.5168949],"genre_scores_gemma":[0.5104551,0.05221936,0.2408002,0.001702191,0.00540362,0.0005987521,0.003886928,0.0005603486,0.1843734],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.01645267,"threshold_uncertainty_score":0.05503964,"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."}}