{"id":"W2400697410","doi":"","title":"On graph labeling problems and regular decompositions of complete graphs.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Graph; Discrete mathematics","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.002599669,0.001261467,0.001574232,0.002505495,0.002451807,0.004908347,0.002333184,0.00251413,0.01156094],"category_scores_gemma":[0.01376065,0.001073085,0.001383764,0.004394614,0.00469052,0.01290774,0.003537081,0.005252709,0.001731095],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002602398,"about_ca_system_score_gemma":0.001137019,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002386615,"about_ca_topic_score_gemma":0.002932196,"domain_scores_codex":[0.9979501,0.0008472949,0.00009669437,0.0004147064,0.0003598636,0.0003312934],"domain_scores_gemma":[0.9884643,0.00861097,0.0006949591,0.0009721761,0.0004785237,0.0007791179],"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.00006781887,0.00009287013,0.0005519641,0.0002077071,0.00003220412,0.00007284428,0.0002554502,0.006034246,0.0004032622,0.9511948,0.0201303,0.02095656],"study_design_scores_gemma":[0.00001553218,0.000008934353,0.0001860135,0.0000421133,0.00001019723,0.00007520005,0.000156077,0.007643205,0.0001488323,0.9858727,0.005832518,0.000008589569],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.1584717,0.01591062,0.5901029,0.02050304,0.001188062,0.0003188388,0.00298356,0.0009277061,0.2095935],"genre_scores_gemma":[0.6668088,0.01488406,0.2470515,0.003627112,0.002986487,0.0006978295,0.006568813,0.00077449,0.05660094],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.01156094,"threshold_uncertainty_score":0.03867525,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0144864742018439,"score_gpt":0.224763703746268,"score_spread":0.2102772295444241,"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."}}