{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003173386,0.0001730678,0.0002505113,0.0002736141,0.0002204309,0.00007339094,0.0004234906,0.00007004303,0.000001989525],"category_scores_gemma":[0.0000247305,0.0001638178,0.00008168886,0.0006936845,0.00009248934,0.0001927846,0.00007918718,0.0001556917,0.000007387544],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009597309,"about_ca_system_score_gemma":0.0000179479,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001820323,"about_ca_topic_score_gemma":0.000001048661,"domain_scores_codex":[0.9986262,0.0000735764,0.0003332151,0.0003981946,0.000296007,0.0002727599],"domain_scores_gemma":[0.9988868,0.0001117764,0.0001395214,0.0005808832,0.0001489072,0.000132175],"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.000004451082,0.0001742282,0.0001752145,0.00001016603,0.00001572444,0.000003792303,0.000188987,0.0001820672,0.01206852,0.9854977,0.000512871,0.001166298],"study_design_scores_gemma":[0.0007935897,0.0005116466,0.001422674,0.0001145509,0.00001054514,0.00001197997,0.000005229239,0.002392041,0.002329202,0.9921397,0.00008714261,0.0001816985],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.994458,0.0008051251,0.001203052,0.001479969,0.0007298289,0.0002503122,0.00000414697,0.0002327791,0.000836805],"genre_scores_gemma":[0.9891602,0.00007219436,0.0102361,0.000498893,6.020474e-7,0.000006007478,0.00000461395,0.000007865474,0.00001351929],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00973932,"threshold_uncertainty_score":0.6680294,"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."}}