{"id":"W2209026667","doi":"10.1016/j.akcej.2015.06.006","title":"On k-edge-magic labelings of maximal outerplanar graphs","year":2015,"lang":"en","type":"article","venue":"AKCE International Journal of Graphs and Combinatorics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Manitoba","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Edge-graceful labeling; Conjecture; Discrete mathematics; Graph; 1-planar graph; Chordal graph; Graph power; Line graph","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.000704157,0.0001475823,0.0002517814,0.0005724928,0.00004057892,0.0001057893,0.000918527,0.00006845697,0.000002791671],"category_scores_gemma":[0.0001401309,0.0001207031,0.0001391963,0.0003876315,0.00008645351,0.0003580071,0.0001416801,0.0002432824,0.000004476673],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002673419,"about_ca_system_score_gemma":0.00009326205,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002341597,"about_ca_topic_score_gemma":7.672438e-7,"domain_scores_codex":[0.9981576,0.00005528255,0.0005445341,0.0001837346,0.0008978657,0.0001609389],"domain_scores_gemma":[0.9975796,0.0001330856,0.0005079034,0.0002012344,0.001365742,0.0002124145],"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.00006517502,0.0002585756,0.005648431,0.000005940216,0.00009064891,0.00007879775,0.0003275116,0.00005825047,0.0001530347,0.9880099,0.00305502,0.002248661],"study_design_scores_gemma":[0.001545321,0.0009722167,0.0008086877,0.00009641079,0.00001734282,0.0002147573,0.0000560681,0.001188677,0.0006856269,0.9933707,0.0009061793,0.0001380789],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9873874,0.001224895,0.004553257,0.001934771,0.003660227,0.00005785254,0.000005073843,0.00003281036,0.0011437],"genre_scores_gemma":[0.9967281,0.0002587491,0.002505813,0.0004279099,0.000008844102,6.73492e-7,0.000001319209,0.000008009756,0.00006059423],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.009340675,"threshold_uncertainty_score":0.4922128,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0180418052582178,"score_gpt":0.2503031048051269,"score_spread":0.2322612995469091,"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."}}