{"id":"W2050254654","doi":"10.1007/s00165-009-0135-6","title":"Lower bounds on lengths of checking sequences","year":2009,"lang":"en","type":"article","venue":"Formal Aspects of Computing","topic":"Software Testing and Debugging Techniques","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Ottawa","funders":"","keywords":"Theory of computation; Sequence (biology); State (computer science); Model checking; Computer science; Algorithm; Upper and lower bounds; Finite-state machine; Mathematics; Theoretical computer science; Combinatorics","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":[],"consensus_categories":[],"category_scores_codex":[0.0005171874,0.0001377602,0.0002455193,0.0001594608,0.0001181119,0.00005270813,0.0007533006,0.00005207558,0.000001969025],"category_scores_gemma":[0.0002237217,0.0001240387,0.00008944876,0.0003677719,0.00005475712,0.0003563765,0.0001543149,0.0001508982,0.000002921113],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002659999,"about_ca_system_score_gemma":0.00006354132,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002775921,"about_ca_topic_score_gemma":5.068068e-7,"domain_scores_codex":[0.9987211,0.00002600517,0.0003664776,0.0002274136,0.0003427554,0.0003162166],"domain_scores_gemma":[0.9988706,0.0002551801,0.0003135097,0.000389501,0.0001245227,0.00004668239],"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.00002940729,0.0003529777,0.002243523,0.00009320941,0.00002836054,0.00004509968,0.002394162,0.00260198,0.00194189,0.5231649,0.0009593487,0.4661451],"study_design_scores_gemma":[0.0007534216,0.004955353,0.04280179,0.001930882,0.00001691179,0.000119407,0.00003473968,0.3331248,0.1475086,0.4676234,0.0002828346,0.0008478597],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5367652,0.0001008176,0.427908,0.0002615687,0.0003463329,0.0001219812,7.499185e-7,0.003412181,0.03108317],"genre_scores_gemma":[0.8714781,0.000001360995,0.1282906,0.0001532461,0.00006526981,3.097456e-7,4.503586e-7,0.000004623674,0.000006007603],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4652973,"threshold_uncertainty_score":0.5058152,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01604354604530554,"score_gpt":0.2687929526499507,"score_spread":0.2527494066046451,"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."}}