{"id":"W2918744402","doi":"","title":"Iterative algorithm for computing irregularity strength of complete graph.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Algorithm; Graph; Combinatorics","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":[],"consensus_categories":[],"category_scores_codex":[0.0004998511,0.0001735723,0.0002936274,0.0001452811,0.0002907295,0.00008152857,0.0006543986,0.00007412043,0.000004093133],"category_scores_gemma":[0.00004737777,0.0001653018,0.0001229389,0.0005547003,0.0002273998,0.0002095302,0.0002411461,0.0001092618,0.000009740899],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000159181,"about_ca_system_score_gemma":0.00004964468,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004165457,"about_ca_topic_score_gemma":0.000002940906,"domain_scores_codex":[0.9985057,0.0000878201,0.0003753249,0.0004310285,0.0002675022,0.0003326698],"domain_scores_gemma":[0.9983109,0.0002374103,0.0002146372,0.0005574424,0.0005752483,0.0001043698],"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.000004741027,0.0001352731,0.0002243165,0.00001362835,0.00003768249,0.000001147226,0.0005923269,0.00000398745,0.001069909,0.9751561,0.001060514,0.02170033],"study_design_scores_gemma":[0.001112823,0.0004670605,0.0005405229,0.00005096097,0.00001023598,0.00000392527,0.0000208523,0.1634839,0.008766845,0.8249216,0.0004309064,0.000190425],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5720261,0.0002613094,0.4195902,0.0003858621,0.005788918,0.0006789897,0.00004770171,0.0003902381,0.0008307536],"genre_scores_gemma":[0.8011332,0.000001715858,0.1986902,0.0001191197,0.000004959698,0.000006271991,0.000008732352,0.000009811789,0.00002598552],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2291072,"threshold_uncertainty_score":0.6740813,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01930189634969985,"score_gpt":0.2559862754358235,"score_spread":0.2366843790861236,"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."}}