{"id":"W170351987","doi":"","title":"On (a, d)-antimagic special trees, unicyclic graphs, complete bipartite graphs.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Bipartite graph; Complete bipartite graph; Discrete mathematics; Graph","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008186919,0.0006040864,0.0009383386,0.002194401,0.002077936,0.003201938,0.001270465,0.001921009,0.007113261],"category_scores_gemma":[0.004648967,0.0006321146,0.0006247301,0.00406549,0.002342866,0.005182401,0.002668321,0.001968821,0.001196199],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002289305,"about_ca_system_score_gemma":0.0007517045,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002087548,"about_ca_topic_score_gemma":0.003516952,"domain_scores_codex":[0.9991653,0.0002976999,0.00004486332,0.0001871586,0.000135357,0.0001696924],"domain_scores_gemma":[0.9946862,0.003552319,0.0005584034,0.0004929419,0.0002168342,0.0004932708],"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.0001612267,0.00008253191,0.001127625,0.0002720419,0.00003161911,0.0001559628,0.0003486096,0.00625121,0.001827341,0.9444878,0.01865618,0.02659787],"study_design_scores_gemma":[0.00003107631,0.00001851907,0.0005002681,0.00005231362,0.00002153412,0.0002767831,0.0002105121,0.01140315,0.0005574473,0.9785019,0.008411426,0.00001502514],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4724579,0.008453138,0.2872024,0.01071333,0.0006509197,0.0002198708,0.003906245,0.00105746,0.2153388],"genre_scores_gemma":[0.8944234,0.00542543,0.06792439,0.001574779,0.0006137273,0.0002523035,0.002464333,0.000216467,0.0271052],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007113261,"threshold_uncertainty_score":0.0237962,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01662667198541942,"score_gpt":0.2300158672047207,"score_spread":0.2133891952193013,"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."}}