{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01910193,0.001916132,0.001859848,0.00533325,0.001933331,0.00568818,0.004451373,0.003020179,0.007531835],"category_scores_gemma":[0.1725464,0.002075762,0.002009767,0.003345575,0.0046773,0.01233037,0.005366741,0.009205994,0.002178696],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003586403,"about_ca_system_score_gemma":0.004091706,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001027009,"about_ca_topic_score_gemma":0.001290009,"domain_scores_codex":[0.9493449,0.01228689,0.004750672,0.00660126,0.0231771,0.003839195],"domain_scores_gemma":[0.5551005,0.3574417,0.01768842,0.04207852,0.02149656,0.006194373],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.004626485,0.0008085728,0.02404927,0.001559461,0.0003523867,0.0006152747,0.001676347,0.3538178,0.04880992,0.2818863,0.007241677,0.2745565],"study_design_scores_gemma":[0.0002036313,0.0007502641,0.003208052,0.0003838364,0.0001722449,0.0006002914,0.0002627476,0.6912856,0.05642772,0.2383526,0.008213779,0.0001393253],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1322946,0.002201261,0.8472255,0.001597213,0.0002558284,0.0002810074,0.001142472,0.004730681,0.01027136],"genre_scores_gemma":[0.7010119,0.0009200721,0.2886414,0.0005513487,0.000451552,0.0007210064,0.00247732,0.001892043,0.003333337],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01910193,"threshold_uncertainty_score":0.1010219,"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."}}