{"id":"W2940923581","doi":"10.4230/lipics.mfcs.2017.24","title":"Better Complexity Bounds for Cost Register Automata","year":2017,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Register (sociolinguistics); Automaton; Register allocation; Theoretical computer science; Parallel computing; Programming language","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","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001160769,0.0005239301,0.0006405488,0.0001919427,0.00188559,0.003136738,0.00459558,0.0002642912,0.00003047259],"category_scores_gemma":[0.0002130155,0.0004627848,0.0004473007,0.0001056221,0.000482849,0.004220845,0.001383443,0.0003396907,0.0001974794],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001404822,"about_ca_system_score_gemma":0.00009378722,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002985752,"about_ca_topic_score_gemma":0.00003243473,"domain_scores_codex":[0.9966736,0.00003578878,0.001125181,0.0004966616,0.0005317186,0.001137041],"domain_scores_gemma":[0.9947153,0.0002269773,0.001001381,0.003447883,0.0003158252,0.0002926293],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0003770469,0.0009905692,0.008425063,0.002028515,0.0006070778,0.00002510331,0.01082447,0.00002558276,0.0002050691,0.5559983,0.2038581,0.2166352],"study_design_scores_gemma":[0.006566211,0.0003453482,0.006235955,0.0002521004,0.00005456874,0.000107305,0.0002499614,0.3076994,0.001087946,0.03621805,0.6400448,0.001138353],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05850662,0.00003675514,0.9135379,0.005627137,0.003351963,0.003083177,0.001507928,0.0008229737,0.01352562],"genre_scores_gemma":[0.7579199,0.00002458869,0.2268406,0.01022758,0.0008305914,0.0008485081,0.0009237446,0.0001327941,0.00225171],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6994133,"threshold_uncertainty_score":0.9997824,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06230586614724938,"score_gpt":0.3169479117971421,"score_spread":0.2546420456498927,"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."}}