{"id":"W2092522707","doi":"10.1109/ase.2011.6100154","title":"Identifying future field accesses in exhaustive state space traversal","year":2011,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Thread (computing); Pathfinder; Tree traversal; Java; Programming language; Scheduling (production processes); Distributed computing; Parallel computing; World Wide Web","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.0001388001,0.00009034585,0.00009623681,0.0001362343,0.00004769703,0.00009454771,0.000577581,0.000046153,0.00005354575],"category_scores_gemma":[0.00001307786,0.00008095959,0.00002682317,0.0003485249,0.00001142923,0.0004926093,0.0001776488,0.0001198851,0.00001678924],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001597738,"about_ca_system_score_gemma":0.00002852576,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002040401,"about_ca_topic_score_gemma":0.00004832108,"domain_scores_codex":[0.9992968,0.00002716164,0.0001414932,0.0002426217,0.0001092628,0.000182634],"domain_scores_gemma":[0.999596,0.00003345599,0.00005062059,0.0002320158,0.0000450594,0.00004286736],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0001506707,0.0007970063,0.04981841,0.0001662691,0.00008834217,0.0007145454,0.09351972,0.004302947,0.0006397427,0.5550261,0.05436164,0.2404146],"study_design_scores_gemma":[0.002343801,0.0008156672,0.09380917,0.0003003354,0.00001778873,0.00008047197,0.002557404,0.2834945,0.4590183,0.1490659,0.00604603,0.002450578],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003778043,0.00003012241,0.9629202,0.0002728163,0.0002050462,0.00007421175,1.518101e-7,0.0003803364,0.032339],"genre_scores_gemma":[0.6473725,0.00007626462,0.351514,0.0003059698,0.00002980774,0.000004357259,3.748436e-7,0.000004265367,0.0006924731],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6435944,"threshold_uncertainty_score":0.3301436,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03566657504074536,"score_gpt":0.27753270272101,"score_spread":0.2418661276802646,"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."}}