{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002245457,0.001036117,0.001120614,0.002638866,0.001154631,0.001644269,0.001083617,0.001053617,0.003361335],"category_scores_gemma":[0.01547996,0.001015821,0.001157163,0.001719014,0.001627375,0.004771904,0.002190833,0.0009785229,0.000576064],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007557689,"about_ca_system_score_gemma":0.003180974,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006887433,"about_ca_topic_score_gemma":0.01220297,"domain_scores_codex":[0.9976043,0.0006545153,0.0001677726,0.0003690412,0.0008616193,0.0003427533],"domain_scores_gemma":[0.9888365,0.008290977,0.0008192306,0.001096523,0.0007899416,0.0001667916],"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.001558617,0.000837829,0.05339246,0.001218623,0.0002867124,0.001146348,0.00310568,0.3517266,0.03748296,0.05518215,0.005857929,0.4882042],"study_design_scores_gemma":[0.00008562164,0.0003119586,0.00419469,0.000122957,0.0001316366,0.0002977586,0.0003784372,0.8781258,0.0223734,0.08922879,0.004651766,0.00009715331],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2329894,0.0003483059,0.7557678,0.0002672954,0.00003159595,0.0003037691,0.0007496345,0.006665239,0.002876916],"genre_scores_gemma":[0.5107365,0.0002350673,0.4836086,0.0001671294,0.00001620344,0.0004319211,0.001850967,0.000702818,0.002250903],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006887433,"threshold_uncertainty_score":0.0136947,"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."}}