{"id":"W2752188301","doi":"10.22215/etd/2017-11936","title":"Covering Arrays from Maximal Sequences over Finite Fields","year":2017,"lang":"en","type":"preprint","venue":"","topic":"VLSI and Analog Circuit Testing","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Finite field; Mathematics; Alphabet; Combinatorics; Focus (optics); Orthogonal array; Combinatorial design; Complementary sequences; Discrete mathematics; Algorithm; Physics","routes":{"ca_aff":true,"ca_fund":false,"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":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0002095485,0.0002837286,0.0003381718,0.00007418098,0.0002722578,0.001263056,0.002782791,0.0002971651,0.0001615484],"category_scores_gemma":[0.0002011763,0.0002596789,0.0001688629,0.000047425,0.00005572775,0.0004405727,0.002190308,0.0006686139,0.00009444673],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004050985,"about_ca_system_score_gemma":0.0002102794,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003576007,"about_ca_topic_score_gemma":0.0001690128,"domain_scores_codex":[0.9981772,0.00003688634,0.0002797078,0.0008187792,0.0003340346,0.0003533573],"domain_scores_gemma":[0.9978009,0.0002615139,0.0002841882,0.00148394,0.00005854836,0.0001108374],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000001860158,0.0001704702,0.06354473,0.0003905573,0.0004916105,0.001353942,0.004835524,0.0428717,0.002275523,0.03973772,0.007548402,0.836778],"study_design_scores_gemma":[0.0004053296,0.00006232457,0.01794925,0.0009463134,0.00004178376,0.00001599452,0.00003351228,0.7073978,0.002042515,0.2656536,0.003809139,0.001642522],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02118305,0.0002159163,0.9187286,0.0005241852,0.001659628,0.0000983255,0.00002186118,0.000373787,0.05719464],"genre_scores_gemma":[0.9835114,0.00004505525,0.01444209,0.0005162391,0.0005262804,0.00001151079,0.00001840398,0.00001202538,0.0009169243],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9623284,"threshold_uncertainty_score":0.9999855,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05015525286706676,"score_gpt":0.2736165631531277,"score_spread":0.2234613102860609,"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."}}