{"id":"W4413302318","doi":"10.1007/978-3-032-01475-7_12","title":"Improved Upper Bounds for Determinizing NIDPDAs with Limited Nondeterminism","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Algorithm","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"],"consensus_categories":[],"category_scores_codex":[0.0004848814,0.0007826207,0.0007635611,0.0009831078,0.0004993546,0.0007636178,0.00365953,0.0004101376,0.000006574307],"category_scores_gemma":[0.0001172554,0.000633386,0.0002081229,0.0007067606,0.0007129327,0.0008080425,0.001217795,0.0007505559,0.000007028203],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002696164,"about_ca_system_score_gemma":0.001012943,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004960566,"about_ca_topic_score_gemma":0.00005467827,"domain_scores_codex":[0.9955391,0.00002311556,0.0005968083,0.002187527,0.0006206665,0.001032825],"domain_scores_gemma":[0.9964305,0.0008850692,0.0003704645,0.001748178,0.000364357,0.0002014858],"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.0000340204,0.0000350641,0.00003786597,0.0001076213,0.00002537905,0.00008884956,0.0005203926,0.00197354,0.0004032353,0.02842151,0.00002262355,0.9683299],"study_design_scores_gemma":[0.001138922,0.001164758,0.00007432034,0.000885078,0.00003319145,0.0001446068,4.715085e-7,0.7584153,0.00370656,0.2268377,0.006059541,0.001539519],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000112508,0.000274405,0.9936057,0.0006023959,0.00161403,0.0008978416,0.000009881292,0.0002774886,0.002605782],"genre_scores_gemma":[0.063976,0.00002471946,0.9292729,0.003963424,0.0004412595,0.00007550715,0.00001052021,0.00005659011,0.002179008],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9667904,"threshold_uncertainty_score":0.9996117,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01436266282375035,"score_gpt":0.2483766205904855,"score_spread":0.2340139577667351,"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."}}