{"id":"W2043757383","doi":"10.4153/cmb-2007-050-x","title":"Asymptotic Existence of Resolvable Graph Designs","year":2007,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":22,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Victoria","funders":"Army Research Office; Deutscher Akademischer Austauschdienst","keywords":"Mathematics; Combinatorics; Partition (number theory); Graph; Vertex (graph theory); Simple graph; Discrete mathematics","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003130727,0.0004791826,0.0009993027,0.001565275,0.001347437,0.002086629,0.001773825,0.001895679,0.0060731],"category_scores_gemma":[0.035379,0.001116309,0.0009913269,0.001191948,0.002213536,0.002961187,0.002201135,0.002815045,0.0008536783],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001547961,"about_ca_system_score_gemma":0.00109698,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004972227,"about_ca_topic_score_gemma":0.0007820119,"domain_scores_codex":[0.9957172,0.001371297,0.0002552015,0.0008218936,0.001298063,0.000536249],"domain_scores_gemma":[0.9494582,0.03564338,0.003347801,0.006313437,0.004101477,0.001135736],"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.0007743689,0.0002315328,0.004147972,0.0005077917,0.000124673,0.000345326,0.0006123073,0.07997672,0.02320846,0.8428007,0.003269799,0.04400034],"study_design_scores_gemma":[0.0001540612,0.0004031247,0.0009148221,0.0001315789,0.00007407223,0.0007347806,0.0002007335,0.1908778,0.01323197,0.7864102,0.006813969,0.00005290241],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4394867,0.0008625527,0.5223066,0.0009849961,0.00007293849,0.0001654127,0.0006227939,0.0009000438,0.03459806],"genre_scores_gemma":[0.8873492,0.0004257293,0.104943,0.0002713007,0.00007135954,0.0003417815,0.0006159722,0.0001497751,0.005831922],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0060731,"threshold_uncertainty_score":0.02031648,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01470172085517344,"score_gpt":0.1966577628875988,"score_spread":0.1819560420324254,"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."}}