{"id":"W2397477242","doi":"","title":"On Super Vertex-Magic Total Labeling of the Disjoint Union of k Copies of K n .","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; MAGIC (telescope); Disjoint sets; Vertex (graph theory); Disjoint union (topology); Physics; Graph; Astrophysics","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.0004829101,0.0000965505,0.0002188084,0.00006872832,0.00004795269,0.000009905835,0.000479598,0.0000476176,0.000004476789],"category_scores_gemma":[0.0001944586,0.0000667372,0.00008953256,0.0003481896,0.0001184562,0.00008227512,0.0002075228,0.00009584002,0.000004913126],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008794456,"about_ca_system_score_gemma":0.00003324034,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008088978,"about_ca_topic_score_gemma":0.000001937457,"domain_scores_codex":[0.9989088,0.0001336398,0.0003155126,0.0001779087,0.0003288167,0.0001353818],"domain_scores_gemma":[0.9987,0.0002205145,0.0002248197,0.0006457905,0.0001737791,0.00003508548],"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.000004329172,0.0001178111,0.002045448,0.00003076697,0.00001138444,1.129339e-7,0.0002986499,0.0002952653,0.01782436,0.9785054,0.0002100965,0.0006563974],"study_design_scores_gemma":[0.0007172,0.0003041363,0.004530145,0.0001966497,0.00001004881,0.000001384448,0.00001944046,0.005812965,0.09244952,0.8958414,0.00002444655,0.00009266741],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9972486,0.0001034733,0.0001718477,0.0002638709,0.001477962,0.00008282157,0.000001508149,0.0000237765,0.0006261747],"genre_scores_gemma":[0.9991456,0.000005732528,0.0007482381,0.0000478474,4.74859e-7,0.000001336484,5.922264e-7,0.000005956564,0.0000442283],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.08266398,"threshold_uncertainty_score":0.2721464,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.006855100886390618,"score_gpt":0.1993239365394676,"score_spread":0.192468835653077,"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."}}