{"id":"W2098684813","doi":"10.1007/s10801-009-0170-7","title":"Bounds for codes and designs in complex subspaces","year":2009,"lang":"en","type":"article","venue":"Journal of Algebraic Combinatorics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs; University of Calgary","keywords":"Linear subspace; Mathematics; Association scheme; Grassmannian; Combinatorics; Dimension (graph theory); Code (set theory); Set (abstract data type); Discrete mathematics; Finite set; Upper and lower bounds; 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.0009427885,0.00011033,0.0002557687,0.0003077304,0.0001011581,0.0001638872,0.0005098471,0.00004923519,0.00000242688],"category_scores_gemma":[0.00009354771,0.00009810529,0.00009705913,0.0005300966,0.00004424965,0.0003859706,0.00004174999,0.0001577923,3.567318e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003425619,"about_ca_system_score_gemma":0.00005825909,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001051264,"about_ca_topic_score_gemma":0.000002504364,"domain_scores_codex":[0.9990644,0.00007377154,0.0003263706,0.0001315879,0.0001997001,0.0002041816],"domain_scores_gemma":[0.9990356,0.0003312942,0.0002259374,0.0001632294,0.0001427248,0.0001011886],"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.00004162084,0.0001673484,0.001831597,0.00001119122,0.00001443071,0.00001920775,0.0006522221,0.000007546593,0.000807485,0.9841676,0.001072467,0.01120732],"study_design_scores_gemma":[0.00110645,0.001180959,0.0285522,0.00003226593,0.00001059769,0.00008994596,0.00006166708,0.001197974,0.0003722455,0.9645137,0.002746843,0.0001351525],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7676545,0.001322783,0.2264866,0.00346417,0.0004627195,0.000156599,0.000001079994,0.00003524352,0.0004162438],"genre_scores_gemma":[0.9914283,0.0000876714,0.008168282,0.0002600434,0.00003582173,0.000001048317,2.74353e-7,0.000003954562,0.00001457158],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2237738,"threshold_uncertainty_score":0.4000618,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03113389045910533,"score_gpt":0.2749133560179146,"score_spread":0.2437794655588093,"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."}}