{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007372251,0.001005299,0.001388218,0.0007537676,0.001097729,0.002849866,0.002506492,0.001933308,0.01522988],"category_scores_gemma":[0.004408399,0.0007008307,0.0009644827,0.002555725,0.001033865,0.003661485,0.002028226,0.002976408,0.001286687],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001290017,"about_ca_system_score_gemma":0.001244372,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003071104,"about_ca_topic_score_gemma":0.002407935,"domain_scores_codex":[0.9991788,0.0002319246,0.00003814879,0.0002275798,0.0001566583,0.0001668731],"domain_scores_gemma":[0.9972671,0.001601806,0.0002276473,0.0003496941,0.0002033858,0.0003502849],"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.001125409,0.0004365809,0.001787297,0.001000043,0.0001353793,0.0004162403,0.0004594488,0.1377916,0.007573497,0.604624,0.06522663,0.1794239],"study_design_scores_gemma":[0.0002025769,0.0000973483,0.00109338,0.0001265989,0.0000605582,0.00043575,0.0002748774,0.196506,0.002902081,0.7693164,0.02893039,0.00005408801],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2132864,0.002383286,0.6825617,0.005431983,0.0007280795,0.0003623566,0.00753512,0.001333135,0.08637802],"genre_scores_gemma":[0.6285318,0.00246897,0.3375593,0.001449886,0.0005557497,0.000456739,0.006636706,0.0007811793,0.02155976],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01522988,"threshold_uncertainty_score":0.05094904,"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."}}