{"id":"W4379537148","doi":"10.1145/3591233","title":"Recursive State Machine Guided Graph Folding for Context-Free Language Reachability","year":2023,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","topic":"Software Testing and Debugging Techniques","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"ca_institutions":"Concordia University","funders":"Advanced Research Projects Agency; Defense Advanced Research Projects Agency; National Science Foundation","keywords":"Reachability; Scalability; Computer science; Graph; Theoretical computer science; Path (computing); Mathematics; 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":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.001573361,0.0002375814,0.0002984611,0.0002322555,0.0002297941,0.0001748567,0.004543903,0.0000755088,9.269626e-7],"category_scores_gemma":[0.01741575,0.0001714423,0.0002166366,0.001021894,0.0001204325,0.0002282293,0.001843862,0.0002048606,0.00000282012],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004991868,"about_ca_system_score_gemma":0.00002559793,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002674946,"about_ca_topic_score_gemma":0.00001028335,"domain_scores_codex":[0.9981947,0.00002030717,0.0003581659,0.000534833,0.0004023622,0.0004896331],"domain_scores_gemma":[0.997121,0.0007784358,0.0003628772,0.001349959,0.0003124019,0.00007527869],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00008813645,0.000213547,0.01895306,0.0007144177,0.0001182432,0.000009194497,0.01679184,0.000006992648,0.007431261,0.02374169,0.1074723,0.8244593],"study_design_scores_gemma":[0.001595646,0.001030941,0.004549046,0.001149352,0.00007202024,0.00004760449,0.001670281,0.001721679,0.1965344,0.7870211,0.003718644,0.000889277],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9531513,0.0008251884,0.006637722,0.01232292,0.0004941358,0.002784772,0.00007555477,0.02308159,0.0006268558],"genre_scores_gemma":[0.7109489,0.00001109687,0.2879315,0.0003063067,0.00006246116,0.0002875128,0.000005761242,0.00004187609,0.000404628],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.82357,"threshold_uncertainty_score":0.990861,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02819721448245871,"score_gpt":0.308115621640343,"score_spread":0.2799184071578843,"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."}}