{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005117051,0.002529859,0.003719614,0.001841136,0.002960657,0.008963524,0.007639715,0.004897394,0.01911745],"category_scores_gemma":[0.04035787,0.001800354,0.003246593,0.004726171,0.005901105,0.02837725,0.006354104,0.01395549,0.004955742],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005496623,"about_ca_system_score_gemma":0.003799522,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002984192,"about_ca_topic_score_gemma":0.004403736,"domain_scores_codex":[0.9947255,0.001162974,0.0001738172,0.00126803,0.0009198157,0.001749824],"domain_scores_gemma":[0.9460411,0.04148494,0.001665691,0.007260624,0.001334004,0.002213552],"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.002633518,0.001081429,0.00507786,0.002151923,0.0002778909,0.0002040954,0.0008617428,0.06056743,0.00973471,0.6325071,0.0871591,0.1977432],"study_design_scores_gemma":[0.0001186755,0.0001045578,0.0008877565,0.00019161,0.0001367901,0.0001798271,0.0002276382,0.07781995,0.002624711,0.9046848,0.01296904,0.00005453374],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1185261,0.01615416,0.6917537,0.06107366,0.002081884,0.0002331996,0.004542259,0.005062846,0.1005721],"genre_scores_gemma":[0.6997836,0.01310745,0.2408555,0.01128481,0.004741583,0.0006418723,0.004096116,0.002798732,0.02269043],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01911745,"threshold_uncertainty_score":0.06395423,"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."}}