{"id":"W2104930613","doi":"10.5539/mas.v6n9p26","title":"The Unconstrained Binary Quadratic Programming for the Sum Coloring Problem","year":2012,"lang":"en","type":"article","venue":"Modern Applied Science","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Binary number; Quadratic programming; Computer science; Quadratic equation; Graph coloring; Quadratic unconstrained binary optimization; Mathematical optimization; Mathematics; Algorithm; Graph; Theoretical computer science; Arithmetic","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.01702265,0.0001480539,0.0001621347,0.0001299436,0.004813453,0.001139887,0.001949894,0.00004306356,0.0000086055],"category_scores_gemma":[0.002016946,0.00007050791,0.00009404547,0.001819822,0.00161345,0.000407809,0.0002407879,0.0001877836,0.00009671466],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006650836,"about_ca_system_score_gemma":0.0003746935,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001304222,"about_ca_topic_score_gemma":0.00002481553,"domain_scores_codex":[0.9965368,0.00004723445,0.0004524922,0.000472349,0.001455696,0.001035412],"domain_scores_gemma":[0.9943879,0.004115987,0.0002076689,0.0008179125,0.0002720284,0.0001985042],"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.00008826383,0.0002401086,0.002861707,0.00001078141,0.00004006796,4.772647e-7,0.008153475,0.009324754,0.07453035,0.3115587,0.001147258,0.5920441],"study_design_scores_gemma":[0.0006334524,0.0000864648,0.003270416,0.00001902728,0.00006636602,0.00001654052,0.007524651,0.8124697,0.003607021,0.1180908,0.05374514,0.0004704242],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07009879,0.000910058,0.9139338,0.004689872,0.001356238,0.002057807,0.000006378545,0.00019981,0.006747242],"genre_scores_gemma":[0.9734688,0.000003000126,0.02506824,0.0001084766,0.0001591695,0.0004519355,4.669585e-7,0.00001003646,0.0007298252],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9033701,"threshold_uncertainty_score":0.999897,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1360438055481522,"score_gpt":0.3805259530287306,"score_spread":0.2444821474805784,"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."}}