{"id":"W4399695835","doi":"10.48550/arxiv.2406.09302","title":"The reflection complexity of sequences over finite alphabets","year":2024,"lang":"en","type":"preprint","venue":"Open Repository and Bibliography (University of Liège)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Killam Trusts; Fonds De La Recherche Scientifique - FNRS","keywords":"Reflection (computer programming); Computer science; Mathematics; Theoretical computer science; Programming language","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007049432,0.0005688114,0.0005299349,0.001568971,0.000648869,0.00204167,0.0008169287,0.0005602118,0.00344843],"category_scores_gemma":[0.007805519,0.0002586478,0.0007093543,0.001205312,0.002415606,0.003514227,0.0009539466,0.001109621,0.0004067638],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001524281,"about_ca_system_score_gemma":0.0007597791,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001135329,"about_ca_topic_score_gemma":0.0007651257,"domain_scores_codex":[0.9991093,0.0001723741,0.00006846825,0.0001757196,0.0003240486,0.0001500138],"domain_scores_gemma":[0.9941293,0.004187747,0.0005712807,0.0004172913,0.000429197,0.0002650581],"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.000318296,0.00008132486,0.008259043,0.0002210365,0.00004248517,0.0003183939,0.001302972,0.05380097,0.02621618,0.8677744,0.001111007,0.04055392],"study_design_scores_gemma":[0.00002352205,0.0001751212,0.004333995,0.00005126984,0.00003165957,0.0003573143,0.0003457741,0.3086884,0.02335377,0.6591151,0.003451358,0.00007256684],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8825265,0.0003159707,0.103479,0.0003368479,0.00002426066,0.00004175093,0.0002770967,0.0003167083,0.01268183],"genre_scores_gemma":[0.9805252,0.0002177442,0.01575056,0.00004000629,0.00004407594,0.00007079693,0.0003454741,0.00008075137,0.002925335],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00344843,"threshold_uncertainty_score":0.01153612,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04396047400539631,"score_gpt":0.2698873962117355,"score_spread":0.2259269222063391,"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."}}