{"id":"W2743017711","doi":"10.1007/978-3-642-12200-2_51","title":"The Interval Constrained 3-Coloring Problem","year":2010,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"Deutsche Forschungsgemeinschaft; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; National Science Foundation","keywords":"Interval (graph theory); Time complexity; Computer science; Combinatorics; Computational complexity theory; NP-complete; Mathematics; Discrete mathematics; Algorithm","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":[],"consensus_categories":[],"category_scores_codex":[0.001876761,0.0001746241,0.0001469479,0.000206877,0.0006462986,0.0008542145,0.002688292,0.00007146385,0.000002773388],"category_scores_gemma":[0.0002231482,0.000113631,0.00005537159,0.001677155,0.0009835496,0.0004878102,0.0008163667,0.0006035909,0.00001854791],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002693061,"about_ca_system_score_gemma":0.0002473214,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003540179,"about_ca_topic_score_gemma":0.0001652842,"domain_scores_codex":[0.9978528,0.00004825833,0.000308857,0.0006786333,0.0004830931,0.0006283342],"domain_scores_gemma":[0.9981504,0.0005465156,0.00009442052,0.0008987506,0.0001738003,0.0001361245],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000003762762,0.0000462822,0.001308562,0.000006400559,0.00000411146,0.00001739783,0.001072895,0.008965393,0.0317306,0.08411489,0.00001667949,0.872713],"study_design_scores_gemma":[0.0002789617,0.00009920866,0.0008214001,0.00003624841,0.000001287973,0.00008900949,7.526648e-7,0.7070195,0.02271466,0.268396,0.0003097808,0.0002331455],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09560791,0.00005020214,0.8976537,0.003743992,0.002493536,0.0001720219,2.284623e-7,0.0001780457,0.0001003477],"genre_scores_gemma":[0.6547386,0.000002131514,0.3446983,0.0005174981,0.0000295426,0.000008753345,1.090711e-7,0.000003847826,0.000001257953],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8724799,"threshold_uncertainty_score":0.823721,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01034433427198021,"score_gpt":0.2383458001660845,"score_spread":0.2280014658941043,"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."}}