{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008330317,0.0002024127,0.0003428919,0.003745787,0.0007415158,0.0005839322,0.002318412,0.0001807414,0.000008676162],"category_scores_gemma":[4.442088e-7,0.0001790355,0.0003882098,0.007259155,0.001065467,0.0004387273,0.004445201,0.00043874,9.921698e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00000742287,"about_ca_system_score_gemma":0.00008332018,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001884338,"about_ca_topic_score_gemma":0.00006025056,"domain_scores_codex":[0.9983897,0.0003113416,0.0002378836,0.0005721924,0.0003074566,0.0001814673],"domain_scores_gemma":[0.9983111,0.0002516766,0.0004125599,0.0007731646,0.0001667426,0.00008474285],"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.0009296453,0.0005694011,0.155366,0.002050397,0.003035479,0.0003010763,0.006440947,0.0001621536,0.01034259,0.7842343,0.02644186,0.0101261],"study_design_scores_gemma":[0.0006798477,0.0007495796,0.1510508,0.001492095,0.0004548349,0.00005785463,0.001311441,0.003758095,0.003693417,0.8323296,0.003515575,0.0009069197],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9153151,0.009046484,0.01814517,0.002106111,0.003129215,0.001148834,0.00009837548,0.0002652796,0.05074542],"genre_scores_gemma":[0.9929716,0.002602931,0.004142148,0.00001907508,0.00003250603,0.000001176897,0.000003434873,0.000005729074,0.0002213914],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0776565,"threshold_uncertainty_score":0.7300857,"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."}}