{"id":"W2403793505","doi":"","title":"A note on the neighbor condition for up-embeddability of graphs.","year":2010,"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","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.0007259951,0.0001073413,0.0001403271,0.00006405196,0.0001588479,0.00004427036,0.0005622241,0.00007845944,0.00001609158],"category_scores_gemma":[0.0002854287,0.00007333944,0.0001122436,0.0002970115,0.000125303,0.0001222647,0.00007304657,0.0001926555,0.00001399217],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006860589,"about_ca_system_score_gemma":0.00004798322,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002173984,"about_ca_topic_score_gemma":0.000005220412,"domain_scores_codex":[0.9990426,0.0000535425,0.0002244246,0.0002758278,0.0002172812,0.0001863197],"domain_scores_gemma":[0.9981956,0.0006008527,0.0001289559,0.0007938134,0.0002210416,0.00005974624],"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.000009905328,0.00009693176,0.0002156428,0.000009247524,0.000007019657,2.055801e-7,0.0001642463,0.000004469835,0.01080396,0.9855695,0.002278551,0.0008403173],"study_design_scores_gemma":[0.0005364491,0.000174197,0.001048652,0.00001128271,0.000005872141,0.000001107497,0.000005000331,0.004307147,0.03248055,0.9607336,0.0006068252,0.00008929801],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9917873,0.00001257878,0.0008689219,0.001836673,0.00434574,0.0003719673,0.000008042085,0.00009369574,0.000675087],"genre_scores_gemma":[0.9977548,0.000001333008,0.001849858,0.0002939496,0.000001334428,0.00004732099,0.000003098226,0.000006746339,0.00004153478],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02483588,"threshold_uncertainty_score":0.2990696,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01293138166201053,"score_gpt":0.2580098579800494,"score_spread":0.2450784763180389,"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."}}