{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008154293,0.004358776,0.003869821,0.009045561,0.004576588,0.01444298,0.004909504,0.004409808,0.01666034],"category_scores_gemma":[0.04651419,0.002336134,0.002326558,0.009030148,0.008790876,0.02185207,0.0126627,0.01186032,0.004610736],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.007470989,"about_ca_system_score_gemma":0.003180684,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0021997,"about_ca_topic_score_gemma":0.003151409,"domain_scores_codex":[0.9908393,0.002299485,0.0004996829,0.001169611,0.00326831,0.001923656],"domain_scores_gemma":[0.9387436,0.0462609,0.002877535,0.004663897,0.004223043,0.003231011],"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.0002390102,0.00007411934,0.0004829507,0.0002011827,0.0000446827,0.00005578306,0.0004576001,0.0101546,0.0009015955,0.9651106,0.005603194,0.0166747],"study_design_scores_gemma":[0.00002191366,0.00003176936,0.0001278263,0.0001087236,0.00003486724,0.00006280599,0.0000740921,0.01622383,0.0006907813,0.978712,0.003874073,0.00003738016],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1314601,0.01307731,0.6859651,0.01239229,0.0009996267,0.0002533967,0.00242159,0.001588282,0.1518424],"genre_scores_gemma":[0.8174897,0.01051653,0.1259446,0.002977355,0.002409547,0.001206237,0.002327272,0.001087694,0.03604107],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01666034,"threshold_uncertainty_score":0.05573434,"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."}}