{"id":"W97347673","doi":"","title":"Covering the Powers of the Complete Graph with a Bounded Number of Snakes.","year":2000,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Bounded function; Graph; Combinatorics; Discrete mathematics; Mathematical analysis","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.0004578249,0.0005803154,0.0007247108,0.0008034154,0.001206646,0.00148136,0.001478682,0.0008367718,0.0126069],"category_scores_gemma":[0.004882536,0.0005839936,0.000851777,0.0006718084,0.001662283,0.003842002,0.002446211,0.001346196,0.002164015],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004288442,"about_ca_system_score_gemma":0.0002790577,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005974159,"about_ca_topic_score_gemma":0.0009776759,"domain_scores_codex":[0.9994628,0.0001613818,0.00002358946,0.0001292165,0.0001312381,0.00009184696],"domain_scores_gemma":[0.9972692,0.001008708,0.0002655187,0.0008301058,0.0001639632,0.0004625708],"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.0003163411,0.00009091206,0.001112716,0.0002199696,0.00005516105,0.0006431948,0.0004485342,0.02498159,0.01673968,0.9044235,0.008699857,0.04226863],"study_design_scores_gemma":[0.00004818586,0.0001079609,0.0008180265,0.00007383565,0.00004785225,0.0007779924,0.0002783662,0.07958613,0.005743448,0.8864573,0.02603813,0.00002287699],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.345992,0.0009455621,0.5287576,0.0007808789,0.0003119739,0.0001448057,0.0005429368,0.0007118838,0.1218123],"genre_scores_gemma":[0.8232043,0.0009994193,0.1266441,0.0002543904,0.0001817701,0.0001707543,0.00071522,0.0005277545,0.04730231],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0126069,"threshold_uncertainty_score":0.04217422,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0123413388339751,"score_gpt":0.2553891607128465,"score_spread":0.2430478218788714,"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."}}