{"id":"W2567527899","doi":"10.1007/s10878-016-0107-8","title":"Is there any polynomial upper bound for the universal labeling of graphs?","year":2016,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"ca_institutions":"Carleton University","funders":"","keywords":"Graph; Upper and lower bounds; Edge-graceful labeling; Graph labeling; Bound graph; Theory of computation; Complement graph; Time complexity","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.0006738479,0.00009418465,0.0001833181,0.0001466516,0.0001456745,0.00007106295,0.0005072036,0.00007394146,0.00001395085],"category_scores_gemma":[0.000183275,0.00005169282,0.0001656959,0.0002831678,0.00006659534,0.0005077787,0.00005351671,0.00007598106,8.058804e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003079955,"about_ca_system_score_gemma":0.0001868465,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007150108,"about_ca_topic_score_gemma":1.188124e-7,"domain_scores_codex":[0.9989494,0.00006110705,0.0004197168,0.0001134449,0.0003100312,0.0001463102],"domain_scores_gemma":[0.9980441,0.0003437448,0.0005686322,0.0002213774,0.0007476633,0.00007443118],"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.0006057079,0.0003681732,0.002060133,0.00003670568,0.0003815459,0.000004971436,0.001347953,0.05741605,0.01395896,0.8972253,0.0203345,0.006259962],"study_design_scores_gemma":[0.02476093,0.003193928,0.0004892414,0.0007831415,0.0003805899,0.00007205777,0.0002483233,0.2056333,0.04139858,0.7106303,0.01165478,0.0007548212],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0333217,0.0008899415,0.9495563,0.007576619,0.008279381,0.0002363141,0.000006001881,0.00002778958,0.0001059383],"genre_scores_gemma":[0.9237513,0.0002675319,0.075644,0.0001479829,0.0001063484,0.000001547588,3.630917e-7,0.00001309808,0.00006784126],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8904296,"threshold_uncertainty_score":0.2107972,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01256233234506361,"score_gpt":0.2335802368730095,"score_spread":0.2210179045279459,"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."}}