{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001412921,0.0005921422,0.001179225,0.001360793,0.002225866,0.003008112,0.002165178,0.002563686,0.01701556],"category_scores_gemma":[0.01117005,0.0005959416,0.001079224,0.001647236,0.003374564,0.01009357,0.0036579,0.005588711,0.002144972],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001118049,"about_ca_system_score_gemma":0.0005484498,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001947174,"about_ca_topic_score_gemma":0.002296987,"domain_scores_codex":[0.9985842,0.0003501459,0.00008314235,0.0003971363,0.0003823498,0.0002031483],"domain_scores_gemma":[0.9917617,0.005920542,0.000271382,0.00103385,0.0004443378,0.0005683005],"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.0001029432,0.0000492283,0.0008118337,0.0001714517,0.00001267757,0.0002212021,0.0002203563,0.00122753,0.002413137,0.9646509,0.01259006,0.01752867],"study_design_scores_gemma":[0.00002540589,0.00004543864,0.0008794549,0.00004541443,0.00002684334,0.0003185803,0.0002057301,0.006540984,0.002113442,0.9699146,0.01985552,0.00002865727],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.1498419,0.007495061,0.3627988,0.01640112,0.005106435,0.0001563181,0.00177548,0.00129473,0.4551301],"genre_scores_gemma":[0.8480582,0.005404751,0.09741572,0.004769449,0.003269103,0.0002584627,0.001659031,0.0005995877,0.03856568],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01701556,"threshold_uncertainty_score":0.05692267,"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."}}