{"id":"W1568296425","doi":"10.37236/1533","title":"Large Equiangular Sets of Lines in Euclidean Space","year":2000,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":56,"is_retracted":false,"has_abstract":true,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Equiangular polygon; Mathematics; Combinatorics; Euclidean space; Upper and lower bounds; Constructive; Euclidean geometry; Integer (computer science); Euclidean distance; Space (punctuation); Order (exchange); Dimension (graph theory); Set (abstract data type); Discrete mathematics; Geometry; Mathematical analysis; Regular polygon; Process (computing); 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.001240919,0.0001146448,0.0002720809,0.0001104407,0.00003034359,0.00000972874,0.0003379878,0.00006128487,0.0000575319],"category_scores_gemma":[0.00002053593,0.00008456927,0.0001089087,0.0004178778,0.00002305513,0.00009395496,0.000009704084,0.0004915923,0.000007981342],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009799472,"about_ca_system_score_gemma":0.00005672805,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003149662,"about_ca_topic_score_gemma":0.000009171376,"domain_scores_codex":[0.9988015,0.0001110055,0.0004175706,0.00004879861,0.0002114634,0.0004096532],"domain_scores_gemma":[0.999531,0.0000798559,0.0001094455,0.0001845496,0.00005466705,0.00004049285],"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.0001109389,0.0002047843,0.001181053,0.0001057879,0.0002030746,0.0000361972,0.002242399,0.01126356,0.002657792,0.9798656,0.0006636636,0.001465124],"study_design_scores_gemma":[0.002612866,0.0006323789,0.001193815,0.0002347351,0.00008070702,0.0003298635,0.0007469524,0.003246437,0.01156613,0.9500837,0.0289519,0.0003205373],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9870125,0.01007234,0.0004484102,0.0001025826,0.000277361,0.00006924574,0.000001157541,0.00001754897,0.001998854],"genre_scores_gemma":[0.9985778,0.001134212,0.000002099465,0.00001016965,0.00004866644,9.743108e-7,3.729301e-7,0.00002049055,0.0002051616],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02978194,"threshold_uncertainty_score":0.3448635,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.00353167202720187,"score_gpt":0.200087413656909,"score_spread":0.1965557416297072,"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."}}