{"id":"W4390338595","doi":"10.1016/j.tcs.2023.114363","title":"Proving properties of some greedily-defined integer recurrences via automata theory","year":2023,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematical proof; Simple (philosophy); Conjecture; Automaton; Integer (computer science); Property (philosophy); Sequence (biology); Integer sequence; Discrete mathematics; Mathematics; Automata theory; Computer science; Combinatorics; Integer programming; Algorithm; Theoretical computer science; Generating function; Programming language","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.001994954,0.0004673643,0.0005358666,0.001364752,0.001536704,0.002216396,0.001017313,0.0009010861,0.003013813],"category_scores_gemma":[0.01221334,0.0004395359,0.00142755,0.000875829,0.003329088,0.005933212,0.001351051,0.002369179,0.0005391226],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001580359,"about_ca_system_score_gemma":0.0008256382,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001133802,"about_ca_topic_score_gemma":0.001041772,"domain_scores_codex":[0.9983873,0.0005034179,0.0001561942,0.000406123,0.0003412861,0.0002056059],"domain_scores_gemma":[0.9928698,0.005014816,0.0006005,0.0007463454,0.0005684737,0.0002000643],"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.00005651112,0.00003145005,0.0009215778,0.00006289533,0.00001591464,0.0001535755,0.0006412269,0.004416327,0.005647637,0.9760449,0.0004794026,0.01152859],"study_design_scores_gemma":[0.00002841723,0.00007509775,0.0003792614,0.00003078301,0.00002969447,0.0002356874,0.0002391133,0.03991875,0.01561637,0.9390247,0.004383457,0.00003868504],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2489638,0.0004921905,0.724632,0.000986888,0.000145493,0.0001201897,0.0001873155,0.0006626789,0.02380949],"genre_scores_gemma":[0.8703451,0.0002761135,0.1233006,0.0003787481,0.0000735137,0.0001344565,0.0001522819,0.0001276726,0.005211381],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003013813,"threshold_uncertainty_score":0.01146632,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01861407997515179,"score_gpt":0.2358628531487552,"score_spread":0.2172487731736034,"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."}}