{"id":"W2078909675","doi":"10.1002/jcd.20210","title":"Graphs with the <i>n</i>‐e.c. adjacency property constructed from resolvable designs","year":2009,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"Dalhousie University; Toronto Metropolitan University; Mount Allison University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs; Fields Institute for Research in Mathematical Sciences","keywords":"Mathematics; Adjacency list; Combinatorics; Adjacency matrix; Affine transformation; Discrete mathematics; Property (philosophy); Extension (predicate logic); Graph; Pure mathematics; Computer science","routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006246347,0.0002460346,0.0004264648,0.0001204212,0.0001652345,0.0001120565,0.0004819251,0.0001256811,0.0000571011],"category_scores_gemma":[0.00003859887,0.0001237523,0.0001547473,0.000436121,0.00009985566,0.0003102452,0.000008578195,0.0004886423,0.000009196167],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000495751,"about_ca_system_score_gemma":0.0001014579,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001609626,"about_ca_topic_score_gemma":0.000002389107,"domain_scores_codex":[0.9983363,0.0002691538,0.0005073995,0.000123769,0.0004521488,0.0003111964],"domain_scores_gemma":[0.9988679,0.0002014648,0.0002348674,0.0002972041,0.0002409356,0.0001576544],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.004876503,0.0008985863,0.005937291,0.0001269608,0.002107163,0.0009034582,0.004868694,0.008577469,0.5043207,0.255515,0.2022553,0.009612889],"study_design_scores_gemma":[0.01947469,0.009305927,0.01019158,0.001460037,0.001130237,0.001237627,0.003138341,0.001390988,0.1708731,0.720709,0.05868025,0.002408293],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9597044,0.002523465,0.01545276,0.000531438,0.007921776,0.0008277649,0.00001744437,0.0002820503,0.01273891],"genre_scores_gemma":[0.9988315,0.00004183236,0.0005779568,0.00005897797,0.0004021836,0.000004310623,0.000001436956,0.00002846216,0.0000533032],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.465194,"threshold_uncertainty_score":0.5046474,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01471263274913301,"score_gpt":0.1969176200346053,"score_spread":0.1822049872854723,"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."}}